e600c0ba0e
This makes sense, since the search index has the information in it, and it's more useful for function signature searches since a function signature search's item type is, by definition, some type of function (there's more than one, but not very many).
93 lines
2.2 KiB
JavaScript
93 lines
2.2 KiB
JavaScript
const QUERY = ['A::B', 'A::B,C', 'A::B<f>,C', 'mod::a'];
|
|
|
|
const PARSED = [
|
|
{
|
|
elems: [{
|
|
name: "a::b",
|
|
fullPath: ["a", "b"],
|
|
pathWithoutLast: ["a"],
|
|
pathLast: "b",
|
|
generics: [],
|
|
typeFilter: -1,
|
|
}],
|
|
foundElems: 1,
|
|
original: "A::B",
|
|
returned: [],
|
|
userQuery: "a::b",
|
|
error: null,
|
|
},
|
|
{
|
|
elems: [
|
|
{
|
|
name: "a::b",
|
|
fullPath: ["a", "b"],
|
|
pathWithoutLast: ["a"],
|
|
pathLast: "b",
|
|
generics: [],
|
|
typeFilter: -1,
|
|
},
|
|
{
|
|
name: "c",
|
|
fullPath: ["c"],
|
|
pathWithoutLast: [],
|
|
pathLast: "c",
|
|
generics: [],
|
|
typeFilter: -1,
|
|
},
|
|
],
|
|
foundElems: 2,
|
|
original: 'A::B,C',
|
|
returned: [],
|
|
userQuery: 'a::b,c',
|
|
error: null,
|
|
},
|
|
{
|
|
elems: [
|
|
{
|
|
name: "a::b",
|
|
fullPath: ["a", "b"],
|
|
pathWithoutLast: ["a"],
|
|
pathLast: "b",
|
|
generics: [
|
|
{
|
|
name: "f",
|
|
fullPath: ["f"],
|
|
pathWithoutLast: [],
|
|
pathLast: "f",
|
|
generics: [],
|
|
},
|
|
],
|
|
typeFilter: -1,
|
|
},
|
|
{
|
|
name: "c",
|
|
fullPath: ["c"],
|
|
pathWithoutLast: [],
|
|
pathLast: "c",
|
|
generics: [],
|
|
typeFilter: -1,
|
|
},
|
|
],
|
|
foundElems: 2,
|
|
original: 'A::B<f>,C',
|
|
returned: [],
|
|
userQuery: 'a::b<f>,c',
|
|
error: null,
|
|
},
|
|
{
|
|
elems: [{
|
|
name: "mod::a",
|
|
fullPath: ["mod", "a"],
|
|
pathWithoutLast: ["mod"],
|
|
pathLast: "a",
|
|
generics: [],
|
|
typeFilter: -1,
|
|
}],
|
|
foundElems: 1,
|
|
original: "mod::a",
|
|
returned: [],
|
|
userQuery: "mod::a",
|
|
error: null,
|
|
},
|
|
];
|