ShowTable.pm, is a Perl 5 module which defines subroutines to print arrays
of data in a nicely formatted listing, using one of four possible formats:
simple table, boxed table, list style, and HTML-formatting (for
World-Wide-Web output). See the documentation on ShowTable.pm for details
on the formatting.
The program "showtable" reads data in a variety of formats from a file or
STDIN, optimally columnizes the data, and then feeds the array of data to
the ShowTable module for display. Showtable can parse its own output as
input (except for HTML). Individual or ranges of columns may be selected
for display, either by name or by index.
In other words, showtable is a data formatting program. Using the '-html'
option, showtable can accept ASCII tabular data and format it appropriately
for display through a Web-browser.
This class implements a simple state machine pattern, allowing you to
quickly build rules-based state machines in Perl. As a simple
implementation of a powerful concept, it differs slightly from an ideal
DFA model in that it does not enforce a single possible switch from one
state to another. Rather, it short circuits the evaluation of the rules
for such switches, so that the first rule to return a true value will
trigger its switch and no other switch rules will be checked. (But see the
strict attribute and parameter to new().) It differs from an NFA model in
that it offers no back-tracking. But in truth, you can use it to build a
state machine that adheres to either model--hence the more generic FSA
moniker.
Releasing a new version of software takes a lot of steps... finding
the next version number (and making sure you didn't already use that
version number before), making sure your changelog is updated, making
sure your "make dist" results in a tarball that builds, committing
changes (with updated version number), tagging, and uploading the
tarball somewhere.
Or maybe more steps. Or not some of the above. Maybe you forgot
something! And maybe you manage multiple projects, and each project
has a different release process.
This is all a pain in the ass.
You want to be hacking, not jumping through hoops.
Your contributors want to see their patches actually make it into a
release, which won't happen if you're afraid of releases.
shipit automates all the hell. It makes life beautiful.
Starting with Perl 5.10, it is possible to create a lexical version of the Perl
default variable $_. Certain Perl constructs like the given keyword
automatically use a lexical $_ rather than the global $_.
It is occasionallly useful for a sub to be able to access its caller's $_
variable regardless of whether it was lexical or not. The (_) sub prototype is
the official way to do so, however there are sometimes disadvantages to this; in
particular it can only appear as the final required argument in a prototype, and
there is no way of the sub differentiating between an explicitly passed argument
and $_.
The lexical::underscore function returns a scalar reference to either a lexical
$_ variable somewhere up the call stack (using PadWalker magic), or to the
global $_ if there was no lexical version.
Wrapping lexical::underscore in ${ ... } dereferences the scalar reference,
allowing you to access (and even assign to) it.
YADIFA is a lightweight authoritative Name Server with DNSSEC capabilities.
Developed by the passionate people behind the .eu top-level domain, YADIFA has
been built from scratch to face today?s DNS challenges, with no compromise on
security, speed and stability, to offer a better and safer Internet experience.
YADIFA has a simple configuration syntax and can handle more queries per second
while maintaining one of the lowest memory footprints in the industry. YADIFA
also has one of the fastest zone file load times ever recorded on a name
server.
YADIFA was developed on FreeBSD and a GNU/Linux. It works on OSX and will be
soon ported to other Unix flavours like OpenBSD and Solaris. A Microsoft
Windows version is also on the cards.
What if a simple mental exercise could improve your memory and
intelligence?
A recent study published in PNAS, an important scientific journal,
shows that a particular memory task called Dual N-Back actually
improves working memory (short term memory) and fluid intelligence.
This finding is important because fluid intelligence was previously
thought to be unchangeable. The game involves remembering a sequence
of spoken letters and a sequence of positions of a square at the
same time.
In addition to its ability to closely replicate the conditions of
the original study by Jaeggi et al. (2008), Brain Workshop includes
optional extended game modes such as Triple N-Back and Arithmetic
N-Back. It also includes features such as statistics tracking,
graphs and easy configurability.
exMARS combines the latest advance in corewar simulation technology, with
proactive performance optimizations.
Actually exMARS is a redcode simulator, just like exhaust and pMARS. In fact,
I have shamelessly taken sourcecode from pMARS, exhaust, some ideas from
qMars, a shot of optimizations, shook everything well, and garnished
everything with a high level interface for Ruby.
The resulting program has the following main features:
* Uses the parser from pMARS, so no previous parsing is necessary. At first
this was my main motivation for exMARS.
* Speed: 50% faster than pmars on a Pentium III, and often more than twice as
fast than pmars on a Pentium 4 (using gcc 3.3.1, and the same compiler
options).
* Rewritten the code in a more object oriented way, which allows different
Mars at the same time in the same program, it should also be thread save.
* To get Ruby interface you can install games/ruby-exmars port.
Jin is an open source, cross platform, graphical client (interface)
for chess servers. It currently supports these servers:
* The Internet Chess Club (aka ICC)
* The Free Internet Chess Server (aka FICS)
A short list of Jin's main features:
* Graphical chess board with many board patterns and piece sets
to choose from. You can also create your own
* Chat/Command console with (customizable) color-coding for
different types of chat/text
* A seek graph, showing the currently sought games in a visual manner
* Flexible game logger, which saves your finished games to your
hard disk (doesn't work in JinApplet)
* A scripter, which allows you to define automatic responses
to certain events
* A list of common actions, which can be quickly executed
at the press of a button
Tanglet is a single player word finding game based on Boggle. The
object of the game is to list as many words as you can before the
time runs out. There are several timer modes that determine how
much time you start with, and if you get extra time when you find
a word.
You can join letters horizontally, vertically, or diagonally in any
direction to make a word, so as long as the letters are next to
each other on the board. However, you can not reuse the same letter
cells in a single word. Also, each word must be at least three
letters on a normal board, and four letters on a large board.
The computer calculates a combination of five characters (each between
A and J) and you have to try to find out the combination the computer
has calculated. Your questions to the computer are also combinations of
five characters (each between A and J).
You get sets of black and/or white blocks as answers to your questions.
If you get a black block as answer it means that there is one character
in your try at the correct position (but you don't know which one it
is).
If you get a white block as answer it means that there is a character in
your guess that also occurs in the solution, but at another position
(but you don't know which one it is and at which position it would be
correct).