cpet/openbsd-ports
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
470cfaa33f
openbsd-ports/devel/ruby-subset_sum/Makefile

26 lines
530 B
Makefile
Raw Normal View History

Bump revisions for ruby gem/extconf ports after the switch to ruby 1.9 by default, since the ruby 1.8 version now has a ruby18 explicit FLAVOR.
2012-09-23 12:57:32 -04:00
# $OpenBSD: Makefile,v 1.5 2012/09/23 16:57:34 jeremy Exp $
Import ruby-subset_sum 1.0.1 This module provides both a C and pure ruby simple subset sum problem solver. The subset sum problem is, given a set of numbers, can the sum of any subset of those numbers equal a given number. This problem is NP-complete. Both the C and pure ruby versions implement a fairly simple meet-in-the-middle algorithm. The C version uses an AVL tree to store the data, while the pure ruby version uses a ruby hash. For the C version to be used, the sum of the positive numbers and the sum of the negative numbers in the set, as well as the wanted number, must all be Fixnums. Additionally, max_seconds should be nil or a Fixnum.
2010-12-20 13:09:01 -05:00
COMMENT = simple subset sum problem solver for ruby
DISTNAME = subset_sum-1.0.1
Bump revisions for ruby gem/extconf ports after the switch to ruby 1.9 by default, since the ruby 1.8 version now has a ruby18 explicit FLAVOR.
2012-09-23 12:57:32 -04:00
REVISION = 2
Import ruby-subset_sum 1.0.1 This module provides both a C and pure ruby simple subset sum problem solver. The subset sum problem is, given a set of numbers, can the sum of any subset of those numbers equal a given number. This problem is NP-complete. Both the C and pure ruby versions implement a fairly simple meet-in-the-middle algorithm. The C version uses an AVL tree to store the data, while the pure ruby version uses a ruby hash. For the C version to be used, the sum of the positive numbers and the sum of the negative numbers in the set, as well as the wanted number, must all be Fixnums. Additionally, max_seconds should be nil or a Fixnum.
2010-12-20 13:09:01 -05:00
CATEGORIES = devel
HOMEPAGE= http://subset-sum.rubyforge.org/
MAINTAINER = Jeremy Evans <jeremy@openbsd.org>
# MIT License
PERMIT_PACKAGE_CDROM = Yes
PERMIT_PACKAGE_FTP = Yes
PERMIT_DISTFILES_CDROM = Yes
PERMIT_DISTFILES_FTP = Yes
MODULES = lang/ruby
CONFIGURE_STYLE = ruby gem ext
MODRUBY_REGRESS = rspec
Update ruby ports to deal with the regress changes to ruby.port.mk. Start using MODRUBY_REGRESS with ruby, rspec2, and testrb entries. Switch away from manual do_regress targets where possible. Add some patches to make regress tests run for some ports.
2011-11-17 11:08:00 -05:00
MODRUBY_REGRESS_TARGET = spec/*_spec.rb
Import ruby-subset_sum 1.0.1 This module provides both a C and pure ruby simple subset sum problem solver. The subset sum problem is, given a set of numbers, can the sum of any subset of those numbers equal a given number. This problem is NP-complete. Both the C and pure ruby versions implement a fairly simple meet-in-the-middle algorithm. The C version uses an AVL tree to store the data, while the pure ruby version uses a ruby hash. For the C version to be used, the sum of the positive numbers and the sum of the negative numbers in the set, as well as the wanted number, must all be Fixnums. Additionally, max_seconds should be nil or a Fixnum.
2010-12-20 13:09:01 -05:00
.include <bsd.port.mk>
Reference in New Issue Copy Permalink