A C implementation of a trie map that can hold (patterns over) ordered trees in its keys. Proof-of-concept for high-speed routing data structures for Syndicate.
Updated
A C implementation of a trie map that can hold (patterns over) ordered trees in its keys. Proof-of-concept for high-speed routing data structures for Syndicate.
Updated