bitstring_trees::iter

Function iter_inclusive

source
pub fn iter_inclusive<K>(first: K, last: K) -> IterInclusive<K> 
where K: BitString + Clone,
Expand description

Generate the smallest (ordered) list of prefixes covering first..=last

Generate smallest ordered list of prefixes to cover all values v with start 0* <= end 1*.

E.g. for IP addresses this results in the smallest list of CIDR blocks exactly covering a range.