| commit | e89373fe6b4a7413d7acd6da1725b83ef713e6e4 | [log] [tgz] |
|---|---|---|
| author | Graeme Connell <[email protected]> | Wed Jan 24 11:54:31 2018 -0700 |
| committer | GitHub <[email protected]> | Wed Jan 24 11:54:31 2018 -0700 |
| tree | 8bfc1da328a90f7eac38192c899c72dd7b66db3d | |
| parent | 316fb6d3f031ae8f4d457c6c5186b9e3ded70435 [diff] | |
| parent | a7570a4e67346a53cea2f7a7ed37bd86de713d61 [diff] |
Merge pull request #21 from gconnell/master Add a Clear method that clears all nodes into a freelist.
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.