authlocal is a simple, self-contained program module (Just one file, just one function to call from your code) to automatically authenticate users logging into servers from localhost. No username/password entry is required. authlocal has been tested to work under versions 2.0 - 2.4 of the Linux kernel.
NFSv4 specifies that the RPC calls be batched into a "compound" call. There is no support for this in RPCGEN. By rearranging the ONC IDL for NFSv4 into AutoGen definitions, these templates will emit the original IDL *plus* all the code to package, send, distribute, collect, return, and dispatch the results. The distributed program author merely needs to call and supply server procedures for the routines specified in the IDL. Templates for these calls and service routines is provided, too. The NFSv4 definitions are included.
AutoOpts is an integrated part of AutoGen. Based on a very simple option description file, it will process configuration files, environment variables, command line options, text strings passed by client programs, and will make the results easily accessible to the client program. It will also produce a man page and the info-doc invoking section automatically.
Avalon is Apache's Java Server Framework project. It is separated into six subprojects: Framework, Excalibur, LogKit, Cornerstone, Phoenix, and Apps. Its purpose is to simplify server side programming for Java-based projects. It formalizes several best practices and patterns for server side programming. Framework describes the interfaces and contracts for the component-based architecture. Excalibur provides a number of useful components and utilities. LogKit is a logging implementation. Cornerstone is a group of reusable server components and services. Phoenix is an enterprise container implementation that uses all of the other subprojects to automatically deploy and manage one or more componentized servers. Apps is a home for several Phoenix-compatible server applications and reusable components (like FtpServer).
This data structure features fast (O(log N)) insertion, removal, and retrieval of records, provided that there is a sorting relation over their keys and there are no entries with equal keys. The AVL tree is an explicit binary searching tree, where left children of each vertex are less or equal, while right children are greater or equal than the vertex itself. In addition, the tree is balanced so that the difference between the depths of the two subtrees of each vertex is at most one.
AVLMAP is a key:data pair data mapping (associative array) library for C programming based on AVL balanced binary trees. Added features include ordered data retrieval forward or reverse, support for optional duplicate keys (e.g. an extra linked list not needed), and the ability to find the nearest member if an exact match isn't available. Both key and data types may be selected from a choice of C data types including string and array variations. One mapping always has one key type, but data types may be mixed within a mapping.
Awka is both a translator of AWK programs to ANSI C, and a separate library against which the C code is linked. The aims of Awka are to allow creation an executable that provides generally better performance than AWK interpretors, to allow easy inclusion of AWK logic in larger C applications, and use of external C functions within AWK scripts.