Bitfield that allocates a series of small buffers to support sparse bits without allocating a massive buffer
Curated collection of data structures for the JavaScript/TypeScript.
Some git helpers that changesets use to get information
Sparse array implementation in JS with no dependencies
msgpack encoder and decoder in pure javascript based on creationix/msgpack-js updated to match the new v5 specification with string support.
Sparse array with run-length encoded deletions
A sparse array optimised for low memory whilst still being fast
Share code across vat boundaries
Extremely fast double-ended queue implementation
Rich text value and manipulation API.
The default blueprint for ember-cli addons.
TypeScript definitions for sparse-bitfield
A sparse octree data structure.
Sparse Merkle tree implementation in TypeScript.
Sparse Merkle tree implementation in TypeScript.
Sparse matrix library
pgvector support for Node.js, Deno, and Bun (and TypeScript)
Chroma Cloud Splade sparse embedding function
The primary functions of the world state package are to maintain the collection of Merkle Trees comprising the global state of the system and to offer an interface with which the trees can be queried.
Sparse Merkle tree implementation in TypeScript.
Download templates and git repositories with pleasure!
The Merkle Trees package contains typescript implementations of the various Merkle Trees required by the system.
Collection of cross-platform routines to operate effectively sparse array. A sparse array is an vector of intervals which splits number space into two subsets, internal and external. ArraySparse leverage iterating, inverting, minimizing and other operatio
Sparse vector & matrix implementations
Basic linear algebra routines
Basic linear algebra routines
Basic linear algebra routines
Basic linear algebra routines
Basic linear algebra routines
Basic linear algebra routines
Basic linear algebra routines