Struct lattices::collections::EmptySet

pub struct EmptySet<T> { /* private fields */ }

A type that will always be an empty set.

Trait Implementations

impl<T: Clone> Clone for EmptySet<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T> Collection for EmptySet<T>

type Item = T

Type of the items of the collection.

impl<T> CollectionRef for EmptySet<T>

type ItemRef<'a> = &'a <EmptySet<T> as Collection>::Item where Self::Item: 'a

Type of references to items of the collection.

fn upcast_item_ref<'short, 'long: 'short>( r: Self::ItemRef<'long>, ) -> Self::ItemRef<'short>

where Self: 'long,

Changes an item reference into a shorter lived reference.

impl<T: Debug> Debug for EmptySet<T>

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

Formats the value using the given formatter.

impl<T: Default> Default for EmptySet<T>

fn default() -> EmptySet<T>

Returns the “default value” for a type.

impl<'de, T> Deserialize<'de> for EmptySet<T>

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<'a, Q, T> Get<&'a Q> for EmptySet<T>

fn get(&self, _key: &'a Q) -> Option<Self::ItemRef<'_>>

Returns a reference to the item stored behind the given key (if any).

fn contains(&self, key: T) -> bool

Checks if the collection contains an item behind the given key.

impl<T: Hash> Hash for EmptySet<T>

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

Feeds this value into the given Hasher.

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

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T> IntoIterator for EmptySet<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = Empty<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T> Iter for EmptySet<T>

type Iter<'a> = Empty<&'a T> where T: 'a

Iterator type.

fn iter(&self) -> Self::Iter<'_>

Create an iterator over the items of the collection.

impl<T> Len for EmptySet<T>

fn len(&self) -> usize

Returns the number of elements in the collection.

fn is_empty(&self) -> bool

Checks if the collection is empty.

impl<T: Ord> Ord for EmptySet<T>

fn cmp(&self, other: &EmptySet<T>) -> Ordering

This method returns an Ordering between self and other.

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

where Self: Sized,

Compares and returns the maximum of two values.

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

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized + PartialOrd,

Restrict a value to a certain interval.

impl<T, Rhs> PartialEq<Rhs> for EmptySet<T>

where Rhs: Len,

fn eq(&self, other: &Rhs) -> 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: PartialOrd> PartialOrd for EmptySet<T>

fn partial_cmp(&self, other: &EmptySet<T>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<T> Serialize for EmptySet<T>

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<T> SimpleCollectionRef for EmptySet<T>

fn into_ref<'r>(r: Self::ItemRef<'r>) -> &'r Self::Item

where Self: 'r,

impl<T: Copy> Copy for EmptySet<T>

impl<T> Eq for EmptySet<T>