Results for ordered_tree

TreeFlat is the simplest way to build & traverse a pre-order Tree for Rust.

rustgym solutions

An in-memory topological sort algorithm for trees based on Group Theory

An intrusive splay tree implementation that is no-std compatible and free from allocation and moves.

Trie ordering for type implementing Orderable.

A high-performance financial quantitative trading order book matching framework.

Traversal of tree-sitter Trees and any arbitrary tree with a TreeCursor-like interface

Traversal of tree-sitter Trees and any arbitrary tree with a TreeCursor-like interface

Traversal of tree-sitter Trees and any arbitrary tree with a TreeCursor-like interface

In memory locality aware b+ tree, faster for ordered access

An ordering that skips prefixes in tree searches

CRDTs as categorical colimits, built on comp-cat-rs