hashsplit

MITGov2.0.0

32 stars3 forks0 contributors

Overview

Split byte streams into chunks, and arrange chunks into trees, with boundaries determined by content, not position

Community-curated · Updated weekly · 100% open source

Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.

Last commit

1 year ago

CreatedSince 2020

Auto-fetched 17 hours ago

A Go library for an efficient implementation of a skip list: https://godoc.org/github.com/MauriceGit/skiplist

skiplist for golang

Generic sorted map for Go with red-black tree under the hood

Merkle hash trees