Free list module software for linux

PAM ListMySQL Module joins the functionality of both pam_mysql and pam_listfile. PAM ListMySQL Module is used to search a list of tokens (pam_listfile) using a MySQL database as a source (pam_mysql).

Options:

The module options are listed below with default in ()s:

user("nobody")
The user with access to open the connection to MySQL
and has permission to read the table with the passwords.

passwd("")
Password for the MySQL user.

host("localhost")
Machine that is running the MySQL server.

db("mysql")
Name of database that contains the table with the user/password
combos.

table("user")
Name of table that you want to use for the user/password checking.
This can be a series of tables with full JOIN-style syntax if you
want more complex control. For example:
[table=Host LEFT JOIN HostUser ON HostUser.host_id=Host.id
LEFT JOIN User ON HostUser.user_id=User.id]

column("user.User")
Name of column that has the field describint the type identified by
type option.

where("")
Used to specify additional criteria for the query. Not that you probably
need to use libpams extended option format. For example:
[where=Host.name="web" AND User.active=1]

item("user")
Type of data to be searched for, can be one of:
user|tty|rhost|ruser|group|shell

sense("allow")
Action to take if found in table, if the item is NOT found in the table,
then the opposite action is requested (can be allow or deny)

conf_file("/etc/security/listmysql.conf")
Set the path of the configuration file, see the configuration example in
order to learn the syntax

MyCMS perl module provides the MN::CMS Perl module used by the MyCMS.

MyCMS perl module contains Perl object classes to manage the data of MyCMS (such as articles, links, and images).

MN::CMS is a perl module that allows you to manage an Internet
publishing system.#

MyCMS is an extension module of MyNews.

MyCMS introduces the concept of article, author and moderator.

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

DNSMasq Webmin Module is a Webmin module to allow configuration of DNSMasq, a DNS proxy and DHCP server.

u24mixer-module is a simple kernel module that provides ALSA mixer controls for the ESI U24 USB sound card.
Enhancements:
- All of the mixer controls found in the ESI U24 Windows control panel were implemented.

Python chess module project is a Python chess move adjudicator module.
Python chess module does not know how to play chess, but does understand the rules enough that it can watch moves and verify that they are correct.
It features high abstraction, understands various notations (including algebraic, long algebraic, and standard algebraic notation), does disambiguation, and supports saving and loading the state of a game.
Main features:
- high abstraction
- understands various notations, including algebraic, long algebraic, and standard algebraic notation (as in PGN); does disambiguation
- supports saving and loading of the state of a game
- not a trivial move processor; understands the intracies of the game
Enhancements:
- Bug with en passant moves 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).