Google Git
Sign in
fuchsia / third_party / github.com / google / btree / 1826edc4575da8898548d113b60322d97d92b6ef
commit1826edc4575da8898548d113b60322d97d92b6ef[log] [tgz]
authorJosh Baker <joshbaker77@gmail.com>Mon May 30 16:44:33 2016 -0700
committerJosh Baker <joshbaker77@gmail.com>Mon May 30 16:44:33 2016 -0700
tree60ba2ed86d154242f75aeb103c69b5a3028b9515
parent7d79101e329e5a3adf994758c578dab82b90c017 [diff]
backwards iteration

Added `DescendRange`, `DescendLessOrEqual`, `DescendGreaterThan`,
and `Descend` functions. These are modeled after the existing
`Ascend..` methods.
2 files changed
tree: 60ba2ed86d154242f75aeb103c69b5a3028b9515
  1. .travis.yml
  2. btree.go
  3. btree_mem.go
  4. btree_test.go
  5. LICENSE
  6. README.md
README.md

BTree implementation for Go

Travis CI Build Status

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.