From 1fd356713e0b1f4a7dcc7716c771de90dd5599cc Mon Sep 17 00:00:00 2001 From: Yassine Benaid Date: Tue, 10 Sep 2024 09:09:00 +0100 Subject: [PATCH] chore: correct description --- README.md | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) diff --git a/README.md b/README.md index 894e2856..de90f721 100644 --- a/README.md +++ b/README.md @@ -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.