sorted-btree
A sorted list of key-value pairs in a fast, typed in-memory B+ tree with a powerful API.
Found 54 results for btree
A sorted list of key-value pairs in a fast, typed in-memory B+ tree with a powerful API.
A sorted list of key-value pairs in a fast, typed in-memory B+ tree with a powerful API.
Utilities for encoding and decoding records for database storage.
Iterate an MVCC b-tree skipping defunct versions of the records.
Merge staging Strata b-trees containing MVCC versioned records into a primary Strata b-tree.
Forward and reverse iteration of a Strata b-tree.
A pure-JavaScript implementation of IndexedDB that is durable and scalable.
In-memory forward iterator for use with the Strata b-tree MVCC tool collection.
Lightweight B+Tree implementation in TypeScript
kdb tree implementation using a chunk store
Store the B+tree flexibly, not only in-memory.
Async/Await I/O B-tree in pure JavaScript for Node.js.
Merge an ordered collection of records into a Strata b-tree.
ranking
A Strata MVCC iterator that filters the results of a Strata MVCC iterator.
asynchronous copy-on-write btree
Jymfony Data Structures
A Promises/A wrapper for Cadence functions.
Encode key/value pairs for LevelDB-style database storage in a Strata b-tree.
Iterate a collection of MVCC b-tree cursors choosing the most recent version of a record from each tree.
an AVL tree implementation that supports node streams
High speed Synchronous and Asynchronous access to Berkeley DB and LMDB from Node.js.
Iterate an MVCC b-tree cursor selecting the most recent version of a record.
A pure-JavaScript LevelDB implementation backed by a durable and persistent evented I/O b-tree for use with LevelUP.
Rewrite a record or key returned from an MVCC iterator.
Create a compartor strategy based on LevelUP API iterator parameters.
Multi-version concurrency control utilities for a Strata b-tree.
A file backed two-dimensional R-Tree index.
A write-ahead log.
Utilities for adding MVCC version numbers to Strata b-tree keys.
B-Tree index for Terraformer
Binary tree index for syncorm
dingcode的解释器
JavaScript memory store for key/value with indexed lookups based on hash and binary search.
Create a compartor strategy based on LevelUP API iterator parameters.
A binary tree module for NodeJS
A sorted list of key-value pairs in a fast, typed in-memory B+ tree with a powerful API.
Native binary tree implementation based on GLib Balanced Binary Trees (GTree) for Node.js
An R-Tree partition algorithm.
Efficient, no-dependency b-tree and binary search tree for node or the browser
B-Tree implementation in TypeScript
A package that hold new braintree package in order to reuse it in an app that has already a previous version
Helper Method to flatten an array to Binary Tree
Return a minimum size set of items from an MVCC iterator.
An `async`/`await` trampoline.
Takes an array of data and a comparison function, returns an object
Lightweight B+Tree with copy-on-write inheritance
Semi-sequential universally unique identifiers
Partition a collated collection for split within a b-tree.
a simple db based on btree data structure
Verify the internal structure of a Strata b-tree.
Binary Tree implementation.
dingcode的解释器
JavaScript indexes with transactions