Struct partiql_value::NullSortedValue
source · 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 T
Trait Implementations§
source§impl<'a, const NULLS_FIRST: bool> Ord for NullSortedValue<'a, NULLS_FIRST, Bag>
impl<'a, const NULLS_FIRST: bool> Ord for NullSortedValue<'a, NULLS_FIRST, Bag>
source§impl<'a, const NULLS_FIRST: bool> Ord for NullSortedValue<'a, NULLS_FIRST, List>
impl<'a, const NULLS_FIRST: bool> Ord for NullSortedValue<'a, NULLS_FIRST, List>
source§impl<'a, const NULLS_FIRST: bool> Ord for NullSortedValue<'a, NULLS_FIRST, Tuple>
impl<'a, const NULLS_FIRST: bool> Ord for NullSortedValue<'a, NULLS_FIRST, Tuple>
source§impl<'a, const NULLS_FIRST: bool> Ord for NullSortedValue<'a, NULLS_FIRST, Value>
impl<'a, const NULLS_FIRST: bool> Ord for NullSortedValue<'a, NULLS_FIRST, Value>
source§impl<'a, const NULLS_FIRST: bool, T: PartialEq> PartialEq<NullSortedValue<'a, NULLS_FIRST, T>> for NullSortedValue<'a, NULLS_FIRST, T>
impl<'a, const NULLS_FIRST: bool, T: PartialEq> PartialEq<NullSortedValue<'a, NULLS_FIRST, T>> 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
This method tests for
self
and other
values to be equal, and is used
by ==
.source§impl<'a, const NULLS_FIRST: bool, T> PartialOrd<NullSortedValue<'a, NULLS_FIRST, T>> for NullSortedValue<'a, NULLS_FIRST, T>where
T: PartialOrd,
NullSortedValue<'a, NULLS_FIRST, T>: Ord,
impl<'a, const NULLS_FIRST: bool, T> PartialOrd<NullSortedValue<'a, NULLS_FIRST, T>> for NullSortedValue<'a, NULLS_FIRST, T>where T: PartialOrd, NullSortedValue<'a, NULLS_FIRST, T>: Ord,
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for
self
and other
) and is used by the <=
operator. Read moreimpl<'a, const NULLS_FIRST: bool, T: Eq> Eq for NullSortedValue<'a, NULLS_FIRST, T>
impl<'a, const NULLS_FIRST: bool, T> StructuralEq 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> 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