Data Structures

Tiny queue data structure

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

A fully persistent balanced binary search tree

Curated collection of data structures for the JavaScript/TypeScript.

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

This package provides support for the [RedisTimeSeries](https://redis.io/docs/data-types/timeseries/) module, which adds a time series data structure to Redis.

The smallest and simplest JavaScript priority queue

This package provides support for the [RedisBloom](https://redis.io/docs/data-types/probabilistic/) module, which adds additional probabilistic data structures to Redis.

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

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

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

Like an array, but rounder.

Syntax tree data structure and parser interfaces for the lezer parser

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

Rope-based persistent sequence type

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

Editor state data structures for the CodeMirror code editor

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

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.

The modular and type safe schema library for validating structural data

Handy data structures for elements keyed by string.

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

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

Trie Data Structure to support cspell.

Codecs for various data structures

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

A TypeScript package with latest Schema.org Schema Typings

A library for encoding and decoding any data structure

Modeling the schema of data structures as first-class values

a simple ring buffer data structure

Binary serialization which sorts bytewise for arbirarily complex data structures

Typewise-structured sorting for arbitrarily complex data structures

Utility data structure used in discord.js

Type definitions for common Sanity data structures

Extremely fast double-ended queue implementation

a simple priority queue data structure

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

Float64Array.

Float32Array.

Uint32Array.

Uint8Array.

Uint16Array.

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

Buffer.

Shared TypeScript definitions for core Portable Text data structures

Allocate a buffer containing a provided string.

A graph data structure with topological sort.

JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash