{"library":"heapify","type":"library","category":null,"description":"A very fast JavaScript priority queue implemented with a binary heap using parallel typed arrays. Version 1.0.2 is stable with no dependencies, released by luciopaiva. Benchmarks show it outperforms competitors like TinyQueue, FastPQ, FlatQueue, and Closure Library in push, pop, and interleaved operations. Supports min-heap, custom capacity, and various key/priority types. Ships TypeScript types and is available for Node.js (ESM and CJS) and browsers (global script or ESM). Suitable for performance-critical applications requiring low-latency queue operations.","language":"javascript","status":"active","version":"1.0.2","tags":["javascript","priority queue","queue","heap","minheap","maxheap","binary heap","heapsort","typescript"],"last_verified":"Sun Jun 07","install":[{"cmd":"npm install heapify","imports":["import { MinQueue } from 'heapify'","const { MinQueue } = require('heapify')","const { MinQueue } = Heapify;","import { MinQueue } from 'https://unpkg.com/heapify/heapify.mjs'"]},{"cmd":"yarn add heapify","imports":[]},{"cmd":"pnpm add heapify","imports":[]}],"homepage":"https://github.com/luciopaiva/heapify","github":"git://github.com/luciopaiva/heapify","docs":null,"changelog":null,"pypi":null,"npm":"heapify","openapi_spec":null,"status_page":null,"smithery":null,"compatibility":null}