list

List/X+ is an ActiveX control which sets a new standard for functionality and programmability in ActiveX controls. List/X+ provides multiple sortable columns, multi-line headers, captions, and list items, unlimited color options, and more. The Mabry List/X+ control is a 32-bit light ActiveX.

List/X+ also provides a unique owner-draw capability using high-level COM objects that you create with Visual Basic. This feature provides unlimited flexibility, freeing you from the design limitations built into other controls. Using owner-draw objects, you can easily define the exact appearance of any column in any row. With List/X+ you can display bitmaps, change fonts and colors on the fly, and use any of the graphical methods available in Visual Basic or the Windows API.

FUNCTIONALITY
* Multiple columns
* Multi-column sorting -- individual columns can be sorted as desired
* Sorted/unsorted property may be modified at runtime
* Multi-line list items -- the individual items can be single line or multi-line
* Multi-line column headings -- each column can have its own multi-line heading
* Multi-line caption -- captions are not limited to single lines.
* Unique and innovative COM callbacks provide the programmer with the ability to paint any or all listbox items on a per-column basis
* ItemData is a Variant instead of a Long -- you are no longer limited to numbers only as the data type. The list items can be associated with numeric values, objects, arrays, boolean values, or any other value that can be held in a Variant.
* Simple selection, multiselect, and extended multiselect
* Selection-type is programmable at run-time
* Column alignment may be modified at run-time
* User resizable columns
* Minimum and maximum widths for user-resizable columns
* Properties to determine whether the mouse is over the caption, headings, or list parts of the listbox
* Powerful object-oriented programming model with Column objects and Columns collection
* ColumnIndex property provides the column location of the mouse
* List items are assignable at design-time using property pages

APPEARANCE
* 3D effects for list, caption, and headings include Raised, Pop, Drop, Shadow, or Inset
* Programmable 3D effect colors
* Caption is alignable to left, right, or center
* Selected and normal foreground and background colors may be specified for the listbox, columns, and individual items
* Appearance and colors are programmable at runtime
* Column alignment right, left, or center -- each column can have its own alignment setting
* Column headings alignment right, left or center -- each column heading can have its own alignment

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.

PocketWear List allows the User to Create Any Number of Re-Usable Check-Off Lists for Virtually Any Application. Examples are Grocery Lists, Travel Lists, Moving Lists, Vacation Lists, To-Do Lists, Car/Home Maintenance Lists etc.

Here are some key features of "PocketWear List":

· Create Virtually Any Number of Re-Useable Check-Off Lists
· Enter a List Item Only Once (No need to Re-Enter the Same Item Over and over)
· Select Only the Items You Need from the Master List
· Order Your Current List Items Anyway You Desire
· Tap-n-Hold Popup Menus on All Lists (Add, Edit, and Delete Items, Highlight Important Items in the List View Screen)
· Large Font in List View Screen for Easy Reading
· Use Either your Stylus, Finger, or Navigation/Action Button to Check-Off List Items
· Send/Receive Lists via Infrared or E-mail
· Create Lists from your Desktop PC
· Set User Preferences Load Default File at Start-up, Set List View Font Size, Set List View Highlight Color.
· Registered Users get Free Upgrades to Future Versions. Simply Download the Trial Version to Upgrade

Limitations:

· 10 days trial

Requirements:

· Pocket PC with 800KB Available RAM

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

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.

MP3 List is an easy to use application that can generate M3U files from the MP3 files you choose.

MP3 list features a simple, well designed graphical interface that doesnt interfere with the programs use.

An extremely easy-to-use and effective program that willquickly backup and/or restore your list of ICQ contacts. You really dont want to loose your list of contacts, they are away of life. Back them up right now to be sure that you cant loose them!