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) β€” Set VALUE as target size (mandatory, bestie, you literally cannot skip this one), VALUE > 0.0
  • --bins, --vols VALUE[unit] β€” Set VALUE as 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 with CHAR. [default = none]
  • --dw, --delimit-with CHAR β€” Delimit file names (lines) with CHAR. [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 -0 and --hs options.
  • -0, --null-bins β€” Same as --bs '\0'. See also the -Z and --hs options.
  • --bs, --bins-separator CHAR β€” Separate bins (vols) with CHAR. [default = newline]
  • --version β€” Print gaffitter version 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. If VALUE is 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 Β© 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 πŸ«ΆπŸŽ€