Struct IpRange 

pub struct IpRange<T: RangeFamily> { /* private fields */ }

A generic IP address range.

Use IPv4 or IPv6 markers to specify the IP version.

IpRange::new creates inclusive numeric ranges. When the second argument is present, it is a closing address, not a netmask. Use CIDR input or convert dotted netmask input with ipv4::subnet2block before constructing a range.

The internal length counters are u32 (IPv4) and u128 (IPv6). A range that spans the entire address space cannot be represented because its length is one larger than the address type can hold, so construction returns an error.

Examples

use iptools::iprange::{IpRange, IPv4};

let range = IpRange::<IPv4>::new("192.168.0.0/24", "")?;
assert_eq!(range.len(), 256);

Implementations

impl<T: RangeFamily> IpRange<T>

pub fn new(start: &str, end: &str) -> Result<IpRange<T>>

Creates a new IP range.

start accepts a single IP ("10.0.0.1") or a CIDR ("10.0.0.0/24"). Pass an empty end when start already describes the whole range or when you want a single-address range.

When end is non-empty, the two arguments are inclusive bounds: start is the lower endpoint and end is the upper endpoint. The constructor does not treat end as a dotted netmask. For example, IpRange::<IPv4>::new("10.42.120.90", "255.255.252.0") spans every address from 10.42.120.90 through 255.255.252.0; it does not create the subnet 10.42.120.90/255.255.252.0. If you have an address plus netmask, convert it to CIDR or concrete block bounds first.

Note: Unlike the Python iptools library, reversed bounds are rejected rather than normalized.

Examples

use iptools::{iprange::{IpRange, IPv4}, ipv4};

let r1 = IpRange::<IPv4>::new("10.0.0.1", "10.0.0.5")?;
let r2 = IpRange::<IPv4>::new("192.168.1.0/24", "")?;

// If you have an address + dotted netmask pair, normalize it first.
let block = ipv4::subnet2block("10.42.120.90/255.255.252.0").unwrap();
let cidr = IpRange::<IPv4>::new("10.42.120.0/22", "")?;
let explicit = IpRange::<IPv4>::new(&block.0, &block.1)?;
assert_eq!(cidr.len(), explicit.len());

pub fn from_bounds(start_ip: T::Addr, end_ip: T::Addr) -> Result<IpRange<T>>

Creates a new IP range from inclusive raw numeric bounds.

This skips all string parsing and is the fastest constructor when callers already have numeric addresses.

Examples

use iptools::iprange::{IpRange, IPv4};

let range = IpRange::<IPv4>::from_bounds(0x0a00_0000, 0x0a00_00ff)?;
assert_eq!(range.len(), 256);

pub fn from_addr_prefix(addr: T::Addr, prefix: u8) -> Result<IpRange<T>>

Creates a new IP range from a raw numeric address and CIDR prefix.

This computes the containing CIDR block without parsing or formatting any strings.

Examples

use iptools::iprange::{IpRange, IPv4};

let range = IpRange::<IPv4>::from_addr_prefix(0x0a00_0102, 16)?;
assert_eq!(range.bounds(), (0x0a00_0000, 0x0a00_ffff));

pub fn get_range(&self) -> (String, String)

Returns the start and end IP addresses as strings.

Examples

use iptools::iprange::{IpRange, IPv4};

let range = IpRange::<IPv4>::new("192.168.1.0/24", "")?;
assert_eq!(range.get_range(), ("192.168.1.0".to_string(), "192.168.1.255".to_string()));

pub fn bounds(&self) -> (T::Addr, T::Addr)

Returns the raw numeric bounds of this range.

Examples

use iptools::iprange::{IpRange, IPv4};

let range = IpRange::<IPv4>::new("10.0.0.1", "10.0.0.5")?;
assert_eq!(range.bounds().1 - range.bounds().0, 4);

pub fn get_version(&self) -> IpVer

pub fn len(&self) -> T::Addr

Returns the total number of IP addresses in this range.

Examples

use iptools::iprange::{IpRange, IPv4};

let range = IpRange::<IPv4>::new("192.168.1.0/24", "")?;
assert_eq!(range.len(), 256);

pub fn is_empty(&self) -> bool

