btree

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

APACHE-2.0 License

Stars

3.9K

Committers

Ecosystems: Go

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.

Package Rankings

Top 0.53% on Proxy.golang.org

慕课 liuyubobobo「玩转数据结构」课程的 Go 语言实现版本

Loser Tree data structure, for fast k-way merge

This is technically a B+Tree, but the btree name is easier on the tongoue :). Completely improvis...

Data Structures and Algorithms implementation in Go

A collection of generic data structures written in Go.

Implementation of common Data Structures and Algorithms with Go

B-tree implementation for Go

[WIP] Implementation of HAT-trie in Go

Surprisingly space efficient trie in Golang(11 bits/key; 100 ns/get).

A collection of useful, performant, and threadsafe Go datastructures.