golang-github-tidwall-btree-dev - 0.3.0-2 main

This package provides an in-memory B-Tree implementation for Go, useful
as an ordered, mutable data structure.
.
This is a fork of the wonderful google/btree package. It's has all the same
great features and adds a few more.
.
* Descend* functions for iterating backwards.
* Iteration performance boost.
* User defined context.
.
User defined context is a great new feature that allows for entering
the same item into multiple B-trees, and each B-tree have a different
ordering formula.