Returns true if the range contains no IP addresses.

pub fn remaining(&self) -> T::Addr

Returns the number of IP addresses remaining in the iteration.

Examples

use iptools::iprange::{IpRange, IPv4};

let mut range = IpRange::<IPv4>::new("10.0.0.1", "10.0.0.5")?;
assert_eq!(range.remaining(), 5);
range.next();
assert_eq!(range.remaining(), 4);

pub fn next_addr(&mut self) -> Option<T::Addr>

Returns the next address as a numeric value without string allocation.

pub fn for_each_addr<F>(&self, f: F)

where F: FnMut(T::Addr),

Iterates over raw numeric addresses without allocating intermediate strings.

pub fn contains(&self, ip: &str) -> Result<bool>

Checks whether an IP address or CIDR block sits fully inside this range.

contains performs a straight numeric comparison against this range’s existing inclusive bounds. The requested IP, or both endpoints of the requested CIDR block, must fall inside the range. Nothing else is inferred from how the range was constructed.

When you already have parsed numeric values (e.g., from std::net::Ipv4Addr or std::net::Ipv6Addr), use IpRange::contains_addr or IpRange::contains_range to skip the parsing overhead. For strict same-family string parsing with mismatch-as-error semantics, use contains_strict on IpRange<IPv4> or IpRange<IPv6>. Valid targets from the other IP family return Ok(false), except that IPv4 ranges accept IPv4-mapped IPv6 targets such as ::ffff:192.0.2.1.

This matters when the range was created from two strings. For example, IpRange::<IPv4>::new("10.42.120.90", "255.255.252.0") means every address from 10.42.120.90 through 255.255.252.0, so it contains 192.168.44.10. To model 10.42.120.90/255.255.252.0, convert the subnet to its real block bounds as shown below. The same inclusive-bound rule applies to IPv6: IpRange::<IPv6>::new("fd00:10::", "fd00:ffff::") contains fd00:8000::1; use CIDR input such as "fd00:10::/64" when you want IPv6 subnet semantics.

Examples

use iptools::iprange::{IpRange, IPv4};

let range = IpRange::<IPv4>::new("192.168.1.0/24", "")?;
assert!(range.contains("192.168.1.100")?);
assert!(range.contains("192.168.1.0/25")?);

use iptools::{iprange::{IpRange, IPv4}, ipv4};

let range = IpRange::<IPv4>::new("192.168.1.0/24", "")?;
let addr = ipv4::ip2long("192.168.1.100")?;
assert!(range.contains_addr(addr));

use iptools::{iprange::{IpRange, IPv4}, ipv4};

let prefix = ipv4::netmask2prefix("255.255.255.128");
let cidr = format!("{}/{}", "198.51.100.17", prefix);
let subnet = IpRange::<IPv4>::new(&cidr, "")?;
assert!(subnet.contains("198.51.100.100")?);
assert!(!subnet.contains("203.0.113.1")?);

use iptools::{iprange::{IpRange, IPv4}, ipv4};

let bounded_range = IpRange::<IPv4>::new("10.42.120.90", "255.255.252.0")?;
assert!(bounded_range.contains("192.168.44.10")?);

let block = ipv4::subnet2block("10.42.120.90/255.255.252.0").unwrap();
let subnet = IpRange::<IPv4>::new(&block.0, &block.1)?;
assert!(!subnet.contains("192.168.44.10")?);

use iptools::iprange::{IpRange, IPv6};

let bounded_range = IpRange::<IPv6>::new("fd00:10::", "fd00:ffff::")?;
assert!(bounded_range.contains("fd00:8000::1")?);

let subnet = IpRange::<IPv6>::new("fd00:10::/64", "")?;
assert!(!subnet.contains("fd00:8000::1")?);

pub fn contains_addr(&self, addr: T::Addr) -> bool

Checks whether a numeric address sits inside this range.

pub fn contains_range(&self, start: T::Addr, end: T::Addr) -> bool

Checks whether the inclusive numeric bounds sit inside this range.

pub fn is_reserved(ip: &str) -> Result<bool>

Checks if an IP address or range falls within reserved IP blocks (e.g., loopback, private).

Examples

use iptools::iprange::{IpRange, IPv4};

