Files
automatic-dispose/node_modules/js-levenshtein/package.json
2018-11-24 14:43:59 +01:00

82 lines
2.0 KiB
JSON

{
"_from": "js-levenshtein@^1.1.3",
"_id": "js-levenshtein@1.1.4",
"_inBundle": false,
"_integrity": "sha512-PxfGzSs0ztShKrUYPIn5r0MtyAhYcCwmndozzpz8YObbPnD1jFxzlBGbRnX2mIu6Z13xN6+PTu05TQFnZFlzow==",
"_location": "/js-levenshtein",
"_phantomChildren": {},
"_requested": {
"type": "range",
"registry": true,
"raw": "js-levenshtein@^1.1.3",
"name": "js-levenshtein",
"escapedName": "js-levenshtein",
"rawSpec": "^1.1.3",
"saveSpec": null,
"fetchSpec": "^1.1.3"
},
"_requiredBy": [
"/@babel/preset-env"
],
"_resolved": "https://registry.npmjs.org/js-levenshtein/-/js-levenshtein-1.1.4.tgz",
"_shasum": "3a56e3cbf589ca0081eb22cd9ba0b1290a16d26e",
"_spec": "js-levenshtein@^1.1.3",
"_where": "/var/www/html/autocompletion/node_modules/@babel/preset-env",
"author": {
"name": "Gustaf Andersson",
"email": "gustaf@me.com"
},
"bugs": {
"url": "https://github.com/gustf/js-levenshtein/issues"
},
"bundleDependencies": false,
"deprecated": false,
"description": "The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.",
"devDependencies": {
"ava": "^0.25.0",
"fast-levenshtein": "^2.0.6",
"leven": "^2.1.0",
"levenshtein-edit-distance": "^2.0.3",
"matcha": "^0.7.0",
"talisman": "^0.21.0",
"xo": "^0.23.0"
},
"engines": {
"node": ">=0.10.0"
},
"files": [
"index.js"
],
"homepage": "https://github.com/gustf/js-levenshtein#readme",
"keywords": [
"levenshtein",
"distance",
"algorithm",
"algo",
"string",
"difference",
"diff",
"fast",
"fuzzy",
"similar",
"similarity",
"compare",
"comparison",
"edit",
"text",
"match",
"matching"
],
"license": "MIT",
"name": "js-levenshtein",
"repository": {
"type": "git",
"url": "git+https://github.com/gustf/js-levenshtein.git"
},
"scripts": {
"bench": "matcha bench.js",
"test": "ava"
},
"version": "1.1.4"
}