sorted associative collection
An RBTree is a sorted associative collection that is implemented with a
Red-Black Tree. It maps keys to values like a Hash, but maintains its
elements in ascending key order. The interface is the almost identical
to that of Hash.

Maintainer: Kurt Mosiejczuk <kmos@openbsd.org>

WWW: https://github.com/mame/rbtree
