hendrik/lens
1
0
Fork 0
mirror of https://github.com/lensapp/lens.git synced 2025-05-20 05:10:56 +00:00
Code Issues Projects Releases Wiki Activity

Implement fuzzy search in search field

Browse Source 
Signed-off-by: gitstart <bot@gitstart.com>
Co-authored-by: ahzia <32243043+ahzia@users.noreply.github.com>
This commit is contained in:
gitstart 2023-08-17 07:20:04 +00:00
parent f1a960fd78
commit 73c80ee15d
No known key found for this signature in database
GPG Key ID: 1029536458B930CC
1 changed files with 48 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

55
packages/core/src/renderer/components/item-object-list/list-layout.tsx
View File

@ -233,6 +233,48 @@ class NonInjectedItemListLayout<I extends ItemObject, PreLoadStores extends bool
return <PageFiltersList filters={filters} />; return <PageFiltersList filters={filters} />;
} }
private fuzzyMatch(search: string, itemText: string): boolean {
const score = this.calculateSimilarityScore(search, itemText);
return score >= 0.5; // Adjust the threshold as needed
}
private calculateSimilarityScore(search: string, itemText: string): number {
const searchLength = search.length;
const itemLength = itemText.length;
const distanceMatrix: number[][] = [];
if (searchLength === 0) return itemLength;
if (itemLength === 0) return searchLength;
// Initialize the distance matrix
for (let i = 0; i <= searchLength; i++) {
distanceMatrix[i] = [i];
}
for (let j = 0; j <= itemLength; j++) {
distanceMatrix[0][j] = j;
}
// Calculate the Levenshtein distance
for (let i = 1; i <= searchLength; i++) {
for (let j = 1; j <= itemLength; j++) {
const cost = search[i - 1] === itemText[j - 1] ? 0 : 1;
distanceMatrix[i][j] = Math.min(
distanceMatrix[i - 1][j] + 1, // Deletion
distanceMatrix[i][j - 1] + 1, // Insertion
distanceMatrix[i - 1][j - 1] + cost, // Substitution
);
}
}
const distance = distanceMatrix[searchLength][itemLength];
const maxLength = Math.max(searchLength, itemLength);
return 1 - distance / maxLength; // Calculate similarity score
}
private filterCallbacks: ItemsFilters<I> = { private filterCallbacks: ItemsFilters<I> = {
[FilterType.SEARCH]: items => { [FilterType.SEARCH]: items => {
const { searchFilters = [] } = this.props; const { searchFilters = [] } = this.props;
@ -241,13 +283,12 @@ class NonInjectedItemListLayout<I extends ItemObject, PreLoadStores extends bool
if (search && searchFilters.length) { if (search && searchFilters.length) {
const searchTexts = [search].map(normalizeText); const searchTexts = [search].map(normalizeText);
return items.filter(item => ( return items.filter(item =>
searchFilters.some(getTexts => ( searchFilters.some(getTexts => {
[getTexts(item)] const itemTexts = [getTexts(item)].flat().map(normalizeText);
.flat()
.map(normalizeText) return itemTexts.some(source => searchTexts.some(search => source.includes(search) || this.fuzzyMatch(search, source)));
.some(source => searchTexts.some(search => source.includes(search))) },
))
)); ));
} }