commit | 00edb8c3163323f673bbe3c04afd9429eb12117d | [log] [tgz] |
---|---|---|
author | Graeme Connell <gconnell@google.com> | Mon Apr 18 11:03:23 2016 -0600 |
committer | Graeme Connell <gconnell@google.com> | Mon Apr 18 11:03:23 2016 -0600 |
tree | 61717608ececd073aaeec8747d0c07438878fb48 | |
parent | ffef89d565ec4071a8ccda06b9273f9f3c73597d [diff] |
Implement Min/Max to get first/last Item in BTree.
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.