commit | 267b577ec35427c678a006bea2f534c88af5c362 | [log] [tgz] |
---|---|---|
author | Graeme Connell <gconnell@google.com> | Mon Oct 20 17:47:47 2014 -0600 |
committer | Graeme Connell <gconnell@google.com> | Mon Oct 20 17:47:47 2014 -0600 |
tree | cf800bef3231e41654b3a27b9b62012605a944b4 | |
parent | 443ef454aa6160770f706bd77a72e15c8bac9427 [diff] |
Use a sync.Pool for btree nodes.
This package provides an in-memory B-Tree implementation for Go, useful as a 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.