BTree implementation for Go

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.

Name	Name	Last commit message	Last commit date
Latest commit zhangchuanqing5658 and gconnell fix: remove item may changed clone btree; (i+1) children has new cow,… Aug 21, 2024 aeba20f · Aug 21, 2024 History 51 Commits
.github/workflows	.github/workflows	ci: use github actions matrix	Jun 7, 2022
LICENSE	LICENSE	Initial commit.	Jul 31, 2014
README.md	README.md	Remove travis badge	Aug 30, 2021
btree.go	btree.go	fix: remove item may changed clone btree; (i+1) children has new cow,…	Aug 21, 2024
btree_generic.go	btree_generic.go	fix: add Has method for a `BTreeG[Item]`	Jun 15, 2022
btree_generic_test.go	btree_generic_test.go	Create a generic BTreeG for Go 1.18 and beyond.	Jun 4, 2022
btree_mem.go	btree_mem.go	Fix btree import in btree_mem, and update comment.	Aug 4, 2014
btree_test.go	btree_test.go	Add coverage of Has in test.	Jun 15, 2022
go.mod	go.mod	Create a generic BTreeG for Go 1.18 and beyond.	Jun 4, 2022

Provide feedback