A fully persistent balanced binary search tree
javascript standard data structure library which benchmark against C++ STL
Curated collection of data structures for the JavaScript/TypeScript.
Unicode Trie data structure for fast character metadata lookup, ported from ICU
parse the .git/config file into a useful data structure
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
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.
Editor state data structures for the CodeMirror code editor
Rope-based persistent sequence type
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
64-bit complex number.
128-bit complex number.
Allocate a buffer containing a provided string.
Extremely fast double-ended queue implementation
Fork of HAMT that adds transient mutation and support for custom key types
a simple ring buffer data structure
An simple, relational SDK for querying TypeScript and JavaScript data structures
Modeling the schema of data structures as first-class values
Utility data structure used in discord.js
Immutable data structures for JavaScript which are backwards-compatible with normal JS Arrays and Objects.
A TypeScript package with latest Schema.org Schema Typings
Binary serialization which sorts bytewise for arbirarily complex data structures
a simple priority queue data structure
Shared TypeScript definitions for core Portable Text data structures
JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash