Free list of mailing lists software for linux

Mailing List project is a Web-based, full-featured mailing list and newsletter system. Users can subscribe and unsubscribe themselves.
Email confirmation is used for new subscriptions. The list of subscribers to a list can be imported and exported.
Installation:
- copy all files to your web host
- use phpmyadmin or your mysql interface to run site.sql against your database.
- open site.xml and edit the database section with your database details.
- go to index.php and login with username of admin with a password of test.
Setup the site.xml file with your database settings as follows.
< database type="mysql" >
< server >database server address< /server >
< login >database login< /login >
< password >database password< /password >
< default >mysql database name< /default >
< /database >
Add this to your ".htaccess" file to prevent viewing of the xml config file.
< Files ~ ".xml" >
Order allow,deny
Deny from all
Satisfy All
< /Files >
Enhancements:
- A problem with the SQL setup file which caused the setup to fail on some systems was fixed.

Requirements:

• Thunderbird 1.0 1.5.0.* ALL
• Mozilla 1.7.7 1.7.7 ALL

LDAP Mailing Lists Access Policy Daemon (MLAPD) is a mailing list manager that uses LDAP (instead of BDB or GDBM) to control list access. Its designed to work in conjunction with Postfix as an access policy delegation daemon. It manages electronic mail discussion and e-newsletter lists. Its goal is to store/read list data on/from LDAP.
It works as a Postfix access policy delegation agent, so it can be installed one time and used by multiple Postfix instances, or installed multiple times and not suffer database access concurrency issues (because it uses LDAP).
Enhancements:
- This can be considered the first stable and usable release.

Minimalist Admin is a very simple Web interface for the Minimalist mailing lists manager.

Installation:

1. Unarchive Minimalist Manager

Make sure that you are in your WWW directory and then unarchive the Minimalist Manager archive (whatever the filename is):

$ tar -zxvf minimalist-manager-0.3.tgz

2. Configure

Check the config.inc file. There you can specify settings that are relevant to your setup.

3. Create list configuration

The list information is taken from the lists.lst file from Minimalist.

In the directory /lists you find 2 files. One .css file in which you can modify the appearance of the subscribe/unsubscribe window. And one config file, in which relevant information which describes the mailinlist.

You have to create at least the config file per list. If there is no css file it will use the toplevel stylesheet located in the root of Minimalist Manager.

4. Done

This is all that is needed. Fire up your browser and go to the site that you specified to host Minimalist Manager.

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?

Tudu Lists is a Web application for managing todo lists. With Tudu Lists, todo lists can be easily accessed, edited, and shared on the Web.
Tudu Lists project is a simple but effective project management tool.
If you want your very own install of Tudu Lists, or if you are a programmer and want to see how Tudu Lists is developped, this website is the place to be.
If you want to install Tudu Lists :
- All you need is JDK 5.0, Tomcat 5.5 and MySQL.
If you are a developer, you will be interested to know that :
- Tudu Lists is heavily based on the Spring Framework.
- Tudu Lists is an AJAX application, using the great DWR Framework.

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

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.