list print
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 5220
ADDRESS LIST print web.de dict one slide 0.3
ADDRESS LIST print web.de dict one slide allows users of web.de can print up to 85 addresses on one sheet of paper! more>>
ADDRESS LIST print web.de dict one slide allows users of web.de can print up to 85 addresses on one sheet of paper!
If you use the printing function of web.de, you get a lot of pages to print but never all informations stored before. It is much more convenient to have all informations on one sheet of paper!
How to install:
1 download adl.tar.bz2
2 unpack adl.tar.bz2 to a directory adl
3 cd (place of the directory of adl)
4 ./configure
5 make
6 make install (as root)
How to use:
1. Search in-/export of adresses
2. press export
3. choose "open" (only first time)
4. choose "open with" (only first time)
5. open with "adl", mark every time
6 print page 3-4
How to uninstall
- make uninstall (as root)
Enhancements:
New:
- i18n (translations now possible, if you like to translate, please mail!)
- Lines filled with dots now => easier to find entries which belong together
- mapping of text/x-csv to Address List => open Adress List with right click is possible
- you can change in code if you prefere text alignment center (default) or left
Much better (V 0.2):
- code cleanup
- again: improved Handbook - read it!!!
<<lessIf you use the printing function of web.de, you get a lot of pages to print but never all informations stored before. It is much more convenient to have all informations on one sheet of paper!
How to install:
1 download adl.tar.bz2
2 unpack adl.tar.bz2 to a directory adl
3 cd (place of the directory of adl)
4 ./configure
5 make
6 make install (as root)
How to use:
1. Search in-/export of adresses
2. press export
3. choose "open" (only first time)
4. choose "open with" (only first time)
5. open with "adl", mark every time
6 print page 3-4
How to uninstall
- make uninstall (as root)
Enhancements:
New:
- i18n (translations now possible, if you like to translate, please mail!)
- Lines filled with dots now => easier to find entries which belong together
- mapping of text/x-csv to Address List => open Adress List with right click is possible
- you can change in code if you prefere text alignment center (default) or left
Much better (V 0.2):
- code cleanup
- again: improved Handbook - read it!!!
Download (1.3MB)
Added: 2006-09-29 License: GPL (GNU General Public License) Price:
1120 downloads
List::Part 0.03
List::Part is a Perl module that allows you to partition one array into several. more>>
List::Part is a Perl module that allows you to partition one array into several.
SYNOPSIS
use List::Part;
($good, $bad)=part { !/substring/ } @array; #store arrayrefs into $good and $bad
(*good, *bad)=part { !/substring/ } @array; #store into @good and @bad
ABSTRACT
List::Part implements the part function, allowing one array to be "partitioned" into several based on the results of a code reference.
There are many applications in which the items of a list need to be categorized. For example, lets say you want to categorize lines in a log file:
my($success, $failure)=part { /^ERR/ } ;
Or, suppose you have a list of employees, and you need to determine their fate:
my($lay_off, $give_raise, $keep)=part {
$_->is_talented ? 0
: $_->is_executive ? 1
: 2
} @employees;
Actually, the second one is better suited to parts alternate form, parta:
my($lay_off, $give_raise, $keep)=parta
[ sub { $_->talented }, sub { $_->is_executive }, qr// ] =>
@employees;
Or maybe you just want yet another way to write the traditional Perl signoff:
perl -MList::Part -e"print map{@$_}part{$i++%5}split,JAercunrlkso ettPHr hea,"
List::Part can help you do those sorts of things.
<<lessSYNOPSIS
use List::Part;
($good, $bad)=part { !/substring/ } @array; #store arrayrefs into $good and $bad
(*good, *bad)=part { !/substring/ } @array; #store into @good and @bad
ABSTRACT
List::Part implements the part function, allowing one array to be "partitioned" into several based on the results of a code reference.
There are many applications in which the items of a list need to be categorized. For example, lets say you want to categorize lines in a log file:
my($success, $failure)=part { /^ERR/ } ;
Or, suppose you have a list of employees, and you need to determine their fate:
my($lay_off, $give_raise, $keep)=part {
$_->is_talented ? 0
: $_->is_executive ? 1
: 2
} @employees;
Actually, the second one is better suited to parts alternate form, parta:
my($lay_off, $give_raise, $keep)=parta
[ sub { $_->talented }, sub { $_->is_executive }, qr// ] =>
@employees;
Or maybe you just want yet another way to write the traditional Perl signoff:
perl -MList::Part -e"print map{@$_}part{$i++%5}split,JAercunrlkso ettPHr hea,"
List::Part can help you do those sorts of things.
Download (0.004MB)
Added: 2007-05-18 License: Perl Artistic License Price:
889 downloads
list files 0.2
list files package prints to file list of files in a given directory. more>>
list files package prints to file list of files in a given directory.
Handy if youd like to, say, tell a friend of yours what ebooks you have, and wouldnt feel like typing them all by hand.
Hope you can find it useful.
INSTALLATION
i assume youve got everything in its standard places; otherwise you probably know what to do anyway.
to install for one user
copy listFiles.desktop to ~/.kde/share/apps/konqueror/servicemenus
copy listFiles.sh to /usr/local/bin or elsewhere in the path
to install for all users
copy listFiles.desktop to /usr/share/apps/konqueror/servicemenus
copy listFiles.sh to /usr/local/bin or elsewhere in the path
Enhancements:
- added counting the number of items
- added the possibility to change the place where the listing is written to
- some minor changes to the code
<<lessHandy if youd like to, say, tell a friend of yours what ebooks you have, and wouldnt feel like typing them all by hand.
Hope you can find it useful.
INSTALLATION
i assume youve got everything in its standard places; otherwise you probably know what to do anyway.
to install for one user
copy listFiles.desktop to ~/.kde/share/apps/konqueror/servicemenus
copy listFiles.sh to /usr/local/bin or elsewhere in the path
to install for all users
copy listFiles.desktop to /usr/share/apps/konqueror/servicemenus
copy listFiles.sh to /usr/local/bin or elsewhere in the path
Enhancements:
- added counting the number of items
- added the possibility to change the place where the listing is written to
- some minor changes to the code
Download (0.002MB)
Added: 2007-02-13 License: GPL (GNU General Public License) Price:
581 downloads
libgnomeprint 2.18.1
libgnomeprint is a Gnome printing library. more>>
libgnomeprint is a Gnome printing library.
This is an implementation of the Gnome Printing Architecture, as described in:
http://www.levien.com/gnome/print-arch.html
An updated description of gnome-print and future plans can be found in :
http://www.levien.com/gnome/print-summit-2000.htm
We have a mailing list setup:
gnome-print@gnome.org
Overview
1. Imaging
Gnome-print uses semi-standard PostScript imaging model. I.e. all
shapes are described as sequences of path commands (moveto, lineto
curveto, closepath) and images created through fill and stroke
operators.
2. Coordinates
The initial coordinate system is identical to the PostScript one,
i.e. unit is 1 typographic point and y grows upwards on the page.
Coordinate system can be modified, using concat operator.
3. Graphic state
Graphic state is manipulated through usual operators, like
setrgbcolor, setopacity, setlinewidth. There are gsave and grestore
operators that manipulate graphic state stack.
Currently the only supported colorspace is RGB, as we have yet to
figure out the patent issues involved in CMYK and other colorspaces.
4. Text
There are 2 primary text operators. The simpler one (show) accepts
UTF-8 encoded string, and outputs it as well as possible using
current font from graphic state.
The other one (glyphlist) accepts device idependently formatted
sequence of glyphs - i.e. user program should do exact layout and
languge analyzing itself. Glyphlist can include glyphs from different
fonts, use different colors and position glyphs either in
predetermined coordinates or use simple font-specific positioning
rules (glyph advances for latin-like fonts).
5. Fonts
Gnome-print uses type1 fonts for all rendering, so printed output
is always identical to onscreen preview.
Enhancements:
- Fix a crash in Gedit caused by a typo. (Jeremy Messenger, Joe Marcus Clarke)
- Fix compiler warnings (Damien Carberry, Michael Wolf)
Updated translations:
- fi (Ilkka Tuohela)
- ga (Ignacio Casal Quinteiro)
- si (Danishka Navin)
- ta (Tirumurthi Vasudevan)
- vi (Pham Thanh Long)
<<lessThis is an implementation of the Gnome Printing Architecture, as described in:
http://www.levien.com/gnome/print-arch.html
An updated description of gnome-print and future plans can be found in :
http://www.levien.com/gnome/print-summit-2000.htm
We have a mailing list setup:
gnome-print@gnome.org
Overview
1. Imaging
Gnome-print uses semi-standard PostScript imaging model. I.e. all
shapes are described as sequences of path commands (moveto, lineto
curveto, closepath) and images created through fill and stroke
operators.
2. Coordinates
The initial coordinate system is identical to the PostScript one,
i.e. unit is 1 typographic point and y grows upwards on the page.
Coordinate system can be modified, using concat operator.
3. Graphic state
Graphic state is manipulated through usual operators, like
setrgbcolor, setopacity, setlinewidth. There are gsave and grestore
operators that manipulate graphic state stack.
Currently the only supported colorspace is RGB, as we have yet to
figure out the patent issues involved in CMYK and other colorspaces.
4. Text
There are 2 primary text operators. The simpler one (show) accepts
UTF-8 encoded string, and outputs it as well as possible using
current font from graphic state.
The other one (glyphlist) accepts device idependently formatted
sequence of glyphs - i.e. user program should do exact layout and
languge analyzing itself. Glyphlist can include glyphs from different
fonts, use different colors and position glyphs either in
predetermined coordinates or use simple font-specific positioning
rules (glyph advances for latin-like fonts).
5. Fonts
Gnome-print uses type1 fonts for all rendering, so printed output
is always identical to onscreen preview.
Enhancements:
- Fix a crash in Gedit caused by a typo. (Jeremy Messenger, Joe Marcus Clarke)
- Fix compiler warnings (Damien Carberry, Michael Wolf)
Updated translations:
- fi (Ilkka Tuohela)
- ga (Ignacio Casal Quinteiro)
- si (Danishka Navin)
- ta (Tirumurthi Vasudevan)
- vi (Pham Thanh Long)
Download (1.1MB)
Added: 2007-08-08 License: LGPL (GNU Lesser General Public License) Price:
807 downloads
Photo Grid Print 0.2
Photo Grid Print is a software which can print photos in a grid on a single page. more>>
Photo Grid Print is a software which can print photos in a grid on a single page.
Photo Grid Print is a dialog window that lets you print a set of photos in a grid on a single page. You set the number of rows and columns in the grid. It figures out an efficient layout to maximize the photo size and minimize the paper used, rotating photos as needed. You can tell it to fill the page with your photo(s), repeating them as needed.
Once installed, the dialog is started by selecting some photos in the Gnome file manager (nautilus) or in the F-Spot application: right-click > Open With... > Open with Photo Grid Print.
Photo Grid Print was eritten using Python, GTK+ and Glade.
<<lessPhoto Grid Print is a dialog window that lets you print a set of photos in a grid on a single page. You set the number of rows and columns in the grid. It figures out an efficient layout to maximize the photo size and minimize the paper used, rotating photos as needed. You can tell it to fill the page with your photo(s), repeating them as needed.
Once installed, the dialog is started by selecting some photos in the Gnome file manager (nautilus) or in the F-Spot application: right-click > Open With... > Open with Photo Grid Print.
Photo Grid Print was eritten using Python, GTK+ and Glade.
Download (0.005MB)
Added: 2007-03-02 License: MIT/X Consortium License Price:
974 downloads
DNS List 0.2
DNS List is a BIND zone file -to- HTML script written in PHP which enables drilling down on particular hosts to view CNAME. more>>
DNS List is a BIND zone file -to- HTML script written in PHP which enables drilling down on particular hosts to view CNAME records (if any).
In order to display an easily readable list of entries hosted on my DNS servers, I wrote this PHP script to parse A and CNAME records out of my BIND zone files, and generate an expandable/collapsable table containing the information.
This script expects to find the zonefile in a zonefile subdirectory of the directory in which the script currently resides. Again this is easy to change, but it was written for my purposes and Im providing it here should it be useful to others. There is a lot of hard-coding within the script for "kw.zone" and "test.zone" - so modify this to suit your needs. The script can parse fairly simple zone files easily, but hasnt been tested with more complex zones. Your milage will vary.
<<lessIn order to display an easily readable list of entries hosted on my DNS servers, I wrote this PHP script to parse A and CNAME records out of my BIND zone files, and generate an expandable/collapsable table containing the information.
This script expects to find the zonefile in a zonefile subdirectory of the directory in which the script currently resides. Again this is easy to change, but it was written for my purposes and Im providing it here should it be useful to others. There is a lot of hard-coding within the script for "kw.zone" and "test.zone" - so modify this to suit your needs. The script can parse fairly simple zone files easily, but hasnt been tested with more complex zones. Your milage will vary.
Download (0.004MB)
Added: 2007-03-12 License: GPL (GNU General Public License) Price:
566 downloads
List::RewriteElements 0.09
List::RewriteElements is a Perl module that can create a new list by rewriting elements of a first list. more>>
List::RewriteElements is a Perl module that can create a new list by rewriting elements of a first list.
SYNOPSIS
use List::RewriteElements;
Constructor
Simplest case: Input from array, output to STDOUT.
$lre = List::RewriteElements->new( {
list => @source,
body_rule => sub {
my $record = shift;
$record .= q{additional field};
},
} );
Input from file, output to STDOUT:
$lre = List::RewriteElements->new( {
file => "/path/to/source/file",
body_rule => sub {
my $record = shift;
$record .= q{,additional field};
},
} );
Provide a different rule for the first element in the list:
$lre = List::RewriteElements->new( {
file => "/path/to/source/file",
header_rule => sub {
my $record = shift;
$record .= q{,ADDITIONAL HEADER};
},
body_rule => sub {
my $record = shift;
$record .= q{,additional field};
},
} );
Input from file, output to file:
$lre = List::RewriteElements->new( {
file => "/path/to/source/file",
body_rule => sub {
my $record = shift;
$record .= q{additional field};
},
output_file => "/path/to/output/file",
} );
To name output file, just provide a suffix to filename:
$lre = List::RewriteElements->new( {
file => "/path/to/source/file",
body_rule => sub {
my $record = shift;
$record .= q{additional field};
},
output_suffix => .out,
} );
Provide criteria to suppress output of header or individual record.
$lre = List::RewriteElements->new( {
file => "/path/to/source/file",
header_suppress => sub {
my $record = shift;
return if $record =~ /$somepattern/;
},
body_suppress => sub {
my $record = shift;
return if $record ne somestring;
},
body_rule => sub {
my $record = shift;
$record .= q{additional field};
},
} );
Generate Output
$lre->generate_output();
Report Output Information
$path_to_output_file = $lre->get_output_path();
$output_file_basename = $lre->get_output_basename();
$output_row_count = $lre->get_total_rows();
$output_record_count = $lre->get_total_records();
$records_changed = $lre->get_records_changed();
$records_unchanged = $lre->get_records_unchanged();
$records_deleted = $lre->get_records_deleted();
$header_status = $lre->get_header_status();
It is common in many situations for you to receive a flat data file from someone else and have to generate a new file in which each row or record in the incoming file must either (a) be transformed according to some rule before being printing to the new file; or (b) if it meets certain criteria, not output to the new file at all.
List::RewriteElements enables you to write such rules and criteria, generate the file of transformed data records, and get back some basic statistics about the transformation.
List::RewriteElements is useful when the number of records in the incoming file may be large and you do not want to hold the entire list in memory. Similarly, the newly generated records are not held in memory but are immediately printed to STDOUT or to file.
On the other hand, if for some reason you already have an array of records in memory, you can use List::RewriteElements to apply rules and criteria to each element of the array and then print the transformed records (again, without holding the output in memory).
<<lessSYNOPSIS
use List::RewriteElements;
Constructor
Simplest case: Input from array, output to STDOUT.
$lre = List::RewriteElements->new( {
list => @source,
body_rule => sub {
my $record = shift;
$record .= q{additional field};
},
} );
Input from file, output to STDOUT:
$lre = List::RewriteElements->new( {
file => "/path/to/source/file",
body_rule => sub {
my $record = shift;
$record .= q{,additional field};
},
} );
Provide a different rule for the first element in the list:
$lre = List::RewriteElements->new( {
file => "/path/to/source/file",
header_rule => sub {
my $record = shift;
$record .= q{,ADDITIONAL HEADER};
},
body_rule => sub {
my $record = shift;
$record .= q{,additional field};
},
} );
Input from file, output to file:
$lre = List::RewriteElements->new( {
file => "/path/to/source/file",
body_rule => sub {
my $record = shift;
$record .= q{additional field};
},
output_file => "/path/to/output/file",
} );
To name output file, just provide a suffix to filename:
$lre = List::RewriteElements->new( {
file => "/path/to/source/file",
body_rule => sub {
my $record = shift;
$record .= q{additional field};
},
output_suffix => .out,
} );
Provide criteria to suppress output of header or individual record.
$lre = List::RewriteElements->new( {
file => "/path/to/source/file",
header_suppress => sub {
my $record = shift;
return if $record =~ /$somepattern/;
},
body_suppress => sub {
my $record = shift;
return if $record ne somestring;
},
body_rule => sub {
my $record = shift;
$record .= q{additional field};
},
} );
Generate Output
$lre->generate_output();
Report Output Information
$path_to_output_file = $lre->get_output_path();
$output_file_basename = $lre->get_output_basename();
$output_row_count = $lre->get_total_rows();
$output_record_count = $lre->get_total_records();
$records_changed = $lre->get_records_changed();
$records_unchanged = $lre->get_records_unchanged();
$records_deleted = $lre->get_records_deleted();
$header_status = $lre->get_header_status();
It is common in many situations for you to receive a flat data file from someone else and have to generate a new file in which each row or record in the incoming file must either (a) be transformed according to some rule before being printing to the new file; or (b) if it meets certain criteria, not output to the new file at all.
List::RewriteElements enables you to write such rules and criteria, generate the file of transformed data records, and get back some basic statistics about the transformation.
List::RewriteElements is useful when the number of records in the incoming file may be large and you do not want to hold the entire list in memory. Similarly, the newly generated records are not held in memory but are immediately printed to STDOUT or to file.
On the other hand, if for some reason you already have an array of records in memory, you can use List::RewriteElements to apply rules and criteria to each element of the array and then print the transformed records (again, without holding the output in memory).
Download (0.026MB)
Added: 2007-07-10 License: Perl Artistic License Price:
837 downloads
Holodeck10 Image Print 1.2
Holodeck10 The purpose of the application allows the user to lay out images to be printed. more>>
Holodeck10 is built using JAVA for the Linux Operating system. Holodeck10 Image Print utilizes the log4j package from the Free Software Foundation (www.apache.org) to facilitate logging of debuging information.
The project takes advantage of the ImageIO class to reduce the memory consumption associated with processing images. The Concurrent package that is now included with JAVA 1.5 is utilized to handle multi-threading of the processing.
Holodeck10 allows the user to select images to be set on a standard LETTER sized page to be printed in either LANDSCAPE or PORTRAIT orientation and then printed. The current version supports layouts of 1x1, 1x2, 2x2, 2x3, 4x5, and 6x8 in either LANDSCAPE or PORTRAIT.
The software uses a filechooser with a filefilter to display the image files that are available. Currently the filefilter allows for the selection of *.gif, *.jpg, *.jpeg, *.xcf, *.xpm, and *.png files.
The SimpleDocument interface in JAVA is used to format the page for printing.
<<lessThe project takes advantage of the ImageIO class to reduce the memory consumption associated with processing images. The Concurrent package that is now included with JAVA 1.5 is utilized to handle multi-threading of the processing.
Holodeck10 allows the user to select images to be set on a standard LETTER sized page to be printed in either LANDSCAPE or PORTRAIT orientation and then printed. The current version supports layouts of 1x1, 1x2, 2x2, 2x3, 4x5, and 6x8 in either LANDSCAPE or PORTRAIT.
The software uses a filechooser with a filefilter to display the image files that are available. Currently the filefilter allows for the selection of *.gif, *.jpg, *.jpeg, *.xcf, *.xpm, and *.png files.
The SimpleDocument interface in JAVA is used to format the page for printing.
Download (1.1MB)
Added: 2006-12-21 License: GPL (GNU General Public License) Price:
1038 downloads
List::Intersperse 1.00
List::Intersperse Perl module can intersperse / unsort / disperse a list. more>>
List::Intersperse Perl module can intersperse / unsort / disperse a list.
SYNOPSIS
use List::Intersperse qw/intersperseq/;
@ispersed = intersperseq {substr($_[0],0,1)} qw/A1 A2 B1 B2 C1 C2/;
@ispersed = List::Intersperse::intersperse qw/A A B B B B B B C/;
intersperse and intersperseq evenly distribute elements of a list. Elements that are considered equal are spaced as far apart from each other as possible.
FUNCTIONS
intersperse LIST
This function returns a list of elements interspersed so that equivalent items are evenly distributed throughout the list.
intersperseq BLOCK LIST
intersperseq works like intersperse but it applies BLOCK to the elements of LIST to determine the equivalance key.
<<lessSYNOPSIS
use List::Intersperse qw/intersperseq/;
@ispersed = intersperseq {substr($_[0],0,1)} qw/A1 A2 B1 B2 C1 C2/;
@ispersed = List::Intersperse::intersperse qw/A A B B B B B B C/;
intersperse and intersperseq evenly distribute elements of a list. Elements that are considered equal are spaced as far apart from each other as possible.
FUNCTIONS
intersperse LIST
This function returns a list of elements interspersed so that equivalent items are evenly distributed throughout the list.
intersperseq BLOCK LIST
intersperseq works like intersperse but it applies BLOCK to the elements of LIST to determine the equivalance key.
Download (0.002MB)
Added: 2007-07-19 License: Perl Artistic License Price:
827 downloads
Dir::List 1.4
Dir::List is a Perl module, that provides you with various information about a specified directory. more>>
Dir::List is a Perl module, that provides you with various information about a specified directory. For example, it can obtain the user and group of files, the sizes of sub-directories, the filetype, and accessibility. Caching functionality is available.
Enhancements:
- The unmaintained Changes has been removed.
- Some missing requirements have been added.
- This release deletes $self->{list} at the beginning of dirinfo, in order to not return old results (this is especially a problem in mod_perl where you only instantiate one Dir::List).
<<lessEnhancements:
- The unmaintained Changes has been removed.
- Some missing requirements have been added.
- This release deletes $self->{list} at the beginning of dirinfo, in order to not return old results (this is especially a problem in mod_perl where you only instantiate one Dir::List).
Download (0.006MB)
Added: 2006-08-18 License: Perl Artistic License Price:
1164 downloads
List::Compare 0.33
List::Compare is a Perl module to compare elements of two or more lists. more>>
List::Compare is a Perl module to compare elements of two or more lists.
SYNOPSIS
The bare essentials:
@Llist = qw(abel abel baker camera delta edward fargo golfer);
@Rlist = qw(baker camera delta delta edward fargo golfer hilton);
$lc = List::Compare->new(@Llist, @Rlist);
@intersection = $lc->get_intersection;
@union = $lc->get_union;
General Comments
List::Compare is an object-oriented implementation of very common Perl code (see "History, References and Development" below) used to determine interesting relationships between two or more lists at a time. A List::Compare object is created and automatically computes the values needed to supply List::Compare methods with appropriate results. In the current implementation List::Compare methods will return new lists containing the items found in any designated list alone (unique), any list other than a designated list (complement), the intersection and union of all lists and so forth. List::Compare also has (a) methods to return Boolean values indicating whether one list is a subset of another and whether any two lists are equivalent to each other (b) methods to pretty-print very simple charts displaying the subset and equivalence relationships among lists.
Except for List::Compares get_bag() method, multiple instances of an element in a given list count only once with respect to computing the intersection, union, etc. of the two lists. In particular, List::Compare considers two lists as equivalent if each element of the first list can be found in the second list and vice versa. Equivalence in this usage takes no note of the frequency with which elements occur in either list or their order within the lists. List::Compare asks the question: Did I see this item in this list at all? Only when you use List::Compare::get_bag() to compute a bag holding the two lists do you ask the question: How many times did this item occur in this list?
<<lessSYNOPSIS
The bare essentials:
@Llist = qw(abel abel baker camera delta edward fargo golfer);
@Rlist = qw(baker camera delta delta edward fargo golfer hilton);
$lc = List::Compare->new(@Llist, @Rlist);
@intersection = $lc->get_intersection;
@union = $lc->get_union;
General Comments
List::Compare is an object-oriented implementation of very common Perl code (see "History, References and Development" below) used to determine interesting relationships between two or more lists at a time. A List::Compare object is created and automatically computes the values needed to supply List::Compare methods with appropriate results. In the current implementation List::Compare methods will return new lists containing the items found in any designated list alone (unique), any list other than a designated list (complement), the intersection and union of all lists and so forth. List::Compare also has (a) methods to return Boolean values indicating whether one list is a subset of another and whether any two lists are equivalent to each other (b) methods to pretty-print very simple charts displaying the subset and equivalence relationships among lists.
Except for List::Compares get_bag() method, multiple instances of an element in a given list count only once with respect to computing the intersection, union, etc. of the two lists. In particular, List::Compare considers two lists as equivalent if each element of the first list can be found in the second list and vice versa. Equivalence in this usage takes no note of the frequency with which elements occur in either list or their order within the lists. List::Compare asks the question: Did I see this item in this list at all? Only when you use List::Compare::get_bag() to compute a bag holding the two lists do you ask the question: How many times did this item occur in this list?
Download (0.18MB)
Added: 2007-01-23 License: Perl Artistic License Price:
1007 downloads
List::MRU 0.04
List::MRU is a Perl module that implements a simple fixed-size MRU-ordered list. more>>
List::MRU is a Perl module that implements a simple fixed-size MRU-ordered list.
SYNOPSIS
use List::MRU;
# Constructor
$lm = List::MRU->new(max => 20);
# Constructor with explicit eq subroutine for obj equality tests
$lm = List::MRU->new(max => 20, eq => sub {
$_[0]->stringify eq $_[1]->stringify
});
# Constructor using explicit UUIDs
$lm - List::MRU->new(max => 5, uuid => 1);
# Add item, moving to head of list if already exists
$lm->add($item);
# Add item, moving to head of list if $uuid matches or object already exists
$lm->add($item, $uuid);
# Iterate in most-recently-added order
for $item ($lm->list) {
print "$itemn";
}
# each-style iteration
while (($item, $uuid) = $lm->each) {
print "$item, $uuidn";
}
# Item deletion
$lm->delete($item);
$lm->delete(uuid => $uuid);
# Accessors
$max = $lm->max; # max items in list
$count = $lm->count; # current items in list
Perl module implementing a simple fixed-size most-recently-used- (MRU)-ordered list of values/objects. Well, really its a most- recently-added list - items added to the list are just promoted to the front of the list if they already exist, otherwise they are added there.
Works fine with with non-scalar items, but you will need to supply an explicit eq subroutine to the constructor to handle testing for the same object (or alternatively have overloaded the eq operator for your object).
List::MRU also supports having explicit UUIDs attached to items, allowing List::MRU items to be modified, instead of a change just creating a new entry.
<<lessSYNOPSIS
use List::MRU;
# Constructor
$lm = List::MRU->new(max => 20);
# Constructor with explicit eq subroutine for obj equality tests
$lm = List::MRU->new(max => 20, eq => sub {
$_[0]->stringify eq $_[1]->stringify
});
# Constructor using explicit UUIDs
$lm - List::MRU->new(max => 5, uuid => 1);
# Add item, moving to head of list if already exists
$lm->add($item);
# Add item, moving to head of list if $uuid matches or object already exists
$lm->add($item, $uuid);
# Iterate in most-recently-added order
for $item ($lm->list) {
print "$itemn";
}
# each-style iteration
while (($item, $uuid) = $lm->each) {
print "$item, $uuidn";
}
# Item deletion
$lm->delete($item);
$lm->delete(uuid => $uuid);
# Accessors
$max = $lm->max; # max items in list
$count = $lm->count; # current items in list
Perl module implementing a simple fixed-size most-recently-used- (MRU)-ordered list of values/objects. Well, really its a most- recently-added list - items added to the list are just promoted to the front of the list if they already exist, otherwise they are added there.
Works fine with with non-scalar items, but you will need to supply an explicit eq subroutine to the constructor to handle testing for the same object (or alternatively have overloaded the eq operator for your object).
List::MRU also supports having explicit UUIDs attached to items, allowing List::MRU items to be modified, instead of a change just creating a new entry.
Download (0.004MB)
Added: 2007-05-18 License: Perl Artistic License Price:
889 downloads
Notes List 0.1
Notes List is a simple and easy way to take Notes. more>>
Notes List is a simple and easy way to take Notes.
- Change SIZE (width and height)
- tun on/off the background image
- Auto save notes
<<less- Change SIZE (width and height)
- tun on/off the background image
- Auto save notes
Download (0.020MB)
Added: 2006-06-28 License: GPL (GNU General Public License) Price:
1219 downloads
List::Pairwise 0.23
List::Pairwise is a Perl module with map/grep arrays and hashes pairwise. more>>
List::Pairwise is a Perl module with map/grep arrays and hashes pairwise.
SYNOPSIS
use List::Pairwise qw(:all);
my %a = (
snoogy1 => 4,
snoogy2 => 2,
NOT => 4,
snoogy3 => 5,
hehe => 12,
);
# keys/values emulation (only slower)
my @keys = mapp {$a} %a;
my @values = mapp {$b} %a;
# reverse hash (does not work in-place)
my %reverse_a = mapp {$b, $a} %a;
# reverse array pairs in-place
my @a = %a;
mapp { ($a, $b) = ($b, $a) } @a;
# modify values in-place
mapp {$b++} %a;
# modify keys (does not work in-place)
my %b = mapp {lc($a) => $b} %a;
# grep hash subset
my %subset1 = grepp {$a =~ /snoogy/} %a;
my %subset2 = grepp {$b < 5} %a;
# grep some specific values
my @snoog_values = mapp {$b} grepp {$a =~ /snoogy/} %a;
# This does not work:
# values grepp {$a =~ /snoogy/} %a; # values() expects a real hash
<<lessSYNOPSIS
use List::Pairwise qw(:all);
my %a = (
snoogy1 => 4,
snoogy2 => 2,
NOT => 4,
snoogy3 => 5,
hehe => 12,
);
# keys/values emulation (only slower)
my @keys = mapp {$a} %a;
my @values = mapp {$b} %a;
# reverse hash (does not work in-place)
my %reverse_a = mapp {$b, $a} %a;
# reverse array pairs in-place
my @a = %a;
mapp { ($a, $b) = ($b, $a) } @a;
# modify values in-place
mapp {$b++} %a;
# modify keys (does not work in-place)
my %b = mapp {lc($a) => $b} %a;
# grep hash subset
my %subset1 = grepp {$a =~ /snoogy/} %a;
my %subset2 = grepp {$b < 5} %a;
# grep some specific values
my @snoog_values = mapp {$b} grepp {$a =~ /snoogy/} %a;
# This does not work:
# values grepp {$a =~ /snoogy/} %a; # values() expects a real hash
Download (0.020MB)
Added: 2007-05-18 License: Perl Artistic License Price:
889 downloads
List::MoreUtils 0.22
List::MoreUtils is a Perl module that can provide the stuff missing in List::Util. more>>
List::MoreUtils is a Perl module that can provide the stuff missing in List::Util.
SYNOPSIS
use List::MoreUtils qw(any all none notall true false firstidx first_index
lastidx last_index insert_after insert_after_string
apply after after_incl before before_incl indexes
firstval first_value lastval last_value each_array
each_arrayref pairwise natatime mesh zip uniq minmax);
List::MoreUtils provides some trivial but commonly needed functionality on lists which is not going to go into List::Util.
All of the below functions are implementable in only a couple of lines of Perl code. Using the functions from this module however should give slightly better performance as everything is implemented in C. The pure-Perl implementation of these functions only serves as a fallback in case the C portions of this module couldnt be compiled on this machine.
any BLOCK LIST
Returns a true value if any item in LIST meets the criterion given through BLOCK. Sets $_ for each item in LIST in turn:
print "At least one value undefined"
if any { !defined($_) } @list;
Returns false otherwise, or undef if LIST is empty.
all BLOCK LIST
Returns a true value if all items in LIST meet the criterion given through BLOCK. Sets $_ for each item in LIST in turn:
print "All items defined"
if all { defined($_) } @list;
Returns false otherwise, or undef if LIST is empty.
none BLOCK LIST
Logically the negation of any. Returns a true value if no item in LIST meets the criterion given through BLOCK. Sets $_ for each item in LIST in turn:
print "No value defined"
if none { defined($_) } @list;
Returns false otherwise, or undef if LIST is empty.
notall BLOCK LIST
Logically the negation of all. Returns a true value if not all items in LIST meet the criterion given through BLOCK. Sets $_ for each item in LIST in turn:
print "Not all values defined"
if notall { defined($_) } @list;
Returns false otherwise, or undef if LIST is empty.
true BLOCK LIST
Counts the number of elements in LIST for which the criterion in BLOCK is true. Sets $_ for each item in LIST in turn:
printf "%i item(s) are defined", true { defined($_) } @list;
false BLOCK LIST
Counts the number of elements in LIST for which the criterion in BLOCK is false. Sets $_ for each item in LIST in turn:
printf "%i item(s) are not defined", false { defined($_) } @list;
firstidx BLOCK LIST
first_index BLOCK LIST
Returns the index of the first element in LIST for which the criterion in BLOCK is true. Sets $_ for each item in LIST in turn:
my @list = (1, 4, 3, 2, 4, 6);
printf "item with index %i in list is 4", firstidx { $_ == 4 } @list;
__END__
item with index 1 in list is 4
Returns -1 if no such item could be found.
first_index is an alias for firstidx.
<<lessSYNOPSIS
use List::MoreUtils qw(any all none notall true false firstidx first_index
lastidx last_index insert_after insert_after_string
apply after after_incl before before_incl indexes
firstval first_value lastval last_value each_array
each_arrayref pairwise natatime mesh zip uniq minmax);
List::MoreUtils provides some trivial but commonly needed functionality on lists which is not going to go into List::Util.
All of the below functions are implementable in only a couple of lines of Perl code. Using the functions from this module however should give slightly better performance as everything is implemented in C. The pure-Perl implementation of these functions only serves as a fallback in case the C portions of this module couldnt be compiled on this machine.
any BLOCK LIST
Returns a true value if any item in LIST meets the criterion given through BLOCK. Sets $_ for each item in LIST in turn:
print "At least one value undefined"
if any { !defined($_) } @list;
Returns false otherwise, or undef if LIST is empty.
all BLOCK LIST
Returns a true value if all items in LIST meet the criterion given through BLOCK. Sets $_ for each item in LIST in turn:
print "All items defined"
if all { defined($_) } @list;
Returns false otherwise, or undef if LIST is empty.
none BLOCK LIST
Logically the negation of any. Returns a true value if no item in LIST meets the criterion given through BLOCK. Sets $_ for each item in LIST in turn:
print "No value defined"
if none { defined($_) } @list;
Returns false otherwise, or undef if LIST is empty.
notall BLOCK LIST
Logically the negation of all. Returns a true value if not all items in LIST meet the criterion given through BLOCK. Sets $_ for each item in LIST in turn:
print "Not all values defined"
if notall { defined($_) } @list;
Returns false otherwise, or undef if LIST is empty.
true BLOCK LIST
Counts the number of elements in LIST for which the criterion in BLOCK is true. Sets $_ for each item in LIST in turn:
printf "%i item(s) are defined", true { defined($_) } @list;
false BLOCK LIST
Counts the number of elements in LIST for which the criterion in BLOCK is false. Sets $_ for each item in LIST in turn:
printf "%i item(s) are not defined", false { defined($_) } @list;
firstidx BLOCK LIST
first_index BLOCK LIST
Returns the index of the first element in LIST for which the criterion in BLOCK is true. Sets $_ for each item in LIST in turn:
my @list = (1, 4, 3, 2, 4, 6);
printf "item with index %i in list is 4", firstidx { $_ == 4 } @list;
__END__
item with index 1 in list is 4
Returns -1 if no such item could be found.
first_index is an alias for firstidx.
Download (0.022MB)
Added: 2007-07-04 License: Perl Artistic License Price:
846 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 list print 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