281 packages found
Clinic.js diagnoses your performance issues
binary heap (priority queue) algorithms (ported from Python's heapq module)
Curated collection of data structures for the JavaScript/TypeScript.
- bag
- bimap
- bit array
- bit set
- bit vector
- bitset
- bk tree
- burkhard-keller tree
- cache
- circular buffer
- counter
- data structures
- default map
- deque
- View more
Exposes node v8 garbage collection stats
- garbage collection
- garbage collection info
- garbage collection information
- garbage collection statistics
- garbage collection stats
- garbage collector
- garbage collector info
- garbage collector information
- garbage collector statistics
- garbage collector stats
- gc
- gc info
- gc information
- gc statistics
- View more
Priority queue data structure where you are able to set your own compare function.
priority queue(heap) data structure for node.js and browsers
Supervisor, Coroutine, Channel, select, AtomicPromise, Cancellation, Cache, InvList, IxList, and some utils.
- supervisor
- actor
- observer
- coroutine
- channel
- select
- cancellation
- sequence
- generator
- iterator
- maybe
- either
- monad
- arrow
- View more
React Native event tracking with Heap.
An utility library implementing summing priority queue in solidity
A Javascript library of simple data structures
Efficient Binary heap (priority queue, binary tree) data structure for JavaScript / TypeScript. Includes JavaScript methods, Python's heapq module methods, and Java's PriorityQueue methods.
Typed data structures, algorithms, and utility functions library for JavaScript/TypeScript
- typescript
- data
- structures
- collections
- generics
- linked
- list
- dictionary
- binary
- search
- tree
- key
- value
- stack
- View more
Fast heap-based priority queue in TypeScript
[](https://www.npmjs.com/package/@astronautlabs/priority-queue) [](https://circleci.com/gh/astronautl
Sort a single-precision floating-point strided array using heapsort.
Sort a double-precision floating-point strided array using heapsort.
Simultaneously sort two strided arrays based on the sort order of the first array using heapsort.
Simultaneously sort two double-precision floating-point strided arrays based on the sort order of the first array using heapsort.
Simultaneously sort two single-precision floating-point strided arrays based on the sort order of the first array using heapsort.