./devel/ruby-rbtree, Sorted associative collection using Red-Black Trees for Ruby

[ CVSweb ] [ Homepage ] [ RSS ] [ Required by ] [ Add to tracker ]

Branch: pkgsrc-2012Q2, Version: 0.3.0nb2, Package name: ruby193-rbtree-0.3.0nb2, Maintainer: pkgsrc-users

RBTree is a sorted associative collection using Red-Black Tree as
the internal data structure. The elements of RBTree are ordered
and the interface is the almost same as Hash, so simply you can
consider RBTree sorted Hash.

Red-Black Tree is a kind of binary tree that automatically balances
by itself when a node is inserted or deleted. Thus the complexity
for insert, search and delete is O(log N) in expected and worst
case. On the other hand the complexity of Hash is O(1). Because
Hash is unordered the data structure is more effective than Red-Black
Tree as an associative collection.

The interface of RBTree is the almost same as Hash although there
are some limitations.

Master sites:

SHA1: cff54a1fdb6aa4cfb212d9ae8ed8892412b55aa5
RMD160: 9cb2739a2ef840651eef7b8e9d478fd6116fa8a0
Filesize: 28.5 KB

Version history: (Expand)