Removing merkletree: (#4126)

* Removing merkletree:
- Last commit is 3 years ago
- Project is still in alpha and not progressing
- Open issues and pull requests are not being responded to
- Has no code coverage report

* Removing merkletree
This commit is contained in:
Shannon 2022-04-07 19:35:50 -07:00 committed by GitHub
parent f3befd3255
commit 2db6067f64
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23

View File

@ -612,7 +612,6 @@ additional ordered map implementations.
- [hashsplit](http://github.com/bobg/hashsplit) - Split byte streams into chunks, and arrange chunks into trees, with boundaries determined by content, not position. - [hashsplit](http://github.com/bobg/hashsplit) - Split byte streams into chunks, and arrange chunks into trees, with boundaries determined by content, not position.
- [merkle](https://github.com/bobg/merkle) - Space-efficient computation of Merkle root hashes and inclusion proofs. - [merkle](https://github.com/bobg/merkle) - Space-efficient computation of Merkle root hashes and inclusion proofs.
- [merkletree](https://github.com/cbergoon/merkletree) - Implementation of a merkle tree providing an efficient and secure verification of the contents of data structures.
- [skiplist](https://github.com/MauriceGit/skiplist) - Very fast Go Skiplist implementation. - [skiplist](https://github.com/MauriceGit/skiplist) - Very fast Go Skiplist implementation.
- [skiplist](https://github.com/gansidui/skiplist) - Skiplist implementation in Go. - [skiplist](https://github.com/gansidui/skiplist) - Skiplist implementation in Go.
- [treap](https://github.com/perdata/treap) - Persistent, fast ordered map using tree heaps. - [treap](https://github.com/perdata/treap) - Persistent, fast ordered map using tree heaps.