Ports Search

Best program ever. This program is a wrapper, it will exec whatever arguments it's given and if the program returns a non-zero exit status or terminates abnormally it will prompt the user to run the program again. It's best used when debugging a large build like so: make CC="replay cc" Then if cc bombs you don't have to restart make, you can just fix your source file and resume your build.

Hashie is available as a RubyGem which extend Hashes and make them more useful. - Hashie::Mash: gives simple pseudo-object functionality that can be built from hashes and easily extended - Hashie::Dash: has a discrete set of defined properties and only those properties may be set on the hash. - Hashie::Trash: a Dash that allows you to translate keys on initialization. - Hashie::Clash: allows you to easily construct complex hashes using method notation chaining.

Hashie is available as a RubyGem which extend Hashes and make them more useful. * Hashie::Mash: gives simple pseudo-object functionality that can be built from hashes and easily extended * Hashie::Dash: has a discrete set of defined properties and only those properties may be set on the hash. * Hashie::Trash: a Dash that allows you to translate keys on initialization. * Hashie::Clash: allows you to easily construct complex hashes using method notation chaining.

This Perl script is designed to load a number of directories into Subversion. This is useful if you have a number of .zip's or tar.{Z,gz,bz2}'s for a particular package and want to load them into Subversion. This script is part of the Subversion distribution and it is assumed that it can be used under the same license terms as Subversion itself.

Dungeon Crawl Stone Soup is a fun, free rogue-like game of exploration and treasure-hunting in dungeons filled with dangerous and unfriendly monsters in a quest for the mystifyingly fabulous Orb of Zot. Dungeon Crawl Stone Soup is a variant of Linley's Dungeon Crawl that's openly developed and invites participation from the Crawl community. This port comes with two interfaces: games/stonesoup - the traditional tty interfaced games/stonesoup-sdl - the fancy SDL interface

This module implements a simple game-tree system for the computer to play against the user in a game of Alak. You can just play the game for fun; or you can use this module as a starting point for understanding game trees (and implementing smarter strategy -- the module's current logic is fairly simple-minded), particularly after reading my Perl Journal #18 article on trees, which discusses this module's implementation of game trees as an example of general tree-shaped data structures.

[ edited excerpt from www site ] GIMP plugin that creates a white (or black) border around an image that merges in with the image so that on a larger white (or black) background, the image appears to have a ragged border. This is similar to the GIMP's Fuzzy Border, but it adapts its jaggedness to the image. (Also unlike Fuzzy Border, it is deterministic, it does not depend on random number seeds.) The plugin can be found under "Filters > theilr > jagged Border"

Poppy is a small perl script that allows you to perform simple tasks on a POP3 or IMAP server. It is of most use in a "limited resources environment" whether thats low disk space, slow internet connection, or no graphical environment. Poppy will individually show the mail headers along with the message's size of each message on the mail server and then allow you to read, delete, reply, or perform other tasks on that message.

smtpmail is a little console-based tool for users who have no local mailserver on her machine. it enables these users to send their mail over a remote smtp server. Features * Use of an remote smtp server * Use of a user-defined sender address * SMPT auth (type login) * You can define unlimited recivers for the mail, the * carbon copy and the blind carbon copy * You can add an unlimited number of attachments to the * mail

Set::Partition takes a list or hash of elements and a list numbers that represent the sizes of the partitions into which the list of elements should be arranged. The resulting object can then be used as an iterator which returns a reference to an array of lists, that represents the original list arranged according to the given partitioning. All possible arrangements are returned, and the object returns undef when the entire combination space has been exhausted.