JobRunner is a tool designed to run a job (i.e., to execute a commandline or script) which does not require user interaction, and to store the program's output (standard error and standard out) in an easy-to-read log file. It is able to save a configuration file of the job to be run, which can be used by JobRunner_Caller as a lightweight queueing system. See the Primer included in the archive for extra details on usage examples.
se is a screen-oriented version of the classic UNIX text editor ed. The editor implements many of the commands of ed, but instead of being line-oriented, se is screen-oriented. The command syntax is very familiar to users who already know ed. If you get stuck, there is a built-in help system that describes many of the available commands. Many configurable options can be loaded from a .serc file. se can be run interactively or in a script via the included scriptse utility. The editor is portable across many platforms, supporting major Linux and BSD distributions as well as other systems like GNU, Minix, Haiku, OpenSolaris, and Cygwin.
bash argsparse is a high-level argument parsing library for bash. Its purpose is to replace the option parsing and usage describing functions commonly rewritten in all scripts. Its features include automatic help message generation, user input checking (type checking, enumerations, etc.), and option properties (mandatory options, option aliases, options excluding each others, etc.). It is implemented for bash version 4. Prior versions of bash will fail at interpreting the code.
Changing directories in bash can be tedious if you have long names or nested paths. Creating aliases or adding to the CDPATH can help, but can be improved on. Bashcd adds 6 new commands to make changing directories a bit easier. This commands use find, the locate database, the mdfind database, or other contextual information to make it easier to change to other directories.
xlife is a laboratory for experimenting with cellular automata. It supports loadable rulesets and palettes, different topologies, and up to 256-state cellular automata. It has rules and patterns for Life, Brian's Brain, Perrier's Loops, Langton's Ants and Loops, Wireworld, E.F. Codd's 1975 UCC automaton, some Prisoner's Dilemma games, and many others. It is very fast for step-by-step mode, bounded grid, and chaotic patterns. It has several unique features: a historical mode, a pseudocolor mode, and n-state statistics. It has been developed since 1989. The modern version of Xlife began its history in 2011.
phalanx computes a digest of many buffers simultaneously, and produces a combined hash of them all. It is an initiative to provide a fast, simple, and portable alternative method to compute a checksum in a parallel fashion. It has options for I/O buffer size, hash width, number of threads, and more. It can be run single-threadedly for performance comparisons. It can check files against previously-saved sums, like "MD5sum" does. It also has a "demo" mode, to ascertain accurate operation. It is intended to be useful on large files and multicore/multiprocessor/multithreaded environments.