Free ions list software for linux

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.

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.

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).

Doubly Linked List project consists of an API for a doubly linked list. The API is divided into six functional groups: initialization, status and state, pointer manipulation, list update, search, and input/output. The API has been used in production software for over 2 years.
Enhancements:
- A CVS-generated ChangeLog has replaced the manually kept HISTORY file.
- The three header files have been reduced to one, and the code formatting has partially changed.
- The documentation has been updated, and a new PDF file has been added to the already existing PS and HTML docs.
- The project is now dual licensed: the Eclipse license has been added to the original Artistic License.

I18N::LangTags::List Perl module contains tags and names for human languages.

SYNOPSIS

use I18N::LangTags::List;
print "Parlez-vous... ", join(, ,
I18N::LangTags::List::name(elx) || unknown_language,
I18N::LangTags::List::name(ar-Kw) || unknown_language,
I18N::LangTags::List::name(en) || unknown_language,
I18N::LangTags::List::name(en-CA) || unknown_language,
), "?n";
prints:
Parlez-vous... Elamite, Kuwait Arabic, English, Canadian English?

This module provides a function I18N::LangTags::List::name( langtag ) that takes a language tag (see I18N::LangTags) and returns the best attempt at an English name for it, or undef if it cant make sense of the tag.

The function I18N::LangTags::List::name(...) is not exported.

This module also provides a function I18N::LangTags::List::is_decent( langtag ) that returns true iff the language tag is syntactically valid and is for general use (like "fr" or "fr-ca", below). That is, it returns false for tags that are syntactically invalid and for tags, like "aus", that are listed in brackets below. This function is not exported.

The map of tags-to-names that it uses is accessable as %I18N::LangTags::List::Name, and its the same as the list that follows in this documentation, which should be useful to you even if you dont use this module.

Prima::Lists is a Perl module for user-selectable item list widgets.

The module provides classes for several abstraction layers of item representation. The hierarchy of classes is as follows:

AbstractListViewer
AbstractListBox
ListViewer
ProtectedListBox
ListBox

The root class, Prima::AbstractListViewer, provides common interface, while by itself it is not directly usable. The main differences between classes are centered around the way the item list is stored. The simplest organization of a text-only item list, provided by Prima::ListBox, stores an array of text scalars in a widget.

More elaborated storage and representation types are not realized, and the programmer is urged to use the more abstract classes to derive own mechanisms. For example, for a list of items that contain text strings and icons see "Prima::DirectoryListBox" in Prima::FileDialog.

To organize an item storage, different from Prima::ListBox, it is usually enough to overload either the Stringify, MeasureItem, and DrawItem events, or their method counterparts: get_item_text, get_item_width, and draw_items.

Algorithm::SkipList is a Perl implementation of skip lists.

SYNOPSIS

my $list = new Algorithm::SkipList();

$list->insert( key1, value );
$list->insert( key2, another value );

$value = $list->find(key2);

$list->delete(key1);

This is an implementation of skip lists in Perl.

Skip lists are similar to linked lists, except that they have random links at various levels that allow searches to skip over sections of the list, like so:

4 +---------------------------> +----------------------> +
| | |
3 +------------> +------------> +-------> +-------> +--> +
| | | | | |
2 +-------> +--> +-------> +--> +--> +--> +-------> +--> +
| | | | | | | | |
1 +--> +--> +--> +--> +--> +--> +--> +--> +--> +--> +--> +
A B C D E F G H I J NIL

A search would start at the top level: if the link to the right exceeds the target key, then it descends a level.

Skip lists generally perform as well as balanced trees for searching but do not have the overhead with respect to inserting new items. See the included file Benchmark.txt for a comparison of performance with other Perl modules.

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.