| commit | 316fb6d3f031ae8f4d457c6c5186b9e3ded70435 | [log] [tgz] |
|---|---|---|
| author | Graeme Connell <[email protected]> | Sat Dec 17 11:35:37 2016 -0700 |
| committer | Graeme Connell <[email protected]> | Sat Dec 17 11:37:10 2016 -0700 |
| tree | 840c7adf192c0af74712aa018c756a18c2d12b48 | |
| parent | 03716cb51c13a371ed7cb086e9f13d3a8f77c5f6 [diff] |
Pedantically rename Clone's receiver. It annoyed me that Clone's receiver was 'b' but the others were all 't' :)
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.