SecBSD's official ports repository

devel/ruby-subset_sum/Makefile

@@ -0,0 +1,22 @@
+COMMENT =	simple subset sum problem solver for ruby
+
+DISTNAME =	subset_sum-1.0.2
+REVISION =	0
+CATEGORIES =	devel
+
+HOMEPAGE=	http://ruby-subsetsum.jeremyevans.net/
+
+MAINTAINER =	Jeremy Evans <jeremy@openbsd.org>
+
+# MIT License
+PERMIT_PACKAGE =	Yes
+
+MODULES =	lang/ruby
+
+CONFIGURE_STYLE = ruby gem ext
+MODRUBY_TEST = ruby
+MODRUBY_TEST_TARGET = spec/subset_sum_spec.rb
+
+TEST_DEPENDS =	${FULLPKGNAME}:${BUILD_PKGPATH}
+
+.include <bsd.port.mk>

devel/ruby-subset_sum/distinfo

@@ -0,0 +1,2 @@
+SHA256 (subset_sum-1.0.2.gem) = vWXzj5jxcrHKKRPhdhRF+UWzbhs1wKzhXeHP+eG1BAU=
+SIZE (subset_sum-1.0.2.gem) = 9728

devel/ruby-subset_sum/pkg/DESCR

@@ -0,0 +1,11 @@
+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.

devel/ruby-subset_sum/pkg/PLIST

@@ -0,0 +1,11 @@
+${GEM_LIB}/cache/${DISTNAME}.gem
+${GEM_LIB}/gems/${DISTNAME}/
+${GEM_LIB}/gems/${DISTNAME}/LICENSE
+${GEM_LIB}/gems/${DISTNAME}/Makefile
+${GEM_LIB}/gems/${DISTNAME}/extconf.rb
+${GEM_LIB}/gems/${DISTNAME}/spec/
+${GEM_LIB}/gems/${DISTNAME}/spec/subset_sum_spec.rb
+${GEM_LIB}/gems/${DISTNAME}/subset_sum.c
+${GEM_LIB}/gems/${DISTNAME}/subset_sum.rb
+${GEM_LIB}/gems/${DISTNAME}/subset_sum.so
+${GEM_LIB}/specifications/${DISTNAME}.gemspec