as-services/libs/utils/words-id/autocorrect/BKNodeLetters.js
devthejo d5febb45c8
Some checks failed
/ build (map[dockerfile:./services/tasks/Dockerfile name:tasks]) (push) Failing after 1m25s
/ deploy (push) Has been skipped
/ build (map[dockerfile:./services/files/Dockerfile name:files]) (push) Failing after 1m34s
/ build (map[dockerfile:./services/app/Dockerfile name:app]) (push) Successful in 2m9s
/ build (map[dockerfile:./services/api/Dockerfile name:api]) (push) Failing after 1m42s
/ build (map[dockerfile:./services/web/Dockerfile name:web]) (push) Failing after 1m18s
/ build (map[dockerfile:./services/watchers/Dockerfile name:watchers]) (push) Failing after 1m22s
/ build (map[dockerfile:./services/hasura/Dockerfile name:hasura]) (push) Successful in 2m3s
chore(init): available sources
2025-04-13 10:34:01 +02:00

49 lines
1.2 KiB
JavaScript

const levenshtein = require("fast-levenshtein")
module.exports = class BKNodeLetters {
constructor(word) {
this.word = word
this.children = new Map()
}
insert(otherWord) {
const dist = levenshtein.get(this.word, otherWord)
if (this.children.has(dist)) {
this.children.get(dist).insert(otherWord)
} else {
this.children.set(dist, new BKNodeLetters(otherWord))
}
}
search(target, maxDist) {
const currentDist = levenshtein.get(this.word, target)
// If the distance is within the acceptable maximum, return this word immediately
if (currentDist <= maxDist) {
return { word: this.word, distance: currentDist }
}
let minDistanceWord = null
for (
let i = Math.max(0, currentDist - maxDist);
i <= currentDist + maxDist;
i++
) {
if (this.children.has(i)) {
const result = this.children.get(i).search(target, maxDist)
if (
result &&
(!minDistanceWord || result.distance < minDistanceWord.distance)
) {
minDistanceWord = result
if (result.distance <= 1) {
// Early stop if very close match found
break
}
}
}
}
return minDistanceWord
}
}