| Commit message (Collapse) | Author | Age | Files | Lines |
|
|
|
|
|
|
| |
Approved by: portmgr blanket
Notes:
svn path=/head/; revision=415452
|
|
|
|
|
|
|
| |
Approved by: portmgr blanket
Notes:
svn path=/head/; revision=405891
|
|
|
|
| |
Notes:
svn path=/head/; revision=363446
|
|
|
|
|
|
|
| |
Approved by: portmgr (not really, but touches unstaged ports)
Notes:
svn path=/head/; revision=363371
|
|
|
|
| |
Notes:
svn path=/head/; revision=333734
|
|
|
|
|
|
|
| |
sysutils)
Notes:
svn path=/head/; revision=327772
|
|
|
|
|
|
|
|
|
|
|
| |
- 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
|
|
|
|
|
|
|
|
|
| |
. bump PORTREVISION;
. trim Makefile headers;
. remove the indefinite article from COMMENT.
Notes:
svn path=/head/; revision=319164
|
|
|
|
| |
Notes:
svn path=/head/; revision=273235
|
|
|
|
| |
Notes:
svn path=/head/; revision=271305
|
|
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
|