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

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

Branch: CURRENT, Version: 0.3.0nb2, Package name: ruby19-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.


Required to run:
[lang/ruby19-base]

Master sites:

SHA1: cff54a1fdb6aa4cfb212d9ae8ed8892412b55aa5
RMD160: 9cb2739a2ef840651eef7b8e9d478fd6116fa8a0
Filesize: 28.5 KB

Version history: (Expand)

CVS history: (Expand)


   2011-11-08 16:37:35 by Takahiro Kambe | Files touched by this commit (32) | Package updated
Log message:
* Remove .require_paths from PLIST
* Bump PKGREVISION.
   2011-02-21 17:01:24 by Takahiro Kambe | Files touched by this commit (80) | Package updated
Log message:
Bump PKGREVISION due to ABI change of ruby18-base.
   2010-09-10 08:15:47 by Takahiro Kambe | Files touched by this commit (2) | Package updated
Log message:
Update devel/ruby-rbtree to 0.3.0.

* Use lang/ruby/gem.mk instead of misc/rubygems/rubygem.mk.
* Add LICENSE.
* Remove default value of GEM_BUILD.

2009-11-14  OZAWA Takuma

	* version 0.3.0 released.

2009-11-10  OZAWA Takuma

	* rbtree.c: applied patches for Ruby 1.9 by Florian Gilcher and
	Nobu Nakada. Thanks.
	http://redmine.ruby-lang.org/issues/show/2348

	* test.rb: ditto.

	* extconf.rb: ditto.

	* extconf.rb: remove options for only gcc.

	* test.rb (test_inspect): correct recursion tests.

	* rbtree.c (rbtree_to_s_recursive): should return if recursive.

	* test.rb (test_to_s): add recursion tests.
   2009-06-14 19:49:18 by Joerg Sonnenberger | Files touched by this commit (454) 
Log message:
Remove @dirrm entries from PLISTs
   2009-02-23 12:39:43 by Thomas Klausner | Files touched by this commit (2) | Package updated
Log message:
Update to 0.2.1:

2009-01-27  OZAWA Takuma

	* version 0.2.1 released.

	* README: fixed documents.

	* rbtree.c: ditto.

2009-01-23  OZAWA Takuma

	* rbtree.c (RETURN_ENUMERATOR): do nothing if rb_enumeratorize not
	defined.

	* rbtree.c (RBTREE_IN_ITERATION): removed. it has been not used.

	* rbtree.c (HAVE_RB_MARSHAL_LOAD, HAVE_RB_OBJ_INIT_COPY,
	HAVE_OBJECT_ALLOCATE, HAVE_RB_BLOCK_PROC, HAVE_RB_YIELD_VALUES):
	removed macros for Ruby 1.6.x.

	* extconf.rb (HAVE_RB_MARSHAL_LOAD, HAVE_RB_OBJ_INIT_COPY,
	HAVE_OBJECT_ALLOCATE, HAVE_RB_BLOCK_PROC, HAVE_RB_YIELD_VALUES):
	ditto.

	* rbtree.c (cmpint): removed a few codes for Ruby 1.6.x.

	* test.rb: ditto.

	* test.rb: (assert_raise): removed an alias for RubyUnit. use
	assert_raises.

	* extconf.rb: removed checking for inline keyword.

2009-01-21  OZAWA Takuma

	* extconf.rb: removed gcc options for portability. Thanks to
	Masatoshi SEKI.

2008-12-26  OZAWA Takuma

	* rbtree.c (rbtree_each, rbtree_each_pair, rbtree_each_key,
	rbtree_each_value, rbtree_reverse_each, rbtree_delete_if,
	rbtree_reject_bang, rbtree_select): Return an enumerator if no
	block is given.

2008-12-24  OZAWA Takuma

	* rbtree.c (rbtree_s_create): check and convert argument inner arrays (assocs) \ 
using #to_ary.

	* rbtree.c (rbtree_s_create): check and convert argument hash using #to_hash.

	* rbtree.c (rbtree_s_create): RBTree#[] now takes assocs as source of rbtree \ 
conversion.

	* rbtree.c (rbtree_to_hash): can't convert MultiRBTree to Hash.

	* rbtree.c (rbtree_s_create): can't convert MultiRBTree to RBTree.

	* rbtree.c (rbtree_s_create, rbtree_values_at): use long for loop counter \ 
instead of int.

2007-09-21  OZAWA Takuma

	* extconf.rb: no gcc options for mswin32.
   2008-08-15 18:06:21 by Takahiro Kambe | Files touched by this commit (1) 
Log message:
Replace HOMEPAGE to RubyForge's project page since previous page was gone.
   2008-04-04 17:30:02 by Johnny C. Lam | Files touched by this commit (98) 
Log message:
Install as a gem using the pkgsrc rubygem.mk framework instead of
directly into site_ruby.
   2007-04-21 12:20:05 by Thomas Klausner | Files touched by this commit (4) | Imported package
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.