{"library":"priority-queue-typescript","type":"library","category":null,"description":"A priority queue (binary heap) implementation in TypeScript with full type support. The constructor accepts an initial capacity and a custom comparator function, defaulting to max-heap. It supports add, poll, peek, contains, clear, toArray, iterable protocol, and dynamic resizing. Version 2.0.3 is the latest stable release; the package is actively maintained. Key differentiators: simple API, TypeScript-first, no runtime dependencies, supports ESM and CJS via CommonJS. Suitable for algorithmic tasks, stream processing, or any in-memory sorting needs.","language":"javascript","status":"active","version":"2.0.3","tags":["javascript","priority-queue","heap","custom-comparator","comparator","data-structure","data-structures","priority","typescript"],"last_verified":"Sun Jun 07","install":[{"cmd":"npm install priority-queue-typescript","imports":["import { PriorityQueue } from 'priority-queue-typescript'","const { PriorityQueue } = require('priority-queue-typescript')","import { PriorityQueue } from 'priority-queue-typescript';\n// Uses built-in types automatically"]},{"cmd":"yarn add priority-queue-typescript","imports":[]},{"cmd":"pnpm add priority-queue-typescript","imports":[]}],"homepage":"https://github.com/childrentime/PriorityQueue#readme","github":"https://github.com/childrentime/PriorityQueue","docs":null,"changelog":null,"pypi":null,"npm":"priority-queue-typescript","openapi_spec":null,"status_page":null,"smithery":null,"compatibility":null}