Struct analytic::set::ordered_integer_set::ContiguousIntegerSet

pub struct ContiguousIntegerSet<E: Integer + Copy> { /* fields omitted */ }

represents the set of integers in [start, end]

Methods

impl<E: Integer + Copy> ContiguousIntegerSet<E>

pub fn new(start: E, end: E) -> ContiguousIntegerSet<E>

pub fn get_start_and_end(&self) -> (E, E)

pub fn is_subset_of(&self, other: &ContiguousIntegerSet<E>) -> bool

pub fn slice<'a, I: Slicing<&'a ContiguousIntegerSet<E>, Option<ContiguousIntegerSet<E>>>>(
    &'a self,
    slicer: I
) -> Option<ContiguousIntegerSet<E>>

Trait Implementations

impl<E: Integer + Copy> Interval for ContiguousIntegerSet<E>

type Element = E

fn get_start(&self) -> E

fn get_end(&self) -> E

fn length(&self) -> E

impl<E: Integer + Copy> Coalesce<ContiguousIntegerSet<E>> for ContiguousIntegerSet<E>

returns an interval if only if the two intervals can be merged into a single non-empty interval. An empty interval can be merged with any other non-empty interval

fn coalesce_with(&self, other: &Self) -> Option<Self>

impl<E: Integer + Copy> Coalesce<E> for ContiguousIntegerSet<E>

fn coalesce_with(&self, other: &E) -> Option<Self>

impl<E: Integer + Copy + ToPrimitive> CoalesceIntervals<ContiguousIntegerSet<E>, E> for OrderedIntegerSet<E>

fn to_coalesced_intervals(&self) -> Vec<ContiguousIntegerSet<E>>

fn coalesce_intervals_inplace(&mut self)

fn into_coalesced(self) -> Self

impl<'_, E: Integer + Copy + ToPrimitive> Sample<'_, ContiguousIntegerSetIter<E>, E, OrderedIntegerSet<E>> for ContiguousIntegerSet<E>

fn sample_subset_without_replacement<'s: 'a>(
    &'s self,
    size: usize
) -> Result<O, String>

samples size elements without replacement size: the number of samples to be drawn returns Err if size is larger than the population size

impl<'_, E: Integer + Copy + FromPrimitive + ToPrimitive> Slicing<&'_ ContiguousIntegerSet<E>, Option<ContiguousIntegerSet<E>>> for Range<usize>

fn slice(
    self,
    input: &ContiguousIntegerSet<E>
) -> Option<ContiguousIntegerSet<E>>

impl<E: Integer + Copy> Set<E, Option<ContiguousIntegerSet<E>>> for ContiguousIntegerSet<E>

fn is_empty(&self) -> bool

fn contains(&self, item: E) -> bool

fn intersect(
    &self,
    other: &ContiguousIntegerSet<E>
) -> Option<ContiguousIntegerSet<E>>

impl<E: Integer + Copy + ToPrimitive> Finite for ContiguousIntegerSet<E>

fn size(&self) -> usize

impl<E: Integer + Copy + ToPrimitive> Refineable<Vec<ContiguousIntegerSet<E>>> for ContiguousIntegerSet<E>

fn get_common_refinement(
    &self,
    other: &ContiguousIntegerSet<E>
) -> IntegerIntervalRefinement<E>

impl<'_, E: Integer + Copy> ToIterator<'_, ContiguousIntegerSetIter<E>, E> for ContiguousIntegerSet<E>

Important traits for ContiguousIntegerSetIter<E>

impl<E: Integer + Copy> Iterator for ContiguousIntegerSetIter<E> type Item = E;

fn to_iter(&self) -> ContiguousIntegerSetIter<E>

impl<E: Integer + Copy> From<ContiguousIntegerSet<E>> for ContiguousIntegerSetIter<E>

Important traits for ContiguousIntegerSetIter<E>

impl<E: Integer + Copy> Iterator for ContiguousIntegerSetIter<E> type Item = E;

fn from(
    contiguous_integer_set: ContiguousIntegerSet<E>
) -> ContiguousIntegerSetIter<E>

Performs the conversion.

impl<E: Clone + Integer + Copy> Clone for ContiguousIntegerSet<E>

fn clone(&self) -> ContiguousIntegerSet<E>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<E: PartialEq + Integer + Copy> PartialEq<ContiguousIntegerSet<E>> for ContiguousIntegerSet<E>

fn eq(&self, other: &ContiguousIntegerSet<E>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &ContiguousIntegerSet<E>) -> bool

This method tests for !=.

impl<E: Eq + Integer + Copy> Eq for ContiguousIntegerSet<E>

impl<E: Copy + Integer> Copy for ContiguousIntegerSet<E>

impl<E: Debug + Integer + Copy> Debug for ContiguousIntegerSet<E>

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

Formats the value using the given formatter.

impl<'_, E: Integer + Copy + ToPrimitive> Sub<&'_ ContiguousIntegerSet<E>> for ContiguousIntegerSet<E>

type Output = OrderedIntegerSet<E>

The resulting type after applying the - operator.

fn sub(self, rhs: &ContiguousIntegerSet<E>) -> Self::Output

Performs the - operation.

impl<E: Integer + Copy + ToPrimitive> Sub<ContiguousIntegerSet<E>> for ContiguousIntegerSet<E>

type Output = OrderedIntegerSet<E>

The resulting type after applying the - operator.

fn sub(self, rhs: ContiguousIntegerSet<E>) -> Self::Output

Performs the - operation.

impl<'_, E: Integer + Copy + ToPrimitive> Sub<&'_ ContiguousIntegerSet<E>> for OrderedIntegerSet<E>

type Output = Self

The resulting type after applying the - operator.

fn sub(self, rhs: &ContiguousIntegerSet<E>) -> Self::Output

Performs the - operation.

impl<E: Integer + Copy + ToPrimitive> Sub<ContiguousIntegerSet<E>> for OrderedIntegerSet<E>

type Output = Self

The resulting type after applying the - operator.

fn sub(self, rhs: ContiguousIntegerSet<E>) -> Self::Output

Performs the - operation.

impl<'_, E: Integer + Copy + ToPrimitive> Sub<&'_ OrderedIntegerSet<E>> for ContiguousIntegerSet<E>

type Output = OrderedIntegerSet<E>

The resulting type after applying the - operator.

fn sub(self, rhs: &OrderedIntegerSet<E>) -> Self::Output

Performs the - operation.

impl<E: Integer + Copy + ToPrimitive> Sub<OrderedIntegerSet<E>> for ContiguousIntegerSet<E>

type Output = OrderedIntegerSet<E>

The resulting type after applying the - operator.

fn sub(self, rhs: OrderedIntegerSet<E>) -> Self::Output

Performs the - operation.

impl<'_, E: Integer + Copy + ToPrimitive> SubAssign<&'_ ContiguousIntegerSet<E>> for OrderedIntegerSet<E>

fn sub_assign(&mut self, rhs: &ContiguousIntegerSet<E>)

Performs the -= operation.

impl<E: Integer + Copy + ToPrimitive> SubAssign<ContiguousIntegerSet<E>> for OrderedIntegerSet<E>

fn sub_assign(&mut self, rhs: ContiguousIntegerSet<E>)

Performs the -= operation.

impl<E: Hash + Integer + Copy> Hash for ContiguousIntegerSet<E>

fn hash<__HE: Hasher>(&self, state: &mut __HE)

Feeds this value into the given [Hasher].

fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given [Hasher].