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

23 lines
444 B
Makefile
Raw Normal View History

Bump ruby gem ext ports after change to WANTLIB in ruby.port.mk
2014-01-15 02:13:57 +00:00
# $OpenBSD: Makefile,v 1.10 2014/01/15 02:13:58 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 18:09:01 +00:00
COMMENT = simple subset sum problem solver for ruby
DISTNAME = subset_sum-1.0.1
Bump ruby gem ext ports after change to WANTLIB in ruby.port.mk
2014-01-15 02:13:57 +00:00
REVISION = 6
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 18:09:01 +00:00
CATEGORIES = devel
HOMEPAGE= http://subset-sum.rubyforge.org/
MAINTAINER = Jeremy Evans <jeremy@openbsd.org>
# MIT License
PERMIT_PACKAGE_CDROM = Yes
MODULES = lang/ruby
CONFIGURE_STYLE = ruby gem ext
PERMIT_* / REGRESS->TEST sweep
2013-03-11 10:50:00 +00:00
MODRUBY_TEST = rspec
MODRUBY_TEST_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 18:09:01 +00:00
.include <bsd.port.mk>
Reference in New Issue Copy Permalink