Did I find the right examples for you? yes no

All Samples(0)  |  Call(0)  |  Derive(0)  |  Import(0)
Implementation of a radix tree data structure for network prefixes.

The radix tree is the data structure most commonly used for routing
table lookups. It efficiently stores network prefixes of varying
lengths and allows fast lookups of containing networks.

Simple example:

       import radix