package.json

{
  "name": "myers-diff",
  "author": "Jamie Peabody",
  "version": "2.1.0",
  "description": "Implementation of the longest common subsequence (diff) algorithm.",
  "license": "Apache-2.0",
  "main": "src/index.js",
  "keywords": [
    "diff",
    "compare",
    "patch"
  ],
  "files": [
    "src",
    "README.md",
    "LICENSE"
  ],
  "repository": {
    "type": "git",
    "url": "https://github.com/wickedest/myers-diff"
  },
  "bugs": {
    "url": "https://github.com/wickedest/myers-diff/issues"
  },
  "homepage": "https://github.com/wickedest/myers-diff",
  "devDependencies": {
    "chai": "^4.2.0",
    "eslint": "^7.11.0",
    "eslint-plugin-chai-expect": "^2.2.0",
    "eslint-plugin-mocha": "^8.0.0",
    "mocha": "^8.1.3",
    "nyc": "^15.1.0"
  },
  "engines": {
    "node": ">=10"
  },
  "nyc": {
    "all": true,
    "check-coverage": true,
    "branches": 100,
    "lines": 100,
    "functions": 100,
    "statements": 100,
    "reporter": [
      "lcov"
    ]
  },
  "scripts": {
    "build": "npm run lint && npm run test",
    "test": "nyc --reporter=lcov --reporter=text-summary mocha --recursive",
    "test:watch": "mocha --recursive --watch",
    "test:nocoverage": "mocha --recursive",
    "lint": "eslint src test"
  }
}