commit | 7d79101e329e5a3adf994758c578dab82b90c017 | [log] [tgz] |
---|---|---|
author | Graeme Connell <gsconnell@gmail.com> | Tue May 24 09:18:35 2016 -0600 |
committer | Graeme Connell <gsconnell@gmail.com> | Tue May 24 09:18:35 2016 -0600 |
tree | b0f86a126d51b8877633294baad3b9c862699c32 | |
parent | 00edb8c3163323f673bbe3c04afd9429eb12117d [diff] | |
parent | 9cda4e30bb3bdd4f7e8ae79f795c0aeaf2b2efc3 [diff] |
Merge pull request #6 from tidwall/patch-mark-gc set removed items to nil
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.