Split byte streams into chunks, and arrange chunks into trees, with boundaries determined by content, not position.
Why do you think that https://github.com/plar/go-adaptive-radix-tree is a good alternative to hashsplit
Split byte streams into chunks, and arrange chunks into trees, with boundaries determined by content, not position.
Why do you think that https://github.com/plar/go-adaptive-radix-tree is a good alternative to hashsplit