Struct I128CO 

pub struct I128CO { /* private fields */ }

Implementations

impl I128CO

pub const fn try_new(start: i128, end_excl: i128) -> Option<Self>

pub const unsafe fn new_unchecked(start: i128, end_excl: i128) -> Self

pub const fn start(self) -> i128

pub const fn end_excl(self) -> i128

pub const fn end_incl(self) -> i128

pub const fn len(self) -> u128

pub const fn midpoint(self) -> i128

Returns the midpoint of the interval [start, end_excl), using floor division if the length is even.

Guarantees

• midpoint() ∈ [self.start, self.end_excl - 1]
• Works for intervals with maximum length (entire i128 range)

pub const fn checked_from_midpoint_len(mid: i128, len: u128) -> Option<Self>

Constructs an I128CO interval from a midpoint and length (u128).

Parameters

• mid: the desired midpoint of the interval
• len: the desired length of the interval in units, must be 1..=u128::MAX

Returns

• Some(I128CO) if the interval [start, end_excl) can be represented in i128
• None if len = 0 or the computed start / end_excl would overflow i128

Guarantees

• Returned interval satisfies start < end_excl
• Maximum accepted input length is u128::MAX

pub const fn saturating_from_midpoint_len(mid: i128, len: u128) -> Option<Self>

Constructs an I128CO interval from a midpoint and length (u128) with saturating semantics.

Parameters

• mid: the desired midpoint of the interval
• len: the desired length of the interval in units, must be 1..=u128::MAX

Behavior

• Values are saturated at i128::MIN / i128::MAX to prevent overflow.
• If len = 0, returns None.

Guarantees

• Returned interval satisfies start < end_excl
• Maximum accepted input length is u128::MAX
• Fully compatible with codegen for other signed integer interval types

pub const fn contains(self, x: i128) -> bool

pub const fn contains_interval(self, other: Self) -> bool

pub const fn iter(self) -> Range<i128>

pub const fn to_range(self) -> Range<i128>

pub const fn intersects(self, other: Self) -> bool

pub const fn is_adjacent(self, other: Self) -> bool

pub const fn is_contiguous_with(self, other: Self) -> bool

impl I128CO

pub const fn intersection(self, other: Self) -> Option<Self>

Returns the intersection of two intervals.

If the intervals do not overlap, returns None.

pub const fn convex_hull(self, other: Self) -> Self

Returns the convex hull (smallest interval containing both) of two intervals.

Always returns a valid I128CO.

pub const fn between(self, other: Self) -> Option<Self>

Returns the interval strictly between two intervals.

If the intervals are contiguous or overlap, returns None.

pub const fn union(self, other: Self) -> OneTwo<Self>

Returns the union of two intervals.

• If intervals are contiguous or overlapping, returns One containing the merged interval.
• Otherwise, returns Two containing both intervals in ascending order.

pub const fn difference(self, other: Self) -> ZeroOneTwo<Self>

Returns the difference of two intervals (self - other).

• If no overlap, returns One(self).
• If partial overlap, returns One or Two depending on remaining segments.
• If fully contained, returns Zero.

pub const fn symmetric_difference(self, other: Self) -> ZeroOneTwo<Self>

Returns the symmetric difference of two intervals.

Equivalent to (self - other) ∪ (other - self).

• If intervals do not overlap, returns Two(self, other) in order.
• If intervals partially overlap, returns remaining non-overlapping segments as One or Two.

impl I128CO

pub const fn checked_minkowski_add(self, other: Self) -> Option<Self>

pub const fn checked_minkowski_sub(self, other: Self) -> Option<Self>

pub const fn checked_minkowski_mul(self, other: Self) -> Option<Self>

pub const fn checked_minkowski_div(self, other: Self) -> Option<Self>

impl I128CO

pub const fn checked_minkowski_add_n(self, n: i128) -> Option<Self>

pub const fn checked_minkowski_sub_n(self, n: i128) -> Option<Self>

pub const fn checked_minkowski_mul_n(self, n: i128) -> Option<Self>

pub const fn checked_minkowski_div_n(self, n: i128) -> Option<Self>

impl I128CO

pub const fn saturating_minkowski_add(self, other: Self) -> Option<Self>

pub const fn saturating_minkowski_sub(self, other: Self) -> Option<Self>

pub const fn saturating_minkowski_mul(self, other: Self) -> Option<Self>

pub const fn saturating_minkowski_div(self, other: Self) -> Option<Self>

impl I128CO

pub const fn saturating_minkowski_add_n(self, n: i128) -> Option<Self>

pub const fn saturating_minkowski_sub_n(self, n: i128) -> Option<Self>

pub const fn saturating_minkowski_mul_n(self, n: i128) -> Option<Self>

pub const fn saturating_minkowski_div_n(self, n: i128) -> Option<Self>

Trait Implementations

impl Clone for I128CO

fn clone(&self) -> I128CO

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for I128CO

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

Formats the value using the given formatter.

impl Hash for I128CO

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 PartialEq for I128CO

fn eq(&self, other: &I128CO) -> 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 Copy for I128CO

impl Eq for I128CO

impl StructuralPartialEq for I128CO