Free suffix tree implementation library 1.2 software for linux

Courier Authentication Library is an API toolkit for implementing password validation and account metadata lookups. Copies of this library code used to exist in other tarballs: Courier, Courier-IMAP, and SqWebMail. Building and installing any of these packages wouldve automatically installed this authentication code.
The authentication library is now a separate, standalone package. This authentication library must now be installed, separately, before upgrading to the following builds (or if installing them for the first time): Courier 0.48, Courier-IMAP 4.0, and SqWebMail 5.0.
The Courier authentication library provides authentication services for other Courier applications. In this context, the term "authentication" refers to the following functions:
1. Take a userid or a loginid, and a password. Determine whether the loginid and the password are valid.
2. Given a userid, obtain the following information about the userid:
A. The accounts home directory.
B. The numeric system userid and groupid that owns all files associated with this account.
C. The location of the accounts maildir.
D. Any maildir quota defined for this account. See the Courier documentation for more information on maildir quotas.
E. Other miscellaneous account-specific options.
3. Change the password associated with a loginid.
4. Obain a complete list of all loginids.
The Courier authentication library provides alternative implementations of these authentication services:
1. Use the traditional system password files: /etc/passwd and /etc/shadow, possibly in conjunction with the PAM library.
2. Maintain all this information in a GDBM or a DB database. The GDBM or the DB database is compiled from plain text files. Perl scripts provide a simple interface for creating and editing the authentication information, then a script compiles the plain text files into a database.
3. Use an LDAP server for authentication.
4. Use a table in a MySQL database for authentication.
5. Use a table in a PostgreSQL database for authentication.
All Courier components that use this authentication library, therefore, will be able to authenticate E-mail accounts using any of the above methods.
Enhancements:
- This release fixes many compiler warnings, updates the LDAP API to OpenLDAP 2.3, tweaks the Makefile to make Solariss linker happy, and cleans up the RPM spec file.

Fid Core Library is the core library for the Frigand Imperial Desktop, a genuine Unix desktop environment based around multiprocessing, text-stream IPC, and the "everything is a file" concept.
It supports Emacs-like extensibility, customizability, and built-in multi-buffer support.
Enhancements:
- This release adds testing support for the axioms over buffer implementations and user interfaces, a better implementation of interactive, and a new cursor movement mechanism that allows the user interface to manage point itself (and, hence, keep it always on a widget).

Common Text Transformation Library, CTTL for short, is a set of C++ classes and functions to understand and modify text data. Common Text Transformation Library implementation is based on STL classes and algorithms.
Concept of a substring plays major role in design of the text transformation library. CTTL substring is an object that interacts with fragments of text encapsulated by STL std::basic_string template class.
Template classes cttl::const_edge and cttl::edge, designed for constant and mutable data access, respectively, represent CTTL substrings. Substrings may be compared, inserted, deleted, or replaced across multiple text inputs. If content of text mutates, the substrings adjust their positions accordingly to the change. CTTL guarantees that substrings remain stable with respect to a potentially mutable text.
Within CTTL framework, a substring may be parsed with EBNF-like grammar. CTTL lexical analysis engine generates a stream of substrings corresponding to the parsed symbols. BNF and EBNF grammars can be written directly in C++.
Template meta-programming and operator overloading offer features to write C++ expressions that describe grammar rules. No additional steps of parsing, compiling, or generating source code are required. Compiled CTTL program implements LL(INF)-parser, the recursive-descent parser with infinite lookahead.
Enhancements:
- This release focuses on documentation enhancements, which include multiple documentation improvements and revisions.
- An alphabetical index of all CTTL facilities was added: http://cttl.sourceforge.net/documentation_idx.html.

GGTL is a library designed to make it easier to program games in C. Generic Game-Tree Library provides an AI that is able to play most 2 player strategic games.
Nim, Tic-Tac-Toe, Reversi (aka Othello), Connect-4 and Chess are all examples of games that can all be implemented using GGTL.
GGTL comes with game-specific extensions that enables it to play Nim and Reversi almost out of the box. Please see the documentation for details.
Enhancements:
- "clock()" is used as a fallback for sub-second timing if "gettimeofday()" is not found.
- An internal typedef was dropped, and a header declaration for a function that didnt exist was removed.
- Some build system refactoring was done.

Uppaal Timed Automata Parser Library (libutap) is the parser library used by UPPAAL.

The Kernel-Machine Library is a freely available (released under the GPL) C++ library to promote the use and progress of kernel machines. It is both for academic use and for developing real world applications.
The Kernel-Machine Library draws heavily from features of modern C++ such as template meta-programming to achieve high performance while at the same time offering a comfortable interface.
It enables compile-time selection of specialised algorithms on the basis of data types: for example, the specific case of a SVM in combination with a linear kernel can be computed by a specialised efficient algorithm.
The Kernel-Machine Library has implementations for the following kernel machines and their cited algorithms:
- Support Vector Machine [1, 2, 3]
- Relevance Vector Machine [4]
- Kernel Recursive Least Squares [5]
- Adaptive Sparseness using Jeffreys Prior [6]
- Smooth Relevance Vector Machine [7]
Up till now, the focus has been on regression. The handling of classification and ranking problems is being added.

Jeffs Java Scanf Library is an implementation of the C-Runtime scanf, fscanf, and sscanf functions.

The syntax of format strings is very similar (%*s, %3d, etc.) to that of the standard C implementation of scanf.

Instead of taking wrapper objects, all scanf functions return an Object[], whose types can be inferred from the format string.