{
  "_from": "levdist@^1.0.0",
  "_id": "levdist@1.0.0",
  "_inBundle": false,
  "_integrity": "sha1-kdejBElk8szEIaBHfKyCf+dcVxg=",
  "_location": "/levdist",
  "_phantomChildren": {},
  "_requested": {
    "type": "range",
    "registry": true,
    "raw": "levdist@^1.0.0",
    "name": "levdist",
    "escapedName": "levdist",
    "rawSpec": "^1.0.0",
    "saveSpec": null,
    "fetchSpec": "^1.0.0"
  },
  "_requiredBy": [
    "/line-diff"
  ],
  "_resolved": "https://registry.npmjs.org/levdist/-/levdist-1.0.0.tgz",
  "_shasum": "91d7a3044964f2ccc421a0477cac827fe75c5718",
  "_spec": "levdist@^1.0.0",
  "_where": "/var/lib/jenkins/workspace/wechat-h5/node_modules/line-diff",
  "author": {
    "name": "Ionică Bizău",
    "email": "bizauionica@gmail.com"
  },
  "bugs": {
    "url": "https://github.com/IonicaBizau/node-levdist/issues"
  },
  "bundleDependencies": false,
  "deprecated": false,
  "description": "A minimal algorithm for computing Levenshtein distance in JavaScript.",
  "directories": {
    "test": "test"
  },
  "homepage": "https://github.com/IonicaBizau/node-levdist",
  "keywords": [
    "levenshtein",
    "distance"
  ],
  "license": "MIT",
  "main": "index.js",
  "name": "levdist",
  "repository": {
    "type": "git",
    "url": "git+ssh://git@github.com/IonicaBizau/node-levdist.git"
  },
  "scripts": {
    "test": "node test/index"
  },
  "version": "1.0.0"
}