GAFFITTER(1)
π gaffitter β file subsets extractor based on genetic algorithms π§
okay so bestie, buckle up, because gaffitter is lowkey a genius little program and you're gonna be obsessed π
πΈ NAME
gaffitter β file subsets extractor based on genetic algorithms β¨
π SYNOPSIS
gaffitter -t|--target value[unit] [OPTION]... FILE...
gaffitter - -t|--target value[unit] [OPTION]... [FILE]...
π DESCRIPTION
gaffitter (Genetic Algorithm File Fitter) is a command-line software written in C++ that extracts --via genetic algorithm-- subsets of an input list of files/directories that best fit the given volume size (target), such as CD, DVD and others. π¦
So like, you hand it a pile of files, you tell it "this all needs to fit in X amount of space", and the genetic algorithm does its main character thing and figures out which subset fits best. periodt.
If gaffitter is executed using the second option listed above (the one with the lone -), the information about files is fetched from stdin. π
The unit suffixes 'k', 'm', 'g' or 't' can be used, where: k = KB/KiB, m = MB/MiB, g = GB/GiB and t = TB/TiB. Default: bytes. no cap π―
β¨ OPTIONS β¨
π General options
-t,--target VALUE[unit](float) β SetVALUEas target size (mandatory, bestie, you literally cannot skip this one),VALUE > 0.0--bins,--vols VALUE[unit]β SetVALUEas the maximum number of bins (volumes). [default ="unlimited"]--siβ Use powers of 1000 (not 1024) for target, min, max and output sizes.--min,--min-size VALUE[unit]β Minimum file size. [default = none]--max,--max-size VALUE[unit]β Maximum file size. [default = none]-B,--block-size VALUEβ The smallest amount of bytes a file can occupy. [default =1]--ss,--show-sizeβ Print the size of each file. π--sb,--show-bytesβ Also print the sizes in bytes.--hi,--hide-itemsβ Don't print selected files. π--hs,--hide-summaryβ Hide summary line containing sum, difference and number of selected files.-s,--sort-by-sizeβ Sort the output by size, not by name.-n,--no-caseβ Use case-insensitive sorting.-r,--sort-reverseβ Sort the output in reverse order.--ew,--enclose-with CHARβ Enclose file names withCHAR. [default = none]--dw,--delimit-with CHARβ Delimit file names (lines) withCHAR. [default = newline]-z,--null-dataβ Assume NULL ( ) as the delimiter of input files via stdin (pipe).-Z,--nullβ Same as--dw '\0'. See also the-0and--hsoptions.-0,--null-binsβ Same as--bs '\0'. See also the-Zand--hsoptions.--bs,--bins-separator CHARβ Separate bins (vols) withCHAR. [default = newline]--versionβ Printgaffitterversion and exit.-v,--verboseβ Verbose. π£οΈ-h,--helpβ Print help and exit. π«Ά
π Direct Input options
--di,--direct-inputβ Switch to direct input mode, i.e., read directly"size identifier"pairs instead of file names.--di-b,--di-bytesβ Assume input sizes as bytes.--di-k,--di-kbβ Assume input sizes as kibi bytes (KiB). KB if--di-si.--di-m,--di-mbβ Assume input sizes as mebi bytes (MiB). MB if--di-si.--di-g,--di-gbβ Assume input sizes as gibi bytes (GiB). GB if--di-si.--di-t,--di-tbβ Assume input sizes as tebi bytes (TiB). TB if--di-si.--di-siβ Use powers of 1000 (not 1024) for input sizes.
𧬠Genetic Algorithm options
--ga-s,--ga-seed VALUE(integer) β GA initialization seed,VALUE >= 0. Zero means random. [default =1]--ga-rs,--ga-random-seedβ Use rendom GA seed (same as--ga-seed 0).--ga-ng,--ga-num-generations VALUE(integer) β Maximum number of generations,VALUE > 0. [default = auto]--ga-ps,--ga-pop-size VALUE(integer) β Number of individuals,VALUE > tournament_size. [default = auto]--ga-cp,--ga-cross-prob VALUE(float) β Crossover probability,0.0 <= VALUE <= 1.0. [default =0.95]--ga-mp,--ga-mutation-prob VALUE(float) β Mutation probability (per gene),0.0 <= VALUE <= 1.0. [default = auto]--ga-sp,--ga-sel-pressure VALUE(integer) β Selection pressure (tournament size),2 <= VALUE < pop_size. [default =2]--ga-theo,--ga-theoretical [VALUE](integer) β Stop if the theoretical minimum number of bins is reached. IfVALUEis given, it is assumed to be the theoretical minimum number of bins.
π₯ Other search methods
--ap,--approximateβ Approximate the solution using Best First search (non-optimal but very fast). β‘--sp,--splitβ Just split the input when target size is reached (preserves original order while splitting).
π AUTHOR
Written by Douglas A. Augusto <daaugusto@gmail.com>. This manpage has been written by Nacho Barrientos Arias <chipi@criptonita.com> for the Debian GNU/Linux system (but may be used by others). icons only π
π BUGS
Report bugs to Douglas A. Augusto <daaugusto@gmail.com>. (found a bug? don't be shy, tell him fr fr π)
β COPYRIGHT
Copyright Β© 2005-2009, Douglas A. Augusto <daaugusto@gmail.com> - All Rights Reserved. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, Inc.
π SEE ALSO
http://gaffitter.sourceforge.net/
and that's the whole vibe check, bestie β this page is for gaffitter version 0.6.0, dated September 24, 2009 (yes she's an elder but she still ate π
β¨). go fit some files, you got this π«Άπ
π¦ where this page comes from
- debian bookworm: gaffitter 0.6.0-3
- debian trixie: gaffitter 0.6.0-4
- ubuntu jammy: gaffitter 0.6.0-3
- ubuntu noble: gaffitter 0.6.0-3
- ubuntu questing: gaffitter 0.6.0-4
- ubuntu resolute: gaffitter 0.6.0-5
- ubuntu stonking: gaffitter 0.6.0-5
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash on : a language model's rewrite of the original, under its terms