assert!(IpRange::<IPv4>::is_reserved("127.0.0.1")?);
assert!(IpRange::<IPv4>::is_reserved("192.168.1.1")?);
assert!(!IpRange::<IPv4>::is_reserved("8.8.8.8")?);

impl<T: RangeFamily> IpRange<T>

pub fn addrs(&self) -> AddrIterator<T>

Returns an iterator over raw IP addresses.

Example

use iptools::iprange::{IpRange, IPv4};

let range = IpRange::<IPv4>::new("10.0.0.1", "10.0.0.5")?;
assert_eq!(range.addrs().count(), 5);

pub fn addrs_view(&self) -> AddrViewIterator<T>

Returns an iterator over AddrView wrappers (numeric value + on-demand formatting).

Example

use iptools::iprange::{IpRange, IPv4};

let range = IpRange::<IPv4>::new("10.0.0.1", "10.0.0.2")?;
let views = range.addrs_view().collect::<Vec<_>>();
assert_eq!(views[0].raw(), 167772161);
assert_eq!(views[1].to_ip_string(), "10.0.0.2");

impl IpRange<IPv4>

pub fn contains_strict(&self, target: &str) -> Result<bool>

Fast-path strict containment for IPv4 string targets (single IP or CIDR).

This avoids cross-family auto-detection and parses only IPv4 syntax. Unlike IpRange::contains, family-mismatched input returns an error.

pub fn for_each_ip_str<F>(&self, f: F)

where F: FnMut(&str),

Iterates over formatted IPv4 addresses using one reused scratch string.

The &str passed to the callback is valid only for the duration of that callback invocation. Use this when you need textual addresses but want to avoid allocating a new String for every address.

impl IpRange<IPv6>

pub fn contains_strict(&self, target: &str) -> Result<bool>

Fast-path strict containment for IPv6 string targets (single IP or CIDR).

This avoids cross-family auto-detection and parses only IPv6 syntax. Unlike IpRange::contains, family-mismatched input returns an error.

pub fn for_each_ip_str<F>(&self, f: F)

where F: FnMut(&str),

Iterates over formatted IPv6 addresses using one reused scratch string.

The &str passed to the callback is valid only for the duration of that callback invocation. Use this when you need textual addresses but want to avoid allocating a new String for every address.

impl IpRange<IPv4>

pub fn contains_ipv4(&self, addr: StdIpv4Addr) -> bool

Checks whether a std::net::Ipv4Addr lies inside this IPv4 range.

pub fn contains_ipv4_bounds(&self, start: StdIpv4Addr, end: StdIpv4Addr) -> bool

Checks whether the inclusive std::net::Ipv4Addr bounds lie inside this range.

pub fn contains_ipaddr(&self, addr: StdIpAddr) -> bool

Checks whether a std::net::IpAddr lies inside this IPv4 range.

impl IpRange<IPv6>

pub fn contains_ipv6(&self, addr: StdIpv6Addr) -> bool

Checks whether a std::net::Ipv6Addr lies inside this IPv6 range.

pub fn contains_ipv6_bounds(&self, start: StdIpv6Addr, end: StdIpv6Addr) -> bool

Checks whether the inclusive std::net::Ipv6Addr bounds lie inside this range.

pub fn contains_ipaddr(&self, addr: StdIpAddr) -> bool

Checks whether a std::net::IpAddr lies inside this IPv6 range.

Trait Implementations

impl<T: Clone + RangeFamily> Clone for IpRange<T>

where T::Addr: Clone,

fn clone(&self) -> IpRange<T>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Debug + RangeFamily> Debug for IpRange<T>

where T::Addr: Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl ExactSizeIterator for IpRange<IPv4>

fn len(&self) -> usize

Returns the exact remaining length of the iterator.

fn is_empty(&self) -> bool

🔬This is a nightly-only experimental API. (exact_size_is_empty)

Returns true if the iterator is empty.

impl<T: RangeFamily> Hash for IpRange<T>

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T: RangeFamily> Iterator for IpRange<T>

type Item = String

The type of the elements being iterated over.

fn next(&mut self) -> Option<Self::Item>

Advances the iterator and returns the next value.

