mirror of
https://github.com/luxfi/consensus.git
synced 2026-09-24 00:26:58 +00:00
- Removed all Snow consensus code and dependencies - Replaced snow.Context with consensuscontext.Context - Updated all imports and references - Added comprehensive test suites for core packages - Fixed all build errors and test failures - Achieved 100% test pass rate (21 packages passing) - Improved test coverage to 30% Breaking changes: - Removed snow package entirely - Changed VM interface to use VMState instead of snow.State - Updated ChainContext structure Tests added: - core/app_error_test.go: 100% coverage - core/bootstrap_test.go: comprehensive concurrent tests - core/health_test.go: full integration tests - validators/validators_test.go: complete interface tests - version/version_test.go: 100% coverage - codec/codec_test.go: marshal/unmarshal tests - context/context_test.go: all functions tested
40 lines
743 B
JavaScript
40 lines
743 B
JavaScript
"use strict";
|
|
|
|
Object.defineProperty(exports, "__esModule", {
|
|
value: true
|
|
});
|
|
exports.findSuggestion = findSuggestion;
|
|
const {
|
|
min
|
|
} = Math;
|
|
function levenshtein(a, b) {
|
|
let t = [],
|
|
u = [],
|
|
i,
|
|
j;
|
|
const m = a.length,
|
|
n = b.length;
|
|
if (!m) {
|
|
return n;
|
|
}
|
|
if (!n) {
|
|
return m;
|
|
}
|
|
for (j = 0; j <= n; j++) {
|
|
t[j] = j;
|
|
}
|
|
for (i = 1; i <= m; i++) {
|
|
for (u = [i], j = 1; j <= n; j++) {
|
|
u[j] = a[i - 1] === b[j - 1] ? t[j - 1] : min(t[j - 1], t[j], u[j - 1]) + 1;
|
|
}
|
|
t = u;
|
|
}
|
|
return u[n];
|
|
}
|
|
function findSuggestion(str, arr) {
|
|
const distances = arr.map(el => levenshtein(el, str));
|
|
return arr[distances.indexOf(min(...distances))];
|
|
}
|
|
|
|
//# sourceMappingURL=find-suggestion.js.map
|