#range #cidr #set #merge #applications #overlapping #adjacent

no-std libnetrangemerge

A implementation of an algorithm to merge overlapping and adjacent network ranges in order to create a minimal set of range values that covers the same parts of the overall network

1 unstable release

0.1.0 Apr 10, 2021

#8 in #overlapping

27 downloads per month
Used in netrange


868 lines


libnetrangemege implements an algorithm that takes in a list of CIDR network ranges and produces a minimal output set of CIDR ranges where all overlapping and adjacent ranges have been merged.

Given the list of CIDR ranges and, libnetrangemerge will produce the output CIDR range since this range completely covers the second range.

Given the list of CIDR ranges and, libnetrangemerge will produce the output CIDR range since the two input ranges were adjacent. Not all adjacent ranges can be merged, however. For example, and are adjacent, but cannot be merged because there is no way to represent the range - in CIDR form.

CIDR range merging isn't useful for all applications that operate on CIDR ranges. If an application wants to make different decisions depending on the particular range, merging those ranges into a smaller set won't be useful. However, for applications that treat a list of ranges equivalently, merging them into a minimal set can be useful.

Range Selection

Every input CIDR range to libnetrangemerge must be marked with a selected flag. When two ranges are merged, if either input range is marked as selected, the output range will also be marked as selected; and if neither is marked the output range will also not be marked. The selected status of ranges has no other effect on merging.

This feature can be useful in minimizing ranges in some specific cases. For example, if an application wants to get the set of CIDR ranges that are used by Amazon's EC2 servers, it can fetch the list of all of the Amazon IP ranges, filter out anything that isn't used by EC2, and then merge the resulting set. Unfortunately, not all the EC2 ranges may be adjacent to each other - there may be ranges in the middle that are used by other Amazon services. If the application wants to create the smallest set of ranges possible, it may be useful to use these other ranges in order to fill in the gaps between the EC2 ranges. The application can accomplish this by passing every Amazon range into libnetrangemerge, but with the EC2 ranges marked as selected and the other ranges not marked. The output set can then be filtered by throwing away any output range not marked as selected. The output set will no longer represent just the EC2 ranges in this case - but if the application is ok with that, this can result in a smaller output set.

The selected functionality is optional - if an application doesn't want to use it, the application can just mark every range as either selected or not and then not filter anything out of the result.


A CIDR range is represented by a struct that implements the Range trait. 3 implementations of that trait are included in the library: IpRange, Ipv4Range, and Ipv6Range. An application may also implement the Range trait for their own types as well.

The merging operation is implemented by creating a list of range values and then passing that list to either merge_ranges or merge_ranges_slice. The two functions implement the same algorithm - the difference is that the former function expects a &mut Vec<Range> which it will merge in place and then truncate to the size of the output set, while the latter expects a &mut [Range] which it will merge in place and then return the size of the output set. When using merge_ranges_slice it is the responsibility of the application not to access any of the ranges past the returned size - doing so is safe but will result in a panic.

Both merge_ranges and merge_ranges_slice operate in place, do not allocate, and will not fail or panic, assuming that none of the methods on the Range type panics.


use libnetrangemerge::{RangeInterest, IpRange, merge_ranges};

let mut ranges: Vec<RangeInterest<IpRange>> = vec![
   RangeInterest::new("".parse().unwrap(), true),
   RangeInterest::new("".parse().unwrap(), true),
   RangeInterest::new("".parse().unwrap(), true),

merge_ranges(&mut ranges);

no_std Support

libnetrangemerge is no_std compatible. However, in no_std mode the merge_ranges method is unavailable as are the built in range types. The application can implement its own type that implements the Range trait and pass instances of that type to merge_ranges_slice for merging.

Minimum Rust version policy

libnetrangemerge was developed rustc 1.51 and likely works with earlier versions as well.

The minimum supported rustc version may be bumped with minor revisions.


This project is licensed under either of

at your option.


~14K SLoC