Free hello world software for linux

WWW::Mechanize::Plugin::HelloWorld is a sample WWW::Mechanize::Pluggable plugin.

SYNOPSIS

use WWW::Mechanize::Pluggable;
# This module is automatically loaded into WWW::Mechanize::Pluggable

This module shows how to mess with the WWW::Mechanize object contained within the WWW::Mechanize::Pluggable object.
Further refinements are left to the reader. Note that the fields in the WWW::Mechanize::Pluggable object are also available to the plugins.
USAGE ^
my $mech = new WWW::Mechanize::Pluggable;
$mech->hello_world;
# $mech->content now eq hello world

Shut The Box project is a simple diversion written in C and GTK+. The object is simple: roll the dice and click the tiles that sum up to that dice roll until there are no more tiles to click.

Shut The Box is based off of those little wooden puzzles with dice and tiles. My first exposure was playing this as a BBS Door on a BBS my friend ran.

The concept was simple enough so I tried writing it for my own Atari BBS (with the help of another more experienced SysOp).

After I took the BBS offline, the game concept grew from an idea into a sort of “Hello World” application I’d write in order to become more familiar with a language. Hence, this is my “Hello World” for GTK+, although I have several other applications brewing in GTK+.

CeeSpot, or "c." is a program run as a Linux or UNIX command interpreter using the #!/usr/bin/ceespot or #!/bin/c. syntax.

After eating (and interpreting) any # comments at the beginning of the file, it compiles the rest and executes the result.

This lets you use a compiled language as a script file. This is plausible now that machines and compilers are fast enough you dont notice a subsecond compile and link.

Some Exemples

::::::::::::::
hello-c
::::::::::::::

#!/usr/bin/ceespot

#include < stdio.h >

int main(int argc, char **argv)
{
printf("hello, worldn");
return 0;
}

::::::::::::::
hello-cxx
::::::::::::::

#!/usr/bin/ceespot
# CC = g++


#include < iostream >
using namespace std;

