[no description] https://git.osdyson.ru/mirror/pkgsrc/atom?h=pkgsrc_2012Q2 2011-11-08T15:37:33Z 2011-11-08T15:37:33Z taca taca 2011-11-08T15:37:33Z urn:sha1:9a45030a386cfedd6858b248e88e30e1e18a0156 * Bump PKGREVISION. 2011-02-21T16:01:10Z taca taca 2011-02-21T16:01:10Z urn:sha1:e521e7c67481ef023ca7ec2ea9100b5567e24bfe 2010-09-10T06:15:47Z taca taca 2010-09-10T06:15:47Z urn:sha1:f7a6ab53499b151a1bc2a8e5de3ac737bae4427e * 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-14T17:48:39Z joerg joerg 2009-06-14T17:48:39Z urn:sha1:a3974bf3b6efabbf626979c76d7215661405a16e 2009-02-23T11:39:42Z wiz wiz 2009-02-23T11:39:42Z urn:sha1:230ed362cf40e9b9ff1dceacaafc0fd28f70b968 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-15T16:06:21Z taca taca 2008-08-15T16:06:21Z urn:sha1:9ade7fd1b0a8849baad47ac0973479810e65320f 2008-04-04T15:30:00Z jlam jlam 2008-04-04T15:30:00Z urn:sha1:bb91d465009f79ffc1ee660432fbd12aad691235 directly into site_ruby. 2007-04-21T10:20:05Z wiz wiz 2007-04-21T10:20:05Z urn:sha1:49feff6d167a8162dbf1e7bcd256840362060963 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.