commit | 0c05920fc3d98100a5e3f7fd339865a6e2aaa671 | [log] [tgz] |
---|---|---|
author | Graeme Connell <gconnell@google.com> | Wed Oct 22 08:06:32 2014 -0600 |
committer | Graeme Connell <gconnell@google.com> | Wed Oct 22 08:06:32 2014 -0600 |
tree | a10826ebefd69f74408f11b23c7d69c60b145ed2 | |
parent | 7498308728cf578f7eb9440f91619631f091af96 [diff] |
Switch from sync.Pool to a per-tree freelist. Done for a couple reasons, but the big one is that trees may have different sized 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.