Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Added m-way trie algorithms "bits" of sop library under the "Data Str… #5110

Open
wants to merge 3 commits into
base: main
Choose a base branch
from
Open

Added m-way trie algorithms "bits" of sop library under the "Data Str… #5110

Changes from 2 commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
7a8cd29
Added m-way trie algorithms "bits" of sop library under the "Data Str…
grecinto Nov 20, 2023
8eb88d0
Re-arranged order of m-way trie & merkle to sort these entries properly.
grecinto Nov 20, 2023
1fd3567
chore: correct description
yassinebenaid Sep 10, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 2 additions & 0 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -618,7 +618,9 @@ additional ordered map implementations.
### Trees

- [hashsplit](http://github.com/bobg/hashsplit) - Split byte streams into chunks, and arrange chunks into trees, with boundaries determined by content, not position.
- [m-way trie](https://github.com/SharedCode/sop) - Generic key-sorted map using M-Way Trie Algorithms(i.e. - load balanced B-Tree) under the hood. Does not use "pointers" thus, Garbage Collector
- [merkle](https://github.com/bobg/merkle) - Space-efficient computation of Merkle root hashes and inclusion proofs.
optimized.
phanirithvij marked this conversation as resolved.
Show resolved Hide resolved
- [skiplist](https://github.com/MauriceGit/skiplist) - Very fast Go Skiplist implementation.
- [skiplist](https://github.com/gansidui/skiplist) - Skiplist implementation in Go.
- [treap](https://github.com/perdata/treap) - Persistent, fast ordered map using tree heaps.
Expand Down