https://github.com/google/btree

BTree provides a simple, ordered, in-memory data structure for Go programs.
https://github.com/google/btree

Last synced: about 2 months ago
JSON representation

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

• Host: GitHub
• URL: https://github.com/google/btree
• Owner: google
• License: apache-2.0
• Created: 2014-07-31T17:56:24.000Z (about 10 years ago)
• Default Branch: master
• Last Pushed: 2024-06-06T02:41:25.000Z (4 months ago)
• Last Synced: 2024-06-18T10:50:39.621Z (3 months ago)
• Language: Go
• Homepage:
• Size: 78.1 KB
• Stars: 3,822
• Watchers: 80
• Forks: 409
• Open Issues: 13
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

• my-awesome - google/btree - 08 star:3.9k fork:0.4k BTree provides a simple, ordered, in-memory data structure for Go programs. (Go)
• awesome - google/btree - BTree provides a simple, ordered, in-memory data structure for Go programs. (Go)
• go-awesome - google/btree - B-tree (Open source library / Data Structure)

README

        
# 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.