how to find my biological mother
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 2998
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
My File Manager 0.4
My File Manager is a small and lightweight file manager. more>>
My File Manager is a small and lightweight file manager. It was developed to provide a small and fast file manager, which has only a few dependencies from other packages, but including some interestings things like mount partitions, minimalistic burning capability and mass renaming files. MFM use FLTK graphics toolkit.
Main features:
- Selectable shown fields (permissions, users, groups, date and size)
- Various sort options
- Rename group of files
- Change attributes of group of files
- Compress files
- Burn CD/DVD
- Find files by name or by content
- Mount/umount partitions
<<lessMain features:
- Selectable shown fields (permissions, users, groups, date and size)
- Various sort options
- Rename group of files
- Change attributes of group of files
- Compress files
- Burn CD/DVD
- Find files by name or by content
- Mount/umount partitions
Download (0.092MB)
Added: 2006-06-11 License: GPL (GNU General Public License) Price:
1237 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
Find on XING 1.1
Find business partners quickly and easily more>> Find on XING 1.1 is the most comprehensive, user friendly and fast solution to find business partners quickly and easily.<<less
Added: 2009-07-15 License: MPL Price: FREE
15 downloads
Mother 0.4.7
Mother provides a Python ORM for PostgreSQL with strong introspection. more>>
Mother provides a Python ORM for PostgreSQL with strong introspection.
Mother is a Python module that hides SQL syntax and gives you a set of intelligent classes and methods that can self-adapt and understand various situations.
It could be considered as an Object Relational Mapper with strong introspection.
In fact, configuration files, tables, fields, and keys declarations are not needed.
It works with PostgreSQL and its introspective nature is based on PostgreSQL meta queries.
The Mother module offers a set of classes to handle different situations.
In particular, its possible to represent a table with one class. Binding a table to a class is the begin of the Mother Art.
In fact, the class knows tables relationships: handling children and relations
is powerful and easy: foreign keys and relationships informations are not needed:
Mother knows them and is able to fill records with the correct values.
Moreover, the methods used to insert children and relations are auto-created
and self-adapting.
The Mother classes can be declared by the user: its sufficient to inherit from some Mother class: so, class extensions are very easy to code.
Some extension is already provided, as the Triggers feature, but writing others plugins is simple and immediate.
The database connection is very comfortable: credentials have to be specified in a configuration file: after that, the connection is transparent.
Mother implements a connection Pool to be used in a Threaded Environemnt.
The database transactions are implemented in a particular way.
Its possible to call nested transactions, so that you dont have to worry about the nested calls to the commit or the rollback statement. This allows to handle transactions in different levels and indipendently.
Mother comes with a logger: Speaker, that supports standard output, log file (with rotation capability), syslog and SMTP.
If you are wondering if Mother has a slow computation model, the answer is no: the Mother knowledge is made once (by Mother tools) and stored to two files. Mother is fast.
<<lessMother is a Python module that hides SQL syntax and gives you a set of intelligent classes and methods that can self-adapt and understand various situations.
It could be considered as an Object Relational Mapper with strong introspection.
In fact, configuration files, tables, fields, and keys declarations are not needed.
It works with PostgreSQL and its introspective nature is based on PostgreSQL meta queries.
The Mother module offers a set of classes to handle different situations.
In particular, its possible to represent a table with one class. Binding a table to a class is the begin of the Mother Art.
In fact, the class knows tables relationships: handling children and relations
is powerful and easy: foreign keys and relationships informations are not needed:
Mother knows them and is able to fill records with the correct values.
Moreover, the methods used to insert children and relations are auto-created
and self-adapting.
The Mother classes can be declared by the user: its sufficient to inherit from some Mother class: so, class extensions are very easy to code.
Some extension is already provided, as the Triggers feature, but writing others plugins is simple and immediate.
The database connection is very comfortable: credentials have to be specified in a configuration file: after that, the connection is transparent.
Mother implements a connection Pool to be used in a Threaded Environemnt.
The database transactions are implemented in a particular way.
Its possible to call nested transactions, so that you dont have to worry about the nested calls to the commit or the rollback statement. This allows to handle transactions in different levels and indipendently.
Mother comes with a logger: Speaker, that supports standard output, log file (with rotation capability), syslog and SMTP.
If you are wondering if Mother has a slow computation model, the answer is no: the Mother knowledge is made once (by Mother tools) and stored to two files. Mother is fast.
Download (0.035MB)
Added: 2007-02-22 License: BSD License Price:
979 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
Intro to Bash Programming HOWTO 0.8
Intro to Bash Programming HOWTO is a bash programming tutorial. more>>
Intro to Bash Programming HOWTO is a bash programming tutorial.
The Intro to Bash Programming HOWTO is meant for newbies who wish to learn how to write shell scripts for bash, the GNU Boure-Again shell.
It contains several samples. It is very early in its development, but it is hoped that some people might find it useful.
Enhancements:
- New translations included and minor correcitons.
<<lessThe Intro to Bash Programming HOWTO is meant for newbies who wish to learn how to write shell scripts for bash, the GNU Boure-Again shell.
It contains several samples. It is very early in its development, but it is hoped that some people might find it useful.
Enhancements:
- New translations included and minor correcitons.
Download (MB)
Added: 2006-10-03 License: (FDL) GNU Free Documentation License Price:
1123 downloads
File::Find::Rule::XPath 0.03
File::Find::Rule::XPath is a Perl module that contains rule to match on XPath expressions. more>>
File::Find::Rule::XPath is a Perl module that contains rule to match on XPath expressions.
SYNOPSIS
use File::Find::Rule::XPath;
my @files = File::Find::Rule->file
->name(*.dkb)
->xpath( //section/title[contains(., "Crustacean")] )
->in($root);
This module extends File::Find::Rule to provide the ability to locate XML files which match a given XPath expression.
METHODS
xpath( $xpath_expression )
Matches XML files which contain one or more nodes matching the given XPath expression. Files which are not well formed XML are silently skipped.
If no XPath expression is supplied, the value / is used. This will match all files which are well formed XML.
<<lessSYNOPSIS
use File::Find::Rule::XPath;
my @files = File::Find::Rule->file
->name(*.dkb)
->xpath( //section/title[contains(., "Crustacean")] )
->in($root);
This module extends File::Find::Rule to provide the ability to locate XML files which match a given XPath expression.
METHODS
xpath( $xpath_expression )
Matches XML files which contain one or more nodes matching the given XPath expression. Files which are not well formed XML are silently skipped.
If no XPath expression is supplied, the value / is used. This will match all files which are well formed XML.
Download (0.004MB)
Added: 2006-09-06 License: Perl Artistic License Price:
1143 downloads
Eigenpoll 0.4
Eigenpoll allows you to extract knowleage from your users. more>>
Eigenpoll allows you to extract knowleage from your users.
Eigenpoll is a script which lets your users compare different options.
Then it uses an algorithm similar to Googles PageRank to order the options.
It is great for comparing your favorite open source software to other options, to find the best book on a subject, or to find the best practices for a problem domain.
<<lessEigenpoll is a script which lets your users compare different options.
Then it uses an algorithm similar to Googles PageRank to order the options.
It is great for comparing your favorite open source software to other options, to find the best book on a subject, or to find the best practices for a problem domain.
Download (0.004MB)
Added: 2007-01-23 License: Freely Distributable Price:
1004 downloads
Bio::GMOD 0.28
Bio::GMOD is a unified API for Model Organism Databases. more>>
Bio::GMOD is a unified API for Model Organism Databases.
SYNOPSIS
Check the installed version of a MOD
use Bio::GMOD::Util::CheckVersions.pm
my $mod = Bio::GMOD::Util::CheckVersions->new(-mod=>WormBase);
my $version = $mod->live_version;
Update a MOD installation
use Bio::GMOD::Update;
my $mod = Bio::GMOD::Update->new(-mod=>WormBase);
$gmod->update();
Fetch a list of genes from a MOD
use Bio::GMOD::Query;
my $mod = Bio::GMOD::Query->new(-mod=>WormBase);
my @genes = $mod->fetch(-class=>Gene,-name=>unc-26);
Bio::GMOD is a unified API for accessing various Model Organism Databases. It is a part of the Generic Model Organism Database project, as well as distributed on CPAN.
MODs are highly curated resources of biological data. Although they typically incorporate sequence data housed at community repositories such as NCBI, they place this information within a framework of biological fuction gelaned from the published literature of experiments in model organisms.
Given the great proliferation of MODs, cross-site data mining strategies have been difficult to implement. Such strategies typically require a familiarity with both the underlying data model and the historical vocabulary of the model system.
Furthermore, the quickly-evolving nature of these projects have made installing a MOD locally and keeping it up-to-date a delicate and time-consuming experience.
<<lessSYNOPSIS
Check the installed version of a MOD
use Bio::GMOD::Util::CheckVersions.pm
my $mod = Bio::GMOD::Util::CheckVersions->new(-mod=>WormBase);
my $version = $mod->live_version;
Update a MOD installation
use Bio::GMOD::Update;
my $mod = Bio::GMOD::Update->new(-mod=>WormBase);
$gmod->update();
Fetch a list of genes from a MOD
use Bio::GMOD::Query;
my $mod = Bio::GMOD::Query->new(-mod=>WormBase);
my @genes = $mod->fetch(-class=>Gene,-name=>unc-26);
Bio::GMOD is a unified API for accessing various Model Organism Databases. It is a part of the Generic Model Organism Database project, as well as distributed on CPAN.
MODs are highly curated resources of biological data. Although they typically incorporate sequence data housed at community repositories such as NCBI, they place this information within a framework of biological fuction gelaned from the published literature of experiments in model organisms.
Given the great proliferation of MODs, cross-site data mining strategies have been difficult to implement. Such strategies typically require a familiarity with both the underlying data model and the historical vocabulary of the model system.
Furthermore, the quickly-evolving nature of these projects have made installing a MOD locally and keeping it up-to-date a delicate and time-consuming experience.
Download (0.070MB)
Added: 2006-10-10 License: Perl Artistic License Price:
1137 downloads
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
File::Find::Closures 1.06
File::Find::Closures is a Perl module with functions you can use with File::Find. more>>
File::Find::Closures is a Perl module with functions you can use with File::Find.
SYNOPSIS
use File::Find;
use File::Find::Closures qw(:all);
my( $wanted, $list_reporter ) = find_by_name( qw(README) );
File::Find::find( $wanted, @directories );
File::Find::find( { wanted => $wanted, ... }, @directories );
my @readmes = $list_reporter->();
SOME PARTS ARE NOT IMPLEMENTED YET! THIS IS ALPHA ALPHA SOFTWARE: A MERE SHELL OF AN IDEA.
I wrote this module as an example of both using closures and using File::Find. Students are always asking me what closures are good for, and heres some examples. The functions mostly stand alone (i.e. they dont need the rest of the module), so rather than creating a dependency in your code, just lift the parts you want).
When I use File::Find, I have two headaches---coming up with the &wanted function to pass to find(), and acculumating the files.
This module provides the &wanted functions as a closures that I can pass directly to find(). Actually, for each pre-made closure, I provide a closure to access the list of files too, so I dont have to create a new array to hold the results.
The filenames are the full path to the file as reported by File::Find.
Unless otherwise noted, the reporter closure returns a list of the filenames in list context and an anonymous array that is a copy (not a reference) of the original list. The filenames have been normalized by File::Spec::canonfile unless otherwise noted. The list of files has been processed by File::Spec::no_upwards so that "." and ".." (or their equivalents) do not show up in the list.
<<lessSYNOPSIS
use File::Find;
use File::Find::Closures qw(:all);
my( $wanted, $list_reporter ) = find_by_name( qw(README) );
File::Find::find( $wanted, @directories );
File::Find::find( { wanted => $wanted, ... }, @directories );
my @readmes = $list_reporter->();
SOME PARTS ARE NOT IMPLEMENTED YET! THIS IS ALPHA ALPHA SOFTWARE: A MERE SHELL OF AN IDEA.
I wrote this module as an example of both using closures and using File::Find. Students are always asking me what closures are good for, and heres some examples. The functions mostly stand alone (i.e. they dont need the rest of the module), so rather than creating a dependency in your code, just lift the parts you want).
When I use File::Find, I have two headaches---coming up with the &wanted function to pass to find(), and acculumating the files.
This module provides the &wanted functions as a closures that I can pass directly to find(). Actually, for each pre-made closure, I provide a closure to access the list of files too, so I dont have to create a new array to hold the results.
The filenames are the full path to the file as reported by File::Find.
Unless otherwise noted, the reporter closure returns a list of the filenames in list context and an anonymous array that is a copy (not a reference) of the original list. The filenames have been normalized by File::Spec::canonfile unless otherwise noted. The list of files has been processed by File::Spec::no_upwards so that "." and ".." (or their equivalents) do not show up in the list.
Download (0.007MB)
Added: 2007-04-26 License: Perl Artistic License Price:
911 downloads
MP3::Find::Filesystem 0.06
MP3::Find::Filesystem is a File::Find-based backend to MP3::Find. more>>
MP3::Find::Filesystem is a File::Find-based backend to MP3::Find.
SYNOPSIS
use MP3::Find::Filesystem;
my $finder = MP3::Find::Filesystem->new;
my @mp3s = $finder->find_mp3s(
dir => /home/peter/music,
query => {
artist => ilyaimy,
album => myxomatosis,
},
ignore_case => 1,
);
<<lessSYNOPSIS
use MP3::Find::Filesystem;
my $finder = MP3::Find::Filesystem->new;
my @mp3s = $finder->find_mp3s(
dir => /home/peter/music,
query => {
artist => ilyaimy,
album => myxomatosis,
},
ignore_case => 1,
);
Download (0.029MB)
Added: 2006-11-09 License: Perl Artistic License Price:
1080 downloads
Objectrefenceanalyser 1.01
Objectrefenceanalyser (ora) helps developers find bugs or design errors by showing Java object references in an easy way. more>>
Objectrefenceanalyser (ora) helps developers find bugs or design errors by showing Java object references in an easy way.
It can be plugged into other programs for taking and saving "snapshots" of the object model at runtime for analysis.
<<lessIt can be plugged into other programs for taking and saving "snapshots" of the object model at runtime for analysis.
Download (0.34MB)
Added: 2007-08-07 License: LGPL (GNU Lesser General Public License) Price:
811 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
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 to find my biological mother 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