Trees -
Awesome Go
- hashsplit - Split byte streams into chunks, and arrange chunks into trees, with boundaries determined by content, not position.
- merkle - Space-efficient computation of Merkle root hashes and inclusion proofs.
- skiplist - Very fast Go Skiplist implementation.
- skiplist - Skiplist implementation in Go.
- treap - Persistent, fast ordered map using tree heaps.
- treemap - Generic key-sorted map using a red-black tree under the hood.
- ordered-concurrently - Go module that processes work concurrently and returns output in a channel in the order of input.
- parapipe - FIFO Pipeline which parallels execution on each stage while maintaining the order of messages and results.
- pipeline - An implementation of pipelines with fan-in and fan-out.
