From 3655dbfcebacb6ec3a714bb9be7dd74e5ae27549 Mon Sep 17 00:00:00 2001 From: wiz Date: Sat, 21 Apr 2007 10:20:05 +0000 Subject: 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. --- 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(+) create mode 100644 devel/ruby-rbtree/DESCR create mode 100644 devel/ruby-rbtree/Makefile create mode 100644 devel/ruby-rbtree/PLIST create mode 100644 devel/ruby-rbtree/distinfo diff --git a/devel/ruby-rbtree/DESCR b/devel/ruby-rbtree/DESCR new file mode 100644 index 00000000000..a9ce6762e0a --- /dev/null +++ b/devel/ruby-rbtree/DESCR @@ -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 --git a/devel/ruby-rbtree/Makefile b/devel/ruby-rbtree/Makefile new file mode 100644 index 00000000000..d1a668a87d7 --- /dev/null +++ b/devel/ruby-rbtree/Makefile @@ -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 +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 --git a/devel/ruby-rbtree/PLIST b/devel/ruby-rbtree/PLIST new file mode 100644 index 00000000000..7cff7466922 --- /dev/null +++ b/devel/ruby-rbtree/PLIST @@ -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 --git a/devel/ruby-rbtree/distinfo b/devel/ruby-rbtree/distinfo new file mode 100644 index 00000000000..d6a7adbf216 --- /dev/null +++ b/devel/ruby-rbtree/distinfo @@ -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 -- cgit v1.2.3