Ports Search

Results 4,2214,230 of 5,161 for /ports-mgmt/.(0.005 seconds)
textproc/lacheck-1.26 (Score: 0.006224396)
Tool for finding common mistakes in LaTeX documents
LaCheck is a general purpose consistency checker for LaTeX documents. It reads a LaTeX document and displays warning messages, if it finds bad sequences. LaCheck is designed to help find common mistakes in LaTeX documents, especially those made by beginners.
textproc/latex-0.1 (Score: 0.006224396)
LaTeX service for GNUstep
This is a small service which converts a LaTeX text into an image. Just select the text, click on the service item menu, choose "Return the LaTeX rendering" and voila! Your text is replaced by its LaTeX rendering. LICENSE: GPL2 or later
textproc/libextractor-1.3 (Score: 0.006224396)
Library for keyword extraction
Libextractor is a library used to extract meta-data from files of arbitrary type. It is designed to use helper-libraries to perform the actual extraction, and to be trivially extendable by linking against external extractors for additional file types.
textproc/bbe-0.2.2 (Score: 0.006224396)
Sed-like editor for binary files
Instead of reading input in lines as sed, bbe reads arbitrary blocks from an input stream and performs byte-related transformations on found blocks. Blocks can be defined using start/stop strings, stream offset and block length, or a combination. Basic editing commands include delete, replace, search/replace, binary operations (and, or, etc.), append, and bcd/ASCII conversion. For examining the input stream, it contains some grep-like features like printing the input file name, stream offset, and block number of found blocks. Block contents can also be printed in different formats like hex, octal, ASCII, and binary.
textproc/html2fo-0.4.2 (Score: 0.006224396)
HTML to xsl:fo converter
html2fo is a converter from html to xsl:fo. The html code could be written with StarOffice or other WYSIWYM editors and must not be 100% valid html code. html2fo is designed to produce a valid xsl:fo for using FOP from Apache.
textproc/liblingoteach-0.2.1 (Score: 0.006224396)
Library for parsing lesson files based on the LingoTeach DTD
This is a port of liblingoteach, a library for special translation lesson interaction. It uses the LingoTeach DTD format for general validation.
textproc/dtdinst-2009.11.11 (Score: 0.006224396)
Converts DTDs to XML instance, in a specific or RELAX NG format
DTDinst is a program for converting XML DTDs into XML instance format. The XML instance can be in either a format specific to DTDinst or RELAX NG format.
textproc/libmrss-0.19.2 (Score: 0.006224396)
C library for parsing, writing, and creating RSS
mRss is a C library for parsing, writing and creating RSS files or streams.
textproc/libparsifal-1.1.0 (Score: 0.006224396)
Lightweight XML Parser
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.
textproc/libstree-0.4.2 (Score: 0.006224396)
Generic Suffix Tree Library
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)).