A Red Black Tree implementation in Rust
A textbook implementation of a Red-Black Tree.
A set based on a RB-Tree for efficient operations.
A collection of useful data structures.
Implementation of various types of trees.
A collection for tree data structures. It provides APIs that allows users to create memory efficient binary search trees, red-black trees and avl trees.
An interval tree implementation using Red-Black Tree as its underlying data structure.
Iron-oxide fast embedded database - nanosecond-level key-value storage
Rolling statistics for technical analysis in backtesting and live trading systems.
Tree-sitter parsing and dynamic grammar loading for graphy
Semantic code analysis CLI for the AI era — powered by DataGrout
Multi-language semantic code analysis library — tree-sitter fact extraction for DataGrout Invariant
(This gem was named as treevisitor) tree.rb is a 'clone' of tree unix command. The gem implements a library to mange tree structures. The gem contains also a library to build tree with a dsl (domain specific language), and an implementation of visitor design pattern. An example of DSL to build tree: <pre> tree = TreeNode.create do node "root" do leaf "l1" node "sub" do leaf "l3" end node "wo leaves" end </pre>
A KDTree Library