Tags : Browse Projects

Modula-2 collections library. The library provides an API for collection ADTs, in particular: stacks, queues, double ended queues, priority queues, balanced binary search trees, patricia tries, dynamic arrays and hash tables to store arbitrary data. The hash table ADT allows data to be stored and ... [More] retrieved by reference or by copy, with built-in reference counting. All other ADTs allow data to be stored and retrieved by reference only. The library follows PIM4, it has no dependencies and it is platform independent. The library is tested with GM2 using option 'fpim4'. Under development. BSD style license. [Less]

PATRICIA Trie Practical Algorithm to Retrieve Information Coded in Alphanumeric "A radix tree, Patricia trie/tree, or crit bit tree is a specialized set data structure based on the trie that is used to store a set of strings. In contrast with a regular trie, the edges of a Patricia trie are ... [More] labelled with sequences of characters rather than with single characters. These can be strings of characters, bit strings such as integers or IP addresses, or generally arbitrary sequences of objects in lexicographical order. Sometimes the names radix tree and crit bit tree are only applied to trees storing integers and Patricia trie is retained for more general inputs, but the structure works the same way in all cases." -- Wikipedia [Less]

C library for Patricia trie storage. The library provides an API to create and use dynamic compact Patricia tries for arbitrary data. Keys may be of variable length. Data may be stored and retrieved by reference only. Supports in-order retrieval and best-match prefix searches with foreach closure ... [More] semantics. Requires C99, no dependencies, platform independent. Work in progress. BSD style license. [Less]