Files
30-seconds-of-code/node_modules/string-similarity/package.json
2019-08-20 15:52:05 +02:00

75 lines
2.0 KiB
JSON

{
"_from": "string-similarity@^1.2.0",
"_id": "string-similarity@1.2.2",
"_inBundle": false,
"_integrity": "sha512-IoHUjcw3Srl8nsPlW04U3qwWPk3oG2ffLM0tN853d/E/JlIvcmZmDY2Kz5HzKp4lEi2T7QD7Zuvjq/1rDw+XcQ==",
"_location": "/string-similarity",
"_phantomChildren": {},
"_requested": {
"type": "range",
"registry": true,
"raw": "string-similarity@^1.2.0",
"name": "string-similarity",
"escapedName": "string-similarity",
"rawSpec": "^1.2.0",
"saveSpec": null,
"fetchSpec": "^1.2.0"
},
"_requiredBy": [
"/gatsby"
],
"_resolved": "https://registry.npmjs.org/string-similarity/-/string-similarity-1.2.2.tgz",
"_shasum": "99b2c20a3c9bbb3903964eae1d89856db3d8db9b",
"_spec": "string-similarity@^1.2.0",
"_where": "/Users/stefanfejes/Projects/30-seconds-of-python-code/node_modules/gatsby",
"author": {
"name": "Akash Kurdekar",
"email": "npm@kurdekar.com",
"url": "http://untilfalse.com/"
},
"bugs": {
"url": "https://github.com/aceakash/string-similarity/issues"
},
"bundleDependencies": false,
"dependencies": {
"lodash.every": "^4.6.0",
"lodash.flattendeep": "^4.4.0",
"lodash.foreach": "^4.5.0",
"lodash.map": "^4.6.0",
"lodash.maxby": "^4.6.0"
},
"deprecated": false,
"description": "Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.",
"devDependencies": {
"jasmine": "^3.2.0"
},
"files": [
"compare-strings.js"
],
"homepage": "https://github.com/aceakash/string-similarity#readme",
"keywords": [
"strings",
"similar",
"difference",
"similarity",
"compare",
"comparison",
"degree",
"match",
"matching",
"dice",
"levenshtein"
],
"license": "ISC",
"main": "compare-strings.js",
"name": "string-similarity",
"repository": {
"type": "git",
"url": "git://github.com/aceakash/string-similarity.git"
},
"scripts": {
"test": "jasmine"
},
"version": "1.2.2"
}