This crate provides a datastructure for fast IP address lookups. It aims at fast lookup times, and a small memory footprint. A full IPv4 BGP table of more than 600k entries fits in less than 5 MB. A full IPv6 BGP table of more than 25k entries fits in less than 1 MB.
Longest match lookups on full BGP IP tables take on the order of 100ns.
The internal datastructure is based on the Tree-bitmap algorithm described by W. Eatherton, Z. Dittia, G. Varghes.
A fast, compressed IP lookup table.