commit | 3f485355f752a153dd0deea0bb647ad64f6f3693 | [log] [tgz] |
---|---|---|
author | Julien Robert <julien@rbrt.fr> | Tue Jun 07 16:38:48 2022 +0200 |
committer | Graeme Connell <gsconnell@gmail.com> | Wed Jun 15 16:04:20 2022 -0600 |
tree | 913102e7eea1b6ff28bf700f3a3a2308459d681c | |
parent | e5eabf37c46f7b065f0b07afb31ddc9a9da2d1c3 [diff] |
fix: add Has method for a `BTreeG[Item]`
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.