list view
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 4743
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
Bagel View 2.0
Bagel View is a lightweight image viewer for looking at PPM, PBM, and PGM images in both RAW and ASCII format. more>>
Bagel View project is a lightweight image viewer for looking at pXm images. Here pXm means Portable Pixmap (ppm), Portable Bitmap (pbm), and Portable Graymap (pgm) in both RAW and ASCII format. Sample files are included in the samples directory.
<<less Download (0.018MB)
Added: 2007-02-27 License: GPL (GNU General Public License) Price:
971 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
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
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
Knotview 0.1.0
Knotview is a crossing between a concept mapper, a wiki and a database. more>>
Knotview software is a crossing between a concept mapper, a wiki and a database. The main idea behind it is to split information into small chunks (knots) and make links between them.
Visual organisation is not enforced : links can be drawn arbitrarily. With Knotview, only the user decides how the information must be shown. Creating links pointing towards files or url is possible and make it very easy to gather scattered information into a single place. Knotview can be used as a powerful bookmark manager, a mind mapper, a small database, and much more.
What distinguishes Knotview from other concept- and mind-mapping software if the fact that it separates contents from appearance. A knot consist of a title, some arbitrary properties (e.g. urls) and an associated text. It is stored in a database (kdb) which does not include any displaying informations. Display is left to a client application, and saved in a separate file (kv).
This allows some useful behaviour, such as displaying several times the same knot, in the same application. Nothing preventsdoing the same with different applications : the same knot can be displayed in a graph, and simultaneously in a todo-list software. This last feature is still planned, unfortunately. A very important feature of knotview is the ability to show the same information differently, depending on the users needs. A todo-list will be shown in a list view widget, whereas a brainstorming needs a powerful graphical interface.
Each knot can be assigned one or more user-defined categories. This allows to set shorts of type to knots. As for now, only displayed knot color is affected, but much more can be done with this. A good example where this is useful is a dictionary. Nouns, verbs, adjectives can be affected different categories. Other categories can be used to distinguish between feminine and masculine (if applicable).
More examples are given in the tutorials.
<<lessVisual organisation is not enforced : links can be drawn arbitrarily. With Knotview, only the user decides how the information must be shown. Creating links pointing towards files or url is possible and make it very easy to gather scattered information into a single place. Knotview can be used as a powerful bookmark manager, a mind mapper, a small database, and much more.
What distinguishes Knotview from other concept- and mind-mapping software if the fact that it separates contents from appearance. A knot consist of a title, some arbitrary properties (e.g. urls) and an associated text. It is stored in a database (kdb) which does not include any displaying informations. Display is left to a client application, and saved in a separate file (kv).
This allows some useful behaviour, such as displaying several times the same knot, in the same application. Nothing preventsdoing the same with different applications : the same knot can be displayed in a graph, and simultaneously in a todo-list software. This last feature is still planned, unfortunately. A very important feature of knotview is the ability to show the same information differently, depending on the users needs. A todo-list will be shown in a list view widget, whereas a brainstorming needs a powerful graphical interface.
Each knot can be assigned one or more user-defined categories. This allows to set shorts of type to knots. As for now, only displayed knot color is affected, but much more can be done with this. A good example where this is useful is a dictionary. Nouns, verbs, adjectives can be affected different categories. Other categories can be used to distinguish between feminine and masculine (if applicable).
More examples are given in the tutorials.
Download (0.099MB)
Added: 2007-07-20 License: GPL (GNU General Public License) Price:
827 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
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
Opcion Font Viewer 1.1.1
Opcion Font Viewer is a TrueType font viewer. more>>
Opcion Font Viewer is a free font viewer written in Java that allows you to view both installed and uninstalled TrueType fonts on Windows, Linux, Unix or Mac.
The main focus of Opcion is to allow you to view your uninstalled fonts so that you install only the fonts you want and keep your system memory free of fonts you dont want.
As you may have experienced, installing the brand new 1000 fonts font pack you just bought on your Windows, Linux, Unix or Mac computer can lead to slow-downs when starting the computer and when loading other programs.
The slow down occurs because the Operating System and certain programs (e.g. word-processors, email clients, graphics editors) need to load all system fonts so that they can be made available to you at any time. This is where Opcion comes in.
Opcion was written to handle the viewing of large font collections, therefore only fonts that you are currently viewing are stored in memory. Although the amount of physical memory you have will effect how many fonts you can view at a time, it will no longer be a limitation to you making use of your entire font library.
Another problem with most Operating Systems default font viewers is that while they are capable of viewing fonts, the default Windows/Linux/Unix font viewers only allows you to view fonts that are already installed and one at a time. Opcion allows you to view TrueType fonts located anywhere and allows you to view system fonts as well.
To help you pick the best font for the job, whether it be for your assignment, project logo or webpage, Opcion provides a list view of either system or other/uninstalled fonts so you may see how a font looks compared to other fonts in your collection.
When you see a font that you feel suits your current job you can simply click on it in the list view and it will be added to a favourites list that can then be saved for future reference or used to install only the fonts you want.
For viewing fonts, seeing how they would appear applied to your name/logo/tagline, and keeping track of which fonts best suit the job is the purpose of Opcion Font Viewer. Opcion allows you to view both installed and uninstalled fonts in different views depending on your needs. Written in Java, Opcion will work on all platforms that the Java Runtime Environment supports (which includes Windows, Mac, Solaris & Linux).
Opcion Font Viewer provdies a default view that allows you to view one font at a time, and a list view which allows you to view multiple fonts at a time. By clicking on fonts you like in the list view you are adding fonts to a faviourties list that Opcion keeps for you. The faviourites list can then be saved for future reference or used in finding out the file names of fonts you wish to install.
Main features:
- Viewing of installed/uninstalled fonts.
- List view of installed/uninstalled fonts.
- Adding/removing of favourite fonts.
- Saving of favourite fonts.
- Customizable sample/display text.
- Customizable font size.
- Customizable font properties (bold, italic, etc.) in sample text area.
- Changeable fonts displayed per page in List View.
Execute Opcion Font Viewer
To execute Opcion Font Viewer in Windows, download the EXE version. For Linux users use the command "java -jar Opcion_v1.1.1.jar" in console/terminal/shortcut.
Exception in thread "main" java.lang.UnsatisfiedLinkError: /usr/java/j2re1.4.1_02/lib/i386/libfontmanager.so: libstdc++-libc6.1-1.so.2: cannot open shared object file: No such file or directory
This error occurs due to backwards compatibility issues with the Java Runtime and libstdc. To fix this problem for RedHat 9.0 install the RPM file compat-libstdc++-7.3.2.96.118.i386.rpm, which can be found on disc 1 of the downloadable distro. For other Linux distributions check rpmfind.net for libstdc++-libc6.1-1.so.2 to see what package you need to install.
An unexpected exception has been detected in native code outside the VM.
Unexpected Signal : 11 occurred at PC=0x4CAEE920 Function=(null)+0x4CAEE920 Library=/usr/local/lib/SunJava2-1.4.2/lib/i386/libfontmanager.so
This error appears to be a problem with Sun Microsystems Java implementation for Linux, the real cause for this crash is still being investigated. There are no solutions to this problem yet.
Opcion crashes during execution when using Blackdown Java Virtual Machine.
Opcion Font Viewer was programmed for Sun Microsystems JVM, and it uses Suns Java API extensively. Thus, it is highly recommended that you use the latest Java Runtime Environment instead of other JVMs.
Enhancements:
- Added sorting to other fonts list.
<<lessThe main focus of Opcion is to allow you to view your uninstalled fonts so that you install only the fonts you want and keep your system memory free of fonts you dont want.
As you may have experienced, installing the brand new 1000 fonts font pack you just bought on your Windows, Linux, Unix or Mac computer can lead to slow-downs when starting the computer and when loading other programs.
The slow down occurs because the Operating System and certain programs (e.g. word-processors, email clients, graphics editors) need to load all system fonts so that they can be made available to you at any time. This is where Opcion comes in.
Opcion was written to handle the viewing of large font collections, therefore only fonts that you are currently viewing are stored in memory. Although the amount of physical memory you have will effect how many fonts you can view at a time, it will no longer be a limitation to you making use of your entire font library.
Another problem with most Operating Systems default font viewers is that while they are capable of viewing fonts, the default Windows/Linux/Unix font viewers only allows you to view fonts that are already installed and one at a time. Opcion allows you to view TrueType fonts located anywhere and allows you to view system fonts as well.
To help you pick the best font for the job, whether it be for your assignment, project logo or webpage, Opcion provides a list view of either system or other/uninstalled fonts so you may see how a font looks compared to other fonts in your collection.
When you see a font that you feel suits your current job you can simply click on it in the list view and it will be added to a favourites list that can then be saved for future reference or used to install only the fonts you want.
For viewing fonts, seeing how they would appear applied to your name/logo/tagline, and keeping track of which fonts best suit the job is the purpose of Opcion Font Viewer. Opcion allows you to view both installed and uninstalled fonts in different views depending on your needs. Written in Java, Opcion will work on all platforms that the Java Runtime Environment supports (which includes Windows, Mac, Solaris & Linux).
Opcion Font Viewer provdies a default view that allows you to view one font at a time, and a list view which allows you to view multiple fonts at a time. By clicking on fonts you like in the list view you are adding fonts to a faviourties list that Opcion keeps for you. The faviourites list can then be saved for future reference or used in finding out the file names of fonts you wish to install.
Main features:
- Viewing of installed/uninstalled fonts.
- List view of installed/uninstalled fonts.
- Adding/removing of favourite fonts.
- Saving of favourite fonts.
- Customizable sample/display text.
- Customizable font size.
- Customizable font properties (bold, italic, etc.) in sample text area.
- Changeable fonts displayed per page in List View.
Execute Opcion Font Viewer
To execute Opcion Font Viewer in Windows, download the EXE version. For Linux users use the command "java -jar Opcion_v1.1.1.jar" in console/terminal/shortcut.
Exception in thread "main" java.lang.UnsatisfiedLinkError: /usr/java/j2re1.4.1_02/lib/i386/libfontmanager.so: libstdc++-libc6.1-1.so.2: cannot open shared object file: No such file or directory
This error occurs due to backwards compatibility issues with the Java Runtime and libstdc. To fix this problem for RedHat 9.0 install the RPM file compat-libstdc++-7.3.2.96.118.i386.rpm, which can be found on disc 1 of the downloadable distro. For other Linux distributions check rpmfind.net for libstdc++-libc6.1-1.so.2 to see what package you need to install.
An unexpected exception has been detected in native code outside the VM.
Unexpected Signal : 11 occurred at PC=0x4CAEE920 Function=(null)+0x4CAEE920 Library=/usr/local/lib/SunJava2-1.4.2/lib/i386/libfontmanager.so
This error appears to be a problem with Sun Microsystems Java implementation for Linux, the real cause for this crash is still being investigated. There are no solutions to this problem yet.
Opcion crashes during execution when using Blackdown Java Virtual Machine.
Opcion Font Viewer was programmed for Sun Microsystems JVM, and it uses Suns Java API extensively. Thus, it is highly recommended that you use the latest Java Runtime Environment instead of other JVMs.
Enhancements:
- Added sorting to other fonts list.
Download (0.35MB)
Added: 2005-04-21 License: GPL (GNU General Public License) Price:
1673 downloads
N-View 3.1
N-View is a network monitor for small and medium-sized networks. more>>
N-View is a network monitor for small and medium-sized networks. It features automatic scanning of subnets for host addresses, monitoring of ICMP responses from all hosts, signalling of timeouts and delays in the GUI and by mail, a portscanner, an SNMP client (MIB browser and trap receiver), a graphical display of network traffic for network interfaces, connectivity to hosts by telnet, HTTP browser, or an arbitrary external program (such as ssh), printing of network diagrams, automatic generation of HTML pages, and more.
Main features:
Simple configuration:
- automatic scan for hosts, based on ICMP ("ping"),
- configurable limits for response delay, timeout and port scan interval,
- individual configuration can be stored in a configuration file;
Graphic display:
- automatic arranging of icons for hosts and subnets (optional),
- arbitrary background pictures for each screen,
- signalling delay and timeout of hosts and subnets with coloured icons,
- graphic display of traffic load for selected network interfaces,
- arbitrary labelling for all icons and windows;
Signalling of status changes on display, acoustic and per e-mail (optional):
- on timeout or delayed reply of a host,
- on changes of the open port status,
- on receiving of SNMP traps;
Management interface, connections to hosts:
- via external browser,
- via internal telnet client,
- via internal SNMP client/browser;
Flexible display:
- showing Subnets as tabbed or cascaded windows,
- coloured printer output of network diagrams,
- network diagrams can be accessed from HTML browsers from inside the network (external HTML server required);
<<lessMain features:
Simple configuration:
- automatic scan for hosts, based on ICMP ("ping"),
- configurable limits for response delay, timeout and port scan interval,
- individual configuration can be stored in a configuration file;
Graphic display:
- automatic arranging of icons for hosts and subnets (optional),
- arbitrary background pictures for each screen,
- signalling delay and timeout of hosts and subnets with coloured icons,
- graphic display of traffic load for selected network interfaces,
- arbitrary labelling for all icons and windows;
Signalling of status changes on display, acoustic and per e-mail (optional):
- on timeout or delayed reply of a host,
- on changes of the open port status,
- on receiving of SNMP traps;
Management interface, connections to hosts:
- via external browser,
- via internal telnet client,
- via internal SNMP client/browser;
Flexible display:
- showing Subnets as tabbed or cascaded windows,
- coloured printer output of network diagrams,
- network diagrams can be accessed from HTML browsers from inside the network (external HTML server required);
Download (5.6MB)
Added: 2005-08-02 License: GPL (GNU General Public License) Price:
1547 downloads
Cache View 1.61
Cache View is an extension which displays Googles Cache, Corals Cache, Wayback Machines Cache and more. more>>
Cache View is an extension which displays Googles Cache, Corals Cache, Wayback Machines Cache and more.
Displays Googles Cache, Corals Cache, Wayback Machines Cache, Dot Cache, Tech Gurus Cache, and Cachebins cache of the current tab open via right-click or Tools menu.
This was made so that if the site is down in any way, especially the Digg effect and Slashdot effect, you can hopefully view it.
<<lessDisplays Googles Cache, Corals Cache, Wayback Machines Cache, Dot Cache, Tech Gurus Cache, and Cachebins cache of the current tab open via right-click or Tools menu.
This was made so that if the site is down in any way, especially the Digg effect and Slashdot effect, you can hopefully view it.
Download (0.034MB)
Added: 2007-04-12 License: MPL (Mozilla Public License) Price:
935 downloads
List::Util 1.19
List::Util Perl module contains a selection of general-utility list subroutines. more>>
List::Util Perl module contains a selection of general-utility list subroutines.
SYNOPSIS
use List::Util qw(first max maxstr min minstr reduce shuffle sum);
List::Util contains a selection of subroutines that people have expressed would be nice to have in the perl core, but the usage would not really be high enough to warrant the use of a keyword, and the size so small such that being individual extensions would be wasteful.
By default List::Util does not export any subroutines. The subroutines defined are
first BLOCK LIST
Similar to grep in that it evaluates BLOCK setting $_ to each element of LIST in turn. first returns the first element where the result from BLOCK is a true value. If BLOCK never returns true or LIST was empty then undef is returned.
$foo = first { defined($_) } @list # first defined value in @list
$foo = first { $_ > $value } @list # first value in @list which
# is greater than $value
This function could be implemented using reduce like this
$foo = reduce { defined($a) ? $a : wanted($b) ? $b : undef } undef, @list
for example wanted() could be defined() which would return the first defined value in @list
max LIST
Returns the entry in the list with the highest numerical value. If the list is empty then undef is returned.
$foo = max 1..10 # 10
$foo = max 3,9,12 # 12
$foo = max @bar, @baz # whatever
This function could be implemented using reduce like this
$foo = reduce { $a > $b ? $a : $b } 1..10
maxstr LIST
Similar to max, but treats all the entries in the list as strings and returns the highest string as defined by the gt operator. If the list is empty then undef is returned.
$foo = maxstr A..Z # Z
$foo = maxstr "hello","world" # "world"
$foo = maxstr @bar, @baz # whatever
This function could be implemented using reduce like this
$foo = reduce { $a gt $b ? $a : $b } A..Z
min LIST
Similar to max but returns the entry in the list with the lowest numerical value. If the list is empty then undef is returned.
$foo = min 1..10 # 1
$foo = min 3,9,12 # 3
$foo = min @bar, @baz # whatever
This function could be implemented using reduce like this
$foo = reduce { $a < $b ? $a : $b } 1..10
minstr LIST
Similar to min, but treats all the entries in the list as strings and returns the lowest string as defined by the lt operator. If the list is empty then undef is returned.
$foo = minstr A..Z # A
$foo = minstr "hello","world" # "hello"
$foo = minstr @bar, @baz # whatever
This function could be implemented using reduce like this
$foo = reduce { $a lt $b ? $a : $b } A..Z
reduce BLOCK LIST
Reduces LIST by calling BLOCK, in a scalar context, multiple times, setting $a and $b each time. The first call will be with $a and $b set to the first two elements of the list, subsequent calls will be done by setting $a to the result of the previous call and $b to the next element in the list.
Returns the result of the last call to BLOCK. If LIST is empty then undef is returned. If LIST only contains one element then that element is returned and BLOCK is not executed.
$foo = reduce { $a < $b ? $a : $b } 1..10 # min
$foo = reduce { $a lt $b ? $a : $b } aa..zz # minstr
$foo = reduce { $a + $b } 1 .. 10 # sum
$foo = reduce { $a . $b } @bar # concat
shuffle LIST
Returns the elements of LIST in a random order
@cards = shuffle 0..51 # 0..51 in a random order
sum LIST
Returns the sum of all the elements in LIST. If LIST is empty then undef is returned.
$foo = sum 1..10 # 55
$foo = sum 3,9,12 # 24
$foo = sum @bar, @baz # whatever
This function could be implemented using reduce like this
$foo = reduce { $a + $b } 1..10
<<lessSYNOPSIS
use List::Util qw(first max maxstr min minstr reduce shuffle sum);
List::Util contains a selection of subroutines that people have expressed would be nice to have in the perl core, but the usage would not really be high enough to warrant the use of a keyword, and the size so small such that being individual extensions would be wasteful.
By default List::Util does not export any subroutines. The subroutines defined are
first BLOCK LIST
Similar to grep in that it evaluates BLOCK setting $_ to each element of LIST in turn. first returns the first element where the result from BLOCK is a true value. If BLOCK never returns true or LIST was empty then undef is returned.
$foo = first { defined($_) } @list # first defined value in @list
$foo = first { $_ > $value } @list # first value in @list which
# is greater than $value
This function could be implemented using reduce like this
$foo = reduce { defined($a) ? $a : wanted($b) ? $b : undef } undef, @list
for example wanted() could be defined() which would return the first defined value in @list
max LIST
Returns the entry in the list with the highest numerical value. If the list is empty then undef is returned.
$foo = max 1..10 # 10
$foo = max 3,9,12 # 12
$foo = max @bar, @baz # whatever
This function could be implemented using reduce like this
$foo = reduce { $a > $b ? $a : $b } 1..10
maxstr LIST
Similar to max, but treats all the entries in the list as strings and returns the highest string as defined by the gt operator. If the list is empty then undef is returned.
$foo = maxstr A..Z # Z
$foo = maxstr "hello","world" # "world"
$foo = maxstr @bar, @baz # whatever
This function could be implemented using reduce like this
$foo = reduce { $a gt $b ? $a : $b } A..Z
min LIST
Similar to max but returns the entry in the list with the lowest numerical value. If the list is empty then undef is returned.
$foo = min 1..10 # 1
$foo = min 3,9,12 # 3
$foo = min @bar, @baz # whatever
This function could be implemented using reduce like this
$foo = reduce { $a < $b ? $a : $b } 1..10
minstr LIST
Similar to min, but treats all the entries in the list as strings and returns the lowest string as defined by the lt operator. If the list is empty then undef is returned.
$foo = minstr A..Z # A
$foo = minstr "hello","world" # "hello"
$foo = minstr @bar, @baz # whatever
This function could be implemented using reduce like this
$foo = reduce { $a lt $b ? $a : $b } A..Z
reduce BLOCK LIST
Reduces LIST by calling BLOCK, in a scalar context, multiple times, setting $a and $b each time. The first call will be with $a and $b set to the first two elements of the list, subsequent calls will be done by setting $a to the result of the previous call and $b to the next element in the list.
Returns the result of the last call to BLOCK. If LIST is empty then undef is returned. If LIST only contains one element then that element is returned and BLOCK is not executed.
$foo = reduce { $a < $b ? $a : $b } 1..10 # min
$foo = reduce { $a lt $b ? $a : $b } aa..zz # minstr
$foo = reduce { $a + $b } 1 .. 10 # sum
$foo = reduce { $a . $b } @bar # concat
shuffle LIST
Returns the elements of LIST in a random order
@cards = shuffle 0..51 # 0..51 in a random order
sum LIST
Returns the sum of all the elements in LIST. If LIST is empty then undef is returned.
$foo = sum 1..10 # 55
$foo = sum 3,9,12 # 24
$foo = sum @bar, @baz # whatever
This function could be implemented using reduce like this
$foo = reduce { $a + $b } 1..10
Download (0.043MB)
Added: 2007-06-30 License: Perl Artistic License Price:
848 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
UF-View 2.4
UF-View provides a Gnome-based User Friendly comic viewer. more>>
UF-View provides a Gnome-based User Friendly comic viewer.
uf-view is a calendar-based User Friendly comic viewer for Gnome.
It also supports:
Calvin and Hobbes
Little Gamers
Angst Technology
Penny Arcade
FoxTrot
It doesnt support anymore:
MegaTokyo
Warp9 To Hell.
Enhancements:
- Misc bug fixes
- Removed Dilbert
- Added Little Gamers
- Added Angst Technology
- Added Swedish translation
- Added .spec file
<<lessuf-view is a calendar-based User Friendly comic viewer for Gnome.
It also supports:
Calvin and Hobbes
Little Gamers
Angst Technology
Penny Arcade
FoxTrot
It doesnt support anymore:
MegaTokyo
Warp9 To Hell.
Enhancements:
- Misc bug fixes
- Removed Dilbert
- Added Little Gamers
- Added Angst Technology
- Added Swedish translation
- Added .spec file
Download (0.15MB)
Added: 2007-03-27 License: GPL (GNU General Public License) Price:
942 downloads
List::Search 0.3
List::Search is a Perl module for fast searching of sorted lists. more>>
List::Search is a Perl module for fast searching of sorted lists.
SYNOPSIS
use List::Search qw( list_search nlist_search custom_list_search );
# Create a list to search
my @list = sort qw( bravo charlie delta );
# Search for a value, returns the index of first match
print list_search( alpha, @list ); # 0
print list_search( charlie, @list ); # 1
print list_search( zebra, @list ); # -1
# Search numerically
my @numbers = sort { $a $b } ( 10, 20, 100, 200, );
print nlist_search( 20, @numbers ); # 2
# Search using some other comparison
my $cmp_code = sub { lc( $_[0] ) cmp lc( $_[1] ) };
my @custom_list = sort { $cmp_code->( $a, $b ) } qw( FOO bar BAZ bundy );
print list_search_generic( $cmp_code, foo, @custom_list );
This module lets you quickly search a sorted list. It will return the index of the first entry that matches, or if there is no exact matches then the first entry that is greater than the search key.
For example in the list my @list = qw( bob dave fred ); searching for dave will return 1 as $list[1] eq dave. Searching for charles will also return 1 as dave is the first entry that is greater than charles.
If there are none of the entries match then -1 is returned. You can either check for this or use it as an index to get the last values in the list. Whichever approach you choose will depend on what you are trying to do.
The actual searching is done using a binary search which is very fast.
<<lessSYNOPSIS
use List::Search qw( list_search nlist_search custom_list_search );
# Create a list to search
my @list = sort qw( bravo charlie delta );
# Search for a value, returns the index of first match
print list_search( alpha, @list ); # 0
print list_search( charlie, @list ); # 1
print list_search( zebra, @list ); # -1
# Search numerically
my @numbers = sort { $a $b } ( 10, 20, 100, 200, );
print nlist_search( 20, @numbers ); # 2
# Search using some other comparison
my $cmp_code = sub { lc( $_[0] ) cmp lc( $_[1] ) };
my @custom_list = sort { $cmp_code->( $a, $b ) } qw( FOO bar BAZ bundy );
print list_search_generic( $cmp_code, foo, @custom_list );
This module lets you quickly search a sorted list. It will return the index of the first entry that matches, or if there is no exact matches then the first entry that is greater than the search key.
For example in the list my @list = qw( bob dave fred ); searching for dave will return 1 as $list[1] eq dave. Searching for charles will also return 1 as dave is the first entry that is greater than charles.
If there are none of the entries match then -1 is returned. You can either check for this or use it as an index to get the last values in the list. Whichever approach you choose will depend on what you are trying to do.
The actual searching is done using a binary search which is very fast.
Download (0.005MB)
Added: 2007-07-27 License: Perl Artistic License Price:
819 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 view 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