
What
Brief
This is a standalone Min Heap 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 min-heap-typed --save
yarn
yarn add min-heap-typed
snippet
TS
import {MinHeap} from 'data-structure-typed';
const minNumHeap = new MinHeap<number>();
minNumHeap.add(1).add(6).add(2).add(0).add(5).add(9);
minNumHeap.has(1)
minNumHeap.has(2)
minNumHeap.poll()
minNumHeap.poll()
minNumHeap.peek()
minNumHeap.has(1);
minNumHeap.has(2);
const arrFromHeap = minNumHeap.toArray();
arrFromHeap.length
arrFromHeap[0]
arrFromHeap[1]
arrFromHeap[2]
arrFromHeap[3]
minNumHeap.sort()
JS
const {MinHeap} = require('data-structure-typed');
const minNumHeap = new MinHeap();
minNumHeap.add(1).add(6).add(2).add(0).add(5).add(9);
minNumHeap.has(1)
minNumHeap.has(2)
minNumHeap.poll()
minNumHeap.poll()
minNumHeap.peek()
minNumHeap.has(1);
minNumHeap.has(2);
const arrFromHeap = minNumHeap.toArray();
arrFromHeap.length
arrFromHeap[0]
arrFromHeap[1]
arrFromHeap[2]
arrFromHeap[3]
minNumHeap.sort()
API docs & Examples
API Docs
Live Examples
Examples Repository
Data Structures
Data Structure |
Unit Test |
Performance Test |
API Docs |
Heap |
 |
 |
Heap |
Standard library data structure comparison
Data Structure Typed |
C++ STL |
java.util |
Python collections |
Heap<E> |
priority_queue<T> |
PriorityQueue<E> |
heapq |
Benchmark
heap
test name | time taken (ms) | executions per sec | sample deviation |
---|
10,000 add & pop | 5.80 | 172.35 | 8.78e-5 |
10,000 fib add & pop | 357.92 | 2.79 | 0.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. |