skiplist
Very fast Go Skiplist implementation.
294
32
Stars
3
Forks
2
Issues
32
Watchers
Split byte streams into chunks, and arrange chunks into trees, with boundaries determined by content, not position.
Very fast Go Skiplist implementation.
Skiplist implementation in Go.
Generic key-sorted map using a red-black tree under the hood.
Space-efficient computation of Merkle root hashes and inclusion proofs.
Topological sort lib,Sorting and pruning of DAG graphs.