Very fast Go Skiplist implementation.
GoMIT Licensedormant
6 projectsData Structures and Algorithms › Trees
Very fast Go Skiplist implementation.
GoMIT Licensedormant
Skiplist implementation in Go.
Godormant
Generic key-sorted map using a red-black tree under the hood.
GoThe Unlicensedormant
Split byte streams into chunks, and arrange chunks into trees, with boundaries determined by content, not position.
GoMIT Licenseslowing
Space-efficient computation of Merkle root hashes and inclusion proofs.
GoMIT Licenseslowing
Topological sort lib,Sorting and pruning of DAG graphs.
GoMIT Licenseslowing