| commit | 4030bb1f1f0c35b30ca7009e9ebd06849dd45306 | [log] [tgz] |
|---|---|---|
| author | ShuNing <[email protected]> | Mon Aug 13 23:31:12 2018 +0800 |
| committer | Graeme Connell <[email protected]> | Mon Aug 13 11:31:12 2018 -0400 |
| tree | 2bd9401e1c1ef7d7fc45bc92cec0b8da8334e5d6 | |
| parent | e89373fe6b4a7413d7acd6da1725b83ef713e6e4 [diff] |
Improve the iterate seek to O(logN) (#25) * improve the iterate seek to O(logN) * add benchmark
This package provides an in-memory B-Tree implementation for Go, useful as an ordered, mutable data structure.
The API is based off of the wonderful http://godoc.org/github.com/petar/GoLLRB/llrb, and is meant to allow btree to act as a drop-in replacement for gollrb trees.
See http://godoc.org/github.com/google/btree for documentation.