Ports Search

ssss is an implementation of Shamir's secret sharing scheme for UNIX/Linux machines. It is free software, the code is licensed under the GNU GPL. ssss does both: the generation of shares for a known secret and the reconstruction of a secret using user provided shares. The software was written in 2006 by B. Poettering, it links against the GNU libgmp multiprecision library (version 4.1.4 works well) and requires the /dev/random entropy source.

PEAR::XML_Wddx does 2 things: a) a drop in replacement for the XML_Wddx extension (if it's not built in) b) produce an editable wddx file (with indenting etc.) and uses CDATA, rather than char tags This package contains 2 static methods: XML_Wddx:serialize($value) XML_Wddx:deserialize($value) Should be 90% compatible with wddx_deserialize(), and the deserializer will use wddx_deserialize if it is built in. No support for recordsets is available at present in the PHP version of the deserializer.

Routino is an application for finding a route between two points using the dataset of topographical information collected by http://www.OpenStreetMap.org. This router uses a routing algorithm that takes OSM format data as its input and calculates either the shortest or quickest route between two points. To optimise the routing a custom database format is used. This allows the routing to be performed quickly after a modest one-off pre-processing stage. A selection is possible for any of the major OSM transport types and for each of the main OSM highway types a preference can be provided and a speed limit. Restrictions on one-way streets, weight, height, width and length are also options. Further preferences about road properties (e.g. paved or not) can also be selected. The processing of the input XML file is based on rules in a configuration file that transform the highway tags into tags that are understood by Routino. The generation of the output files (HTML and GPX) uses language fragments selected from another configuration file which allows multi-lingual output from the same database. The router takes into account private/public/permissive restrictions on highways as well as tagged speed limits and barriers (gates, bollards). The simplest and most common turn restriction relations (those composed of a way, node and way) are also supported.

http://www.linuxtv.org/vdrwiki/index.php/Streamdev-plugin This PlugIn is a VDR implementation of the VTP (Video Transfer Protocol) Version 0.0.3 (see file PROTOCOL) and a basic HTTP Streaming Protocol. It consists of a server and a client part, but both parts are compiled together with the PlugIn source, but appear as separate PlugIns to VDR. The client part acts as a full Input Device, so it can be used in conjunction with a DXR3-Card, XINE, SoftDevice or others to act as a working VDR installation without any DVB-Hardware including EPG-Handling. The server part acts as a Receiver-Device and works transparently in the background within your running VDR. It can serve multiple clients and it can distribute multiple input streams (i.e. from multiple DVB-cards) to multiple clients using the native VTP protocol (for VDR-clients), or using the HTTP protocol supporting clients such as XINE, MPlayer and so on. With XMMS or WinAMP, you can also listen to radio channels over a HTTP connection.

cdb is a fast, reliable, lightweight package for creating and reading constant databases. Its database structure provides several features: * Fast lookups: A successful lookup in a large database normally takes just two disk accesses. An unsuccessful lookup takes only one. * Low overhead: A database uses 2048 bytes, plus 24 bytes per record, plus the space for keys and data. * No random limits: cdb can handle any database up to 4 gigabytes. There are no other restrictions; records don't even have to fit into memory. Databases are stored in a machine-independent format. * Fast atomic database replacement: cdbmake can rewrite an entire database two orders of magnitude faster than other hashing packages. * Fast database dumps: cdbdump prints the contents of a database in cdbmake-compatible format. cdb is designed to be used in mission-critical applications like e-mail. Database replacement is safe against system crashes. Readers don't have to pause during a rewrite. Note for developers: packages that need to read cdb files should incorporate the necessary portions of the cdb library rather than relying on an external cdb library. (See WWW)

SLOCCount can count physical SLOC for a wide number of languages. It can gracefully handle awkward situations in many languages, for example, it can determine the syntax used in different assembly language files and adjust appropriately, it knows about Python's use of string constants as comments, and it can handle various Perl oddities (e.g., perlpods, here documents, and Perl's __END__ marker). It even has a "generic" SLOC counter that you may be able to use count the SLOC of other languages (depending on the language's syntax). SLOCCount can also take a large list of files and automatically categorize them using a number of different heuristics. The heuristics automatically determine if a file is a source code file or not, and if so, which language it's written in. It will even examine file headers to attempt to accurately determine the file's true type. As a result, you can analyze large systems completely automatically. Finally, SLOCCount has some report-generating tools to collect the data generated, and then present it in several different formats and sorted different ways. The report-generating tool can also generate simple tab- separated files so data can be passed on to other analysis tools (such as spreadsheets and database systems).

ccrypt is a utility for encrypting and decrypting files and streams. It was designed to replace the standard Unix crypt utility, which is notorious for using a very weak encryption algorithm. ccrypt is based on the Rijndael cipher, which is the U.S. government's chosen candidate for the Advanced Encryption Standard (AES, see http://www.nist.gov/aes/). This cipher is believed to provide very strong security. Unlike Unix crypt, the algorithm provided by ccrypt is not symmetric, i.e., one must specify whether to encrypt or decrypt. The most common way to invoke ccrypt is via the commands ccencrypt and ccdecrypt. There is also a ccat command for decrypting a file directly to the terminal, thus reducing the likelihood of leaving temporary plaintext files around. In addition, there is a compatibility mode for decrypting legacy Unix crypt files. Encryption and decryption depends on a keyword (or key phrase) supplied by the user. By default, the user is prompted to enter a keyword from the terminal. Keywords can consist of any number of characters, and all characters are significant (although ccrypt internally hashes the key to 256 bits). Longer keywords provide better security than short ones, since they are less likely to be discovered by exhaustive search.

LT XML is an integrated set of XML tools and a developers' tool-kit, including a C-based API. The LT XML tool-kit includes stand-alone tools for a wide range of processing of well-formed XML documents, including searching and extracting, down-translation (e.g. report generation, formatting), tokenising and sorting. Sequences of tool applications can be pipelined together to achieve complex results. For special purposes beyond what the pre-constructed tools can achieve, extending their functionality and/or creating new tools is easy using the LT XML API. Minimal applications require less than one-half page of C code to express. LT XML provides two views of an XML file; one as a flat stream of markup elements and text; a second as a sequence of tree-structured XML elements. The two views can be mixed, allowing great flexibility in the manipulation of XML documents. It also includes a powerful, yet simple, querying language, which allows the user to quickly and easily select those parts of an XML document which are of interest.

The objective of the package is to provide a fast and essential HTML check (esp. for CGI scripts where response time is important) to prevent a piece of user input HTML code from messing up the rest of a file, i.e., to minimize and localize any possible damage created by including a piece of user input HTML text in a dynamic document. HTMLQuickCheck checks for unmatched < and >, unmatched tags and improper nesting, which could ruin the rest of the document. Attributes and elements with optional end tags are not checked, as they should not cause disasters with any decent browsers (they should ignore any unrecognized tags and attributes according to the standard). A piece of HTML that passes HTMLQuickCheck may not necessarily be valid HTML, but it would be very unlikely to screw others but itself. A valid piece of HTML that doesn't pass the HTMLQuickCheck is however very likely to screw many browsers(which are obviously broken in terms of strict conformance). HTMLQuickCheck currently supports HTML 1.0, 2.x (draft), 3.0 (draft) and netscape extensions (1.1).

The rencode module is similar to bencode from the BitTorrent project. For complex, heterogeneous data structures with many small elements, r-encodings take up significantly less space than b-encodings. This version of rencode is a complete rewrite in Cython to attempt to increase the performance over the pure Python module written by Petru Paler, Connelly Barnes et al. Later, it was forked, enhanced, and bundled with Deluge. Now, it is re-packaged and distributed by Xpra.