commit | 7364763242911ab6d418d2722e237194938ebad0 | [log] [tgz] |
---|---|---|
author | Graeme Connell <gsconnell@gmail.com> | Fri Sep 23 11:12:10 2016 -0600 |
committer | GitHub <noreply@github.com> | Fri Sep 23 11:12:10 2016 -0600 |
tree | fde776f8fe2563dd92748a91682bb8824c809db3 | |
parent | cbf3301ee2fff94d14cfb35eea76d4491f0553e4 [diff] | |
parent | 301b2551885c1c70a4a0a30492e570694d3a1d68 [diff] |
Merge pull request #7 from tidwall/backwards-iteration backwards iteration
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.