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

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

Branch: pkgsrc-2008Q2, Version: 0.2.0nb1, Package name: ruby18-rbtree-0.2.0nb1, 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.


Required to run:
[misc/rubygems] [lang/ruby18-base]

Required to build:
[misc/rubygems]

Master sites:

SHA1: 261e599253ccb5cb385eced3316f39edb3f1ad6b
RMD160: bed3036ff854c1da0dd7ee5dd1cbcdee424c5aec
Filesize: 27.5 KB

Version history: (Expand)