int main( int argc, char **argv )
{
cout
#include < X11/StringDefs.h >
#include < X11/Xaw/Label.h >

main(int argc,char **argv)
{
XtAppContext app_context;
Widget toplevel,hello;

toplevel = XtVaAppInitialize(&app_context,"XHello",NULL,0,
&argc,argv,NULL,NULL);
hello = XtVaCreateManagedWidget("Hello World!",labelWidgetClass,
toplevel,(void*)0);

XtRealizeWidget(toplevel);

XtAppMainLoop(app_context);
return 0;
}

The Hecl Programming Language is a high-level scripting language implemented in Java. Hecl Programming Language is intended to be small, extensible, extremely flexible, and easy to learn and use.

Hecl is intended as a complement to the Java programming language, not a replacement. As such, it tries to do well what Java doesnt, and leaves those tasks to Java for which it is best suited.

Hecl aims to be a very immediate language - you can pick it up and start doing useful things with it quickly. It is also meant to be easy to learn. Where Java is verbose and rigid, Hecl is forgiving and quick to write. For instance, System.out.println("Hello World"); vs puts "Hello World" - 41 keystrokes (shifted letters count double) versus 22. Hecl is built to "scale down".

This makes Hecl ideal for large applications written in Java that would like to provide a user friendly scripting interface, rather than, say, a clunky XML based configuration system.

Hecl is also a small language with a minimal core. The idea is to provide only whats necessary in the language itself, and as needed, add in extensions for specific tasks.

Core Hecl is small enough to run on my Nokia 3100 cell phone as a J2ME application, presenting the interesting possibility of writing scripts, or at some point, maybe even scripting entire applications, for devices running embedded Java. As an example, you can try this MIDlet: Hecl.jar Hecl.jad

HTML::FormRemove is a Perl module to remove form tags from HTML.

SYNOPSIS

my $html =
"< FORM > < INPUT TYPE=TEXT NAME=Test VALUE=Hello World! > < /FORM >";
use HTML::FormRemove
print RemoveFormValues($html);

HTML::FormRemove is a module that removes form tags from HTML, while otherwise leaving the HTML intact. This allows for forms to be converted into something printable and usable.

RemoveFormValues ( HTML [, HTML [, HTML [...]]] )
Removes the form values. Exported by default. Returns an array of lines containing the updated HTML, or one single like containing them separated by newlines.

NOTES

This module is a work in progress; Ive only got basic functionality working at the moment.

Locale::TextDomain is a Perl Interface to Uniforum Message Translation.

SYNOPSIS

use Locale::TextDomain (my-package, @locale_dirs);

use Locale::TextDomain qw (my-package);

my $translated = __"Hello World!n";

my $alt = $__{"Hello World!n"};

my $alt2 = $__->{"Hello World!n"};

my @list = (N__"Hello", N__"World");

my @plurals = (N__ ("One world", "{num} worlds"),
N__ ("1 file", "%d files"));

my $question = __x ("Error reading file {file}: {err}",
file => $file, err => $!);

printf (__n ("one file read",
"%d files read",
$num_files),
$num_files);

print __nx ("one file read", "{num} files read", $num_files,
num => $num_files);

The module Locale::TextDomain(3pm) provides a high-level interface to Perl message translation.

Textdomains

When your request a translation for a given string, the system used in libintl-perl follows a standard strategy to find a suitable message catalog containing the translation: Unless you explicitely define a name for the message catalog, libintl-perl will assume that your catalog is called messages (unless you have changed the default value to something else via Locale::Messages(3pm), method textdomain()).
You might think that his default strategy leaves room for optimization and you are right. It would be a lot smarter if multiple software packages, all with their individual message catalogs, could be installed on one system, and it should also be possible that third-party components of your software (like Perl modules) can load their message catalogs, too, without interfering with yours.

The solution is clear, you have to assign a unique name to your message database, and you have to specify that name at run-time. That unique name is the so-called textdomain of your software package. The name is actually arbitrary but you should follow these best-practice guidelines to ensure maximum interoperability:

File System Safety

In practice, textdomains get mapped into file names, and you should therefore make sure that the textdomain you choose is a valid filename on every system that will run your software.

Case-sensitivity

Textdomains are always case-sensitive (i. e. Package and PACKAGE are not the same). However, since the message catalogs will be stored on file systems, that may or may not distinguish case when looking up file names, you should avoid potential conflicts here.

Textdomain Should Match CPAN Name

If your software is listed as a module on CPAN, you should simply choose the name on CPANS as your textdomain. The textdomain for libintl-perl is hence libintl-perl. But please replace all periods (.) in your package name with an underscore because ...

Internet Domain Names as a Fallback

... if your software is not a module listed on CPAN, as a last resort you should use the Java(tm) package scheme, i. e. choose an internet domain that you are owner of (or ask the owner of an internet domain) and concatenate your preferred textdomain with the reversed internet domain. Example: Your company runs the web-site www.foobar.org and is the owner of the domain foobar.org. The textdomain for your companys software barfoos should hence be org.foobar.barfoos.

If your software is likely to be installed in different versions on the same system, it is probably a good idea to append some version information to your textdomain.
Other systems are less strict with the naming scheme for textdomains but the phenomena known as Perl is actually a plethora of small, specialized modules and it is probably wisest to postulate some namespace model in order to avoid chaos.

Binding textdomains to directories

Once the system knows the textdomain of the message that you want to get translated into the users language, it still has to find the correct message catalog. By default, libintl-perl will look up the string in the translation database found in the directories /usr/share/locale and /usr/local/share/locale (in that order).

It is neither guaranteed that these directories exist on the target machine, nor can you be sure that the installation routine has write access to these locations. You can therefore instruct libintl-perl to search other directories prior to the default directories. Specifying a differnt search directory is called binding a textdomain to a directory.

Locale::TextDomain extends the default strategy by a Perl specific approach. Unless told otherwise, it will look for a directory LocaleData in every component found in the standard include path @INC and check for a database containing the message for your textdomain there. Example: If the path /usr/lib/perl/5.8.0/site_perl is in your @INC, you can install your translation files in /usr/lib/perl/5.8.0/site_perl/LocaleData, and they will be found at run-time.

List::Util Perl module contains a selection of general-utility list subroutines.

SYNOPSIS

use List::Util qw(first max maxstr min minstr reduce shuffle sum);

List::Util contains a selection of subroutines that people have expressed would be nice to have in the perl core, but the usage would not really be high enough to warrant the use of a keyword, and the size so small such that being individual extensions would be wasteful.

By default List::Util does not export any subroutines. The subroutines defined are

first BLOCK LIST

Similar to grep in that it evaluates BLOCK setting $_ to each element of LIST in turn. first returns the first element where the result from BLOCK is a true value. If BLOCK never returns true or LIST was empty then undef is returned.

$foo = first { defined($_) } @list # first defined value in @list
$foo = first { $_ > $value } @list # first value in @list which
# is greater than $value

This function could be implemented using reduce like this

$foo = reduce { defined($a) ? $a : wanted($b) ? $b : undef } undef, @list

for example wanted() could be defined() which would return the first defined value in @list

max LIST

Returns the entry in the list with the highest numerical value. If the list is empty then undef is returned.

$foo = max 1..10 # 10
$foo = max 3,9,12 # 12
$foo = max @bar, @baz # whatever

This function could be implemented using reduce like this

$foo = reduce { $a > $b ? $a : $b } 1..10

maxstr LIST

Similar to max, but treats all the entries in the list as strings and returns the highest string as defined by the gt operator. If the list is empty then undef is returned.

$foo = maxstr A..Z # Z
$foo = maxstr "hello","world" # "world"
$foo = maxstr @bar, @baz # whatever

This function could be implemented using reduce like this

$foo = reduce { $a gt $b ? $a : $b } A..Z

min LIST

Similar to max but returns the entry in the list with the lowest numerical value. If the list is empty then undef is returned.

$foo = min 1..10 # 1
$foo = min 3,9,12 # 3
$foo = min @bar, @baz # whatever

This function could be implemented using reduce like this

$foo = reduce { $a < $b ? $a : $b } 1..10

minstr LIST

Similar to min, but treats all the entries in the list as strings and returns the lowest string as defined by the lt operator. If the list is empty then undef is returned.

$foo = minstr A..Z # A
$foo = minstr "hello","world" # "hello"
$foo = minstr @bar, @baz # whatever

This function could be implemented using reduce like this

$foo = reduce { $a lt $b ? $a : $b } A..Z

reduce BLOCK LIST

Reduces LIST by calling BLOCK, in a scalar context, multiple times, setting $a and $b each time. The first call will be with $a and $b set to the first two elements of the list, subsequent calls will be done by setting $a to the result of the previous call and $b to the next element in the list.

Returns the result of the last call to BLOCK. If LIST is empty then undef is returned. If LIST only contains one element then that element is returned and BLOCK is not executed.

$foo = reduce { $a < $b ? $a : $b } 1..10 # min
$foo = reduce { $a lt $b ? $a : $b } aa..zz # minstr
$foo = reduce { $a + $b } 1 .. 10 # sum
$foo = reduce { $a . $b } @bar # concat
shuffle LIST

Returns the elements of LIST in a random order

@cards = shuffle 0..51 # 0..51 in a random order

sum LIST

Returns the sum of all the elements in LIST. If LIST is empty then undef is returned.

$foo = sum 1..10 # 55
$foo = sum 3,9,12 # 24
$foo = sum @bar, @baz # whatever

This function could be implemented using reduce like this

$foo = reduce { $a + $b } 1..10