Subject: CVS commit: pkgsrc/devel/ruby-rbtree
To: None <pkgsrc-changes@NetBSD.org>
From: Thomas Klausner <wiz@netbsd.org>
List: pkgsrc-changes
Date: 04/21/2007 10:20:05
Module Name:	pkgsrc
Committed By:	wiz
Date:		Sat Apr 21 10:20:05 UTC 2007

Update of /cvsroot/pkgsrc/devel/ruby-rbtree
In directory ivanova.netbsd.org:/tmp/cvs-serv18714

Log Message:
Initial import of ruby-rbtree-0.2.0:

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.


Vendor Tag:	TNF
Release Tags:	pkgsrc-20070421
		
N pkgsrc/devel/ruby-rbtree/Makefile
N pkgsrc/devel/ruby-rbtree/PLIST
N pkgsrc/devel/ruby-rbtree/distinfo
N pkgsrc/devel/ruby-rbtree/DESCR

No conflicts created by this import