pub struct EmptySetStructure<Set> { /* private fields */ }Trait Implementations§
Source§impl<Set> Clone for EmptySetStructure<Set>
impl<Set> Clone for EmptySetStructure<Set>
Source§impl<Set> Debug for EmptySetStructure<Set>
impl<Set> Debug for EmptySetStructure<Set>
Source§impl<Set> Default for EmptySetStructure<Set>
impl<Set> Default for EmptySetStructure<Set>
Source§impl<Set: Debug + Clone + Send + Sync> EqSignature for EmptySetStructure<Set>
impl<Set: Debug + Clone + Send + Sync> EqSignature for EmptySetStructure<Set>
Source§impl<Set: Debug + Clone + Send + Sync> OrdSignature for EmptySetStructure<Set>
impl<Set: Debug + Clone + Send + Sync> OrdSignature for EmptySetStructure<Set>
fn cmp(&self, _: &Self::Set, _: &Self::Set) -> Ordering
fn max(&self, a: &Self::Set, b: &Self::Set) -> Self::Set
fn min(&self, a: &Self::Set, b: &Self::Set) -> Self::Set
fn is_sorted(&self, a: &[impl Borrow<Self::Set>]) -> bool
fn is_sorted_by_key<X>(&self, a: &[X], key: impl Fn(&X) -> &Self::Set) -> bool
fn is_sorted_and_unique(&self, a: &[impl Borrow<Self::Set>]) -> bool
fn is_sorted_and_unique_by_key<X>( &self, a: &[X], key: impl Fn(&X) -> &Self::Set, ) -> bool
fn binary_search( &self, v: &[impl Borrow<Self::Set>], target: &Self::Set, ) -> bool
fn binary_search_by_key<'x, X>( &self, v: &'x [X], target: &Self::Set, key: impl Fn(&X) -> &Self::Set, ) -> Option<&'x X>
fn merge_sorted<'s, S: Borrow<Self::Set> + 's>( &'s self, a: Vec<S>, b: Vec<S>, ) -> impl Iterator<Item = (MergedSource, S)>
fn merge_sorted_by_key<X>( &self, a: Vec<X>, b: Vec<X>, key: impl Fn(&X) -> &Self::Set, ) -> impl Iterator<Item = (MergedSource, X)>
fn sort<S: Borrow<Self::Set>>(&self, a: Vec<S>) -> Vec<S>
fn sort_by_key<X>(&self, a: Vec<X>, key: &impl Fn(&X) -> &Self::Set) -> Vec<X>
fn sort_by_cached_by<X: 'static>(
&self,
a: Vec<X>,
key: impl Fn(&X) -> Self::Set,
) -> Vec<X>where
Self::Set: 'static,
Source§impl<Set> PartialEq for EmptySetStructure<Set>
impl<Set> PartialEq for EmptySetStructure<Set>
Source§impl<Set: Debug + Clone + Send + Sync> PartialOrdSignature for EmptySetStructure<Set>
impl<Set: Debug + Clone + Send + Sync> PartialOrdSignature for EmptySetStructure<Set>
Source§impl<Set: Debug + Clone + Send + Sync> SetSignature for EmptySetStructure<Set>
impl<Set: Debug + Clone + Send + Sync> SetSignature for EmptySetStructure<Set>
impl<Set> Eq for EmptySetStructure<Set>
impl<Set: Send + Sync> Signature for EmptySetStructure<Set>
Auto Trait Implementations§
impl<Set> Freeze for EmptySetStructure<Set>
impl<Set> RefUnwindSafe for EmptySetStructure<Set>where
Set: RefUnwindSafe,
impl<Set> Send for EmptySetStructure<Set>where
Set: Send,
impl<Set> Sync for EmptySetStructure<Set>where
Set: Sync,
impl<Set> Unpin for EmptySetStructure<Set>where
Set: Unpin,
impl<Set> UnwindSafe for EmptySetStructure<Set>where
Set: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
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 moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
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