Showing 4 of 4 projects
A simple, fast, ordered, persistable key-value storage library for Go, using an LSM-like design.
A high-performance, memory-efficient Go implementation of Adaptive Radix Trees with zero-allocation searches and ordered iteration.
A high-performance Go library implementing a skip list with O(log n) operations and benchmark-proven speed.
A Clojure library providing ordered sets and maps that maintain insertion order of elements.
Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.