commit | f06e229e679911bb31a04e07ac891115822e37c3 | [log] [tgz] |
---|---|---|
author | Graeme Connell <gsconnell@gmail.com> | Wed Mar 30 09:58:14 2016 -0700 |
committer | Graeme Connell <gsconnell@gmail.com> | Wed Mar 30 09:58:14 2016 -0700 |
tree | f5669a1203483881eb30d89d5991f3cbcedc6641 | |
parent | cc6329d4279e3f025a53a83c397d2339b5705c45 [diff] | |
parent | 189ebcb89dea6f3ea68fd30f452a9065e5bd4586 [diff] |
Merge pull request #3 from jonboulle/patch-1 Fix minor typo in README
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.