{"library":"p-queue-ts","type":"library","category":null,"description":"Minimalist priority queue implementation using a binary heap, written in TypeScript. Version 1.2.0 ships with type definitions and supports both max-heap (default) and min-heap via custom comparator. The library is small (under 1KB gzipped), has zero dependencies, and targets Node >=8. It provides a basic API (push, pop, top, size) common to LeetCode-style problems. Compared to alternatives like @datastructures-js/priority-queue or js-priority-queue, this package is simpler and less feature-rich, but it remains actively maintained as of 2025.","language":"javascript","status":"active","version":"1.2.0","tags":["javascript","priority queue","js module","heap","max heap","min heap","heapify","algorithm","typescript"],"last_verified":"Sun Jun 07","install":[{"cmd":"npm install p-queue-ts","imports":["import { PriorityQueue } from 'p-queue-ts'","import PriorityQueue from 'p-queue-ts'","import type { PriorityQueue } from 'p-queue-ts'"]},{"cmd":"yarn add p-queue-ts","imports":[]},{"cmd":"pnpm add p-queue-ts","imports":[]}],"homepage":"https://github.com/davidnguyen179/p-queue-ts/blob/master/README.md","github":"https://github.com/davidnguyen179/p-queue-ts","docs":null,"changelog":null,"pypi":null,"npm":"p-queue-ts","openapi_spec":null,"status_page":null,"smithery":null,"compatibility":null}