asynchronous copy-on-write btree
Scalable P2P 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.
A sorted list of key-value pairs in a fast, typed in-memory B+ tree with a powerful API.
Functional utilities for working with btrees such as those used in agAST
btree-tex
An append-only Btree running on a dDatabase.
Helper functions for working with BTree pointer machines.
Content-addressed b-tree
Native binary tree implementation based on GLib Balanced Binary Trees (GTree) for Node.js
a simple db based on btree data structure
My JavaScript parser
A tiny, zero-dependency in-memory B+ tree for TypeScript, Node.js, and browser JavaScript.
Bem-vindo ao Pine Design System! Pine é um conjunto de diretrizes e componentes de design criado para ajudar a construir interfaces de usuário coesas e eficientes. Este sistema é projetado para garantir consistência visual e facilitar a criação de experiê
An append-only Btree running on a Unichain.
A sorted, in-memory B+ tree with range-based iteration and support for unique and non-unique keys
Async B-tree implementation for Javascript
A rebalancing binary tree for JS
JavaScript/TypeScript implementation of Behavior Trees.
STS Data Management Modules, Utilities and Services
A balanced Binary Search Tree using Indexes instead of Nodes
React hooks and DevTools component used to visualize tree.
B-Tree index for Terraformer
A generic persistant BTree, using the RawSerde crate
AVL and Btree for rust
Easy-to-use macros for initializing any collection
A persistent, embedded key-value storage engine in Rust featuring a Copy-On-Write (COW) B-Tree, ACID compliance, and crash safety with multi-bucket support
limousine_engine can reason about a large design continuum of hybrid key-value store designs and materialize an optimal implementation using procedural macros.
B-trees backed by a slab/arena to reduce allocations and increase locality + copyable, immutable B-trees which must be manually dropped
A Rust implementation of BTree structure on persistent storage in userspace.
B-tree range map implementation
A memory compact Slab-based B-tree implementation
Generic BTree for versatile purposes
A Data Structure of BTree Implemented with Rust, support snapshot. not use any unsafe lib.
A persistent copy-on-write B+Tree implementation, designed as an index for a key-value store, inspired by SQLite.
Pure ruby implementation of a btree as described in Introduction to Algorithms by Cormen, Leiserson, Rivest and Stein, Chapter 18.
Ruby bindings to GTree balanced binary tree from GLib library.
Cache based on btrees, for large ammounts of cache.
Ruby implementation of database with btree and ORM mapper
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.