{"library":"ts-priority-queue","type":"library","category":null,"description":"A priority queue data structure implemented in TypeScript, providing O(log n) insertion and removal. Version 0.1.1 is the current stable release. The library uses a binary heap strategy and is a port of the CoffeeScript js-priority-queue, with array and BHeap strategies removed. It offers a simple API: queue, dequeue, peek, clear, and length. Supports custom comparators and initial values. Ideal for TypeScript projects needing a minimal, dependency-free priority queue. However, it is a small, possibly unmaintained package with limited testing and documentation.","language":"javascript","status":"active","version":"0.1.1","tags":["javascript","priority","queue","b-heap","binary","heap","dequeue","comparator"],"last_verified":"Sun Jun 07","install":[{"cmd":"npm install ts-priority-queue","imports":["import { PriorityQueue } from 'ts-priority-queue';","import PriorityQueue from 'ts-priority-queue';","import { PriorityQueueOptions } from 'ts-priority-queue';"]},{"cmd":"yarn add ts-priority-queue","imports":[]},{"cmd":"pnpm add ts-priority-queue","imports":[]}],"homepage":"https://github.com/RonPenton/ts-priority-queue#readme","github":"https://github.com/RonPenton/ts-priority-queue","docs":null,"changelog":null,"pypi":null,"npm":"ts-priority-queue","openapi_spec":null,"status_page":null,"smithery":null,"compatibility":null}