kpriv/pkgsrc
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity
210667 commits 166 branches 0 tags 1.5 GiB
Commit graph

12 commits

Author SHA1 Message Date
taca
0782704979 Tweak GEM_CLEANBUILD for ruby200. 2013-07-21 02:42:09 +00:00
taca
07636baa24 Change GEM_CLEANBUILD not to include the same Ruby's extension file in 
package.

Bump PKGREVISION.
 2013-07-07 15:25:59 +00:00
taca
0dfdd023b9 Update ruby-rbtree to 0.4.1. 
* Fixed a crash that could be triggered when GC happened.
 2013-06-16 16:21:54 +00:00
taca
89242f70af 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 16:06:49 +00:00
taca
6b9a0108b4 * Remove .require_paths from PLIST 
* Bump PKGREVISION.
 2011-11-08 15:37:33 +00:00
taca
33e824faca Bump PKGREVISION due to ABI change of ruby18-base. 2011-02-21 16:01:10 +00:00
taca
bd6ddb3345 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.
 2010-09-10 06:15:47 +00:00
joerg
bacea7cad5 Remove @dirrm entries from PLISTs 2009-06-14 17:48:39 +00:00
wiz
d4d8806dc8 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.
 2009-02-23 11:39:42 +00:00
taca
06e6b336fb Replace HOMEPAGE to RubyForge's project page since previous page was gone. 2008-08-15 16:06:21 +00:00
jlam
49044b1ec2 Install as a gem using the pkgsrc rubygem.mk framework instead of 
directly into site_ruby.
 2008-04-04 15:30:00 +00:00
wiz
a741d59054 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 10:20:05 +00:00