pkgsrc/devel/ruby-rbtree/distinfo

$NetBSD: distinfo,v 1.5 2013/03/17 16:06:49 taca Exp $

SHA1 (rbtree-0.4.0.gem) = 820ca5a8a50623bf6a71ae9e71d50141004de107
RMD160 (rbtree-0.4.0.gem) = f7fa3ac2931d66e7217c3016582124e26590f096
Size (rbtree-0.4.0.gem) = 28160 bytes
Update ruby-rbtree to 0.4.0. === 0.4.0 * Fixed build failure with Ruby 2.0.0. * \#bound now returns an enumerator if no block is given. * \#select now returns a new MultiRBTree / RBTree. * Fixed a bug where \#reject could return nil. * \#to_s is now equivalent to \#inspect. * \#each now passes a two elements array as an argument to the given block. * Added new methods: \#default_proc=, \#flatten, \#keep_if, \#key, \#select! and \#to_h. 2013-03-17 17:06:49 +01:00			$NetBSD: distinfo,v 1.5 2013/03/17 16:06:49 taca Exp $
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. 2007-04-21 12:20:05 +02:00
Update ruby-rbtree to 0.4.0. === 0.4.0 * Fixed build failure with Ruby 2.0.0. * \#bound now returns an enumerator if no block is given. * \#select now returns a new MultiRBTree / RBTree. * Fixed a bug where \#reject could return nil. * \#to_s is now equivalent to \#inspect. * \#each now passes a two elements array as an argument to the given block. * Added new methods: \#default_proc=, \#flatten, \#keep_if, \#key, \#select! and \#to_h. 2013-03-17 17:06:49 +01:00			`SHA1 (rbtree-0.4.0.gem) = 820ca5a8a50623bf6a71ae9e71d50141004de107`
			`RMD160 (rbtree-0.4.0.gem) = f7fa3ac2931d66e7217c3016582124e26590f096`
			`Size (rbtree-0.4.0.gem) = 28160 bytes`