# 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.
# Functions
New creates a new B-Tree with the given degree.
NewFreeList creates a new free list.
NewWithFreeList creates a new B-Tree that uses the given node free list.
# Constants
No description provided by the author
# Interfaces
Item represents a single object in the tree.
# Type aliases
Int implements the Item interface for integers.
ItemIterator allows callers of Ascend* to iterate in-order over portions of the tree.