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
23 stars
3 watching
4 forks
Language: Nim
last commit: over 1 year ago
Linked from 1 awesome list
ringabout/awesome-nimRelated projects:
| Repository | Description | Stars |
|---|---|---|
| nycto/quadtreenim | A data structure library for efficiently indexing objects on a grid | 9 |
 canscale/stablerbtree | An implementation of a stable data structure based on Red Black Trees in the Motoko programming language. | 3 |
 wyhaines/splay_tree_map.cr | A data structure implementation of a semi-balanced binary search tree that optimizes access to frequently accessed items | 15 |
 tyre/red_black_tree | An implementation of a data structure for ordered key-value stores with efficient lookup and insertion capabilities. | 37 |
 billyevans/tst | A Rust implementation of a ternary search tree data structure used for efficient string matching and lookup. | 23 |
 weecology/neontreeevaluation | A dataset and tools for evaluating tree detection algorithms on multisensor aerial imagery | 136 |
 google-deepmind/tree | A library for working with nested data structures in Python | 948 |
 begeekmyfriend/bplustree | A minimal B+Tree indexing structure implementation for efficient key-value storage | 1,866 |
 braintree/braintree_ruby | A Ruby library providing access to the Braintree payment gateway | 446 |
 narimiran/sorta | An implementation of sorted data structures using B-Trees in the Nim programming language | 17 |
 rrethy/nvim-treesitter-textsubjects | A plugin that enables location-aware text objects in Neovim. | 523 |
 2ndquadrant/postgres | Development trees for collaborative work on PostgreSQL patches and features | 6 |
 rtanno21609/adaptiveneuraltrees | An implementation of Adaptive Neural Trees in PyTorch for deep learning | 151 |
 jblindsay/kdtree | An efficient spatial data structure for fast point query operations | 43 |
 attaswift/btree | A package that provides fast and efficient in-memory data structures using B-tree technology | 1,312 |