commit | 03716cb51c13a371ed7cb086e9f13d3a8f77c5f6 | [log] [tgz] |
---|---|---|
author | Graeme Connell <gconnell@google.com> | Thu Dec 15 17:13:04 2016 -0700 |
committer | Graeme Connell <gconnell@google.com> | Thu Dec 15 17:13:04 2016 -0700 |
tree | dc0efe9610c8f235f178cacb29b847c3e6715cf2 | |
parent | 0c3044bc8bada22db67b93f5760fe3f05d6a5c25 [diff] |
Update clone docs to disuade concurrent Clone.
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.