| commit | 8e29150ba321eef204059de2ab494f179b6cff2c | [log] [tgz] |
|---|---|---|
| author | Graeme Connell <gsconnell@gmail.com> | Wed Jun 15 16:06:10 2022 -0600 |
| committer | Graeme Connell <gsconnell@gmail.com> | Wed Jun 15 16:06:10 2022 -0600 |
| tree | 83e28c6f8fc0c7c7e0fb3d816111534f2d4ab7db | |
| parent | 3f485355f752a153dd0deea0bb647ad64f6f3693 [diff] |
Add coverage of Has in test.
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.