Struct SetMinimalBasis 

pub struct SetMinimalBasis<T: PartialOrder + PartialEq + Hash + Eq> {
    configs: Vec<T>,
}

Set of configurations where each element is incomparable to every other element in the set

Each configuration represents an upwards closed set of configurations, where each of the configurations contained is the minimal basis of the set of configurations it represents.

Fields

configs: Vec<T>

Implementations

impl<T: PartialOrder + PartialEq + Hash + Eq> SetMinimalBasis<T>

pub fn new<V: Into<Vec<T>>>(configs: V) -> Self

Create a new set of minimal basis

If there are comparable elements only the smaller one will be maintained in the set.

pub fn retain<F>(&mut self, f: F)

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

Retain only the elements for which f returns true

Trait Implementations

impl<T: Clone + PartialOrder + PartialEq + Hash + Eq> Clone for SetMinimalBasis<T>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug + PartialOrder + PartialEq + Hash + Eq> Debug for SetMinimalBasis<T>

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

Formats the value using the given formatter.

impl<T: PartialOrder + PartialEq + Hash + Eq, I: Iterator<Item = T>> From<I> for SetMinimalBasis<T>

fn from(value: I) -> Self

Converts to this type from the input type.

impl<'a, T: PartialOrder + PartialEq + Hash + Eq> IntoIterator for &'a SetMinimalBasis<T>

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: PartialOrder + PartialEq + Hash + Eq> IntoIterator for SetMinimalBasis<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = <Vec<T> as IntoIterator>::IntoIter

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: PartialEq + PartialOrder + PartialEq + Hash + Eq> PartialEq for SetMinimalBasis<T>

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl<T: PartialOrder + PartialEq + Hash + Eq> StructuralPartialEq for SetMinimalBasis<T>