Google Git
Sign in
fuchsia / third_party / github.com / google / btree / 07b41b253e55263d06351b777e384bb749e40134
commit07b41b253e55263d06351b777e384bb749e40134[log] [tgz]
authorGraeme Connell <gconnell@google.com>Thu Jul 31 15:46:25 2014 -0600
committerGraeme Connell <gconnell@google.com>Thu Jul 31 15:46:25 2014 -0600
treec10d9e8ab2a28599c1b75c8b8add8449983da3d6
parentf7f14e67160ebd63def5cad41c356d1cf9d52c65 [diff]
Documentation fixes, small insert optimization.

Most of this is finicky documentation/comment fixes.  However, we've also
changed slice insertion to use copy() instead of a manual for-loop approach.
That's sped up the insert benchmark by over 15%, which is pretty nice :)
2 files changed
tree: c10d9e8ab2a28599c1b75c8b8add8449983da3d6
  1. btree.go
  2. btree_mem.go
  3. btree_test.go
  4. LICENSE
  5. README.md
README.md

BTree implementation for Go

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.