Struct U32CO 

pub struct U32CO { /* private fields */ }

Implementations

impl U32CO

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

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

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

Construct a U32CO from a midpoint and a length.

Returns None if the computed interval is invalid or overflows u32.

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

Saturating version: from midpoint + length, keeps start < end_excl

impl U32CO

pub const fn start(self) -> u32

pub const fn end_excl(self) -> u32

pub const fn end_incl(self) -> u32

pub const fn len(self) -> u32

pub const fn midpoint(self) -> u32

Returns the midpoint of the interval (floor division).

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

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

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

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

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 U32CO

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 U32CO.

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 U32CO

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

Minkowski addition: [a_start, a_end) + [b_start, b_end)

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

Minkowski subtraction: [a_start, a_end) - [b_start, b_end)

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

Minkowski multiplication: [a_start, a_end) * [b_start, b_end)

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

Minkowski division: [a_start, a_end) / [b_start, b_end)

impl U32CO

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

Add a scalar to an interval: [start, end) + n

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

Subtract a scalar from an interval: [start, end) - n

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

Multiply an interval by a scalar: [start, end) * n

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

Divide an interval by a scalar: [start, end) / n

impl U32CO

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 U32CO

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

Saturating add scalar: [start, end) + n

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

Saturating sub scalar: [start, end) - n

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

Saturating mul scalar: [start, end) * n

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

Saturating div scalar: [start, end) / n

Trait Implementations

impl Clone for U32CO

fn clone(&self) -> U32CO

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for U32CO

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

Formats the value using the given formatter.

impl Hash for U32CO

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 Ord for U32CO

fn cmp(&self, other: &U32CO) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for U32CO

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

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

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Copy for U32CO

impl Eq for U32CO

impl StructuralPartialEq for U32CO