Important: This documentation covers Yarn 1 (Classic).
For Yarn 2+ docs and migration guide, see yarnpkg.com.

Package detail

max-priority-queue-typed

zrwusa598MIT2.0.3TypeScript support: included

Max Priority Queue

Max Priority Queue, max priority queue, max-priority-queue, maxpriorityqueue, max value, extract maximum, Priority Queue, priority queue, priorityqueue, priority-queue, priority q, priorityQ, min, max, efficient, priority, heap, binary heap, binaryheap, heap property, complete binary, heapify, extract min, extract max, complete binary tree, min priority queue, max priority queue, efficient priority, ordering property, dynamic resizing, priority-based, priority-based processing, sorting, element priority, queue priority, insertion, deletion, javascript, java script, JavaScript, js, typescript, type script, TypeScript, ts, sorted, sort, data, structure, structures, data structure, datastructure, data-structure, data structures, datastructures, data-structures, in data structures, in data structure, DataStructure, DataStructures, traversal, recursive, iterative, Node.js, CommonJS, ES6, UMD, esmodule, java.util, c++ stl, c++ std, Python collections, System.Collections.Generic, STL, stl, util, collection, Collection, collections, Collections, searching, performance, OOP, documentation, visualization

readme

NPM GitHub top language npm eslint npm bundle size npm bundle size npm

What

Brief

This is a standalone Max Priority Queue data structure from the data-structure-typed collection. If you wish to access more data structures or advanced features, you can transition to directly installing the complete data-structure-typed package

How

install

npm

npm i max-priority-queue --save

yarn

yarn add max-priority-queue

snippet

API docs & Examples

API Docs

Live Examples

Examples Repository

Data Structures

Data Structure Unit Test Performance Test API Docs
Max Priority Queue MaxPriorityQueue

Standard library data structure comparison

Data Structure Typed C++ STL java.util Python collections
PriorityQueue<E> priority_queue<T> PriorityQueue<E> -

Benchmark

max-priority-queue
test nametime taken (ms)executions per secsample deviation
10,000 refill & poll8.91112.292.26e-4
priority-queue
test nametime taken (ms)executions per secsample deviation
100,000 add & pop103.599.650.00

Built-in classic algorithms

Algorithm Function Description Iteration Type

Software Engineering Design Standards

Principle Description
Practicality Follows ES6 and ESNext standards, offering unified and considerate optional parameters, and simplifies method names.
Extensibility Adheres to OOP (Object-Oriented Programming) principles, allowing inheritance for all data structures.
Modularization Includes data structure modularization and independent NPM packages.
Efficiency All methods provide time and space complexity, comparable to native JS performance.
Maintainability Follows open-source community development standards, complete documentation, continuous integration, and adheres to TDD (Test-Driven Development) patterns.
Testability Automated and customized unit testing, performance testing, and integration testing.
Portability Plans for porting to Java, Python, and C++, currently achieved to 80%.
Reusability Fully decoupled, minimized side effects, and adheres to OOP.
Security Carefully designed security for member variables and methods. Read-write separation. Data structure software does not need to consider other security aspects.
Scalability Data structure software does not involve load issues.