Free entry level job search software for linux

Archive Search is an extension which displays an archived versions of the webpage.

Displays an archived versions of the webpage.

First click: Internet Archive
Second click: Google cache
Third click: Yahoo
Fourth click: MSN

Level Shmup is a frantic addictive shoot-em-up.

Level Shmup is an old-school arcade style shoot-em-up game in the style of classics such as R-Type and Gradius. Interesting features of this game include the ability to fire in eight directions, and an adaptive difficulty curve.

The game automatically gets easier or harder based on your performance, with bonuses awarded for completion on the highest difficulties.

Usage:

Level Shmup must be run from a terminal to work. Just navigate to the folder youve uncompressed the game to, and type ./levelshmup (then Enter, of course).

pro-search is a crawler for FTP servers, SMB shares, HTTP servers, and DC++ networks.

Homeland Security Threat Level is an extension which displays the current U.S. Homeland Security Threat Level as an icon.

Displays the current U.S. Homeland Security Threat Level as an icon in the status bar.

nautilus-search-tool is a Nautilus extension to have "search files" on popup menu.

List::Search is a Perl module for fast searching of sorted lists.

SYNOPSIS

use List::Search qw( list_search nlist_search custom_list_search );

# Create a list to search
my @list = sort qw( bravo charlie delta );

# Search for a value, returns the index of first match
print list_search( alpha, @list ); # 0
print list_search( charlie, @list ); # 1
print list_search( zebra, @list ); # -1

# Search numerically
my @numbers = sort { $a $b } ( 10, 20, 100, 200, );
print nlist_search( 20, @numbers ); # 2

# Search using some other comparison
my $cmp_code = sub { lc( $_[0] ) cmp lc( $_[1] ) };
my @custom_list = sort { $cmp_code->( $a, $b ) } qw( FOO bar BAZ bundy );
print list_search_generic( $cmp_code, foo, @custom_list );

This module lets you quickly search a sorted list. It will return the index of the first entry that matches, or if there is no exact matches then the first entry that is greater than the search key.

For example in the list my @list = qw( bob dave fred ); searching for dave will return 1 as $list[1] eq dave. Searching for charles will also return 1 as dave is the first entry that is greater than charles.

If there are none of the entries match then -1 is returned. You can either check for this or use it as an index to get the last values in the list. Whichever approach you choose will depend on what you are trying to do.

The actual searching is done using a binary search which is very fast.

Data::ICal::Entry::Event is a Perl module that represents an event in an iCalendar file.

SYNOPSIS

my $vevent = Data::ICal::Entry::Event->new();
$vevent->add_properties(
summary => "my party",
description => "Ill cry if I want to",
# Dat*e*::ICal is not a typo here
dtstart => Date::ICal->new( epoch => time )->ical,
);

$calendar->add_entry($vevent);

$vevent->add_entry($alarm);

A Data::ICal::Entry::Event object represents a single event in an iCalendar file. (Note that the iCalendar RFC refers to entries as "components".) It is a subclass of Data::ICal::Entry and accepts all of its methods.