Data Structures

Tiny queue data structure

A fully persistent balanced binary search tree

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

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.

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

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

Curated collection of data structures for the JavaScript/TypeScript.

Handy data structures for elements keyed by string.

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

The smallest and simplest JavaScript priority queue

Syntax tree data structure and parser interfaces for the lezer parser

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

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

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

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

Extremely fast double-ended queue implementation

Rope-based persistent sequence type

Editor state data structures for the CodeMirror code editor

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

An implementation of the Fibonacci heap 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.

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

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

Allocate a buffer containing a provided string.

Buffer.

Float64Array.

Float32Array.

64-bit complex number.

128-bit complex number.

Uint32Array.

Uint8Array.

Uint16Array.

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

A TypeScript package with latest Schema.org Schema Typings

Utility data structure used in discord.js

read and write binary structures and data types

Trie Data Structure to support cspell.

Read, write or test a data structure's nested property via a string like 'my.nested.property'. It works through arrays and objects.'

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

Shared TypeScript definitions for core Portable Text data structures

Validates if a value is matrix-like.

A union-find data structure for maintaining disjoint sets.

a simple priority queue data structure

Type definitions for common Sanity data structures

The listview control allows you to select an item or multiple items from a list-like interface and represents the data in interactive hierarchical structure across different layouts or views.

A graph data structure with topological sort.

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