Enum Set 

pub enum Set {
    Range(Vec<i64>),
    Strings(Vec<String>),
    Tuples(Vec<IndexTuple>),
}

A finite, ordered index set.

Supports integer ranges, string lists, and arbitrary tuple lists (built via Set::product / the &a * &b operator, or constructed directly).

Variants

Range(Vec<i64>)

Strings(Vec<String>)

Tuples(Vec<IndexTuple>)

Implementations

impl Set

pub fn range<T: PrimInt>(r: Range<T>) -> Self

Build an integer index set from a range over any primitive integer type. Accepts Range<i64>, Range<i32>, Range<usize>, etc.

The untyped literal form Set::range(0..5) defaults to i32 and works without annotation.

Panics

Panics if either range bound does not fit in i64.

pub fn from_ints<T, I>(iter: I) -> Self

where T: PrimInt, I: IntoIterator<Item = T>,

Build an integer index set from an iterator of any primitive integer type. Useful when keys are sparse or computed (e.g. only even indices).

Panics

Panics if any element does not fit in i64.

pub fn strings<I, S>(iter: I) -> Self

where I: IntoIterator<Item = S>, S: Into<String>,

pub fn tuples<I, T>(iter: I) -> Self

where I: IntoIterator<Item = T>, T: Into<IndexTuple>,

Build a tuple set directly from an iterator of keys.

pub fn product(a: &Set, b: &Set) -> Self

Cartesian product of two sets. Inner tuple keys are flattened so a product (a * b) * c yields 3-element tuples, not nested 2-tuples.

pub fn filter<F>(&self, f: F) -> Self

where F: FnMut(&IndexKey) -> bool,

Filter keys with a predicate. Preserves the original variant where possible, filtered Range/Strings stay in their native variant.

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

impl Set

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

pub fn par_iter(&self) -> impl ParallelIterator<Item = IndexKey> + '_

Trait Implementations

impl Clone for Set

fn clone(&self) -> Set

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Set

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

Formats the value using the given formatter.

impl<'a> IntoIterator for &'a Set

type Item = IndexKey

The type of the elements being iterated over.

type IntoIter = SetIter<'a>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl Mul<&Set> for &Set

type Output = Set

The resulting type after applying the * operator.

fn mul(self, rhs: &Set) -> Set

Performs the * operation.