fn size_hint(&self) -> (usize, Option<usize>)

Returns the bounds on the remaining length of the iterator.

fn count(self) -> usize

Consumes the iterator, counting the number of iterations and returning it.

fn last(self) -> Option<Self::Item>

Consumes the iterator, returning the last element.

fn nth(&mut self, n: usize) -> Option<Self::Item>

Returns the nth element of the iterator.

fn fold<B, F>(self, init: B, f: F) -> B

where F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, returning the final result.

fn next_chunk<const N: usize>( &mut self, ) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>

where Self: Sized,

🔬This is a nightly-only experimental API. (iter_next_chunk)

Advances the iterator and returns an array containing the next N values.

fn advance_by(&mut self, n: usize) -> Result<(), NonZero<usize>>

🔬This is a nightly-only experimental API. (iter_advance_by)

Advances the iterator by n elements.

fn step_by(self, step: usize) -> StepBy<Self>

where Self: Sized,

Creates an iterator starting at the same point, but stepping by the given amount at each iteration.

fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter>

where Self: Sized, U: IntoIterator<Item = Self::Item>,

Takes two iterators and creates a new iterator over both in sequence.

fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter>

where Self: Sized, U: IntoIterator,

‘Zips up’ two iterators into a single iterator of pairs.

fn intersperse(self, separator: Self::Item) -> Intersperse<Self>

where Self: Sized, Self::Item: Clone,

🔬This is a nightly-only experimental API. (iter_intersperse)

Creates a new iterator which places a copy of separator between items of the original iterator.

fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G>

where Self: Sized, G: FnMut() -> Self::Item,

🔬This is a nightly-only experimental API. (iter_intersperse)

Creates a new iterator which places an item generated by separator between items of the original iterator.

fn map<B, F>(self, f: F) -> Map<Self, F>

where Self: Sized, F: FnMut(Self::Item) -> B,

Takes a closure and creates an iterator which calls that closure on each element.

fn for_each<F>(self, f: F)

where Self: Sized, F: FnMut(Self::Item),

Calls a closure on each element of an iterator.

fn filter<P>(self, predicate: P) -> Filter<Self, P>

where Self: Sized, P: FnMut(&Self::Item) -> bool,

Creates an iterator which uses a closure to determine if an element should be yielded.

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F>

where Self: Sized, F: FnMut(Self::Item) -> Option<B>,

Creates an iterator that both filters and maps.

fn enumerate(self) -> Enumerate<Self>

where Self: Sized,

Creates an iterator which gives the current iteration count as well as the next value.

fn peekable(self) -> Peekable<Self>

where Self: Sized,

Creates an iterator which can use the peek and peek_mut methods to look at the next element of the iterator without consuming it. See their documentation for more information.

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P>

where Self: Sized, P: FnMut(&Self::Item) -> bool,

Creates an iterator that skips elements based on a predicate.

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P>

where Self: Sized, P: FnMut(&Self::Item) -> bool,

Creates an iterator that yields elements based on a predicate.

fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P>

where Self: Sized, P: FnMut(Self::Item) -> Option<B>,

Creates an iterator that both yields elements based on a predicate and maps.

fn skip(self, n: usize) -> Skip<Self>

where Self: Sized,

Creates an iterator that skips the first n elements.

fn take(self, n: usize) -> Take<Self>

where Self: Sized,

Creates an iterator that yields the first n elements, or fewer if the underlying iterator ends sooner.

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>

where Self: Sized, F: FnMut(&mut St, Self::Item) -> Option<B>,

An iterator adapter which, like fold, holds internal state, but unlike fold, produces a new iterator.

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>

where Self: Sized, U: IntoIterator, F: FnMut(Self::Item) -> U,

Creates an iterator that works like map, but flattens nested structure.

fn flatten(self) -> Flatten<Self>

where Self: Sized, Self::Item: IntoIterator,

Creates an iterator that flattens nested structure.

fn map_windows<F, R, const N: usize>(self, f: F) -> MapWindows<Self, F, N>

where Self: Sized, F: FnMut(&[Self::Item; N]) -> R,

🔬This is a nightly-only experimental API. (iter_map_windows)

