Free 0.6 liters equals how many milliliters software for linux

List::Intersperse Perl module can intersperse / unsort / disperse a list.

SYNOPSIS

use List::Intersperse qw/intersperseq/;

@ispersed = intersperseq {substr($_[0],0,1)} qw/A1 A2 B1 B2 C1 C2/;

@ispersed = List::Intersperse::intersperse qw/A A B B B B B B C/;

intersperse and intersperseq evenly distribute elements of a list. Elements that are considered equal are spaced as far apart from each other as possible.

FUNCTIONS

intersperse LIST

This function returns a list of elements interspersed so that equivalent items are evenly distributed throughout the list.

intersperseq BLOCK LIST

intersperseq works like intersperse but it applies BLOCK to the elements of LIST to determine the equivalance key.

Gip is an IP address calculator that integrates well with the GNOME desktop environment.

Gip provides system administrators with tools for IP address based calculations. For example, an administrator who needs to find out which IP prefix length equals the IP netmask 255.255.240.0, just types in the mask and gets the prefix length presented. But many more advanced calculations can be made.

Gip can convert an address range into a list of prefix lengths. It can also split subnets using a given IP netmask or IP prefix length. Many more calculations are possible.

Search::Binary is a Perl module for generic binary search.

SYNOPSIS

use Seach::Binary;
$pos = binary_search($min, $max, $val, $read, $handle, [$size]);

binary_search implements a generic binary search algorithm returning the position of the first record whose index value is greater than or equal to $val. The search routine does not define any of the terms position, record or index value, but leaves their interpretation and implementation to the user supplied function &$read(). The only restriction is that positions must be integer scalars.

During the search the read function will be called with three arguments: the input parameters $handle and $val, and a position. If the position is not undef, the read function should read the first whole record starting at or after the position; otherwise, the read function should read the record immediately following the last record it read. The search algorithm will guarantee that the first call to the read function will not be with a position of undef. The read function needs to return a two element array consisting of the result of comparing $val with the index value of the read record and the position of the read record. The comparison value must be positive if $val is strictly greater than the index value of the read record, 0 if equal, and negative if strictly less. Furthermore, the returned position value must be greater than or equal to the position the read function was called with.

The input parameters $min and $max are positions and represents the extent of the search. Only records which begin at positions within this range (inclusive) will be searched. Moreover, $min must be the starting position of a record. If present $size is a difference between positions and determines when the algorithms switches to a sequential search. $val is an index value. The value of $handle is of no consequence to the binary search algorithm; it is merely passed as a convenience to the read function.

Unicode::Overload is a Perl source filter to implement Unicode operations.

SYNOPSIS

use charnames :full;
use Unicode::Overload (
"N{UNION}" => infix =>
sub { my %a = map{$_=>1}@{$_[0]};
my %b = map{$_=>1}@{$_[1]};
return keys(%a,$b); },
"N{SUPERSCRIPT TWO}" => postfix => sub { $_[0] ** 2 },
"N{NOT SIGN}" => prefix => sub { !$_[0] },
[ "N{LEFT FLOOR}", "N{RIGHT FLOOR}" ] => outfix =>
sub { POSIX::floor($_[0]) },
);

