RBTreeNim

Balanced search tree

A library implementing a balanced binary search tree data structure with customizable key extraction and comparison functions.

Nim Red/Black Trees

GitHub

23 stars
3 watching
4 forks
Language: Nim
last commit: almost 3 years ago
Linked from 1 awesome list


Backlinks from these awesome lists:

Related projects:

RepositoryDescriptionStars
nycto/quadtreenimA data structure library for efficiently indexing objects on a grid9
canscale/stablerbtreeAn implementation of a stable data structure based on Red Black Trees in the Motoko programming language.3
wyhaines/splay_tree_map.crA data structure implementation of a semi-balanced binary search tree that optimizes access to frequently accessed items15
tyre/red_black_treeAn implementation of a data structure for ordered key-value stores with efficient lookup and insertion capabilities.37
billyevans/tstA Rust implementation of a ternary search tree data structure used for efficient string matching and lookup.23
weecology/neontreeevaluationA dataset and tools for evaluating tree detection algorithms on multisensor aerial imagery136
google-deepmind/treeA library for working with nested data structures in Python948
begeekmyfriend/bplustreeA minimal B+Tree indexing structure implementation for efficient key-value storage1,866
braintree/braintree_rubyA Ruby library providing access to the Braintree payment gateway446
narimiran/sortaAn implementation of sorted data structures using B-Trees in the Nim programming language17
rrethy/nvim-treesitter-textsubjectsA plugin that enables location-aware text objects in Neovim.523
2ndquadrant/postgresDevelopment trees for collaborative work on PostgreSQL patches and features6
rtanno21609/adaptiveneuraltreesAn implementation of Adaptive Neural Trees in PyTorch for deep learning151
jblindsay/kdtreeAn efficient spatial data structure for fast point query operations43
attaswift/btreeA package that provides fast and efficient in-memory data structures using B-tree technology1,312