opensource/grafana
1
0
Fork 0
mirror of https://github.com/grafana/grafana.git synced 2025-08-06 20:59:35 +08:00
Code Issues Packages Projects Releases Wiki Activity

Chore: uFuzzy 1.0.2 (#62276)

Browse Source 
Co-authored-by: joshhunt <josh@trtr.co>
This commit is contained in:
Leon Sorokin
2023-02-02 09:09:48 -06:00
committed by GitHub
parent 1aae808723
commit 4d564f8b0a
7 changed files with 63 additions and 66 deletions
Download Patch File Download Diff File Expand all files Collapse all files

32
public/app/features/commandPalette/useMatches.ts
View File

@ -186,8 +186,8 @@ function useInternalMatches(filtered: ActionImpl[], search: string): Match[] {
return throttledFiltered.map((action) => ({ score: 0, action }));
}
const haystack = throttledFiltered.map((action) =>
[action.name, action.keywords, action.subtitle].join(' ').toLowerCase()
const haystack = throttledFiltered.map(({ name, keywords, subtitle }) =>
`${name} ${keywords ?? ''} ${subtitle ?? ''}`.toLowerCase()
);
const results: Match[] = [];
@ -201,35 +201,27 @@ function useInternalMatches(filtered: ActionImpl[], search: string): Match[] {
const haystackItem = haystack[haystackIndex];
// Use the position of the match as a stand-in for score
const substringPosition = haystackItem.toLowerCase().indexOf(query);
const substringPosition = haystackItem.indexOf(query);
if (substringPosition > -1) {
const score = haystack.length - substringPosition;
const score = substringPosition * -1; // lower position of the match should be a higher priority score
const action = throttledFiltered[haystackIndex];
results.push({ score, action });
}
}
} else {
const allMatchedIndexes = new Set<number>();
const termCount = ufuzzy.split(throttledSearch).length;
const infoThresh = Infinity;
const oooSearch = termCount < 5;
const queryWords = ufuzzy.split(throttledSearch);
const queryPermutations =
queryWords.length < 5 ? uFuzzy.permute(queryWords).map((terms) => terms.join(' ')) : [throttledSearch];
for (const permutedSearchTerm of queryPermutations) {
const indexes = ufuzzy.filter(haystack, permutedSearchTerm);
const info = ufuzzy.info(indexes, haystack, permutedSearchTerm);
const order = ufuzzy.sort(info, haystack, permutedSearchTerm);
const [, info, order] = ufuzzy.search(haystack, throttledSearch, oooSearch, infoThresh);
if (info && order) {
for (let orderIndex = 0; orderIndex < order.length; orderIndex++) {
const actionIndex = order[orderIndex];
if (!allMatchedIndexes.has(actionIndex)) {
allMatchedIndexes.add(actionIndex);
const score = order.length - orderIndex;
const action = throttledFiltered[info.idx[actionIndex]];
results.push({ score, action });
}
const score = order.length - orderIndex;
const action = throttledFiltered[info.idx[actionIndex]];
results.push({ score, action });
}
}
}