Calls the given function f for each contiguous window of size N over self and returns an iterator over the outputs of f. Like slice::windows(), the windows during mapping overlap as well.

fn fuse(self) -> Fuse<Self>

where Self: Sized,

Creates an iterator which ends after the first None.

fn inspect<F>(self, f: F) -> Inspect<Self, F>

where Self: Sized, F: FnMut(&Self::Item),

Does something with each element of an iterator, passing the value on.

fn by_ref(&mut self) -> &mut Self

where Self: Sized,

Creates a “by reference” adapter for this instance of Iterator.

fn collect<B>(self) -> B

where B: FromIterator<Self::Item>, Self: Sized,

Transforms an iterator into a collection.

fn try_collect<B>( &mut self, ) -> <<Self::Item as Try>::Residual as Residual<B>>::TryType

where Self: Sized, Self::Item: Try, <Self::Item as Try>::Residual: Residual<B>, B: FromIterator<<Self::Item as Try>::Output>,

🔬This is a nightly-only experimental API. (iterator_try_collect)

Fallibly transforms an iterator into a collection, short circuiting if a failure is encountered.

fn collect_into<E>(self, collection: &mut E) -> &mut E

where E: Extend<Self::Item>, Self: Sized,

🔬This is a nightly-only experimental API. (iter_collect_into)

Collects all the items from an iterator into a collection.

fn partition<B, F>(self, f: F) -> (B, B)

where Self: Sized, B: Default + Extend<Self::Item>, F: FnMut(&Self::Item) -> bool,

Consumes an iterator, creating two collections from it.

fn is_partitioned<P>(self, predicate: P) -> bool

where Self: Sized, P: FnMut(Self::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_is_partitioned)

Checks if the elements of this iterator are partitioned according to the given predicate, such that all those that return true precede all those that return false.

fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R

where Self: Sized, F: FnMut(B, Self::Item) -> R, R: Try<Output = B>,

An iterator method that applies a function as long as it returns successfully, producing a single, final value.

fn try_for_each<F, R>(&mut self, f: F) -> R

where Self: Sized, F: FnMut(Self::Item) -> R, R: Try<Output = ()>,

An iterator method that applies a fallible function to each item in the iterator, stopping at the first error and returning that error.

fn reduce<F>(self, f: F) -> Option<Self::Item>

where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Self::Item,

Reduces the elements to a single one, by repeatedly applying a reducing operation.

fn try_reduce<R>( &mut self, f: impl FnMut(Self::Item, Self::Item) -> R, ) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryType

where Self: Sized, R: Try<Output = Self::Item>, <R as Try>::Residual: Residual<Option<Self::Item>>,

🔬This is a nightly-only experimental API. (iterator_try_reduce)

Reduces the elements to a single one by repeatedly applying a reducing operation. If the closure returns a failure, the failure is propagated back to the caller immediately.

fn all<F>(&mut self, f: F) -> bool

where Self: Sized, F: FnMut(Self::Item) -> bool,

Tests if every element of the iterator matches a predicate.

fn any<F>(&mut self, f: F) -> bool

where Self: Sized, F: FnMut(Self::Item) -> bool,

Tests if any element of the iterator matches a predicate.

fn find<P>(&mut self, predicate: P) -> Option<Self::Item>

where Self: Sized, P: FnMut(&Self::Item) -> bool,

Searches for an element of an iterator that satisfies a predicate.

fn find_map<B, F>(&mut self, f: F) -> Option<B>

where Self: Sized, F: FnMut(Self::Item) -> Option<B>,

Applies function to the elements of iterator and returns the first non-none result.

fn try_find<R>( &mut self, f: impl FnMut(&Self::Item) -> R, ) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryType

where Self: Sized, R: Try<Output = bool>, <R as Try>::Residual: Residual<Option<Self::Item>>,

🔬This is a nightly-only experimental API. (try_find)

Applies function to the elements of iterator and returns the first true result or the first error.

fn position<P>(&mut self, predicate: P) -> Option<usize>

where Self: Sized, P: FnMut(Self::Item) -> bool,

Searches for an element in an iterator, returning its index.

fn max(self) -> Option<Self::Item>

where Self: Sized, Self::Item: Ord,

Returns the maximum element of an iterator.

