Free matches software for linux

GluCat project is a library of template classes which model the universal Clifford algebras over the real or complex fields, with arbitrary dimension and arbitrary signature.

GluCat implements a model of each Clifford algebra corresponding to each non-degenerate quadratic form up to a maximum number of dimensions.

GluCat classes were originally designed to be used as template parameters for other template libraries, such as Blitz++, deal.II, Matrix Template Library and POOMA.

These template libraries expect a numeric class which implements "appropriate numeric semantics". To provide these semantics, the GluCat interface matches float or complex as much as possible, but the GluCat classes must be different from float or complex, because they model a different algebra.

check_ssl_cert project is a Nagios plugin to check X.509 certificates.

It checks if the server is running and delivers a valid certificate.

It also checks if the CA matches a given pattern, and checks the validity.

Regexp::Common::time Perl module contains date and time regexps.

SYNOPSIS

use Regexp::Common qw(time);

# Piecemeal, Time::Format-like patterns
$RE{time}{tf}{-pat => pattern}

# Piecemeal, strftime-like patterns
$RE{time}{strftime}{-pat => pattern}

# Match ISO8601-style date/time strings
$RE{time}{iso}

# Fuzzy date patterns
# YEAR/MONTH/DAY
$RE{time}{ymd} # Most flexible
$RE{time}{YMD} # Strictest (equivalent to y4m2d2)
# Other available patterns: y2md, y4md, y2m2d2, y4m2d2

# MONTH/DAY/YEAR (American style)
$RE{time}{mdy} # Most flexible
$RE{time}{MDY} # Strictest (equivalent to m2d2y4)
# Other available patterns: mdy2, mdy4, m2d2y2, m2d2y4

# DAY/MONTH/YEAR (European style)
$RE{time}{mdy} # Most flexible
$RE{time}{MDY} # Strictest (equivalent to d2m2y4)
# Other available patterns: dmy2, dmy4, d2m2y2, d2m2y4

# Fuzzy time pattern
# HOUR/MINUTE/SECOND
$RE{time}{hms} # H: matches 1 or 2 digits; 12 or 24 hours
# M: matches 2 digits.
# S: matches 2 digits; may be omitted
# May be followed by "a", "am", "p.m.", etc.

This module creates regular expressions that can be used for parsing dates and times. See Regexp::Common for a general description of how to use this interface.

Parsing dates is a dirty business. Dates are generally specified in one of three possible orders: year/month/day, month/day/year, and day/month/year. Years can be specified with four digits or with two digits (with assumptions made about the century). Months can be specified as one digit, two digits, as a spelled-out name, or as a three-letter abbreviation. Day numbers can be one digit or two digits, with limits depending on the month (and, in the case of February, even the year). Also, different people use different punctuation for separating the various elements.
A human can easily recognize that "October 21, 2005" and "21.10.05" refer to the same date, but its tricky to get a program to come to the same conclusion. This module attempts to make it possible to do so, with a minimum of difficulty.

If you know the exact format of the data to be matched, use one of the specific, piecemeal pattern builders: tf or strftime. If there is some variability, use one of the fuzzy-matching patterns in the dmy, mdy, or ymd families. If the data are wildly variable, such as raw user input, give up and use the Date::Manip or Date::Parse module.

Time values are generally much simpler to parse than date values. Only one fuzzy pattern is provided, and it should suffice for most needs.

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.

perlrecharclass package contains Perl regular expression character classes.

The top level documentation about Perl regular expressions is found in perlre.
This manual page discusses the syntax and use of character classes in Perl Regular Expressions.

A character class is a way of denoting a set of characters, in such a way that one character of the set is matched. Its important to remember that matching a character class consumes exactly one character in the source string. (The source string is the string the regular expression is matched against.)
There are three types of character classes in Perl regular expressions: the dot, backslashed sequences, and the bracketed form.

The dot

The dot (or period), . is probably the most used, and certainly the most well-known character class. By default, a dot matches any character, except for the newline. The default can be changed to add matching the newline with the single line modifier: either for the entire regular expression using the /s modifier, or locally using (?s).

Here are some examples:

"a" =~ /./ # Match
"." =~ /./ # Match
"" =~ /./ # No match (dot has to match a character)
"n" =~ /./ # No match (dot does not match a newline)
"n" =~ /./s # Match (global single line modifier)
"n" =~ /(?s:.)/ # Match (local single line modifier)
"ab" =~ /^.$/ # No match (dot matches one character)

Backslashed sequences

Perl regular expressions contain many backslashed sequences that constitute a character class. That is, they will match a single character, if that character belongs to a specific set of characters (defined by the sequence). A backslashed sequence is a sequence of characters starting with a backslash. Not all backslashed sequences are character class; for a full list, see perlrebackslash.

Heres a list of the backslashed sequences, which are discussed in more detail below.

d Match a digit character.
D Match a non-digit character.
w Match a "word" character.
W Match a non-"word" character.
s Match a white space character.
S Match a non-white space character.
h Match a horizontal white space character.
H Match a character that isnt horizontal white space.
v Match a vertical white space character.
V Match a character that isnt vertical white space.
pP, p{Prop} Match a character matching a Unicode property.
PP, P{Prop} Match a character that doesnt match a Unicode property.

Hub::Perl::Language is a Perl module that contains a lot of methods.

PUBLIC METHODS

sizeof

Integer size of hashes, arrays, and scalars

Usage: sizeof %hash
Usage: sizeof @array
Usage: sizeof $scalar_ref
Usage: sizeof $scalar
Usage: sizeof %more, @than, $one

Sizes are computed as follows:

HASH - Number of keys in the hash
ARRAY - Number of elements
SCALAR - Length as returned by C

The total size of all arguments is returned.

Example: Hash: (matches)

sizeof( { a=>1, b=>2, c=>3 } );


3
Example: Array: (matches)
sizeof( [ a1, b2, c3 ] );


3
Example: Scalar: (matches)
sizeof( "abc" );


3
Example: Scalar (ref): (matches)
sizeof( "abc" );


3
Example: Nothing: (matches)
sizeof( undef );


0
Example: Multiple values: (matches)
sizeof( "a", "b", "c" );


3
check

True if all items in list pass the test.
Usage: check [OPTIONS], [TEST], LIST

B::XPath class can search Perl optrees with XPath syntax.

SYNOPSIS

Perl represents programs internally as a tree of opcodes. To execute a program, it walks this tree, performing each operation as it encounters it. The B family of modules allows you to examine (and in some cases, manipulate) this optree on programs even as they run.

B::XPath allows you to use XPath syntax to select ops in the optree.

use B::XPath;

my $node = B::XPath->fetch_root( &some_function );
my $root = B::XPath->fetch_main_root();

# find all global scalar accesses
my @globals = $root->match( //gvsv );

# find all global scalar accesses within some_function() named $bob
my @bobs = $node->match( //gvsv[@NAME="bob"] );

Class Methods

There are two methods to use to start your match; both set the root of the tree to search. Theres also a nice helper method youll probably never use unless you find a bug.

fetch_root( $subref )

This method returns the B::XPath::Node object at the root of the optree for the subroutine reference. All matches performed on this node will search this branch of the optree for matching nodes.

fetch_main_root()

This method returns the B::XPath::Node object at the root of the program. Use this to search your entire program (at least, the part of it outside of any given subroutine).

find_op_class( $op )

Given a B::OP or descendent object, returns the name of the appropriate B::XPath::Node subclass to use to wrap that op so that B::XPath can manipulate it appropriately.