[pkgsrc/trunk]: pkgsrc/devel/ruby-rbtree Initial import of ruby-rbtree-0.2.0:

[wiz <wiz%pkgsrc.org@localhost>]

details:   https://anonhg.NetBSD.org/pkgsrc/rev/53960fad4038
branches:  trunk
changeset: 528111:53960fad4038
user:      wiz <wiz%pkgsrc.org@localhost>
date:      Sat Apr 21 10:20:05 2007 +0000

description:
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.

diffstat:

 devel/ruby-rbtree/DESCR    |  14 ++++++++++++++
 devel/ruby-rbtree/Makefile |  16 ++++++++++++++++
 devel/ruby-rbtree/PLIST    |   2 ++
 devel/ruby-rbtree/distinfo |   5 +++++
 4 files changed, 37 insertions(+), 0 deletions(-)

diffs (53 lines):

diff -r 4a9bce9f6ff4 -r 53960fad4038 devel/ruby-rbtree/DESCR
--- /dev/null   Thu Jan 01 00:00:00 1970 +0000
+++ b/devel/ruby-rbtree/DESCR   Sat Apr 21 10:20:05 2007 +0000
@@ -0,0 +1,14 @@
+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.
diff -r 4a9bce9f6ff4 -r 53960fad4038 devel/ruby-rbtree/Makefile
--- /dev/null   Thu Jan 01 00:00:00 1970 +0000
+++ b/devel/ruby-rbtree/Makefile        Sat Apr 21 10:20:05 2007 +0000
@@ -0,0 +1,16 @@
+# $NetBSD: Makefile,v 1.1.1.1 2007/04/21 10:20:05 wiz Exp $
+#
+
+DISTNAME=      rbtree-0.2.0
+PKGNAME=       ${RUBY_PKGPREFIX}-${DISTNAME}
+CATEGORIES=    devel
+MASTER_SITES=  http://www.geocities.co.jp/SiliconValley-PaloAlto/3388/rbtree/
+
+MAINTAINER=    pkgsrc-users%NetBSD.org@localhost
+HOMEPAGE=      http://www.geocities.co.jp/SiliconValley-PaloAlto/3388/rbtree/README.html
+COMMENT=       Sorted associative collection using Red-Black Trees for Ruby
+
+USE_RUBY_EXTCONF=      yes
+
+.include "../../lang/ruby/modules.mk"
+.include "../../mk/bsd.pkg.mk"
diff -r 4a9bce9f6ff4 -r 53960fad4038 devel/ruby-rbtree/PLIST
--- /dev/null   Thu Jan 01 00:00:00 1970 +0000
+++ b/devel/ruby-rbtree/PLIST   Sat Apr 21 10:20:05 2007 +0000
@@ -0,0 +1,2 @@
+@comment $NetBSD: PLIST,v 1.1.1.1 2007/04/21 10:20:05 wiz Exp $
+${RUBY_SITEARCHLIBDIR}/rbtree.${RUBY_DLEXT}
diff -r 4a9bce9f6ff4 -r 53960fad4038 devel/ruby-rbtree/distinfo
--- /dev/null   Thu Jan 01 00:00:00 1970 +0000
+++ b/devel/ruby-rbtree/distinfo        Sat Apr 21 10:20:05 2007 +0000
@@ -0,0 +1,5 @@
+$NetBSD: distinfo,v 1.1.1.1 2007/04/21 10:20:05 wiz Exp $
+
+SHA1 (rbtree-0.2.0.tar.gz) = 25f22403caaa99e3f11ed0e9932ff127401956f7
+RMD160 (rbtree-0.2.0.tar.gz) = 6d6d1f5f0d6fb4c5baf82ce31699b53cb74b3add
+Size (rbtree-0.2.0.tar.gz) = 24383 bytes