Struct Conjunction 

pub struct Conjunction<T: PartialEq>(Vec<T>);

Conjunction of T

Tuple Fields

0: Vec<T>

Implementations

impl<T: PartialEq> Conjunction<T>

pub fn is_empty(&self) -> bool

Check whether the conjunction has no conjuncts, i.e., is true

pub fn len(&self) -> usize

Returns the number of elements in the conjunction

pub fn get(&self, index: usize) -> Option<&T>

Get a reference to the conjunct at index

Returns None if index is out of bounds.

pub fn get_mut(&mut self, index: usize) -> Option<&mut T>

Get a mutable reference to the conjunct at index

Returns None if index is out of bounds.

impl<T: PartialEq> Conjunction<T>

pub fn iter(&self) -> Iter<'_, T>

Iterate over the conjuncts

pub fn iter_mut(&mut self) -> IterMut<'_, T>

Iterate over the conjuncts, allowing them to be modified

Trait Implementations

impl<T: PartialEq> And for Conjunction<T>

fn and(self, other: Self) -> Self

Get the conjunction of self and other

impl<T: PartialEq> AsMut<[T]> for Conjunction<T>

fn as_mut(&mut self) -> &mut [T]

Converts this type into a mutable reference of the (usually inferred) input type.

impl<T: PartialEq> AsRef<[T]> for Conjunction<T>

fn as_ref(&self) -> &[T]

Converts this type into a shared reference of the (usually inferred) input type.

impl<T: Clone + PartialEq> Clone for Conjunction<T>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug + PartialEq> Debug for Conjunction<T>

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

Formats the value using the given formatter.

impl<T: PartialEq> Default for Conjunction<T>

fn default() -> Self

The empty conjunction, i.e., true

impl<T: Display + PartialEq> Display for Conjunction<T>

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

Formats the value using the given formatter.

impl<T: PartialEq, S: Into<Vec<T>>> From<S> for Conjunction<T>

fn from(value: S) -> Self

Converts to this type from the input type.

impl<T: PartialEq> FromIterator<T> for Conjunction<T>

fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self

Creates a value from an iterator.

impl<T: PartialEq> Index<usize> for Conjunction<T>

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

Access the conjunct at the given index

Panics

Panics if index is out of bounds.

type Output = T

The returned type after indexing.

impl<T: PartialEq> IndexMut<usize> for Conjunction<T>

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

Mutably access the conjunct at the given index

Panics

Panics if index is out of bounds.

impl<T: PartialEq> IntoIterator for Conjunction<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<'a, T: PartialEq> IntoIterator for &'a Conjunction<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<'a, T: PartialEq> IntoIterator for &'a mut Conjunction<T>

type Item = &'a mut T

The type of the elements being iterated over.

type IntoIter = IterMut<'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: PartialEq> PartialEq for Conjunction<T>

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

Set equality: two conjunctions are equal if they contain the same conjuncts, regardless of order or duplicates.

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

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