@andrewrubin/min-heap
Version:
Min Heap data structure in JavaScript
36 lines (35 loc) • 902 B
JSON
{
"name": "@andrewrubin/min-heap",
"version": "1.1.3",
"description": "Min Heap data structure in JavaScript",
"repository": "https://github.com/andrewrubin/min-heap",
"issues": "https://github.com/andrewrubin/min-heap/issues",
"type": "module",
"source": "index.js",
"exports": {
"require": "./dist/min-heap.cjs",
"default": "./dist/min-heap.js"
},
"main": "./dist/min-heap.cjs",
"module": "./dist/min-heap.module.js",
"unpkg": "./dist/min-heap.umd.js",
"scripts": {
"build": "microbundle",
"dev": "microbundle watch",
"tests": "for i in tests/*.js; do node $i; done",
"prepare": "npm run tests && npm run build"
},
"keywords": [
"minheap",
"binaryheap",
"tree",
"heap",
"queue",
"priority"
],
"author": "Andrew Rubin <arubin78@gmail.com>",
"license": "ISC",
"devDependencies": {
"microbundle": "~0.15.1"
}
}