kpriv/pkgsrc
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity
pkgsrc/devel/ruby-rbtree/Makefile

16 lines
387 B
Makefile
Raw Normal View History

Bump PKGREVISION due to ABI change of ruby18-base.
2011-02-21 17:01:10 +01:00
# $NetBSD: Makefile,v 1.6 2011/02/21 16:01:15 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 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 08:15:47 +02:00
DISTNAME= rbtree-0.3.0
Bump PKGREVISION due to ABI change of ruby18-base.
2011-02-21 17:01:10 +01:00
PKGREVISION= 1
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
CATEGORIES= devel
MAINTAINER= pkgsrc-users@NetBSD.org
Replace HOMEPAGE to RubyForge's project page since previous page was gone.
2008-08-15 18:06:21 +02:00
HOMEPAGE= http://rubyforge.org/projects/rbtree/
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
COMMENT= Sorted associative collection using Red-Black Trees for Ruby
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 08:15:47 +02:00
LICENSE= mit
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
Install as a gem using the pkgsrc rubygem.mk framework instead of directly into site_ruby.
2008-04-04 17:30:00 +02:00
GEM_CLEANBUILD= Makefile *.o mkmf.log
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 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 08:15:47 +02:00
.include "../../lang/ruby/gem.mk"
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
.include "../../mk/bsd.pkg.mk"
Reference in a new issue Copy permalink