aboutsummaryrefslogtreecommitdiff
path: root/sysutils/gaffitter
Commit message (Collapse)AuthorAgeFilesLines
* Remove # $FreeBSD$ from Makefiles.Mathieu Arnold2021-04-061-1/+0
|
* - No need to specify master site subdirectory when it's the same as defaultDmitry Marakasov2016-05-181-1/+2
| | | | | | | Approved by: portmgr blanket Notes: svn path=/head/; revision=415452
* Convert LICENSE= "GPLxx # or later" to "GPLxx+"Dmitry Marakasov2016-01-121-1/+1
| | | | | | | Approved by: portmgr blanket Notes: svn path=/head/; revision=405891
* UnbreakAntoine Brodin2014-07-301-1/+1
| | | | Notes: svn path=/head/; revision=363446
* Convert a bunch of USE_BZIP2 to USES=tar:bzip2Adam Weinberger2014-07-291-2/+1
| | | | | | | Approved by: portmgr (not really, but touches unstaged ports) Notes: svn path=/head/; revision=363371
* Support STAGEDIR.Vanilla I. Shu2013-11-141-5/+4
| | | | Notes: svn path=/head/; revision=333734
* Add NO_STAGE all over the place in preparation for the staging support (cat: ↵Baptiste Daroussin2013-09-201-0/+1
| | | | | | | sysutils) Notes: svn path=/head/; revision=327772
* - Fix parallel builds, by fixing makefile and USES'ing gmakeAlexey Dokuchaev2013-07-292-20/+15
| | | | | | | | | | | - Always install manual pages like we normally do - Cleanup Makefile header and COMMENT line while here - Synchronize port description text with upstream Reported by: pointyhat-west Notes: svn path=/head/; revision=323872
* . add LICENSE=GPLv3;Boris Samorodov2013-05-271-7/+5
| | | | | | | | | . bump PORTREVISION; . trim Makefile headers; . remove the indefinite article from COMMENT. Notes: svn path=/head/; revision=319164
* By Maintainer's request, toss these ports back into the poolDoug Barton2011-04-271-1/+1
| | | | Notes: svn path=/head/; revision=273235
* - Get Rid MD5 supportMartin Wilke2011-03-191-1/+0
| | | | Notes: svn path=/head/; revision=271305
* Genetic Algorithm File Fitter, GAFFitter for short, is a tool basedMartin Wilke2010-03-204-0/+239
on a genetic algorithm (GA) that tries to fit a collection of items into as few as possible volumes of a specific size. For example, the items might be files/directories and the volumes might be CDs or DVDs. The task of arranging items in such manner that the number of required bins is minimized is called Bin Packing, a NP-hard combinatorial problem for which no deterministic polynomial-time algorithm is known. Using heuristics, such as GAs, it is usually possible to approximate -- and often reach -- the best solution for the problem within a reasonable time. WWW: http://gaffitter.sourceforge.net PR: ports/144725 Submitted by: Charlie Kester <corky1951@comcast.net> Notes: svn path=/head/; revision=251311
generated by cgit v1.2.3 (git 2.25.1) at 2024-09-22 03:05:39 +0000