Search Results for "trie"

...The router is optimized for high performance and a small memory footprint. It scales well even with very long paths and a large number of routes. A compressing dynamic trie (radix tree) structure is used for efficient matching. With other routers, like http.ServeMux, a requested URL path could match multiple patterns. Therefore they have some awkward pattern priority rules, like longest match or first registered, first matched. By design of this router, a request can only match exactly one or no route. ...

A compression engine based on the Huffman trie algorithm. The algorithm is pretty cpu-light, and as such, runs much more quickly than RAR or other 'heavy' algorithms, but could still achieve decent compression. Use with tar for multi-file archives.

A implementation of the Trie data structure with java random access files and regular expression queries.

Provides fast lookup for a Subject Based messaging product using a trie. It allows for configurable wildcard characters to replace a single or multiple subject field(s) (A.B.*.D.>). Insertion in to the tree returns a unique handle for subsequent deletion