{
  "name": "byheap",
  "version": "1.0.11",
  "description": "An efficient es6 implementation of priority queue using binary heap data structure",
  "main": "lib/index.js",
  "scripts": {
    "test": "mocha test/src || true",
    "prepare": "babel src --out-dir lib"
  },
  "babel": {
    "presets": [
      "es2015"
    ]
  },
  "keywords": [
    "npm",
    "es6",
    "priority queue",
    "optimization",
    "efficient",
    "heap",
    "binary heap",
    "max heap",
    "min heap",
    "heapsort",
    "extract min",
    "extract max",
    "data structure"
  ],
  "author": "Rahul Choudhary <ragulchoudhary666666@gmail.com>",
  "repository": {
    "type": "git",
    "url": "git://github.com/rahul1368/byheap.git"
  },
  "license": "ISC",
  "devDependencies": {
    "babel-cli": "^6.26.0",
    "babel-core": "^6.26.3",
    "babel-preset-es2015": "^6.24.1",
    "chai": "^4.2.0",
    "mocha": "^7.1.2"
  }
}