Ports 搜索

Parsifal is minimal non-validating XML parser written in ANSI C. Parsifal implements the subset of SAX2 including namespace support. Parsifal can be used for parsing XML based messages (such as SOAP and RSS) and for application specific data processing e.g. config files, data files etc. Parsifal can also be used for limited document-oriented processing and for parsing modular documents because it contains supports for internal and external general entities - it doesn't support currently parameter entities or other DTD features. Parsifal can be used for processing large data files and streams too since its SAX based and consumes very little memory not to mention it is fast enough for most purposes 'cos its written in C. Using Parsifal in place of large XML processing libraries (e.g. libxml, xerces) or even in the place of small Expat (which is considerably bigger and more complicated) can be justified for limited memory environments and in applications requiring bundled parser. If you need higher level tools, for example library supporting DTD validation or dom/xpath processing, you should look for other libs of course.

libstree is a generic suffix tree implementation, written in C. It can handle arbitrary data structures as elements of a string. Unlike most demo implementations, it is not limited to simple ASCII character strings. Suffix tree generation in libstree is highly efficient and implemented using the algorithm by Ukkonen, which means that libstree builds suffix trees in time linear to the length of the strings (assuming that string element comparisons can be done in O(1)).

Translate GNU info files into HTML pages

This is Rick Jelliffe's implementation of ISO Schematron using XSLT.

LibWapcaplet is a string internment library, written in C. It provides reference counted string interment and rapid string comparison functionality.

The LibXDiff library implements basic and yet complete functionalities to create file differences/patches to both binary and text files. The library uses memory files as file abstraction to achieve both performance and portability. For binary files, LibXDiff implements (with some modification) the algorithm described in File System Support for Delta Compression by Joshua P. MacDonald, while for text files it follows directives described in An O(ND) Difference Algorithm and Its Variations by Eugene W. Myers. Memory files used by the library are basically a collection of buffers that store the file content. There are two different requirements for memory files when passed to diff/patch functions. Text files for diff/patch functions require that a single line do not have to spawn across two different memory file blocks. Binary diff/patch functions require memory files to be compact. A compact memory files is a file whose content is stored inside a single block.

Kibana is an open source (Apache Licensed), browser based analytics and search interface to Logstash and other timestamped data sets stored in ElasticSearch. With those in place Kibana is a snap to setup and start using (seriously). Kibana strives to be easy to get started with, while also being flexible and powerful.

This port contains the programming reference for textproc/libxslt.

The Link Grammar Parser is a syntactic parser of English, based on link grammar, an original theory of English syntax. Given a sentence, the system assigns to it a syntactic structure, which consists of a set of labeled links connecting pairs of words. The parser also produces a "constituent" representation of a sentence (showing noun phrases, verb phrases, etc.).

Libkolabxml is the reference implementation of the Kolab XML Format. It provides serialization/deserialization from/to in-memory representations for all Kolab Objects, including input validation.