Free love matches software for linux

Movie Mapper project is a small program for indexing movie collections.

Movie Mapper is a small program for indexing movie collections. It browses given directory trees, searching for text files that contain IMDB URLs.

These URLs are used to generate database entries for movies.

Movie Mapper can also be used for offline indexing by creating text files that contain offline movie titles.

It tries to find matches from IMDB for those titles listed in the text files.

System Monitor Theme that started out as a High-Tech one, then devolved into this low-tech broken typewriter version.

I love the chaotic nature of it.

This is my 1st theme, please critique!

File::Searcher is a searches for files and performs search/replacements on matching files.

SYNOPSIS

use File::Searcher;
my $search = File::Searcher->new(*.cgi);
$search->add_expression(name=>street,
search=>1234 Easy St.,
replace=>456 Hard Way,
options=>i);
$search->add_expression(name=>department,
search=>(Dept.|Department)(s+)(d+),
replace=>$1$2$3,
options=>im);
$search->add_expression(name=>place,
search=>Portland, OR(.*?)97212,
replace=>Vicksburg, MI${1}49097,
options=>is);
$search->start;
# $search->interactive; SEE File::Searcher::Interactive
@files_matched = $search->files_matched;
print "Files Matchedn";
print "t" . join("nt", @files_matched) . "n";
print "Total Files:t" . $search->file_cnt . "n";
print "Directories:t" . $search->dir_cnt . "n";
my @files_replaced = $search->expression(street)->files_replaced;
my @files_replaced = $search->expression($expression)->files_replaced;
my %matches = $search->expression(street)->matches;
my %replacements = $search->expression(street)->replacements;

File::Searcher allows for the traversing of a directory tree for files matching a Perl regular expression. When a match is found, the statistics are stored and if the file is a text file a series of searches and replacements can be performed. File::Searcher has options that allow for backing-up / archiving files and has OO access to reporting and statistics of matches and replacements.

Net::ACL::Match::IP is a class matching IP addresses against an IP or network.

SYNOPSIS

use Net::ACL::Match::IP;
# Constructor
$match = new Net::ACL::Match::IP(1,10.0.0.0/8);
# Accessor Methods
$netmaskobj = $match->net($netmaskobj);
$netmaskobj = $match->net($net);
$index = $match->index($index);
$rc = $match->match($ip);
__top

This module is just a wrapper of the Net::Netmask module to allow it to operate automatically with Net::ACL::Rule.

Locale::Maketext::Fuzzy is a Perl module for Maketext from already interpolated strings.

SYNOPSIS

package MyApp::L10N;
use base Locale::Maketext::Fuzzy; # instead of Locale::Maketext

package MyApp::L10N::de;
use base MyApp::L10N;
our %Lexicon = (
# Exact match should always be preferred if possible
"0 camels were released."
=> "Exact match",

# Fuzzy match candidate
"[quant,_1,camel was,camels were] released."
=> "[quant,_1,Kamel wurde,Kamele wurden] freigegeben.",

# This could also match fuzzily, but is less preferred
"[_2] released[_1]"
=> "[_1][_2] ist frei[_1]",
);

package main;
my $lh = MyApp::L10N->get_handle(de);

# All ->maketext calls below will become ->maketext_fuzzy instead
$lh->override_maketext(1);

# This prints "Exact match"
print $lh->maketext(0 camels were released.);

# "1 Kamel wurde freigegeben." -- quant() gets 1
print $lh->maketext(1 camel was released.);

# "2 Kamele wurden freigegeben." -- quant() gets 2
print $lh->maketext(2 camels were released.);

# "3 Kamele wurden freigegeben." -- parameters are ignored
print $lh->maketext(3 released.);

# "4 Kamele wurden freigegeben." -- normal usage
print $lh->maketext([*,_1,camel was,camels were] released., 4);

# "!Perl ist frei!" -- matches the broader one
# Note that the sequence ([_2] before [_1]) is preserved
print $lh->maketext(Perl released!);

Ice Hockey Manager is a hockey simulator which has the ultimate goal of creating a game that offers the most realistic simulation experience possible. Our focus is more on substance than style.
While we want the game to be intuitive, we arent looking to compete with the flashy 3D graphics you might see in games from EA or Sega. Theyve pretty much cornered the market when it comes to pretty graphics.
Were more interested in games that challenge your mind and not your hand-eye coordination. We plan to take hockey simulators (and perhaps sports simulators in general) to places theyve never gone before, The way we see it, the possibilities are limitless, much like real life hockey.
While IHM may not have photorealistic facial features for every player model in the NHL we do strive to create a game that really does make you feel like you are at the helm of your own hockey franchise.
We first started developing IHM in late 2001 and the development team consisted of two members, Bernhard von Gunten and Arik Dasen. The first real release of the game was version 0.1.1 in January of 2002. The game was playable but still very basic, more intended as a framework for future development. In July of 2002, version 0.1.2 was released with many updates to the game but after this release the project essentially went on hiatus until September/October of 2004.
Up until that time the project hadnt garnered much interest from the open source community, either the project was too localized to Swiss-style hockey or it perhaps just didnt get the exposure needed to get people to jump onboard, whatever the reason, IHM seemed to be more of a labor of love than a project that perpetuated itself. Fortunately, in October 2004, development kicked back into gear and all sorts of new and exciting features started to take shape. Some of these features include computer AI, multiplayer-support, trading/transfers, sponsoring/finances, full season/playoffs simulation, etc.
And the IHM team is currently working towards version 0.3, which has been dubbed a "Preview Release" to demonstrate a fully-operational playable game. Will this Preview Release set any kind of standard as far as hockey simulators are concerned? No, not yet. In fact, many elements within the game are still rather simplified, such as in-game simulation (which will begin development post-0.2), but we hope the Preview Release will compel other open source developers to help out with the project as there is still a lot to be done before IHM can be considered a complete game.
This website is intended to both introduce you to the game as well as to encourage you to participate and/or contribute to this project in some way. Whether you are a Java developer, a graphic artist, a beta tester, or something else entirely, we want to hear from you. IHM cant build itself, and while we have invested many hours into the games development we still have our limitations as to what we can achieve, both in time and resources. So if you think you can help out in some way, please let us know. Ideally, you should be a fan of hockey, but thats about the only prerequisite.
Main features:
- Game controller, based on a game calendar.
- Multiuser framework
- League framework (Swiss style leagues implemented, including playoffs and relegations).
- Teams, with statistics and informations.
- Players with attributes, statistics, contracts and informations.
- Simulated matches with generated plays and "radio" output.
- Training
- Injuries
- Contracts framework
- Sponsoring framework, based on contracts
- Financial framework
- Real Impacts (on teams & players)
- Transfers (Swiss style)
- Infrastructure framework (Arena implemented)
- Prospects
- Assistants
- and more ...
Technical stuff:
- Written in 100% pure Java
- Running under Linux and Windows and every other Java 1.5 platform
- Swing GUI
- More than 200 java classes
- More than 30000 lines of code

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.