awesome/awesome-go
1
0
Fork 0
mirror of https://github.com/avelino/awesome-go.git synced 2024-11-28 16:56:26 +00:00
Code Issues Packages Projects Releases Wiki Activity

chore: correct description

Browse Source
This commit is contained in:
Yassine Benaid 2024-09-10 09:09:00 +01:00 committed by GitHub
parent 8eb88d0203
commit 1fd356713e
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 1 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
README.md
View File

@ -618,9 +618,8 @@ 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
- [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 optimized.
- [merkle](https://github.com/bobg/merkle) - Space-efficient computation of Merkle root hashes and inclusion proofs.
optimized.
- [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.