RBTreeNim
by Nycto
Nim Red/Black Trees
AI summary
Balanced search tree
A library implementing a balanced binary search tree data structure with customizable key extraction and comparison functions.
- stars
- 23
- forks
- 4
- watching
- 3
- awesome list
- 1
Similar projects
Found by comparing what the projects do, not just their names.
Grid indexer
A data structure library for efficiently indexing objects on a grid
Red black tree library
An implementation of a stable data structure based on Red Black Trees in the Motoko programming language.
Binary search tree
A data structure implementation of a semi-balanced binary search tree that optimizes access to frequently accessed items
Ordered store
An implementation of a data structure for ordered key-value stores with efficient lookup and insertion capabilities.
Ternary search tree
A Rust implementation of a ternary search tree data structure used for efficient string matching and lookup.
Tree detection benchmark
A dataset and tools for evaluating tree detection algorithms on multisensor aerial imagery
Data navigator
A library for working with nested data structures in Python
B+Tree index
A minimal B+Tree indexing structure implementation for efficient key-value storage
Payment processor
A Ruby library providing access to the Braintree payment gateway
Sorted data library
An implementation of sorted data structures using B-Trees in the Nim programming language
Text selector
A plugin that enables location-aware text objects in Neovim.
Database feature development
Development trees for collaborative work on PostgreSQL patches and features
Neural Tree Model
An implementation of Adaptive Neural Trees in PyTorch for deep learning
Spatial tree
An efficient spatial data structure for fast point query operations
attaswift/btree1.3K
B-tree collection library
A package that provides fast and efficient in-memory data structures using B-tree technology
Featured in 1 awesome list
Each link jumps to the spot where the list mentions RBTreeNim.
