Data Structures

Tiny queue data structure

A fully persistent balanced binary search tree

The fastest javascript implementation of a double-ended queue. Used by the official Redis, MongoDB, MariaDB & MySQL libraries for Node.js and many other libraries. Maintains compatability with deque.

javascript standard data structure library which benchmark against C++ STL

javascript standard data structure library which benchmark against C++ STL

Curated collection of data structures for the JavaScript/TypeScript.

Like an array, but rounder.

asn1js is a pure JavaScript library implementing this standard. ASN.1 is the basis of all X.509 related data structures and numerous other protocols used on the web

parse the .git/config file into a useful data structure

Query JavaScript objects with JSONPath expressions. Robust / safe JSONPath engine for Node.js.

Unicode Trie data structure for fast character metadata lookup, ported from ICU

A very fast static 2D index for points based on kd-tree.

This package provides support for the [RedisTimeSeries](https://redistimeseries.io) module, which adds a time series data structure to Redis. It extends the [Node Redis client](https://github.com/redis/node-redis) to include functions for each of the Redi

The smallest and simplest JavaScript priority queue

This package provides support for the [RedisBloom](https://redisbloom.io) module, which adds additional probabilistic data structures to Redis. It extends the [Node Redis client](https://github.com/redis/node-redis) to include functions for each of the R

Syntax tree data structure and parser interfaces for the lezer parser

This library aims to provide codegen helpers and data structure for Vue language plugin API v1.x that does not depend on Volar runtime.

Rope-based persistent sequence type

Handy data structures for elements keyed by string.

Editor state data structures for the CodeMirror code editor

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.

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

Modeling the schema of data structures as first-class values

Read all the installed packages in a folder, and return a tree structure with all the data.

An implementation of the Fibonacci heap data structure

Trie Data Structure to support cspell.

queue-lit is a tiny queue data structure in case you `Array#push()` or `Array#shift()` on large arrays very often

An simple, relational SDK for querying TypeScript and JavaScript data structures

a simple priority queue data structure

Extremely fast double-ended queue implementation

a simple ring buffer data structure

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

The modular and type safe schema library for validating structural data

Utility data structure used in discord.js

Min/Max Heap & Heap Sort implementation in javascript

Typewise-structured sorting for arbitrarily complex data structures

Binary serialization which sorts bytewise for arbirarily complex data structures

Float64Array.

Float32Array.

Uint16Array.

Uint32Array.

Uint8Array.

A TypeScript package with latest Schema.org Schema Typings

Immutable data structures for JavaScript which are backwards-compatible with normal JS Arrays and Objects.

Buffer.

Allocate a buffer containing a provided string.

read and write binary structures and data types

Type definitions for common Sanity data structures

Codecs for various data structures

A graph data structure with topological sort.