binpacker

binpacker solves the classic binpacking problem for a bunch of files that you want do distribute into bins of a certain size. A bin could be e.g. a CD with a size of 650MBytes. So you would use 650M as bin size.
binpacker uses the STL's red/black tree implementation of the multiset template class and should therefore offer an overall performance of O(n*log(n)).

Download

Stable Version

Current

binpacker 1.0.2

Archive

currently nothing

Development Version

currently nothing

Runs on

At least Linux

Requires

C++ compiler with STL

Distribution

How to untar the archive

History

1.0.2 Illegal binsizes are now rejected (e.g. invalid numbers or 0). Directories are now ignored. 1.0.1 First semi-public release

Installation

Included in the binpacker archive is the C++ source code and a minimalistic Makefile. Building was tested on Fedora Core 2 so far. Just type make to build, then try ./binpacker to get the usage.