{
  "name": "fastpriorityqueue",
  "description": "Fast heap-based priority queue in JavaScript",
  "keywords": [
    "heap",
    "binary heap",
    "data structure",
    "priority queue",
    "performance"
  ],
  "version": "0.8.0",
  "repository": {
    "type": "git",
    "url": "git+https://github.com/lemire/FastPriorityQueue.js.git"
  },
  "main": "FastPriorityQueue.js",
  "types": "FastPriorityQueue.d.ts",
  "scripts": {
    "test": "mocha unit/basictests.js",
    "benchmark": "node benchmark/test.js"
  },
  "license": "Apache-2.0",
  "bugs": {
    "url": "https://github.com/lemire/FastPriorityQueue.js/issues"
  },
  "homepage": "https://github.com/lemire/FastPriorityQueue.js#readme",
  "devDependencies": {
    "benchmark": "^2.1.4",
    "binaryheapx": "^0.1.1",
    "heap": "^0.2.7",
    "js-heap": "^0.3.1",
    "js-priority-queue": "^0.1.5",
    "mocha": "^11.3.0",
    "priority_queue": "^0.1.3",
    "priorityqueuejs": "^2.0.0",
    "qheap": "^1.4.0",
    "queue-priority": "^1.0.0",
    "stablepriorityqueue": "^0.1.2",
    "yabh": "^1.2.0"
  },
  "author": "Daniel Lemire <lemire@gmail.com> (http://lemire.me/en/)"
}