UnorderedPairs

algebraeon_sets::structure

Struct UnorderedPairs 

Source 
pub struct UnorderedPairs<Set> { /* private fields */ }
Expand description

The set of unordered Pairs of distinct elements

Implementations§

Source§

impl<Set: SetSignature> UnorderedPairs<Set>

Source

pub fn new(set: Set) -> Self

Source§

impl<S: SetSignature + EqSignature> UnorderedPairs<S>

Source

pub fn new_pair( &self, a: &S::Set, b: &S::Set, ) -> Result<UnorderedPair<S::Set>, String>

Trait Implementations§

Source§

impl<Set: Clone> Clone for UnorderedPairs<Set>

Source§

fn clone(&self) -> UnorderedPairs<Set>

Returns a duplicate of the value. Read more
1.0.0 · Source§

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

Performs copy-assignment from source. Read more
Source§

impl<Set: Debug> Debug for UnorderedPairs<Set>

Source§

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

Formats the value using the given formatter. Read more
Source§

impl<S: SetSignature + EqSignature> EqSignature for UnorderedPairs<S>

Source§

fn equal(&self, a: &Self::Set, b: &Self::Set) -> bool

Source§

impl<Set: PartialEq> PartialEq for UnorderedPairs<Set>

Source§

fn eq(&self, other: &UnorderedPairs<Set>) -> bool

Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§

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

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

impl<S: SetSignature + EqSignature> SetSignature for UnorderedPairs<S>

Source§

type Set = UnorderedPair<<S as SetSignature>::Set>

Source§

fn is_element(&self, x: &Self::Set) -> Result<(), String>

Some instances of Self::Set may not be valid to represent elements of this set. Return true if x is a valid element and false if not.
Source§

impl<Set: Eq> Eq for UnorderedPairs<Set>

Source§

impl<S: SetSignature> Signature for UnorderedPairs<S>

Source§

impl<Set> StructuralPartialEq for UnorderedPairs<Set>

Auto Trait Implementations§

§

impl<Set> Freeze for UnorderedPairs<Set>
where Set: Freeze,

§

impl<Set> RefUnwindSafe for UnorderedPairs<Set>
where Set: RefUnwindSafe,

§

impl<Set> Send for UnorderedPairs<Set>
where Set: Send,

§

impl<Set> Sync for UnorderedPairs<Set>
where Set: Sync,

§

impl<Set> Unpin for UnorderedPairs<Set>
where Set: Unpin,

§

impl<Set> UnwindSafe for UnorderedPairs<Set>
where Set: UnwindSafe,

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
Source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V

Source§

impl<Domain, Range, M, BM> BorrowedMorphism<Domain, Range, M> for BM
where Domain: Signature, Range: Signature, M: Morphism<Domain, Range>, BM: Borrow<M> + Clone + Debug + Send + Sync,

Source§

impl<S, BS> BorrowedSet<S> for BS
where BS: Borrow<S> + Clone + Debug + Send + Sync,

Source§

impl<S, BS> BorrowedStructure<S> for BS
where S: Signature, BS: Borrow<S> + Clone + Debug + Eq + Send + Sync,