Free find em all software for linux

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.

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.

libdiscmage is a library to rip/convert single tracks from proprietary image formats (like DiscJuggler or Nero ) for burning em with cdrecord. Example apps are included.
Usage: discmage [OPTION(S)]... IMAGE
Options
--mktoc generate TOC sheet for IMAGE or existing CUE sheet
--mkcue generate CUE sheet for IMAGE or existing TOC sheet
--mksheet same as --mktoc and --mkcue
--rip=N rip/dump track N from IMAGE
--cdmage=N like --rip but writes always (padded) sectors with 2352 Bytes;
this is what CDmage would do
Enhancements:
- added support for CDI, ISO and BIN images
- added support for cua and toc sheets

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

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.