snaptree
Concurrent tree
A concurrent data structure implementation for efficient tree-based operations with atomic cloning and snapshot isolation.
Concurrent TreeMap w/ efficient support for clone() and consistent iteration
148 stars
20 watching
30 forks
Language: Java
last commit: about 12 years ago Related projects:
Repository | Description | Stars |
---|---|---|
preshing/junction | A collection of concurrent hash map implementations in C++. | 1,408 |
romix/java-concurrent-hash-trie-map | An implementation of a concurrent hash array mapped trie data structure for thread-safe and lock-free map operations. | 151 |
dtenny/clj-con | A Common Lisp package providing concurrency operations similar to Clojure | 35 |
rtanno21609/adaptiveneuraltrees | An implementation of Adaptive Neural Trees in PyTorch for deep learning | 151 |
begeekmyfriend/bplustree | A minimal B+Tree indexing structure implementation for efficient key-value storage | 1,863 |
jblindsay/kdtree | An efficient spatial data structure for fast point query operations | 43 |
jberryman/unagi-chan | A high-performance concurrent queue implementation using atomic counters and the x86 fetch-and-add instruction | 127 |
nycto/rbtreenim | A library implementing a balanced binary search tree data structure with customizable key extraction and comparison functions. | 23 |
ducasse/quadtree | An implementation of Region Trees for efficient spatial partitioning and data storage | 2 |
aphyr/meangirls | A data structure library for building eventually consistent systems with concurrent updates and merging operations | 651 |
sharow/libconcurrent | A lightweight, low-overhead concurrency library | 361 |
sindresorhus/p-times | Runs promise-returning & async functions multiple times concurrently | 38 |
boundary/high-scale-lib | A concurrent utilities library designed to improve performance on multi-core systems | 415 |
cerebral-legacy/redux-action-tree | An implementation of a signal-based behavior tree for Redux actions | 228 |
erikerlandson/st_tree | A C++ template class for tree data structures with flexible storage models and standard STL interfaces. | 96 |