pub struct DefaultOrdered<T: DefaultOrd>(pub T);
Expand description
Wrapper that delegates PartialOrd
and Ord
to the DefaultPartialOrd
and
DefaultOrd
implementations of inner type.
Tuple Fields§
§0: T
Implementations§
source§impl<T: DefaultOrd> DefaultOrdered<T>
impl<T: DefaultOrd> DefaultOrdered<T>
Trait Implementations§
source§impl<T: Clone + DefaultOrd> Clone for DefaultOrdered<T>
impl<T: Clone + DefaultOrd> Clone for DefaultOrdered<T>
source§fn clone(&self) -> DefaultOrdered<T>
fn clone(&self) -> DefaultOrdered<T>
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl<T: Debug + DefaultOrd> Debug for DefaultOrdered<T>
impl<T: Debug + DefaultOrd> Debug for DefaultOrdered<T>
source§impl<T: DefaultOrd> Deref for DefaultOrdered<T>
impl<T: DefaultOrd> Deref for DefaultOrdered<T>
source§impl<T: DefaultOrd + EstimateSize> EstimateSize for DefaultOrdered<T>
impl<T: DefaultOrd + EstimateSize> EstimateSize for DefaultOrdered<T>
source§fn estimated_heap_size(&self) -> usize
fn estimated_heap_size(&self) -> usize
The estimated heap size of the current struct in bytes.
source§fn estimated_size(&self) -> usizewhere
Self: Sized,
fn estimated_size(&self) -> usizewhere
Self: Sized,
The estimated total size of the current struct in bytes, including the
estimated_heap_size
and the size of Self
.source§impl<T: DefaultOrd> From<T> for DefaultOrdered<T>
impl<T: DefaultOrd> From<T> for DefaultOrdered<T>
source§impl<T: Hash + DefaultOrd> Hash for DefaultOrdered<T>
impl<T: Hash + DefaultOrd> Hash for DefaultOrdered<T>
source§impl<T: DefaultOrd> Ord for DefaultOrdered<T>
impl<T: DefaultOrd> Ord for DefaultOrdered<T>
source§impl<T: PartialEq + DefaultOrd> PartialEq for DefaultOrdered<T>
impl<T: PartialEq + DefaultOrd> PartialEq for DefaultOrdered<T>
source§impl<T: DefaultOrd> PartialOrd for DefaultOrdered<T>
impl<T: DefaultOrd> PartialOrd for DefaultOrdered<T>
source§impl<R: Row> Row for DefaultOrdered<R>
impl<R: Row> Row for DefaultOrdered<R>
source§unsafe fn datum_at_unchecked(&self, index: usize) -> DatumRef<'_>
unsafe fn datum_at_unchecked(&self, index: usize) -> DatumRef<'_>
source§fn iter(&self) -> impl Iterator<Item = DatumRef<'_>>
fn iter(&self) -> impl Iterator<Item = DatumRef<'_>>
Returns an iterator over the datums in the row, in
DatumRef
form.source§fn value_serialize_into(&self, buf: impl BufMut)
fn value_serialize_into(&self, buf: impl BufMut)
Serializes the row with value encoding, into the given
buf
.source§fn value_serialize(&self) -> Vec<u8> ⓘ
fn value_serialize(&self) -> Vec<u8> ⓘ
Serializes the row with value encoding and returns the bytes.
source§fn memcmp_serialize_into(&self, serde: &OrderedRowSerde, buf: impl BufMut)
fn memcmp_serialize_into(&self, serde: &OrderedRowSerde, buf: impl BufMut)
Serializes the row with memcomparable encoding, into the given
buf
. As each datum may have
different order type, a serde
should be provided.source§fn memcmp_serialize(&self, serde: &OrderedRowSerde) -> Vec<u8> ⓘ
fn memcmp_serialize(&self, serde: &OrderedRowSerde) -> Vec<u8> ⓘ
Serializes the row with memcomparable encoding and return the bytes. As each datum may have
different order type, a
serde
should be provided.source§fn hash<H: BuildHasher>(&self, hash_builder: H) -> HashCode<H>
fn hash<H: BuildHasher>(&self, hash_builder: H) -> HashCode<H>
Returns the hash code of the row.
source§fn hash_datums_into<H: Hasher>(&self, state: &mut H)
fn hash_datums_into<H: Hasher>(&self, state: &mut H)
Hash the datums of this row into the given hasher. Read more
source§fn eq(this: &Self, other: impl Row) -> bool
fn eq(this: &Self, other: impl Row) -> bool
Determines whether the datums of this row are equal to those of another.
source§fn into_owned_row(self) -> OwnedRow
fn into_owned_row(self) -> OwnedRow
Consumes
self
and converts it into an OwnedRow
.source§fn value_serialize_bytes(&self) -> Bytes
fn value_serialize_bytes(&self) -> Bytes
Serializes the row with value encoding and returns the bytes.
fn value_estimate_size(&self) -> usize
impl<T: Copy + DefaultOrd> Copy for DefaultOrdered<T>
impl<T: Eq + DefaultOrd> Eq for DefaultOrdered<T>
impl<T: DefaultOrd> StructuralPartialEq for DefaultOrdered<T>
Auto Trait Implementations§
impl<T> Freeze for DefaultOrdered<T>where
T: Freeze,
impl<T> RefUnwindSafe for DefaultOrdered<T>where
T: RefUnwindSafe,
impl<T> Send for DefaultOrdered<T>where
T: Send,
impl<T> Sync for DefaultOrdered<T>where
T: Sync,
impl<T> Unpin for DefaultOrdered<T>where
T: Unpin,
impl<T> UnwindSafe for DefaultOrdered<T>where
T: UnwindSafe,
Blanket Implementations§
§impl<T, A, P> Access<T> for P
impl<T, A, P> Access<T> for P
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§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
source§impl<R> DefaultOrd for Rwhere
R: Row,
impl<R> DefaultOrd for Rwhere
R: Row,
fn default_cmp(&self, other: &R) -> Ordering
source§impl<R> DefaultPartialOrd for Rwhere
R: Row,
impl<R> DefaultPartialOrd for Rwhere
R: Row,
§impl<T, A> DynAccess<T> for Awhere
A: Access<T>,
<A as Access<T>>::Guard: 'static,
impl<T, A> DynAccess<T> for Awhere
A: Access<T>,
<A as Access<T>>::Guard: 'static,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§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§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<T> FutureExt for T
impl<T> FutureExt for T
§fn with_context(self, otel_cx: Context) -> WithContext<Self>
fn with_context(self, otel_cx: Context) -> WithContext<Self>
§fn with_current_context(self) -> WithContext<Self>
fn with_current_context(self) -> WithContext<Self>
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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 moresource§impl<T> IntoRequest<T> for T
impl<T> IntoRequest<T> for T
source§fn into_request(self) -> Request<T>
fn into_request(self) -> Request<T>
Wrap the input message
T
in a tonic::Request
§impl<T> IntoResult<T> for T
impl<T> IntoResult<T> for T
type Err = Infallible
fn into_result(self) -> Result<T, <T as IntoResult<T>>::Err>
source§impl<M> MetricVecRelabelExt for M
impl<M> MetricVecRelabelExt for M
source§fn relabel(
self,
metric_level: MetricLevel,
relabel_threshold: MetricLevel,
) -> RelabeledMetricVec<M>
fn relabel( self, metric_level: MetricLevel, relabel_threshold: MetricLevel, ) -> RelabeledMetricVec<M>
Equivalent to
RelabeledMetricVec::with_metric_level
.source§fn relabel_n(
self,
metric_level: MetricLevel,
relabel_threshold: MetricLevel,
relabel_num: usize,
) -> RelabeledMetricVec<M>
fn relabel_n( self, metric_level: MetricLevel, relabel_threshold: MetricLevel, relabel_num: usize, ) -> RelabeledMetricVec<M>
Equivalent to
RelabeledMetricVec::with_metric_level_relabel_n
.source§fn relabel_debug_1(
self,
relabel_threshold: MetricLevel,
) -> RelabeledMetricVec<M>
fn relabel_debug_1( self, relabel_threshold: MetricLevel, ) -> RelabeledMetricVec<M>
Equivalent to
RelabeledMetricVec::with_metric_level_relabel_n
with metric_level
set to
MetricLevel::Debug
and relabel_num
set to 1.§impl<T> Pointable for T
impl<T> Pointable for T
source§impl<R> RowExt for Rwhere
R: Row,
impl<R> RowExt for Rwhere
R: Row,
source§fn chain<R: Row>(self, other: R) -> Chain<Self, R>where
Self: Sized,
fn chain<R: Row>(self, other: R) -> Chain<Self, R>where
Self: Sized,
Adapter for chaining two rows together.
source§fn project(self, indices: &[usize]) -> Project<'_, Self>where
Self: Sized,
fn project(self, indices: &[usize]) -> Project<'_, Self>where
Self: Sized,
Adapter for projecting a row onto a subset of its columns with the given
indices
. Read moresource§fn slice(self, range: impl RangeBounds<usize>) -> Slice<Self>where
Self: Sized,
fn slice(self, range: impl RangeBounds<usize>) -> Slice<Self>where
Self: Sized,
Adapter for slicing a row with the given
range
. Read more