commit | ffef89d565ec4071a8ccda06b9273f9f3c73597d | [log] [tgz] |
---|---|---|
author | Graeme Connell <gsconnell@gmail.com> | Thu Apr 14 22:37:56 2016 -0600 |
committer | Graeme Connell <gsconnell@gmail.com> | Thu Apr 14 22:37:56 2016 -0600 |
tree | 055593a89535b2ca27733a25cdb63bd747bee386 | |
parent | f06e229e679911bb31a04e07ac891115822e37c3 [diff] | |
parent | e17093fc139b98e54111fcf6746825959d0ccdfe [diff] |
Merge pull request #5 from keep94/freelist Allow for common free lists.
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.