Data structure Packages

An implementation of the Fibonacci heap data structure

binary heap (priority queue) algorithms (ported from Python's heapq module)

Immutable finite list objects with constant-time equality testing (===) and no memory leaks

a simple priority queue data structure

Ceibo is a JavaScript micro library to model trees that evaluate arbitrary code when accessing its nodes.

Implementation of interval tree data structure.

Circular Buffer JavaScript implementation

Javascript implementation of a doubly linked-list data structure

Fast heap-based priority queue in JavaScript

Javascript implementation of a queue data structure

Matrices.

Javascript implementation of a stack (LIFO) data structure

Circular Buffer JavaScript implementation

Fork of HAMT that adds transient mutation and support for custom key types

Enum type made by es6

k-neareset neighbors search for RBush

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.

An implementation of Priority Queue

a simple ring buffer data structure

quadtree data structure