Struct I8CO

Source

pub struct I8CO { /* private fields */ }

Implementations§

Source §

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

Constructs an I8CO interval from a midpoint and length (u8).

§Parameters

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

§Returns

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

§Guarantees

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

Source

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

Constructs an I8CO interval from a midpoint and length (u8) with saturating semantics.

§Parameters

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

§Behavior

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

§Guarantees

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

Source §

impl I8CO

Source

pub const fn checked_from_start_len(start: i8, len: u8) -> Option<Self>

Constructs an I8CO interval from a start position and length.

The resulting interval is [start, start + len).

Handles signed cross-zero intervals without widening arithmetic. For example, start = -3, len = 5 produces [-3, 2).

Returns None if:

len == 0;
start + len would exceed i8::MAX.

Source

pub const fn saturating_from_start_len(start: i8, len: u8) -> Option<Self>

Constructs an I8CO interval from a start position and length, saturating the exclusive end bound at i8::MAX.

The resulting interval is [start, saturated_end_excl).

Returns None if:

len == 0;
saturation still produces an empty interval, e.g. start == i8::MAX.

Source §

impl I8CO

Source

pub const fn start(self) -> i8

Source

pub const fn end_excl(self) -> i8

Source

pub const fn end_incl(self) -> i8

Source

pub const fn len(self) -> u8

Source

pub const fn midpoint(self) -> i8

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 i8 range)

Source

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

Source

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

Source

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

Source

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

Source

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

Source

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

Source

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

Source §

impl I8CO

Source

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

Returns the intersection of two intervals.

If the intervals do not overlap, returns None.

Source

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

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

Always returns a valid I8CO.

Source

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.

Source

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.

Source

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.

Source

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.

Source §