Max Priority Queue

A standalone Max Priority Queue data structure with TypeScript support, implemented as part of the data-structure-typed collection. Version 2.6.0 provides a minified bundle of ~5.3 KB. It uses a binary heap and offers typical operations like add, poll, peek, and toArray. The package is actively maintained alongside the larger data-structure-typed library, which includes many other data structures. Key differentiators include a focus on TypeScript-first design, custom comparator support, and detailed API documentation. The package follows a regular release cadence with weekly releases.