{"library":"min-priority-queue-typed","type":"library","category":null,"description":"A TypeScript implementation of a min-priority queue data structure, extracted from the data-structure-typed collection. Version 2.6.0 offers a standalone binary heap-based priority queue with a customizable comparator for ordering elements. The package ships TypeScript declarations and supports ESM and CJS via module bundlers. It differentiates itself from built-in JavaScript priority queues by providing a dedicated min-heap with explicit add, poll, and peek methods, making it suitable for scheduling, event simulation, and algorithmic use cases. The library is actively maintained with regular releases.","language":"javascript","status":"active","version":"2.6.0","tags":["javascript","Min Priority Queue","min priority queue","minpriorityqueue","min-priority-queue","Priority Queue","priority queue","priorityqueue","priority-queue","typescript"],"last_verified":"Sun Jun 07","install":[{"cmd":"npm install min-priority-queue-typed","imports":["import { MinPriorityQueue } from 'min-priority-queue-typed'","const { MinPriorityQueue } = require('min-priority-queue-typed')","import type { MinPriorityQueue } from 'min-priority-queue-typed'"]},{"cmd":"yarn add min-priority-queue-typed","imports":[]},{"cmd":"pnpm add min-priority-queue-typed","imports":[]}],"homepage":"https://data-structure-typed-docs.vercel.app","github":"https://github.com/zrwusa/data-structure-typed","docs":null,"changelog":null,"pypi":null,"npm":"min-priority-queue-typed","openapi_spec":null,"status_page":null,"smithery":null,"compatibility":null}