18 lines
589 B
JavaScript
18 lines
589 B
JavaScript
|
const levenshtein = require("fast-levenshtein");
|
||
|
|
|
||
|
|
export function getClosest(input, list, limit=5){
|
||
|
|
let t0 = performance.now();
|
||
|
|
const things = []
|
||
|
|
for (let s in list) {
|
||
|
|
let ns = s.replaceAll("_"," ");
|
||
|
|
if (ns.toLowerCase().includes(input.toLowerCase())){
|
||
|
|
things.push({name: s, dist: 0})
|
||
|
|
continue;
|
||
|
|
}
|
||
|
|
things.push({name: s, dist: levenshtein.get(input, ns)})
|
||
|
|
}
|
||
|
|
things.sort((a,b) => a.dist - b.dist);
|
||
|
|
let t1 = performance.now();
|
||
|
|
console.debug(`Levenshtein took ${t1-t0} ms`)
|
||
|
|
return things.splice(0,limit);
|
||
|
|
}
|