pub struct StateTableInner<S, SD = BasicSerde, const IS_REPLICATED: bool = false, const USE_WATERMARK_CACHE: bool = false>where
S: StateStore,
SD: ValueRowSerde,{Show 18 fields
table_id: TableId,
row_store: StateTableRowStore<S::Local, SD>,
store: S,
epoch: Option<EpochPair>,
pk_serde: OrderedRowSerde,
pk_indices: Vec<usize>,
distribution: TableDistribution,
prefix_hint_len: usize,
value_indices: Option<Vec<usize>>,
pending_watermark: Option<ScalarImpl>,
committed_watermark: Option<ScalarImpl>,
watermark_cache: StateTableWatermarkCache,
data_types: Vec<DataType>,
i2o_mapping: ColIndexMapping,
pub output_indices: Vec<usize>,
op_consistency_level: StateTableOpConsistencyLevel,
clean_watermark_index_in_pk: Option<i32>,
on_post_commit: bool,
}Expand description
StateTableInner is the interface accessing relational data in KV(StateStore) with
row-based encoding.
Fields§
§table_id: TableIdId for this table.
row_store: StateTableRowStore<S::Local, SD>State store backend.
store: SState store for accessing snapshot data
epoch: Option<EpochPair>Current epoch
pk_serde: OrderedRowSerdeUsed for serializing and deserializing the primary key.
pk_indices: Vec<usize>Indices of primary key. Note that the index is based on the all columns of the table, instead of the output ones.
distribution: TableDistributionDistribution of the state table.
It holds vnode bitmap. Only the rows whose vnode of the primary key is in this set will be visible to the executor. The table will also check whether the written rows conform to this partition.
prefix_hint_len: usize§value_indices: Option<Vec<usize>>§pending_watermark: Option<ScalarImpl>Pending watermark for state cleaning. Old states below this watermark will be cleaned when committing.
committed_watermark: Option<ScalarImpl>Last committed watermark for state cleaning. Will be restored on state table recovery.
watermark_cache: StateTableWatermarkCacheCache for the top-N primary keys for reducing unnecessary range deletion.
data_types: Vec<DataType>Data Types We will need to use to build data chunks from state table rows.
i2o_mapping: ColIndexMapping“i” here refers to the base state_table’s actual schema.
“o” here refers to the replicated state table’s output schema.
This mapping is used to reconstruct a row being written from replicated state table.
Such that the schema of this row will match the full schema of the base state table.
It is only applicable for replication.
output_indices: Vec<usize>Output indices Used for:
- Computing
output_value_indicesto ser/de replicated rows. - Computing output pk indices to used them for backfill state.
op_consistency_level: StateTableOpConsistencyLevel§clean_watermark_index_in_pk: Option<i32>§on_post_commit: boolFlag to indicate whether the state table has called commit, but has not called
post_yield_barrier on the StateTablePostCommit callback yet.
Implementations§
Source§impl<S, SD, const IS_REPLICATED: bool, const USE_WATERMARK_CACHE: bool> StateTableInner<S, SD, IS_REPLICATED, USE_WATERMARK_CACHE>where
S: StateStore,
SD: ValueRowSerde,
impl<S, SD, const IS_REPLICATED: bool, const USE_WATERMARK_CACHE: bool> StateTableInner<S, SD, IS_REPLICATED, USE_WATERMARK_CACHE>where
S: StateStore,
SD: ValueRowSerde,
Sourcepub async fn init_epoch(&mut self, epoch: EpochPair) -> StreamExecutorResult<()>
pub async fn init_epoch(&mut self, epoch: EpochPair) -> StreamExecutorResult<()>
In streaming executors, this methods must be called after receiving and yielding the first barrier, and otherwise, deadlock can be likely to happen.
pub async fn try_wait_committed_epoch( &self, prev_epoch: u64, ) -> StorageResult<()>
pub fn state_store(&self) -> &S
Source§impl<S, SD, const IS_REPLICATED: bool, const USE_WATERMARK_CACHE: bool> StateTableInner<S, SD, IS_REPLICATED, USE_WATERMARK_CACHE>where
S: StateStore,
SD: ValueRowSerde,
impl<S, SD, const IS_REPLICATED: bool, const USE_WATERMARK_CACHE: bool> StateTableInner<S, SD, IS_REPLICATED, USE_WATERMARK_CACHE>where
S: StateStore,
SD: ValueRowSerde,
Sourcepub async fn from_table_catalog(
table_catalog: &Table,
store: S,
vnodes: Option<Arc<Bitmap>>,
) -> Self
pub async fn from_table_catalog( table_catalog: &Table, store: S, vnodes: Option<Arc<Bitmap>>, ) -> Self
Create state table from table catalog and store.
If vnodes is None, [TableDistribution::singleton()] will be used.
Sourcepub async fn from_table_catalog_inconsistent_op(
table_catalog: &Table,
store: S,
vnodes: Option<Arc<Bitmap>>,
) -> Self
pub async fn from_table_catalog_inconsistent_op( table_catalog: &Table, store: S, vnodes: Option<Arc<Bitmap>>, ) -> Self
Create state table from table catalog and store with sanity check disabled.
Sourceasync fn from_table_catalog_inner(
table_catalog: &Table,
store: S,
vnodes: Option<Arc<Bitmap>>,
op_consistency_level: StateTableOpConsistencyLevel,
output_column_ids: Vec<ColumnId>,
preload_all_rows: bool,
) -> Self
async fn from_table_catalog_inner( table_catalog: &Table, store: S, vnodes: Option<Arc<Bitmap>>, op_consistency_level: StateTableOpConsistencyLevel, output_column_ids: Vec<ColumnId>, preload_all_rows: bool, ) -> Self
Create state table from table catalog and store.
pub fn get_data_types(&self) -> &[DataType]
pub fn table_id(&self) -> TableId
Sourcefn compute_prefix_vnode(&self, pk_prefix: &impl Row) -> VirtualNode
fn compute_prefix_vnode(&self, pk_prefix: &impl Row) -> VirtualNode
Get the vnode value with given (prefix of) primary key
Sourcepub fn compute_vnode_by_pk(&self, pk: impl Row) -> VirtualNode
pub fn compute_vnode_by_pk(&self, pk: impl Row) -> VirtualNode
Get the vnode value of the given primary key
Sourcepub fn pk_indices(&self) -> &[usize]
pub fn pk_indices(&self) -> &[usize]
NOTE(kwannoel): This is used by backfill. We want to check pk indices of upstream table.
Sourcepub fn pk_in_output_indices(&self) -> Option<Vec<usize>>
pub fn pk_in_output_indices(&self) -> Option<Vec<usize>>
Get the indices of the primary key columns in the output columns.
Returns None if any of the primary key columns is not in the output columns.
pub fn pk_serde(&self) -> &OrderedRowSerde
pub fn vnodes(&self) -> &Arc<Bitmap>
pub fn value_indices(&self) -> &Option<Vec<usize>>
pub fn is_consistent_op(&self) -> bool
Source§impl<S, SD, const USE_WATERMARK_CACHE: bool> StateTableInner<S, SD, true, USE_WATERMARK_CACHE>where
S: StateStore,
SD: ValueRowSerde,
impl<S, SD, const USE_WATERMARK_CACHE: bool> StateTableInner<S, SD, true, USE_WATERMARK_CACHE>where
S: StateStore,
SD: ValueRowSerde,
Source§impl<S, SD, const IS_REPLICATED: bool, const USE_WATERMARK_CACHE: bool> StateTableInner<S, SD, IS_REPLICATED, USE_WATERMARK_CACHE>where
S: StateStore,
SD: ValueRowSerde,
impl<S, SD, const IS_REPLICATED: bool, const USE_WATERMARK_CACHE: bool> StateTableInner<S, SD, IS_REPLICATED, USE_WATERMARK_CACHE>where
S: StateStore,
SD: ValueRowSerde,
Sourcepub async fn get_row(
&self,
pk: impl Row,
) -> StreamExecutorResult<Option<OwnedRow>>
pub async fn get_row( &self, pk: impl Row, ) -> StreamExecutorResult<Option<OwnedRow>>
Get a single row from state table.
Sourcepub async fn exists(&self, pk: impl Row) -> StreamExecutorResult<bool>
pub async fn exists(&self, pk: impl Row) -> StreamExecutorResult<bool>
Get a raw encoded row from state table.
fn serialize_pk(&self, pk: &impl Row) -> TableKey<Bytes>
fn serialize_pk_and_get_prefix_hint( &self, pk: &impl Row, ) -> (TableKey<Bytes>, Option<Bytes>)
Source§impl<S, SD, const IS_REPLICATED: bool, const USE_WATERMARK_CACHE: bool> StateTableInner<S, SD, IS_REPLICATED, USE_WATERMARK_CACHE>where
S: StateStore,
SD: ValueRowSerde,
impl<S, SD, const IS_REPLICATED: bool, const USE_WATERMARK_CACHE: bool> StateTableInner<S, SD, IS_REPLICATED, USE_WATERMARK_CACHE>where
S: StateStore,
SD: ValueRowSerde,
Sourcepub fn insert(&mut self, value: impl Row)
pub fn insert(&mut self, value: impl Row)
Insert a row into state table. Must provide a full row corresponding to the column desc of the table.
Sourcepub fn delete(&mut self, old_value: impl Row)
pub fn delete(&mut self, old_value: impl Row)
Delete a row from state table. Must provide a full row of old value corresponding to the column desc of the table.
Sourcepub fn update(&mut self, old_value: impl Row, new_value: impl Row)
pub fn update(&mut self, old_value: impl Row, new_value: impl Row)
Update a row. The old and new value should have the same pk.
Sourcepub fn write_record(&mut self, record: Record<impl Row>)
pub fn write_record(&mut self, record: Record<impl Row>)
Write a record into state table. Must have the same schema with the table.
fn fill_non_output_indices(&self, chunk: StreamChunk) -> StreamChunk
Sourcepub fn write_chunk(&mut self, chunk: StreamChunk)
pub fn write_chunk(&mut self, chunk: StreamChunk)
Write batch with a StreamChunk which should have the same schema with the table.
Sourcepub fn update_watermark(&mut self, watermark: ScalarImpl)
pub fn update_watermark(&mut self, watermark: ScalarImpl)
Sourcepub fn get_committed_watermark(&self) -> Option<&ScalarImpl>
pub fn get_committed_watermark(&self) -> Option<&ScalarImpl>
Get the committed watermark of the state table. Watermarks should be fed into the state
table through update_watermark method.
pub async fn commit( &mut self, new_epoch: EpochPair, ) -> StreamExecutorResult<StateTablePostCommit<'_, S, SD, IS_REPLICATED, USE_WATERMARK_CACHE>>
pub async fn commit_assert_no_update_vnode_bitmap( &mut self, new_epoch: EpochPair, ) -> StreamExecutorResult<()>
pub async fn commit_may_switch_consistent_op( &mut self, new_epoch: EpochPair, op_consistency_level: StateTableOpConsistencyLevel, ) -> StreamExecutorResult<StateTablePostCommit<'_, S, SD, IS_REPLICATED, USE_WATERMARK_CACHE>>
async fn commit_inner( &mut self, new_epoch: EpochPair, switch_consistent_op: Option<StateTableOpConsistencyLevel>, ) -> StreamExecutorResult<StateTablePostCommit<'_, S, SD, IS_REPLICATED, USE_WATERMARK_CACHE>>
Sourcefn commit_pending_watermark(
&mut self,
) -> Option<(WatermarkDirection, Vec<VnodeWatermark>, WatermarkSerdeType)>
fn commit_pending_watermark( &mut self, ) -> Option<(WatermarkDirection, Vec<VnodeWatermark>, WatermarkSerdeType)>
Commit pending watermark and return vnode bitmap-watermark pairs to seal.
pub async fn try_flush(&mut self) -> StreamExecutorResult<()>
Source§impl<S, SD, const IS_REPLICATED: bool, const USE_WATERMARK_CACHE: bool> StateTableInner<S, SD, IS_REPLICATED, USE_WATERMARK_CACHE>where
S: StateStore,
SD: ValueRowSerde,
impl<S, SD, const IS_REPLICATED: bool, const USE_WATERMARK_CACHE: bool> StateTableInner<S, SD, IS_REPLICATED, USE_WATERMARK_CACHE>where
S: StateStore,
SD: ValueRowSerde,
Sourcepub async fn iter_with_vnode(
&self,
vnode: VirtualNode,
pk_range: &(Bound<impl Row>, Bound<impl Row>),
prefetch_options: PrefetchOptions,
) -> StreamExecutorResult<impl RowStream<'_>>
pub async fn iter_with_vnode( &self, vnode: VirtualNode, pk_range: &(Bound<impl Row>, Bound<impl Row>), prefetch_options: PrefetchOptions, ) -> StreamExecutorResult<impl RowStream<'_>>
This function scans rows from the relational table with specific pk_range under the same
vnode.
pub async fn iter_keyed_row_with_vnode( &self, vnode: VirtualNode, pk_range: &(Bound<impl Row>, Bound<impl Row>), prefetch_options: PrefetchOptions, ) -> StreamExecutorResult<impl KeyedRowStream<'_>>
pub async fn iter_with_vnode_and_output_indices( &self, vnode: VirtualNode, pk_range: &(Bound<impl Row>, Bound<impl Row>), prefetch_options: PrefetchOptions, ) -> StreamExecutorResult<impl RowStream<'_>>
Source§impl<S, SD, const IS_REPLICATED: bool, const USE_WATERMARK_CACHE: bool> StateTableInner<S, SD, IS_REPLICATED, USE_WATERMARK_CACHE>where
S: StateStore,
SD: ValueRowSerde,
impl<S, SD, const IS_REPLICATED: bool, const USE_WATERMARK_CACHE: bool> StateTableInner<S, SD, IS_REPLICATED, USE_WATERMARK_CACHE>where
S: StateStore,
SD: ValueRowSerde,
Sourcepub async fn iter_with_prefix(
&self,
pk_prefix: impl Row,
sub_range: &(Bound<impl Row>, Bound<impl Row>),
prefetch_options: PrefetchOptions,
) -> StreamExecutorResult<impl RowStream<'_>>
pub async fn iter_with_prefix( &self, pk_prefix: impl Row, sub_range: &(Bound<impl Row>, Bound<impl Row>), prefetch_options: PrefetchOptions, ) -> StreamExecutorResult<impl RowStream<'_>>
This function scans rows from the relational table with specific prefix and sub_range under the same
vnode. If sub_range is (Unbounded, Unbounded), it scans rows from the relational table with specific pk_prefix.
pk_prefix is used to identify the exact vnode the scan should perform on.
Sourcepub async fn get_from_one_row_table(
&self,
) -> StreamExecutorResult<Option<OwnedRow>>
pub async fn get_from_one_row_table( &self, ) -> StreamExecutorResult<Option<OwnedRow>>
Get the row from a state table with only 1 row.
Sourcepub async fn get_from_one_value_table(
&self,
) -> StreamExecutorResult<Option<ScalarImpl>>
pub async fn get_from_one_value_table( &self, ) -> StreamExecutorResult<Option<ScalarImpl>>
Get the row from a state table with only 1 row, and the row has only 1 col.
None can mean either the row is never persisted, or is a persisted NULL,
which does not matter in the use case.
pub async fn iter_keyed_row_with_prefix( &self, pk_prefix: impl Row, sub_range: &(Bound<impl Row>, Bound<impl Row>), prefetch_options: PrefetchOptions, ) -> StreamExecutorResult<impl KeyedRowStream<'_>>
Sourcepub async fn rev_iter_with_prefix(
&self,
pk_prefix: impl Row,
sub_range: &(Bound<impl Row>, Bound<impl Row>),
prefetch_options: PrefetchOptions,
) -> StreamExecutorResult<impl RowStream<'_>>
pub async fn rev_iter_with_prefix( &self, pk_prefix: impl Row, sub_range: &(Bound<impl Row>, Bound<impl Row>), prefetch_options: PrefetchOptions, ) -> StreamExecutorResult<impl RowStream<'_>>
This function scans the table just like iter_with_prefix, but in reverse order.
async fn iter_with_prefix_inner<const REVERSE: bool, K: CopyFromSlice + FromVnodeBytes>( &self, pk_prefix: impl Row, sub_range: &(Bound<impl Row>, Bound<impl Row>), prefetch_options: PrefetchOptions, ) -> StreamExecutorResult<impl PkRowStream<'_, K>>
Sourceasync fn iter_kv_with_pk_range<'a, K: CopyFromSlice + FromVnodeBytes>(
&'a self,
pk_range: &(Bound<impl Row>, Bound<impl Row>),
vnode: VirtualNode,
prefetch_options: PrefetchOptions,
) -> StreamExecutorResult<impl PkRowStream<'a, K>>
async fn iter_kv_with_pk_range<'a, K: CopyFromSlice + FromVnodeBytes>( &'a self, pk_range: &(Bound<impl Row>, Bound<impl Row>), vnode: VirtualNode, prefetch_options: PrefetchOptions, ) -> StreamExecutorResult<impl PkRowStream<'a, K>>
This function scans raw key-values from the relational table with specific pk_range under
the same vnode.
Auto Trait Implementations§
impl<S, SD = BasicSerde, const IS_REPLICATED: bool = false, const USE_WATERMARK_CACHE: bool = false> !Freeze for StateTableInner<S, SD, IS_REPLICATED, USE_WATERMARK_CACHE>
impl<S, SD, const IS_REPLICATED: bool, const USE_WATERMARK_CACHE: bool> RefUnwindSafe for StateTableInner<S, SD, IS_REPLICATED, USE_WATERMARK_CACHE>
impl<S, SD, const IS_REPLICATED: bool, const USE_WATERMARK_CACHE: bool> Send for StateTableInner<S, SD, IS_REPLICATED, USE_WATERMARK_CACHE>
impl<S, SD, const IS_REPLICATED: bool, const USE_WATERMARK_CACHE: bool> Sync for StateTableInner<S, SD, IS_REPLICATED, USE_WATERMARK_CACHE>
impl<S, SD, const IS_REPLICATED: bool, const USE_WATERMARK_CACHE: bool> Unpin for StateTableInner<S, SD, IS_REPLICATED, USE_WATERMARK_CACHE>
impl<S, SD, const IS_REPLICATED: bool, const USE_WATERMARK_CACHE: bool> UnwindSafe for StateTableInner<S, SD, IS_REPLICATED, USE_WATERMARK_CACHE>
Blanket Implementations§
§impl<T> AsAny for T
impl<T> AsAny for T
§fn any_ref(&self) -> &(dyn Any + Sync + Send + 'static)
fn any_ref(&self) -> &(dyn Any + Sync + Send + 'static)
dyn Any reference to the object: Read more§fn as_any(self: Arc<T>) -> Arc<dyn Any + Sync + Send>
fn as_any(self: Arc<T>) -> Arc<dyn Any + Sync + Send>
Arc<dyn Any> reference to the object: Read more§fn into_any(self: Box<T>) -> Box<dyn Any + Sync + Send>
fn into_any(self: Box<T>) -> Box<dyn Any + Sync + Send>
Box<dyn Any>: Read more§fn type_name(&self) -> &'static str
fn type_name(&self) -> &'static str
std::any::type_name, since Any does not provide it and
Any::type_id is useless as a debugging aid (its Debug is just a mess of hex digits).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
§impl<T> Conv for T
impl<T> Conv for T
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>, which can then be
downcast into Box<dyn ConcreteType> where ConcreteType implements Trait.§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Rc<Trait> (where Trait: Downcast) to Rc<Any>, which can then be further
downcast into Rc<ConcreteType> where ConcreteType implements Trait.§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.§impl<T> DowncastSend for T
impl<T> DowncastSend for T
§impl<T> DowncastSync for T
impl<T> DowncastSync for T
§impl<T> FmtForward for T
impl<T> FmtForward for T
§fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
self to use its Binary implementation when Debug-formatted.§fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
self to use its Display implementation when
Debug-formatted.§fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
self to use its LowerExp implementation when
Debug-formatted.§fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
self to use its LowerHex implementation when
Debug-formatted.§fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
self to use its Octal implementation when Debug-formatted.§fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
self to use its Pointer implementation when
Debug-formatted.§fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
self to use its UpperExp implementation when
Debug-formatted.§fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
self to use its UpperHex implementation when
Debug-formatted.§fn fmt_list(self) -> FmtList<Self>where
&'a Self: for<'a> IntoIterator,
fn fmt_list(self) -> FmtList<Self>where
&'a Self: for<'a> IntoIterator,
§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> ⓘ
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> ⓘ
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>
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>
§impl<M> MetricVecRelabelExt for M
impl<M> MetricVecRelabelExt for M
§fn relabel(
self,
metric_level: MetricLevel,
relabel_threshold: MetricLevel,
) -> RelabeledMetricVec<M>
fn relabel( self, metric_level: MetricLevel, relabel_threshold: MetricLevel, ) -> RelabeledMetricVec<M>
RelabeledMetricVec::with_metric_level].§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>
RelabeledMetricVec::with_metric_level_relabel_n].§fn relabel_debug_1(
self,
relabel_threshold: MetricLevel,
) -> RelabeledMetricVec<M>
fn relabel_debug_1( self, relabel_threshold: MetricLevel, ) -> RelabeledMetricVec<M>
RelabeledMetricVec::with_metric_level_relabel_n] with metric_level set to
MetricLevel::Debug and relabel_num set to 1.§impl<T> Pipe for Twhere
T: ?Sized,
impl<T> Pipe for Twhere
T: ?Sized,
§fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
§fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
self and passes that borrow into the pipe function. Read more§fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
self and passes that borrow into the pipe function. Read more§fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
§fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R,
) -> R
fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R, ) -> R
§fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
self, then passes self.as_ref() into the pipe function.§fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
self, then passes self.as_mut() into the pipe
function.§fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
self, then passes self.deref() into the pipe function.§impl<T> Pointable for T
impl<T> Pointable for T
§impl<T> Scope for T
impl<T> Scope for T
§impl<T> Tap for T
impl<T> Tap for T
§fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
Borrow<B> of a value. Read more§fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
BorrowMut<B> of a value. Read more§fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
AsRef<R> view of a value. Read more§fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
AsMut<R> view of a value. Read more§fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
Deref::Target of a value. Read more§fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
Deref::Target of a value. Read more§fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
.tap() only in debug builds, and is erased in release builds.§fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
.tap_mut() only in debug builds, and is erased in release
builds.§fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
.tap_borrow() only in debug builds, and is erased in release
builds.§fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
.tap_borrow_mut() only in debug builds, and is erased in release
builds.§fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
.tap_ref() only in debug builds, and is erased in release
builds.§fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
.tap_ref_mut() only in debug builds, and is erased in release
builds.§fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
.tap_deref() only in debug builds, and is erased in release
builds.