@union = (@a N{UNION @b); # Parentheses REQUIRED
die "Pythagoras was WRONG!" # Same here
unless sqrt((3)N{SUPERSCRIPT TWO} + (4)N{SUPERSCRIPT TWO}) == 5;
$b = N{NOT SIGN}($b); # Required here too
die "Fell through floor" # Balanced characters form their own parentheses
unless N{LEFT FLOOR}-3.2N{RIGHT FLOOR} == 4;

Allows you to declare your own Unicode operators and have them behave as prefix (like sigma or integral), postfix (like superscripted 2), infix (like union), or outfix (like the floor operator, with the L-like and J-like brackets).

To keep this document friendly to people without UTF-8 terminals, the N{} syntax for Unicode characters will be used throughout, but please note that the N{} characters can be replaced with the actual UTF-8 characters anywhere.
Also, please note that since Perl 5 doesnt support the notion of arbitrary operators, this module cheats and uses source filters to do its job. As such, all "operators" must have their arguments enclosed in parentheses. This limitation will be lifted when a better way to do this is found.

Also, note that since these arent "real" operators there is no way (at the moment) to specify precedence. All Unicode "operators" have the precedence (such as it is) of function calls, as they all get transformed into function calls inline before interpreting.

In addition, due to a weird unicode-related bug, only one character per operator is currently permitted. Despite behaving correctly elsewhere, substr() thinks that one character equals one byte inside Unicode::Overload .

Anyway, this module defines four basic types of operators. Prefix and infix should be familiar to most users of perl, as prefix operators are basically function calls without the parens. Infix operators are of course the familiar + etcetera.

The best analogy for postfix operators is probably the algebraic notation for squares. $a**2 is perls notation, ($a)N{SUPERSCRIPT TWO} is the Unicode::Overload equivalent, looking much closer to a mathematical expression, with the 2 in its proper position.

Outfix is the last operator, and a little odd. Outfix can best be thought of as user-definable brackets. One of the more common uses for this notation again comes from mathematics in the guise of the floor operator. Looking like brackets with the top bar missing, they return effectively POSIX::floor() of their contents.

Since outfix operators define their own brackets, extra parentheses are not needed on this type of operator.

A quick summary follows:

prefix

Operator goes directly before the parentheses containing its operands. Whitespace is allowed between the operator and opening parenthesis. This acts like a function call.

Sample: N{NOT SIGN}($b)

postfix

Operator goes directly after the parentheses containing its operands. Whitespace is allowed between the closing parenthesis and operator. This doesnt have a good Perl equivalent, but there are many equivalents in algebra, probably the most common being:

Sample: ($a+$b)N{SUPERSCRIPT TWO}

infix

Operator goes somewhere inside the parentheses. Whitespace is allowed between either parenthesis and the operator.

Sample: ($a N{ELEMENT OF} @list)

outfix

Operators surround their arguments and are translated into parentheses. As such, whitespace is allowed anywhere inside the operator pairs. There is no requirement that the operators be visually symmetrical, although it helps.

Sampe: $c=N{LEFT FLOOR}$a_+$bN{RIGHT FLOOR}

The requirements for parentheses will be removed as soon as I can figure out how to make these operators behave closer to perl builtins. Nesting is perfectly legal, but multiple infix operators cant coexists within one set of parentheses.

Chain Reaction (aka Critical Mass, aka Atoms) is an addictive, multi-player board game. Lee Haywoods Chain Reaction is easy to learn to play. There is a computer player (for 2 player games only).
- Players take turns to add units (blobs) of their colour to either an empty cell or a cell they already occupy.
- Once the number of blobs in a cell equals the number of neighbouring cells - 2 in a corner, 3 along an edge and 4 elsewhere - the blobs explode, adding 1 blob to each neighbour and leaving the original cell empty.
- The neigbouring cell may then have enough blobs to explode as well - making their neigbours explode, and so on - a chain reaction.
- Any blobs affected by the chain reaction change colour to that of the person making the move - this is how other players cells are taken.
- Wipe out your opponent(s) and win - eventually someone is going to win because the total number of blobs increases by 1 with each move, gradually filling the board.
Main features:
- Provides a high-quality computer player (for a single opponent).
- Allows between 2 and 6 players.
- Graphical implementation - can be played either in a window or in full-screen mode.
- Configurable for different screen resolutions, allowing massive boards to be used.
- Audio support for both sound-cards and simple beeps/bells.
- Features a grid editor.
- Automatically moves the mouse pointer back to the current players last position.
- Indicates where each player last went.
- Shows progress indicators for each player and for the whole game.
- Player names may be entered and saved.
- Players can choose their favourite colour to play with.
- Foreground and background skins may be changed.
- Saved states can be automatically loaded when the program starts.
Game options:
- Provides the ability to undo and redo all moves.
- Games in progress can be saved and resumed later.
- Locks keyboard and mouse controls individually for each player.
- Players can stick with their favourite colour when the order of play is changed.
- Sound can be turned on and off during a game (for both samples and beeps).

Java Development Environment for Emacs (JDEE) is an Emacs-based integrated development environment (IDE) for developing Java applications and applets.
Features include multiple code browsers, a JPDA-based debugger, method and field completion, template-based and procedure-based code generation, Java source code interpreter, context-sensitive help, and more.
Enhancements:
- On XEmacs, Use efc-xemacs-query-options, i.e., a GUI dialog box instead of a text dialog box, only if use-dialog-box is nonnil.
- Fixes bug in ProjectClasses to avoid duplicate entries of imports.
- Updated JDEEs Ant interface to force use of pipes to interact with external Ant process.
- Fixed regression that caused jde-help-class-member to issue a Lisp error.
- Fixed regression in jde-wiz-update-class-list command.
- Fixed regression that caused JDEbug to issue a Lisp error when launching an application.
- Thanks to Martin Schwamberger.
- Revise the following templates to conform to CheckStyle requirements:
- jde-gen-deep-clone-template
- jde-gen-to-string-method-template
- jde-gen-bean-template
- Thanks to Martin Schwamberger.
- Added the following code generation templates:
- jde-gen-exception
- Generates an exception class in the current buffer.
- jde-gen-exception-buffer
- Generates a buffer containing an exception class.
- jde-gen-hashcode-method
- Generates a hashcode method at point.
- jde-gen-equals-method
- Generates an equals method at point.
- jde-gen-tostring-method
- Generates a toString method that uses Apaches
- ToStringBuilder class.
- Thanks to Ole Arndt.
- Enhanced jde-run-option-classpath to allow you to specify that the JDEE should omit the classpath argument when running the class or application in the current buffer, regardless of the setting of jde-global-classpath.
- Fixed regression that caused the JDEE to switch projects during debugging when stepping into code that does not belong to the project being debugged.
- Updated regular expressions used by the JDEEs interface to jdb to accommodate non-English punctuation styles for numeric expressions in debugger messages, e.g.,
- 1.200 for a line number where the English would write 1,200.
- Thanks to Morten B. Isaksen.
- In previous releases, building javadoc caused all future uses of compilation mode to try to
- display the javadoc. This release fixes the problem.
- Thanks to David Evers.
- Updated the submit-problem-report command to include an XEmacs users init.el file.