tiny-levenshtein
Advanced tools
Comparing version 1.0.0 to 1.0.1
@@ -57,2 +57,3 @@ /* IMPORT */ | ||
}; | ||
/* EXPORT */ | ||
export default levenshtein; |
@@ -8,4 +8,3 @@ declare class Matrix { | ||
set(row: number, column: number, value: number): number; | ||
reset(): void; | ||
} | ||
export default Matrix; |
/* MAIN */ | ||
//TODO: Maybe publish this as uint-matrix or typed-matrix or something | ||
class Matrix { | ||
@@ -19,7 +18,4 @@ /* CONSTRUCTOR */ | ||
} | ||
reset() { | ||
this.buffer.fill(0); | ||
} | ||
} | ||
/* EXPORT */ | ||
export default Matrix; |
@@ -5,3 +5,4 @@ { | ||
"description": "A tiny implementation of the Levenshtein edit distance algorithm.", | ||
"version": "1.0.0", | ||
"license": "MIT", | ||
"version": "1.0.1", | ||
"type": "module", | ||
@@ -18,4 +19,4 @@ "main": "dist/index.js", | ||
"test": "tsex test", | ||
"test:watch": "tsex --watch", | ||
"prepublishOnly": "npm run clean && npm run compile && npm run test" | ||
"test:watch": "tsex test --watch", | ||
"prepublishOnly": "tsex prepare" | ||
}, | ||
@@ -29,8 +30,7 @@ "keywords": [ | ||
"devDependencies": { | ||
"benchloop": "^1.3.2", | ||
"fastest-levenshtein": "^1.0.12", | ||
"fava": "^0.0.6", | ||
"tsex": "^1.1.2", | ||
"typescript": "^4.7.4" | ||
"benchloop": "^2.1.1", | ||
"fava": "^0.3.4", | ||
"tsex": "^4.0.2", | ||
"typescript": "^5.7.3" | ||
} | ||
} |
@@ -8,3 +8,3 @@ # Tiny Levenshtein | ||
```sh | ||
npm install --save tiny-levenshtein | ||
npm install tiny-levenshtein | ||
``` | ||
@@ -17,2 +17,4 @@ | ||
// Let's compute the Levenshtein edit distance between two strings | ||
levenshtein ( 'kitten', 'sitting' ); // => 3 | ||
@@ -19,0 +21,0 @@ ``` |
4
24
5306
7
90