Struct math::partition::integer_partitions::IntegerPartitions

pub struct IntegerPartitions<T: Copy + Integer + ToPrimitive> { /* private fields */ }

A collection of disjoint integer intervals

Implementations

impl<T: Copy + Integer + ToPrimitive> IntegerPartitions<T>

pub fn new(partitions: Vec<Partition<T>>) -> IntegerPartitions<T>

pub fn num_partitions(&self) -> usize

pub fn iter(&self) -> IntegerPartitionIter<T>

Creates an iterator that iterates through the partitions.

pub fn union(&self) -> Partition<T>

Converts the collection of partitions into a single Partition consisting of the same integer elements.

Trait Implementations

impl<T: Clone + Copy + Integer + ToPrimitive> Clone for IntegerPartitions<T>

fn clone(&self) -> IntegerPartitions<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug + Copy + Integer + ToPrimitive> Debug for IntegerPartitions<T>

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

Formats the value using the given formatter.

impl<T: Copy + Integer + ToPrimitive> Index<usize> for IntegerPartitions<T>

type Output = OrderedIntegerSet<T>

The returned type after indexing.

fn index(&self, index: usize) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<T: PartialEq + Copy + Integer + ToPrimitive> PartialEq for IntegerPartitions<T>

fn eq(&self, other: &IntegerPartitions<T>) -> bool

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

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

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

impl<T: Eq + Copy + Integer + ToPrimitive> Eq for IntegerPartitions<T>

impl<T: Copy + Integer + ToPrimitive> StructuralEq for IntegerPartitions<T>

impl<T: Copy + Integer + ToPrimitive> StructuralPartialEq for IntegerPartitions<T>