Enum PositionSpan 

pub enum PositionSpan {
    Range {
        start: usize,
        end: usize,
    },
    Discrete(Vec<usize>),
}

Variants

Range

Fields

start: usize

end: usize

Discrete(Vec<usize>)

Implementations

impl PositionSpan

pub fn range(start: usize, end: usize) -> Self

pub fn new(start: usize, end: usize) -> Self

pub fn from_positions(positions: impl IntoIterator<Item = usize>) -> Self

pub fn empty() -> Self

pub fn iter(&self) -> SpanIter<'_>

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn bounds(&self) -> (usize, usize)

pub fn contains(&self, pos: usize) -> bool

pub fn overlaps_set(&self, set: &PositionSet) -> bool

pub fn to_position_set(&self) -> PositionSet

pub fn to_vec(&self) -> Vec<usize>

pub fn is_contiguous(&self) -> bool

Returns true if the positions form a contiguous range with no gaps. This is always true for Range variants, and checks adjacency for Discrete.

Trait Implementations

impl Clone for PositionSpan

fn clone(&self) -> PositionSpan

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PositionSpan

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

Formats the value using the given formatter.

impl PartialEq for PositionSpan

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

Compare two PositionSpans for semantic equality.

Returns true if both spans contain exactly the same positions, regardless of representation (Range vs Discrete).

Performance:

• Range vs Range: O(1)
• Discrete vs Discrete: O(n)
• Range vs Discrete: O(n) with early exit on length mismatch

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

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