how do i find a person
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 3214
File::Find::Similars 1.1
File::Find::Similars is a Similar files locator. more>>
File::Find::Similars is a Similar files locator.
SYNOPSIS
use File::Find::Similars;
File::Find::Similars->init(0, @ARGV);
similarity_check_name();
Similar-sized and similar-named files are picked as suspicious candidates of duplicated files.
What descirbes it better than a actual output. Sample suspicious duplicated files:
## =========
1574 PopupTest.java /home/tong/.../examples/chap10
1561 CardLayoutTest.java /home/tong/.../examples/chap1
1570 PopupButtonFrame.class /home/tong/.../examples/chap6
## =========
22984 BinderyHelloWorld.jpg /home/tong/...
17509 MacHelloWorld.gif /home/tong/...
The first column is the size of the file, 2nd the name, and 3rd the path. The motto for the listing is that, I would rather my program overkills (wrongly picking out suspicious ones) than neglects something that would cause me otherwise years to notice.
By default, File::Find::Similars(3) assumes that similar files within the same folder are OK. Hence you will not get duplicate warnings for generated files (like .o, .class or .aux, and .dvi files) or other file series.
Once you are sure that there are no duplications between folders and want File::Find::Similars(3) to scoop further, specify the first parameter as 1. This is very good to eliminate similar mp3 files within the same folder, or downloaded files from big sites where different packaging methods are used, e.g.:
## =========
66138 jdc-src.tar.gz .../ftp.ora.com/published/oreilly/java/javadc
147904 jdc-src.zip .../ftp.ora.com/published/oreilly/java/javadc
<<lessSYNOPSIS
use File::Find::Similars;
File::Find::Similars->init(0, @ARGV);
similarity_check_name();
Similar-sized and similar-named files are picked as suspicious candidates of duplicated files.
What descirbes it better than a actual output. Sample suspicious duplicated files:
## =========
1574 PopupTest.java /home/tong/.../examples/chap10
1561 CardLayoutTest.java /home/tong/.../examples/chap1
1570 PopupButtonFrame.class /home/tong/.../examples/chap6
## =========
22984 BinderyHelloWorld.jpg /home/tong/...
17509 MacHelloWorld.gif /home/tong/...
The first column is the size of the file, 2nd the name, and 3rd the path. The motto for the listing is that, I would rather my program overkills (wrongly picking out suspicious ones) than neglects something that would cause me otherwise years to notice.
By default, File::Find::Similars(3) assumes that similar files within the same folder are OK. Hence you will not get duplicate warnings for generated files (like .o, .class or .aux, and .dvi files) or other file series.
Once you are sure that there are no duplications between folders and want File::Find::Similars(3) to scoop further, specify the first parameter as 1. This is very good to eliminate similar mp3 files within the same folder, or downloaded files from big sites where different packaging methods are used, e.g.:
## =========
66138 jdc-src.tar.gz .../ftp.ora.com/published/oreilly/java/javadc
147904 jdc-src.zip .../ftp.ora.com/published/oreilly/java/javadc
Download (0.010MB)
Added: 2006-11-14 License: Perl Artistic License Price:
1075 downloads
Find Em All 1.0
Find Em All is inspired by XFCE-3s XFglob and Efinder which is part of the Equinox desktop environment. more>>
FindEmAll is another graphical find-and-grep tool.
Find Em All is inspired by XFCE-3s XFglob and Efinder which is part of the Equinox desktop environment.
Unfortunately XFglob is no longer included in XFCE and Efinder does not seem to work (at least for me), because it uses XFCEs glob command which is no longer available.
Main features:
- optional Perl-style regular expression syntax (grep -P)
- search for files owned by non-system user / group (find -nouser -nogroup)
- search files where the search pattern does not match
- exclude binary files from search
Files may be opened in your favorite editor by a double-click on an entry in the list of results. Right-clicking a file opens a context menu that allows to choose an arbitrary application to open this file.
<<lessFind Em All is inspired by XFCE-3s XFglob and Efinder which is part of the Equinox desktop environment.
Unfortunately XFglob is no longer included in XFCE and Efinder does not seem to work (at least for me), because it uses XFCEs glob command which is no longer available.
Main features:
- optional Perl-style regular expression syntax (grep -P)
- search for files owned by non-system user / group (find -nouser -nogroup)
- search files where the search pattern does not match
- exclude binary files from search
Files may be opened in your favorite editor by a double-click on an entry in the list of results. Right-clicking a file opens a context menu that allows to choose an arbitrary application to open this file.
Download (0.030MB)
Added: 2006-11-23 License: GPL (GNU General Public License) Price:
1068 downloads
NetAddr::IP::Find 0.03
NetAddr::IP::Find is a Perl module to find IP addresses in plain text. more>>
NetAddr::IP::Find is a Perl module to find IP addresses in plain text.
SYNOPSIS
use NetAddr::IP::Find;
$num_found = find_ipaddrs($text, &callback);
This is a module for finding IP addresses in plain text.
Functions
NetAddr::IP::Find exports one function, find_ipaddrs(). It works very similar to URI::Finds find_uris() or Email::Finds find_emails().
$num_ipaddrs_found = find_ipaddrs($text, &callback);
The first argument is a text to search through and manipulate. Second is a callback routine which defines what to do with each IP address as theyre found. It returns the total number of IP addresses found.
The callback is given two arguments. The first is a NetAddr::IP instance representing the IP address found. The second is the actual IP address as found in the text. Whatever the callback returns will replace the original text.
EXAMPLES
# For each IP address found, ping its host to see if its alive.
use Net::Ping;
my $pinger = Net::Ping->new;
my %pinged;
find_ipaddrs($text, sub {
my($ipaddr, $orig) = @_;
my $host = $ipaddr->to_string;
next if exists $pinged{$host};
$pinged{$host} = $pinger->ping($host);
});
while (my($host, $up) == each %pinged) {
print "$host is " . $up ? up : down . "n";
}
# Resolve IP address to FQDN
find_ipaddrs($text, sub {
my($ipaddr, $orig) = @_;
resolve_ip($ipaddr->to_string);
});
sub resolve_ip {
use Net::DNS;
# see perldoc Net::DNS for details
}
<<lessSYNOPSIS
use NetAddr::IP::Find;
$num_found = find_ipaddrs($text, &callback);
This is a module for finding IP addresses in plain text.
Functions
NetAddr::IP::Find exports one function, find_ipaddrs(). It works very similar to URI::Finds find_uris() or Email::Finds find_emails().
$num_ipaddrs_found = find_ipaddrs($text, &callback);
The first argument is a text to search through and manipulate. Second is a callback routine which defines what to do with each IP address as theyre found. It returns the total number of IP addresses found.
The callback is given two arguments. The first is a NetAddr::IP instance representing the IP address found. The second is the actual IP address as found in the text. Whatever the callback returns will replace the original text.
EXAMPLES
# For each IP address found, ping its host to see if its alive.
use Net::Ping;
my $pinger = Net::Ping->new;
my %pinged;
find_ipaddrs($text, sub {
my($ipaddr, $orig) = @_;
my $host = $ipaddr->to_string;
next if exists $pinged{$host};
$pinged{$host} = $pinger->ping($host);
});
while (my($host, $up) == each %pinged) {
print "$host is " . $up ? up : down . "n";
}
# Resolve IP address to FQDN
find_ipaddrs($text, sub {
my($ipaddr, $orig) = @_;
resolve_ip($ipaddr->to_string);
});
sub resolve_ip {
use Net::DNS;
# see perldoc Net::DNS for details
}
Download (0.003MB)
Added: 2007-04-17 License: Perl Artistic License Price:
923 downloads
File::Find 5.8.8
File::Find is a Perl module to traverse a directory tree. more>>
File::Find is a Perl module to traverse a directory tree.
SYNOPSIS
use File::Find;
find(&wanted, @directories_to_search);
sub wanted { ... }
use File::Find;
finddepth(&wanted, @directories_to_search);
sub wanted { ... }
use File::Find;
find({ wanted => &process, follow => 1 }, .);
These are functions for searching through directory trees doing work on each file found similar to the Unix find command. File::Find exports two functions, find and finddepth. They work similarly but have subtle differences.
find
find(&wanted, @directories);
find(%options, @directories);
find() does a depth-first search over the given @directories in the order they are given. For each file or directory found, it calls the &wanted subroutine. (See below for details on how to use the &wanted function). Additionally, for each directory found, it will chdir() into that directory and continue the search, invoking the &wanted function on each file or subdirectory in the directory.
finddepth
finddepth(&wanted, @directories);
finddepth(%options, @directories);
finddepth() works just like find() except that is invokes the &wanted function for a directory after invoking it for the directorys contents. It does a postorder traversal instead of a preorder traversal, working from the bottom of the directory tree up where find() works from the top of the tree down.
<<lessSYNOPSIS
use File::Find;
find(&wanted, @directories_to_search);
sub wanted { ... }
use File::Find;
finddepth(&wanted, @directories_to_search);
sub wanted { ... }
use File::Find;
find({ wanted => &process, follow => 1 }, .);
These are functions for searching through directory trees doing work on each file found similar to the Unix find command. File::Find exports two functions, find and finddepth. They work similarly but have subtle differences.
find
find(&wanted, @directories);
find(%options, @directories);
find() does a depth-first search over the given @directories in the order they are given. For each file or directory found, it calls the &wanted subroutine. (See below for details on how to use the &wanted function). Additionally, for each directory found, it will chdir() into that directory and continue the search, invoking the &wanted function on each file or subdirectory in the directory.
finddepth
finddepth(&wanted, @directories);
finddepth(%options, @directories);
finddepth() works just like find() except that is invokes the &wanted function for a directory after invoking it for the directorys contents. It does a postorder traversal instead of a preorder traversal, working from the bottom of the directory tree up where find() works from the top of the tree down.
Download (12.2MB)
Added: 2007-04-26 License: Perl Artistic License Price:
913 downloads
Email::Find 0.10
Email::Find allows you to find RFC 822 email addresses in plain text. more>>
Email::Find allows you to find RFC 822 email addresses in plain text.
Email::Find is a module for finding a subset of RFC 822 email addresses in arbitrary text (see "CAVEATS"). The addresses it finds are not guaranteed to exist or even actually be email addresses at all (see "CAVEATS"), but they will be valid RFC 822 syntax.
Email::Find will perform some heuristics to avoid some of the more obvious red herrings and false addresses, but theres only so much which can be done without a human.
Finds email addresses in the text and executes callback registered.
The callback is given two arguments. The first is a Mail::Address object representing the address found. The second is the actual original email as found in the text. Whatever the callback returns will replace the original text.
<<lessEmail::Find is a module for finding a subset of RFC 822 email addresses in arbitrary text (see "CAVEATS"). The addresses it finds are not guaranteed to exist or even actually be email addresses at all (see "CAVEATS"), but they will be valid RFC 822 syntax.
Email::Find will perform some heuristics to avoid some of the more obvious red herrings and false addresses, but theres only so much which can be done without a human.
Finds email addresses in the text and executes callback registered.
The callback is given two arguments. The first is a Mail::Address object representing the address found. The second is the actual original email as found in the text. Whatever the callback returns will replace the original text.
Download (0.039MB)
Added: 2007-03-31 License: Perl Artistic License Price:
943 downloads
Russian Mafia 0.994
Russian Mafia is a multiplayer IRC game implementation of Russian Mafia. more>>
Russian Mafia project is a multiplayer IRC game implementation of Russian Mafia.
Russian Mafia is a multiplayer IRC game implementation of the popular game, Russian Mafia, which is based on the Russian card game "MAFIA".
The peaceful civilians attempt to kill all the Mafia and maniacs, while the Mafia and maniacs attempt to kill all the civilians.
After the crush of the Soviet Union, Moscow was plunged into a mafia terror. Russian Goverment asking asking Italian parliament to send them the most talanted detective Commissar Katani, who keep in fear italian mafia Kosa Nostra. Katani arrives in Moscow and with civilians is trying to calm down the crime in the city.
This if fully atomatic game, on the over hande its very interesting and simple multiplayer game. All the game function processed by the IRC mafia bot, which also stores the statistic informations and game points, bank accounts.
The main goal in this game to win. Peaceful civilians have to find and kill all mafia men and maniac, or mafia men and maniac have to kill all civilians, Commissar Katani and other peaceful roles. This mean, peaceful roles have to guess who is bad and kill them - how they can kill them, look down.
Its a round game, with a stages. At the start of each round the mafia bot randomly distribute the roles. The round two stages - day and night, with are repeating until the one of the sides win or until the draw. During the night the roles make the commands, and during the day all players decide whom to kill because of the evidence or guessing, or to process without killing.
To start you have to type !reg during the round registration. After you just follow the mafia bot commands.
After the round registration you will receive a role.
During the night you will be asked about a order to the bot, concerning the role you have.
During the day you have to talk to other players to guess who is criminal, and making votes for the person to kill (codnamn to die).
After the vote the acused person will die. If no winners from civilians or mafia, the game starting again at night stage.
<<lessRussian Mafia is a multiplayer IRC game implementation of the popular game, Russian Mafia, which is based on the Russian card game "MAFIA".
The peaceful civilians attempt to kill all the Mafia and maniacs, while the Mafia and maniacs attempt to kill all the civilians.
After the crush of the Soviet Union, Moscow was plunged into a mafia terror. Russian Goverment asking asking Italian parliament to send them the most talanted detective Commissar Katani, who keep in fear italian mafia Kosa Nostra. Katani arrives in Moscow and with civilians is trying to calm down the crime in the city.
This if fully atomatic game, on the over hande its very interesting and simple multiplayer game. All the game function processed by the IRC mafia bot, which also stores the statistic informations and game points, bank accounts.
The main goal in this game to win. Peaceful civilians have to find and kill all mafia men and maniac, or mafia men and maniac have to kill all civilians, Commissar Katani and other peaceful roles. This mean, peaceful roles have to guess who is bad and kill them - how they can kill them, look down.
Its a round game, with a stages. At the start of each round the mafia bot randomly distribute the roles. The round two stages - day and night, with are repeating until the one of the sides win or until the draw. During the night the roles make the commands, and during the day all players decide whom to kill because of the evidence or guessing, or to process without killing.
To start you have to type !reg during the round registration. After you just follow the mafia bot commands.
After the round registration you will receive a role.
During the night you will be asked about a order to the bot, concerning the role you have.
During the day you have to talk to other players to guess who is criminal, and making votes for the person to kill (codnamn to die).
After the vote the acused person will die. If no winners from civilians or mafia, the game starting again at night stage.
Download (0.033MB)
Added: 2007-01-04 License: GPL (GNU General Public License) Price:
1035 downloads
File::Find::Parallel 0.0.4
File::Find::Parallel allows you to traverse a number of similar directories in parallel. more>>
File::Find::Parallel allows you to traverse a number of similar directories in parallel.
SYNOPSIS
use File::Find::Parallel;
my $ffp = File::Find::Parallel->new( qw( /foo /bar ) );
print "Union:n";
my $union = $ffp->any_iterator
print " $_n" while $_ = $union->();
print "Intersection:n";
my $inter = $ffp->all_iterator
print " $_n" while $_ = $inter->();
File::Find is the ideal tool for quickly scanning a single directory. But sometimes its nice to be able to perform operations on multiple similar directories in parallel. Perhaps you need to compare the contents of two directories or convert files that are shared in more than one directory into hard links.
This module manufactures iterators that visit each file and directory in either the union or the intersection of a number of directories. Hmm. What does that mean?
Given two directory trees like this
foo
foo/a
foo/b/c
foo/d
bar
bar/a
bar/b
bar/e
you can choose to work with the intersection of the two directory structures:
.
./a
./b
That is the subdirectories and files that the foo and bar share.
Alternately you can work with the union of the two directory structures:
.
./a
./b
./b/c
./d
./e
Still not clear? Well, if you wanted to do a recursive diff on the two directories youd iterate their union so you could report files that were present in foo but missing from bar and vice-versa.
If, on the other hand you wanted to scan the directories and find all the files that are common to all of them youd iterate their intersection and receive only files and directories that were present in all the directories being scanned.
The any_iterator and all_iterator are built on a more general purpose method: want_iterator. If, for example, you want to make links between files that are found in more than one directory you might get your iterator like this:
my $iter = $ffp->want_iterator( 2 );
The apparently magic 2 reflects the fact that if youre going to be making links you need at least two files. No matter how many directories you are iterating over in parallel you will only see files and directories that appear in at least two of those directories.
File::Find::Parallel can scan any number of directories at the same time. Heres an example (on Unix systems) that returns the list of all files and directories that are contained in all home directories.
use File::Glob :glob;
use File::Find::Parallel;
my $find = File::Find::Parallel->new( bsd_glob( /home/* ) );
my @common = ( );
my $iter = $find->all_iterator;
while ( defined my $obj = $iter->() ) {
push @common, $obj;
}
print "The following files are common to ",
"all directories below /home :n";
print " $_n" for @common;
For a complete concrete example of its use see lncopies in the bin subdirectory of this distribution.
Iterators
The iterator returned by any_iterator, all_iterator or want_iterator is a code reference. Call it to get the next file or directory. When all files and directories have been returned the iterator will return undef.
Once created an iterator is independent of the File::Find::Parallel object that created it. If the object goes out of scope and is destroyed during the life of the iterator it will still function normally.
You may have many active iterators for a single File::Find::Parallel object at any time.
<<lessSYNOPSIS
use File::Find::Parallel;
my $ffp = File::Find::Parallel->new( qw( /foo /bar ) );
print "Union:n";
my $union = $ffp->any_iterator
print " $_n" while $_ = $union->();
print "Intersection:n";
my $inter = $ffp->all_iterator
print " $_n" while $_ = $inter->();
File::Find is the ideal tool for quickly scanning a single directory. But sometimes its nice to be able to perform operations on multiple similar directories in parallel. Perhaps you need to compare the contents of two directories or convert files that are shared in more than one directory into hard links.
This module manufactures iterators that visit each file and directory in either the union or the intersection of a number of directories. Hmm. What does that mean?
Given two directory trees like this
foo
foo/a
foo/b/c
foo/d
bar
bar/a
bar/b
bar/e
you can choose to work with the intersection of the two directory structures:
.
./a
./b
That is the subdirectories and files that the foo and bar share.
Alternately you can work with the union of the two directory structures:
.
./a
./b
./b/c
./d
./e
Still not clear? Well, if you wanted to do a recursive diff on the two directories youd iterate their union so you could report files that were present in foo but missing from bar and vice-versa.
If, on the other hand you wanted to scan the directories and find all the files that are common to all of them youd iterate their intersection and receive only files and directories that were present in all the directories being scanned.
The any_iterator and all_iterator are built on a more general purpose method: want_iterator. If, for example, you want to make links between files that are found in more than one directory you might get your iterator like this:
my $iter = $ffp->want_iterator( 2 );
The apparently magic 2 reflects the fact that if youre going to be making links you need at least two files. No matter how many directories you are iterating over in parallel you will only see files and directories that appear in at least two of those directories.
File::Find::Parallel can scan any number of directories at the same time. Heres an example (on Unix systems) that returns the list of all files and directories that are contained in all home directories.
use File::Glob :glob;
use File::Find::Parallel;
my $find = File::Find::Parallel->new( bsd_glob( /home/* ) );
my @common = ( );
my $iter = $find->all_iterator;
while ( defined my $obj = $iter->() ) {
push @common, $obj;
}
print "The following files are common to ",
"all directories below /home :n";
print " $_n" for @common;
For a complete concrete example of its use see lncopies in the bin subdirectory of this distribution.
Iterators
The iterator returned by any_iterator, all_iterator or want_iterator is a code reference. Call it to get the next file or directory. When all files and directories have been returned the iterator will return undef.
Once created an iterator is independent of the File::Find::Parallel object that created it. If the object goes out of scope and is destroyed during the life of the iterator it will still function normally.
You may have many active iterators for a single File::Find::Parallel object at any time.
Download (0.009MB)
Added: 2007-07-07 License: Perl Artistic License Price:
840 downloads
MP3::Find::Base 0.06
MP3::Find::Base is a base class for MP3::Find backends. more>>
MP3::Find::Base is a base class for MP3::Find backends.
SYNOPSIS
package MyFinder;
use base MP3::Find::Base;
sub search {
my $self = shift;
my ($query, $dirs, $sort, $options) = @_;
# do something to find and sort the mp3s...
my @results = do_something(...);
return @results;
}
package main;
my $finder = MyFinder->new;
# see MP3::Find for details about %options
print "$_n" foreach $finder->find_mp3s(%options);
This is the base class for the classes that actually do the searching and sorting for MP3::Find.
<<lessSYNOPSIS
package MyFinder;
use base MP3::Find::Base;
sub search {
my $self = shift;
my ($query, $dirs, $sort, $options) = @_;
# do something to find and sort the mp3s...
my @results = do_something(...);
return @results;
}
package main;
my $finder = MyFinder->new;
# see MP3::Find for details about %options
print "$_n" foreach $finder->find_mp3s(%options);
This is the base class for the classes that actually do the searching and sorting for MP3::Find.
Download (0.029MB)
Added: 2006-11-08 License: Perl Artistic License Price:
1080 downloads
KoffeePhoto 1.1 Beta
KoffeePhoto is a free software that allows you to manage your personal photo library. more>>
KoffeePhoto is a free software that allows you to manage your personal photo library. You can manage your photo albums with KoffeePhoto, and share them with your friends or family very easily. Your albums will be saved on the KoffeePhoto network, which will let you access them anytime and anywhere.
KoffeePhoto allows you to pick your photos on your hard disk or on your camera, and to organize them in albums. Thanks to several ways of sorting your photos, by date, topic, place, person, or any combination of these categories, you will always have an easy way to find all your photos again.
KoffeePhoto saves your whole photo library on its peer-to-peer KoffeePhoto network. This is carried out in a completely seamless way. Your photos are encrypted to ensure confidentiality, and are saved without any loss in quality (no format reduction, no data compression), and no storage expiration date. You can access your photo library from several computers if you wish. In case of any data loss, you can recover your whole photo library very easily!
<<lessKoffeePhoto allows you to pick your photos on your hard disk or on your camera, and to organize them in albums. Thanks to several ways of sorting your photos, by date, topic, place, person, or any combination of these categories, you will always have an easy way to find all your photos again.
KoffeePhoto saves your whole photo library on its peer-to-peer KoffeePhoto network. This is carried out in a completely seamless way. Your photos are encrypted to ensure confidentiality, and are saved without any loss in quality (no format reduction, no data compression), and no storage expiration date. You can access your photo library from several computers if you wish. In case of any data loss, you can recover your whole photo library very easily!
Download (0.003MB)
Added: 2006-10-20 License: Freeware Price:
1174 downloads
Marathon: Rubicon X 20060701
Marathon: Rubicon X is a first person shooter that continues the story of Bungies Marathon trilogy. more>>
Marathon: Rubicon X is a first person shooter that continues the story of Bungies Marathon trilogy.
Marathon: Rubicon X is a free, cross platform, first person shooter that continues the story of Bungie’s Marathon trilogy. First released as Marathon:Rubicon in 2001, Rubicon X is a complete overhaul of the original.
It features all new high-resolution artwork, new and updated maps, and enough surprises to feel like a whole new game.
Installation:
To play Rubicon, download and unzip the archive below. When youre done, you should have a new directory called Rubicon X.
You will need the newest version of the Aleph One engine. Copy the application, Fonts, and Themes into your Rubicon X folder.
<<lessMarathon: Rubicon X is a free, cross platform, first person shooter that continues the story of Bungie’s Marathon trilogy. First released as Marathon:Rubicon in 2001, Rubicon X is a complete overhaul of the original.
It features all new high-resolution artwork, new and updated maps, and enough surprises to feel like a whole new game.
Installation:
To play Rubicon, download and unzip the archive below. When youre done, you should have a new directory called Rubicon X.
You will need the newest version of the Aleph One engine. Copy the application, Fonts, and Themes into your Rubicon X folder.
Download (1.2MB)
Added: 2006-08-25 License: GPL (GNU General Public License) Price:
1160 downloads
File::Find::Rule 0.30
File::Find::Rule is an alternative Perl interface to File::Find. more>>
SYNOPSIS
use File::Find::Rule;
# find all the subdirectories of a given directory
my @subdirs = File::Find::Rule->directory->in( $directory );
# find all the .pm files in @INC
my @files = File::Find::Rule->file()
->name( *.pm )
->in( @INC );
# as above, but without method chaining
my $rule = File::Find::Rule->new;
$rule->file;
$rule->name( *.pm );
my @files = $rule->in( @INC );
Download (0.014MB)
Added: 2007-04-26 License: Perl Artistic License Price:
911 downloads

Finddouble 1.4
Finddouble searches directories for file duplicate. more>> finddouble 1.4 : is a Linux/Mac application. It searches directories for file duplicate. Very usefull to find copies of the same file : images, png, jpe, music, mp3, any kind of file.<<less
Download (22KB)
Added: 2009-04-27 License: Freeware Price: Free
428 downloads
MP3::Find 0.06
MP3::Find is a Perl module to search and sort MP3 files based on their ID3 tags. more>>
MP3::Find is a Perl module to search and sort MP3 files based on their ID3 tags.
SYNOPSIS
# select with backend you want
use MP3::Find qw(Filesystem);
print "$_n" foreach find_mp3s(
dir => /home/peter/cds,
query => {
artist => ilyaimy,
title => deep in the am,
},
ignore_case => 1,
exact_match => 1,
sort => [qw(year album tracknum)],
printf => %2n. %a - %t (%b: %y),
);
This module allows you to search for MP3 files by their ID3 tags. You can ask for the results to be sorted by one or more of those tags, and return either the list of filenames (the deault), a printf-style formatted string for each file using its ID3 tags, or the actual Perl data structure representing the results.
There are currently two backends to this module: MP3::Find::Filesystem and MP3::Find::DB. You choose which one you want by passing its name as the argument to you use statement; MP3::Find will look for a MP3::Find::$BACKEND module. If no backend name is given, it will default to using MP3::Find::Filesystem.
Note: Im still working out some kinks in the DB backend, so it is currently not as stable as the Filesystem backend.
Note the second: This whole project is still in the alpha stage, so I can make no guarentees that there wont be significant interface changes in the next few versions or so. Also, comments about what about the API rocks (or sucks!) are appreciated.
<<lessSYNOPSIS
# select with backend you want
use MP3::Find qw(Filesystem);
print "$_n" foreach find_mp3s(
dir => /home/peter/cds,
query => {
artist => ilyaimy,
title => deep in the am,
},
ignore_case => 1,
exact_match => 1,
sort => [qw(year album tracknum)],
printf => %2n. %a - %t (%b: %y),
);
This module allows you to search for MP3 files by their ID3 tags. You can ask for the results to be sorted by one or more of those tags, and return either the list of filenames (the deault), a printf-style formatted string for each file using its ID3 tags, or the actual Perl data structure representing the results.
There are currently two backends to this module: MP3::Find::Filesystem and MP3::Find::DB. You choose which one you want by passing its name as the argument to you use statement; MP3::Find will look for a MP3::Find::$BACKEND module. If no backend name is given, it will default to using MP3::Find::Filesystem.
Note: Im still working out some kinks in the DB backend, so it is currently not as stable as the Filesystem backend.
Note the second: This whole project is still in the alpha stage, so I can make no guarentees that there wont be significant interface changes in the next few versions or so. Also, comments about what about the API rocks (or sucks!) are appreciated.
Download (0.029MB)
Added: 2006-11-07 License: Perl Artistic License Price:
1081 downloads
People Search and Public Record Toolbar 1.0
People Search and Public Record Toolbar is a Firefox extension is a handy menu tool for investigators, reporters, etc. more>>
People Search and Public Record Toolbar is a Firefox extension is a handy menu tool for investigators, reporters, legal professionals, real estate agents, online researchers and anyone interested in doing their own basic people searches and public record lookups as well as background research.
Find past friends, relatives, classmates, coworkers, military buddies or do background research on people and businesses.
This useful extension offers you the following free people and public record searches at the click of a mouse:
- Free People Searches: White Pages, 411, DA Plus, Zaba Search, Zoom Info, Google, International Phone Directories, Google Image Search and Riya photo search.
- Reverse Phone Numbers: White Pages, DA Plus, Google, Land Line or Cell Phone? Search, Reverse Payphone and Do Not Call List.
- Reverse Addresses: White Pages, DA Plus, Google, Mail Drop Search and Whois Lookup.
- Area Code, Zip Code and International Calling Code Searches.
- Yellow Pages & Local Searches: White Pages Yellow, DA Plus Yellow, Google Local and Yahoo Local.
- Public Record Searches: Skipease Public Record Directory, Search Systems Public Record Directory, Social Security Number Searches, NETRonline Property Records, Zillow Property Values, Trulia Real Estate Search, Yahoo Real Estate and NACO US County Information.
- Criminal Searches: Inmate Locators and National Sex Offender Registry.
- Maps & Satellites: Google Maps, Map Quest, Yahoo Maps, Google Earth, Terra Server.
- Government Phone Directories: US Blue Pages, Canada GEDS.
- US Government Search Engines: FirstGov and Google Government Search.
- News & Blog Searches: Google News, Yahoo News, Technorati, IceRocket and Google Blog Search.
- Business & Finance: Alibaba, Business.com, Thomas Registry, Google Finance, Yahoo Finance.
- Jobs & Classifieds: Indeed Meta Job Search, Simply Hired Meta Job Search, Dice Jobs, Hot Jobs, Monster Jobs, Craigslist Classifieds.
- Social Network Sites: Facebook, Friendster, MySpace, Tribe, Xanga.
This extension contains NO malicious scripts or code; no malware, spyware or adware of any kind. This extension does NOT record personal or surfing information from users. If you dont believe me, then check the source code on the extension after you download it. There is absolutely no Spyware or malware of any kind and the same person continues to attack this extension and defame it using numerous different logon ids.
<<lessFind past friends, relatives, classmates, coworkers, military buddies or do background research on people and businesses.
This useful extension offers you the following free people and public record searches at the click of a mouse:
- Free People Searches: White Pages, 411, DA Plus, Zaba Search, Zoom Info, Google, International Phone Directories, Google Image Search and Riya photo search.
- Reverse Phone Numbers: White Pages, DA Plus, Google, Land Line or Cell Phone? Search, Reverse Payphone and Do Not Call List.
- Reverse Addresses: White Pages, DA Plus, Google, Mail Drop Search and Whois Lookup.
- Area Code, Zip Code and International Calling Code Searches.
- Yellow Pages & Local Searches: White Pages Yellow, DA Plus Yellow, Google Local and Yahoo Local.
- Public Record Searches: Skipease Public Record Directory, Search Systems Public Record Directory, Social Security Number Searches, NETRonline Property Records, Zillow Property Values, Trulia Real Estate Search, Yahoo Real Estate and NACO US County Information.
- Criminal Searches: Inmate Locators and National Sex Offender Registry.
- Maps & Satellites: Google Maps, Map Quest, Yahoo Maps, Google Earth, Terra Server.
- Government Phone Directories: US Blue Pages, Canada GEDS.
- US Government Search Engines: FirstGov and Google Government Search.
- News & Blog Searches: Google News, Yahoo News, Technorati, IceRocket and Google Blog Search.
- Business & Finance: Alibaba, Business.com, Thomas Registry, Google Finance, Yahoo Finance.
- Jobs & Classifieds: Indeed Meta Job Search, Simply Hired Meta Job Search, Dice Jobs, Hot Jobs, Monster Jobs, Craigslist Classifieds.
- Social Network Sites: Facebook, Friendster, MySpace, Tribe, Xanga.
This extension contains NO malicious scripts or code; no malware, spyware or adware of any kind. This extension does NOT record personal or surfing information from users. If you dont believe me, then check the source code on the extension after you download it. There is absolutely no Spyware or malware of any kind and the same person continues to attack this extension and defame it using numerous different logon ids.
Download (0.033MB)
Added: 2007-06-27 License: MPL (Mozilla Public License) Price:
986 downloads
KPhotoAlbum 3.0
KPhotoAlbum is a tool for annotating, searching, and viewing images. more>>
KPhotoAlbum program (formerly known as KimDaBa, KDE Image Database) is a tool for indexing, searching, and viewing images. The indexing is done by telling KPhotoAlbum who is on the images, where the images were taken, and (optionally) adding descriptions.
It is highly optimized for easy indexing of images, so that it is possible to use it with thousands of images. It also allows you to browse your images easily, based on the properties (person, location, keywords) you specified when indexing.
I personally realized that this was not possible anymore, and especially for my digital images - but also for my paper images - I needed a tool to help me describe my images, and to search in the pile of images. This is exactly what KPhotoAlbum is all about.
With KPhotoAlbum it is today possible for me to find any image I have in less than 5 seconds, let that be an image with a special person, an image from a special place, or even both.
There is of course no such thing as free lunch - with KPhotoAlbum this means that you have to annotate all your images before you are set. KPhotoAlbum is, however, highly optimized for annotating images, so annotating 100 images in 10 minutes are no way impossible.
Enhancements:
- Video Support
- Much improved subcategory support.
<<lessIt is highly optimized for easy indexing of images, so that it is possible to use it with thousands of images. It also allows you to browse your images easily, based on the properties (person, location, keywords) you specified when indexing.
I personally realized that this was not possible anymore, and especially for my digital images - but also for my paper images - I needed a tool to help me describe my images, and to search in the pile of images. This is exactly what KPhotoAlbum is all about.
With KPhotoAlbum it is today possible for me to find any image I have in less than 5 seconds, let that be an image with a special person, an image from a special place, or even both.
There is of course no such thing as free lunch - with KPhotoAlbum this means that you have to annotate all your images before you are set. KPhotoAlbum is, however, highly optimized for annotating images, so annotating 100 images in 10 minutes are no way impossible.
Enhancements:
- Video Support
- Much improved subcategory support.
Download (11.6MB)
Added: 2007-01-01 License: GPL (GNU General Public License) Price:
1027 downloads
Secleted [ 0 ] software to compare
Copyright Notice:
Software piracy is theft, Using crack, password, serial numbers, registration codes, key generators is illegal and prevent future software development. The above how do i find a person search only lists software in full, demo and trial versions for free download. Download links are directly from our mirror sites or publisher sites, torrent files or links from rapidshare.com, yousendit.com or megaupload.com are not allowed