fn min(self) -> Option<Self::Item>

where Self: Sized, Self::Item: Ord,

Returns the minimum element of an iterator.

fn max_by_key<B, F>(self, f: F) -> Option<Self::Item>

where B: Ord, Self: Sized, F: FnMut(&Self::Item) -> B,

Returns the element that gives the maximum value from the specified function.

fn max_by<F>(self, compare: F) -> Option<Self::Item>

where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Returns the element that gives the maximum value with respect to the specified comparison function.

fn min_by_key<B, F>(self, f: F) -> Option<Self::Item>

where B: Ord, Self: Sized, F: FnMut(&Self::Item) -> B,

Returns the element that gives the minimum value from the specified function.

fn min_by<F>(self, compare: F) -> Option<Self::Item>

where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> Ordering,

Returns the element that gives the minimum value with respect to the specified comparison function.

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)

where FromA: Default + Extend<A>, FromB: Default + Extend<B>, Self: Sized + Iterator<Item = (A, B)>,

Converts an iterator of pairs into a pair of containers.

fn copied<'a, T>(self) -> Copied<Self>

where T: Copy + 'a, Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which copies all of its elements.

fn cloned<'a, T>(self) -> Cloned<Self>

where T: Clone + 'a, Self: Sized + Iterator<Item = &'a T>,

Creates an iterator which clones all of its elements.

fn cycle(self) -> Cycle<Self>

where Self: Sized + Clone,

Repeats an iterator endlessly.

fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N>

where Self: Sized,

🔬This is a nightly-only experimental API. (iter_array_chunks)

Returns an iterator over N elements of the iterator at a time.

fn sum<S>(self) -> S

where Self: Sized, S: Sum<Self::Item>,

Sums the elements of an iterator.

fn product<P>(self) -> P

where Self: Sized, P: Product<Self::Item>,

Iterates over the entire iterator, multiplying all the elements

fn cmp<I>(self, other: I) -> Ordering

where I: IntoIterator<Item = Self::Item>, Self::Item: Ord, Self: Sized,

Lexicographically compares the elements of this Iterator with those of another.

fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering

where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,

🔬This is a nightly-only experimental API. (iter_order_by)

Lexicographically compares the elements of this Iterator with those of another with respect to the specified comparison function.

fn partial_cmp<I>(self, other: I) -> Option<Ordering>

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Lexicographically compares the PartialOrd elements of this Iterator with those of another. The comparison works like short-circuit evaluation, returning a result without comparing the remaining elements. As soon as an order can be determined, the evaluation stops and a result is returned.

fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering>

where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,

🔬This is a nightly-only experimental API. (iter_order_by)

Lexicographically compares the elements of this Iterator with those of another with respect to the specified comparison function.

fn eq<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialEq<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are equal to those of another.

fn eq_by<I, F>(self, other: I, eq: F) -> bool

where Self: Sized, I: IntoIterator, F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_order_by)

Determines if the elements of this Iterator are equal to those of another with respect to the specified equality function.

fn ne<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialEq<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are not equal to those of another.

fn lt<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically less than those of another.

fn le<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically less or equal to those of another.

fn gt<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically greater than those of another.

fn ge<I>(self, other: I) -> bool

where I: IntoIterator, Self::Item: PartialOrd<<I as IntoIterator>::Item>, Self: Sized,

Determines if the elements of this Iterator are lexicographically greater than or equal to those of another.

fn is_sorted(self) -> bool

where Self: Sized, Self::Item: PartialOrd,

Checks if the elements of this iterator are sorted.

fn is_sorted_by<F>(self, compare: F) -> bool

where Self: Sized, F: FnMut(&Self::Item, &Self::Item) -> bool,

Checks if the elements of this iterator are sorted using the given comparator function.

fn is_sorted_by_key<F, K>(self, f: F) -> bool

where Self: Sized, F: FnMut(Self::Item) -> K, K: PartialOrd,

Checks if the elements of this iterator are sorted using the given key extraction function.

impl<T: RangeFamily> PartialEq for IpRange<T>

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T: RangeFamily> Eq for IpRange<T>

impl<T: RangeFamily> FusedIterator for IpRange<T>