Ports Search

[ description from README.txt ] Coil: A Configuration Library. Introduction ============ Coil is a configuration file format that is parsed into a tree of dict like Struct objects. The format supports inheritance, allowing complicated configurations to be as compact as possible. Design Goals ============ General design/implementation goals, some have been met, others are still in progress. - Support Twisted and non-Twisted reactor driven Python programs. - Scalable to complex configurations, easily avoiding duplication. - Orthogonal to code; code should not be required to know about the config system used, it should be regular Python or Twisted code. - Minimal boilerplate.

OSSP mm - Shared Memory Allocation Library Copyright (c) 1999-2005 Ralf S. Engelschall <rse@engelschall.com> Copyright (c) 1999-2005 The OSSP Project <http://www.ossp.org/> OSSP mm is a 2-layer abstraction library which simplifies the usage of shared memory between forked (and this way strongly related) processes under Unix platforms. On the first layer it hides all platform dependent implementation details (allocation and locking) when dealing with shared memory segments and on the second layer it provides a high-level malloc(3)-style API for a convenient and well known way to work with data-structures inside those shared memory segments.

Soup is a SOAP (Simple Object Access Protocol) implementation in C. It provides a queued asynchronous callback-based mechanism for sending and servicing SOAP requests, and a WSDL (Web Service Definition Language) for C compilers which generates client stubs and server skeletons for easily calling and implementing SOAP methods. It uses GLib and is designed to work well with GTK applications. Features: * Completely Asynchronous * Connection cache * HTTP chunked transfer and persistent connections * Authenticated HTTP, SOCKS4, and SOCKS5 proxy support * SSL Support using OpenSSL * Apache module server support * Client digest authentication

Soup is a SOAP (Simple Object Access Protocol) implementation in C. It provides a queued asynchronous callback-based mechanism for sending and servicing SOAP requests, and a WSDL (Web Service Definition Language) for C compilers which generates client stubs and server skeletons for easily calling and implementing SOAP methods. It uses GLib and is designed to work well with GTK applications. Features: * Completely Asynchronous * Connection cache * HTTP chunked transfer and persistent connections * Authenticated HTTP, SOCKS4, and SOCKS5 proxy support * SSL Support using OpenSSL * Apache module server support * Client digest authentication

The Netwide Assembler (NASM) is an x86 and amd64 (x86-64) assembler designed for portability and modularity. It will output flat-form binary files, a.out (Linux and *BSD), COFF, ELF32, ELF64, Mach-O, Microsoft OMF (OBJ), Win32, Win64, as86 (Minix/Linux bin86 v0.3), LADsoft IEEE-695, Intel hex, Motorola S-record, and a home-grown format called RDOFF. NASM syntax is similar to Intel's, but is less complex. It supports Pentium, P6, MMX, 3DNow!, SSE, SSE2, SSE3, SSE4.1, SSE4.2, XOP/FMA4/CVT16 (rev 3.03), and x64 opcodes, among others. It has strong support for macro conventions. The port also includes NDISASM, a binary file disassembler which uses the same instruction set as NASM.

ExtLib is a project aiming at providing a complete - yet small - standard library for the OCaml programming language. The purpose of this library is to add new functions to OCaml Standard Library modules, to modify some functions in order to get better performances or more safety (tail-recursive) but also to provide new modules which should be useful for the average OCaml programmer. ExtLib is not directly related to OCaml authors (INRIA) although this library can be seen as a proposal for inclusion in the official distribution.

Algorithm::Accounting provide simple aggregation method to make log accounting easier. It accepts data in rows, each rows can have many fields, and each field is a scalar or a list(arrayref). The basic usage is you walk through all your logs, and use append_data() to insert each rows, (you'll have to split the line into fields), and then call result() to retrieve the result, or report() to immediately see simple result. You may specify a filed_groups parameter (arrayref of arrayref), and Algorithm::Accounting will account these fields in groups.

This module will create sorting networks, a sequence of comparisons that do not depend upon the results of prior comparisons. There are several algorithms to generate sorting networks. This module has three of them: Bose and Nelson's, Hibbard's, and Batcher's Merge Exchange. It also has networks that were found to be superior in comparison count to those generated automatically by these algorithms. There is a flexible formatting function that will allow you to print out your network in many ways (see documentation). There is also a graphical output function that will return the network in an encapsulated postscript, SVG, or text form.

CHI provides a unified caching API, designed to assist a developer in persisting data for a specified period of time. The CHI interface is implemented by driver classes that support fetching, storing and clearing of data. Driver classes exist or will exist for the gamut of storage backends available to Perl, such as memory, plain files, memory mapped files, memcached, and DBI. CHI is intended as an evolution of DeWitt Clinton's Cache::Cache package, adhering to the basic Cache API but adding new features and addressing limitations in the Cache::Cache implementation.

Class::Accessor is a great way to automate the tedious task of generating accessors and mutators. One small drawback is that due to the details of the implementation, you only get one __ANON__ entry in profiling output. That entry contains all your accessors, which can be a real pain if you're attempting to figure out which of your accessors is being called six billion times. This module is a development aid which uses Hook::LexWrap and Sub::Name to talk your accessors into identifying themselves. While it shouldn't add much additional runtime overhead (as it acts only Class::Accessor's generator functions), it has not been designed for production deployment.