pub struct LogicalAgg {
pub base: PlanBase<Logical>,
core: Agg<PlanRef>,
}
Expand description
LogicalAgg
groups input data by their group key and computes aggregation functions.
It corresponds to the GROUP BY
operator in a SQL query statement together with the aggregate
functions in the SELECT
clause.
The output schema will first include the group key and then the aggregation calls.
Fields§
§base: PlanBase<Logical>
§core: Agg<PlanRef>
Implementations§
source§impl LogicalAgg
impl LogicalAgg
sourcefn gen_stateless_two_phase_streaming_agg_plan(
&self,
stream_input: PlanRef,
) -> Result<PlanRef, RwError>
fn gen_stateless_two_phase_streaming_agg_plan( &self, stream_input: PlanRef, ) -> Result<PlanRef, RwError>
Generate plan for stateless 2-phase streaming agg. Should only be used iff input is distributed. Input must be converted to stream form.
sourcefn gen_vnode_two_phase_streaming_agg_plan(
&self,
stream_input: PlanRef,
dist_key: &[usize],
) -> Result<PlanRef, RwError>
fn gen_vnode_two_phase_streaming_agg_plan( &self, stream_input: PlanRef, dist_key: &[usize], ) -> Result<PlanRef, RwError>
Generate plan for stateless/stateful 2-phase streaming agg. Should only be used iff input is distributed. Input must be converted to stream form.
fn gen_single_plan(&self, stream_input: PlanRef) -> Result<PlanRef, RwError>
fn gen_shuffle_plan(&self, stream_input: PlanRef) -> Result<PlanRef, RwError>
sourcefn gen_dist_stream_agg_plan(
&self,
stream_input: PlanRef,
) -> Result<PlanRef, RwError>
fn gen_dist_stream_agg_plan( &self, stream_input: PlanRef, ) -> Result<PlanRef, RwError>
Generates distributed stream plan.
sourcefn prepare_approx_percentile(
&self,
core: &mut Agg<PlanRef>,
stream_input: PlanRef,
) -> Result<(ColIndexMapping, ColIndexMapping, Option<PlanRef>), RwError>
fn prepare_approx_percentile( &self, core: &mut Agg<PlanRef>, stream_input: PlanRef, ) -> Result<(ColIndexMapping, ColIndexMapping, Option<PlanRef>), RwError>
Prepares metadata and the approx_percentile
plan, if there’s one present.
It may modify core.agg_calls
to separate normal agg and approx percentile agg,
and core.input
to share the input via StreamShare
,
to both approx percentile agg and normal agg.
fn need_row_merge(approx_percentile: &Option<PlanRef>) -> bool
sourcefn add_row_merge_if_needed(
approx_percentile: Option<PlanRef>,
global_agg: PlanRef,
approx_percentile_col_mapping: ColIndexMapping,
non_approx_percentile_col_mapping: ColIndexMapping,
) -> Result<PlanRef, RwError>
fn add_row_merge_if_needed( approx_percentile: Option<PlanRef>, global_agg: PlanRef, approx_percentile_col_mapping: ColIndexMapping, non_approx_percentile_col_mapping: ColIndexMapping, ) -> Result<PlanRef, RwError>
Add RowMerge
if needed
fn separate_normal_and_special_agg(&self) -> SeparatedAggInfo
fn build_approx_percentile_agg( &self, input: PlanRef, approx_percentile_agg_call: &PlanAggCall, ) -> Result<PlanRef, RwError>
sourcefn build_approx_percentile_aggs(
&self,
input: PlanRef,
approx_percentile_agg_call: &[PlanAggCall],
) -> Result<Option<PlanRef>, RwError>
fn build_approx_percentile_aggs( &self, input: PlanRef, approx_percentile_agg_call: &[PlanAggCall], ) -> Result<Option<PlanRef>, RwError>
If only 1 approx percentile, just return it.
Otherwise build a tree of approx percentile with MergeProject
.
e.g.
ApproxPercentile(col1, 0.5) as x,
ApproxPercentile(col2, 0.5) as y,
ApproxPercentile(col3, 0.5) as z
will be built as
MergeProject
/
MergeProject
z
/
x y
pub fn core(&self) -> &Agg<PlanRef>
source§impl LogicalAgg
impl LogicalAgg
sourcepub fn i2o_col_mapping(&self) -> ColIndexMapping
pub fn i2o_col_mapping(&self) -> ColIndexMapping
get the Mapping of columnIndex from input column index to out column index
sourcepub fn create(
select_exprs: Vec<ExprImpl>,
group_by: GroupBy,
having: Option<ExprImpl>,
input: PlanRef,
) -> Result<(PlanRef, Vec<ExprImpl>, Option<ExprImpl>), RwError>
pub fn create( select_exprs: Vec<ExprImpl>, group_by: GroupBy, having: Option<ExprImpl>, input: PlanRef, ) -> Result<(PlanRef, Vec<ExprImpl>, Option<ExprImpl>), RwError>
create
will analyze select exprs, group exprs and having, and construct a plan like
LogicalAgg -> LogicalProject -> input
It also returns the rewritten select exprs and having that reference into the aggregated results.
sourcepub fn agg_calls(&self) -> &Vec<PlanAggCall>
pub fn agg_calls(&self) -> &Vec<PlanAggCall>
Get a reference to the logical agg’s agg calls.
pub fn grouping_sets(&self) -> &Vec<IndexSet>
pub fn decompose( self, ) -> (Vec<PlanAggCall>, IndexSet, Vec<IndexSet>, PlanRef, bool)
pub fn rewrite_with_input_agg( &self, input: PlanRef, agg_calls: &[PlanAggCall], input_col_change: ColIndexMapping, ) -> (Self, ColIndexMapping)
Methods from Deref<Target = PlanBase<Logical>>§
pub fn clone_with_new_plan_id(&self) -> Self
sourcepub fn clone_with_new_distribution(&self, dist: Distribution) -> Self
pub fn clone_with_new_distribution(&self, dist: Distribution) -> Self
Clone the plan node with a new distribution.
Panics if the plan node is not physical.
Trait Implementations§
source§impl Clone for LogicalAgg
impl Clone for LogicalAgg
source§fn clone(&self) -> LogicalAgg
fn clone(&self) -> LogicalAgg
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moresource§impl ColPrunable for LogicalAgg
impl ColPrunable for LogicalAgg
source§impl Debug for LogicalAgg
impl Debug for LogicalAgg
source§impl Deref for LogicalAgg
impl Deref for LogicalAgg
source§impl Distill for LogicalAgg
impl Distill for LogicalAgg
source§impl ExprRewritable for LogicalAgg
impl ExprRewritable for LogicalAgg
fn has_rewritable_expr(&self) -> bool
fn rewrite_exprs(&self, r: &mut dyn ExprRewriter) -> PlanRef
source§impl ExprVisitable for LogicalAgg
impl ExprVisitable for LogicalAgg
fn visit_exprs(&self, v: &mut dyn ExprVisitor)
source§impl Hash for LogicalAgg
impl Hash for LogicalAgg
source§impl PartialEq for LogicalAgg
impl PartialEq for LogicalAgg
source§impl PlanNodeMeta for LogicalAgg
impl PlanNodeMeta for LogicalAgg
const NODE_TYPE: PlanNodeType = PlanNodeType::LogicalAgg
type Convention = Logical
source§fn plan_base(&self) -> &PlanBase<Logical>
fn plan_base(&self) -> &PlanBase<Logical>
PlanBase
with corresponding convention.source§fn plan_base_ref(&self) -> PlanBaseRef<'_>
fn plan_base_ref(&self) -> PlanBaseRef<'_>
source§impl PlanTreeNode for LogicalAgg
impl PlanTreeNode for LogicalAgg
source§impl PlanTreeNodeUnary for LogicalAgg
impl PlanTreeNodeUnary for LogicalAgg
fn input(&self) -> PlanRef
fn clone_with_input(&self, input: PlanRef) -> Self
source§fn rewrite_with_input(
&self,
input: PlanRef,
input_col_change: ColIndexMapping,
) -> (Self, ColIndexMapping)
fn rewrite_with_input( &self, input: PlanRef, input_col_change: ColIndexMapping, ) -> (Self, ColIndexMapping)
source§impl PredicatePushdown for LogicalAgg
impl PredicatePushdown for LogicalAgg
source§fn predicate_pushdown(
&self,
predicate: Condition,
ctx: &mut PredicatePushdownContext,
) -> PlanRef
fn predicate_pushdown( &self, predicate: Condition, ctx: &mut PredicatePushdownContext, ) -> PlanRef
source§impl ToBatch for LogicalAgg
impl ToBatch for LogicalAgg
source§impl ToDistributedBatch for LogicalAgg
impl ToDistributedBatch for LogicalAgg
source§fn to_distributed(&self) -> Result<PlanRef, RwError>
fn to_distributed(&self) -> Result<PlanRef, RwError>
to_distributed
is equivalent to to_distributed_with_required(&Order::any(), &RequiredDist::Any)
source§fn to_distributed_with_required(
&self,
required_order: &Order,
required_dist: &RequiredDist,
) -> Result<PlanRef, RwError>
fn to_distributed_with_required( &self, required_order: &Order, required_dist: &RequiredDist, ) -> Result<PlanRef, RwError>
source§impl ToLocalBatch for LogicalAgg
impl ToLocalBatch for LogicalAgg
source§impl ToStream for LogicalAgg
impl ToStream for LogicalAgg
source§fn to_stream(&self, ctx: &mut ToStreamContext) -> Result<PlanRef, RwError>
fn to_stream(&self, ctx: &mut ToStreamContext) -> Result<PlanRef, RwError>
to_stream
is equivalent to to_stream_with_dist_required(RequiredDist::Any)
source§fn logical_rewrite_for_stream(
&self,
ctx: &mut RewriteStreamContext,
) -> Result<(PlanRef, ColIndexMapping), RwError>
fn logical_rewrite_for_stream( &self, ctx: &mut RewriteStreamContext, ) -> Result<(PlanRef, ColIndexMapping), RwError>
logical_rewrite_for_stream
will rewrite the logical node, and return (new_plan_node
,
col_mapping
), the col_mapping
is for original columns have been changed into some other
position. Read moresource§fn to_stream_with_dist_required(
&self,
required_dist: &RequiredDist,
ctx: &mut ToStreamContext,
) -> Result<PlanRef, RwError>
fn to_stream_with_dist_required( &self, required_dist: &RequiredDist, ctx: &mut ToStreamContext, ) -> Result<PlanRef, RwError>
source§impl TryToBatchPb for LogicalAgg
impl TryToBatchPb for LogicalAgg
fn try_to_batch_prost_body(&self) -> Result<NodeBody, SchedulerError>
source§impl TryToStreamPb for LogicalAgg
impl TryToStreamPb for LogicalAgg
fn try_to_stream_prost_body( &self, _state: &mut BuildFragmentGraphState, ) -> Result<NodeBody, SchedulerError>
impl Eq for LogicalAgg
impl PlanNode for LogicalAgg
impl StructuralPartialEq for LogicalAgg
impl ToPb for LogicalAgg
Auto Trait Implementations§
impl Freeze for LogicalAgg
impl !RefUnwindSafe for LogicalAgg
impl !Send for LogicalAgg
impl !Sync for LogicalAgg
impl Unpin for LogicalAgg
impl !UnwindSafe for LogicalAgg
Blanket Implementations§
source§impl<P> AnyPlanNodeMeta for Pwhere
P: PlanNodeMeta,
impl<P> AnyPlanNodeMeta for Pwhere
P: PlanNodeMeta,
fn node_type(&self) -> PlanNodeType
fn plan_base(&self) -> PlanBaseRef<'_>
fn convention(&self) -> Convention
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
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)
clone_to_uninit
)§impl<T> Conv for T
impl<T> Conv for T
§impl<Choices> CoproductSubsetter<CNil, HNil> for Choices
impl<Choices> CoproductSubsetter<CNil, HNil> for Choices
§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>
. Box<dyn Any>
can
then be further downcast
into Box<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>
. Rc<Any>
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<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
§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
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
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
§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
§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<T, U, I> LiftInto<U, I> for Twhere
U: LiftFrom<T, I>,
impl<T, U, I> LiftInto<U, I> for Twhere
U: LiftFrom<T, I>,
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>
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>
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>
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<Source> Sculptor<HNil, HNil> for Source
impl<Source> Sculptor<HNil, HNil> for Source
§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.