| commit | 479b5e81b0a93ec038d201b0b33d17db599531d3 | [log] [tgz] |
|---|---|---|
| author | Adam Colton <adamcolton@gmail.com> | Tue Oct 15 22:43:19 2019 -0400 |
| committer | Graeme Connell <gsconnell@gmail.com> | Wed Oct 16 10:15:28 2019 -0600 |
| tree | 783e57a186111856910c1dc346bdd5d56e70e991 | |
| parent | be84af90a1f71c9eeac820a4cdacb863122396d6 [diff] |
Minor documentation fix, DescendGreaterThan starts with the last item in the tree and decends to the least item greater than the pivot
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.