pub struct NullSortedValue<'a, const NULLS_FIRST: bool, T>(pub &'a T);Expand description
A wrapper on [T] that specifies if a null or missing value should be ordered before
([NULLS_FIRST] is true) or after ([NULLS_FIRST] is false) other values.
Tuple Fields§
§0: &'a TTrait Implementations§
Source§impl<const NULLS_FIRST: bool> Ord for NullSortedValue<'_, NULLS_FIRST, Bag>
impl<const NULLS_FIRST: bool> Ord for NullSortedValue<'_, NULLS_FIRST, Bag>
Source§impl<const NULLS_FIRST: bool> Ord for NullSortedValue<'_, NULLS_FIRST, List>
impl<const NULLS_FIRST: bool> Ord for NullSortedValue<'_, NULLS_FIRST, List>
Source§impl<const NULLS_FIRST: bool> Ord for NullSortedValue<'_, NULLS_FIRST, Tuple>
impl<const NULLS_FIRST: bool> Ord for NullSortedValue<'_, NULLS_FIRST, Tuple>
Source§impl<const NULLS_FIRST: bool> Ord for NullSortedValue<'_, NULLS_FIRST, Value>
impl<const NULLS_FIRST: bool> Ord for NullSortedValue<'_, NULLS_FIRST, Value>
Source§impl<const NULLS_FIRST: bool> Ord for NullSortedValue<'_, NULLS_FIRST, Variant>
impl<const NULLS_FIRST: bool> Ord for NullSortedValue<'_, NULLS_FIRST, Variant>
Source§impl<'a, const NULLS_FIRST: bool, T: PartialEq> PartialEq for NullSortedValue<'a, NULLS_FIRST, T>
impl<'a, const NULLS_FIRST: bool, T: PartialEq> PartialEq for NullSortedValue<'a, NULLS_FIRST, T>
Source§fn eq(&self, other: &NullSortedValue<'a, NULLS_FIRST, T>) -> bool
fn eq(&self, other: &NullSortedValue<'a, NULLS_FIRST, T>) -> bool
Tests for
self and other values to be equal, and is used by ==.Source§impl<'a, const NULLS_FIRST: bool, T> PartialOrd for NullSortedValue<'a, NULLS_FIRST, T>
impl<'a, const NULLS_FIRST: bool, T> PartialOrd for NullSortedValue<'a, NULLS_FIRST, T>
impl<'a, const NULLS_FIRST: bool, T: Eq> Eq for NullSortedValue<'a, NULLS_FIRST, T>
impl<'a, const NULLS_FIRST: bool, T> StructuralPartialEq for NullSortedValue<'a, NULLS_FIRST, T>
Auto Trait Implementations§
impl<'a, const NULLS_FIRST: bool, T> Freeze for NullSortedValue<'a, NULLS_FIRST, T>
impl<'a, const NULLS_FIRST: bool, T> RefUnwindSafe for NullSortedValue<'a, NULLS_FIRST, T>where
T: RefUnwindSafe,
impl<'a, const NULLS_FIRST: bool, T> Send for NullSortedValue<'a, NULLS_FIRST, T>where
T: Sync,
impl<'a, const NULLS_FIRST: bool, T> Sync for NullSortedValue<'a, NULLS_FIRST, T>where
T: Sync,
impl<'a, const NULLS_FIRST: bool, T> Unpin for NullSortedValue<'a, NULLS_FIRST, T>
impl<'a, const NULLS_FIRST: bool, T> UnwindSafe for NullSortedValue<'a, NULLS_FIRST, T>where
T: RefUnwindSafe,
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<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
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<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
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