FFFF GitHub - google/btree: BTree provides a simple, ordered, in-memory data structure for Go programs. · GitHub

This repository was archived by the owner on Oct 24, 2025. It is now read-only.

Repository navigation

btree

Public archive

About

BTree provides a simple, ordered, in-memory data structure for Go programs.

Apache-2.0 license

Code of conduct

Security policy

Custom properties

4.2k stars

1 watching

Report repository

Name		Name	Last commit message	Last commit date
.github/workflows		.github/workflows
LICENSE		LICENSE
README.md		README.md
btree.go		btree.go
btree_generic.go		btree_generic.go
btree_generic_test.go		btree_generic_test.go
btree_mem.go		btree_mem.go
btree_test.go		btree_test.go
go.mod		go.mod

Repository files navigation

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.

See http://godoc.org/github.com/google/btree for documentation.

About

BTree provides a simple, ordered, in-memory data structure for Go programs.

Apache-2.0 license

Code of conduct

Security policy

Custom properties

4.2k stars

1 watching

Report repository

Contributors

Languages

0