Please feel free to partake of the following.
To be able to preview PDF files, you may want to download
Acrobat® Reader®, which is available for free
from Adobe Inc.
Provides: Avl.cs
threaded Avl-tree C# class to implement an ordered list of items which
can be accessed by value and by position. License:
Mozilla Public License
Downloads: Navl (with nunit-tests + API reference)
tuck is a portable, lossless data compression tool based on the Burrows-Wheeler transform , thus ensuring good compression ratios.
It currently runs quite slowly (slower than the efficient bzip2 ), mainly because of the block-sorting algorithms involved: sorting is where the compressor spends most of its time.
tuck can be seen as an ANSI C implementation of Dr Juergen Abel's
recommendations.
tuck 0.10 uses the same modeling techniques as Dr Abel's
ABC program
in front of a range coder (byte-oriented arithmetic coder), but the
block-sorting algorithms differ. Arithmetic coding is less robust
against errors than (otherwise faster) Huffman coding (which bzip2
uses). Models are adaptive, so there are no plans to support random
access into tuck-compressed files.
tuck 0.10 has no encryption or archival capabilities.
As of March 2006 (initial release) tuck is distributed as a Mach-O powerpc executable command-line program only, with an interface reminiscent of gzip. It has been tested on Mac 0S 10.3.9 (Panther) among other systems, but not on 10.4
The source code will be released later. Please see the README file in the archive for more explanations, and CREDITS.
Downloads: bzipped tar ,gzipped tar ,stuffit archive
See also Freshmeat entry.
Simple Patricia trie (crit-bit tree) routines (written in C) to map bit-strings to values. PATRICIA is a funky acronym for ``Practical Algorithm to Retrieve Information Coded In Alphanumeric''. License: Mozilla Public License 1.1. Depends on: GLib2. Html manual is online. See Freshmeat project entry. Updated July 1st, 2007. The package contains a JavaScript implementation. Downloads: bzipped tar
A ternary search tree (TST) is a nice and simple data structure which provides an efficient way to store strings in order. It also supports more advanced string queries (partial-match search). A TST can be seen as a hybrid between a binary search tree and a digital search trie. Since version 0.20, the package also comes with an implementation of the Aho-Corasick string searching algorithm in which TST's play the part of the keyword dictionary/automaton. This is not a library, just code with room for improvement, released under the revised BSD license since version 0.20. See the complete README. Download: bzipped tar or gzipped tar (ctst-dist-XXX)
This small package provides an
avl-tree
type extension module for
Python
programmers to enjoy. Hosted by
Sourceforge.
The module and the standalone base collection of routines are written
in portable C. Usage notes are supplied. Apple MPW makefile.
It provides objects of type 'avl_tree' in Python, which can behave as
sorted containers or sequential lists.
Last modified April 20, 2008