pub struct CardinalityVisitor;Expand description
A visitor that computes the cardinality of a plan node.
Implementations§
Source§impl CardinalityVisitor
impl CardinalityVisitor
Sourcefn visit_predicate(
input: &dyn LogicalPlanNode,
input_card: Cardinality,
eq_set: HashSet<usize>,
) -> Cardinality
fn visit_predicate( input: &dyn LogicalPlanNode, input_card: Cardinality, eq_set: HashSet<usize>, ) -> Cardinality
Used for Filter and Scan with predicate.
Sourcefn fixed_columns(predicate: &Condition) -> HashSet<usize>
fn fixed_columns(predicate: &Condition) -> HashSet<usize>
Returns the columns that predicate fixes to a single value:
- columns compared by
=,IS NOT DISTINCT FROM, or a single-itemINwith a pure expression that references no input column, such as a constant, a parameter, or a correlated input ref. A row comparison such as(a, b) = (1, 2)fixes its columns field by field. - boolean columns used as a conjunction directly or through
NOT,IS TRUE, orIS FALSE, such asWHERE flag.
Other conjunctions, such as pk > 1, pk = other_col, or pk = 1 OR pk = 2, can keep
several rows even when they reference every unique key column, so they are ignored.
Sourcefn collect_equality_fixed_columns(
lhs: &ExprImpl,
rhs: &ExprImpl,
fixed: &mut HashSet<usize>,
)
fn collect_equality_fixed_columns( lhs: &ExprImpl, rhs: &ExprImpl, fixed: &mut HashSet<usize>, )
Collects the columns that lhs = rhs fixes. When both sides are rows, each pair of
fields is compared on its own.
Sourcefn collect_operand_columns(expr: &ExprImpl, fixed: &mut HashSet<usize>)
fn collect_operand_columns(expr: &ExprImpl, fixed: &mut HashSet<usize>)
Collects the columns of an operand that is equal to a fixed value: the column itself, a
lossless cast of it, or each such field of a row, as in ROW(a, b) = '(1,2)'.
fn row_fields(expr: &ExprImpl) -> Option<&[ExprImpl]>
Sourcefn as_injective_input_ref(expr: &ExprImpl) -> Option<usize>
fn as_injective_input_ref(expr: &ExprImpl) -> Option<usize>
Returns the column referenced by expr if expr is the column itself or a lossless cast
of it, so that equal results imply equal column values. Such casts come from comparing
columns of different numeric types, e.g. CAST(int_pk AS DECIMAL) = 1.5 or
CAST(int_pk AS BIGINT) = bigint_col.
Trait Implementations§
Source§impl LogicalPlanVisitor for CardinalityVisitor
impl LogicalPlanVisitor for CardinalityVisitor
type Result = Cardinality
type DefaultBehavior = impl DefaultBehavior<<CardinalityVisitor as LogicalPlanVisitor>::Result>
Source§fn default_behavior() -> Self::DefaultBehavior
fn default_behavior() -> Self::DefaultBehavior
visit_xxx.Source§fn visit_logical_values(&mut self, plan: &LogicalValues) -> Cardinality
fn visit_logical_values(&mut self, plan: &LogicalValues) -> Cardinality
LogicalValues , the function should visit the inputs.LogicalShare , the function should visit the inputs.Source§fn visit_logical_dedup(&mut self, plan: &LogicalDedup) -> Cardinality
fn visit_logical_dedup(&mut self, plan: &LogicalDedup) -> Cardinality
LogicalDedup , the function should visit the inputs.Source§fn visit_logical_over_window(
&mut self,
plan: &LogicalOverWindow,
) -> Self::Result
fn visit_logical_over_window( &mut self, plan: &LogicalOverWindow, ) -> Self::Result
LogicalOverWindow , the function should visit the inputs.Source§fn visit_logical_agg(&mut self, plan: &LogicalAgg) -> Cardinality
fn visit_logical_agg(&mut self, plan: &LogicalAgg) -> Cardinality
LogicalAgg , the function should visit the inputs.Source§fn visit_logical_limit(&mut self, plan: &LogicalLimit) -> Cardinality
fn visit_logical_limit(&mut self, plan: &LogicalLimit) -> Cardinality
LogicalLimit , the function should visit the inputs.Source§fn visit_logical_max_one_row(&mut self, plan: &LogicalMaxOneRow) -> Cardinality
fn visit_logical_max_one_row(&mut self, plan: &LogicalMaxOneRow) -> Cardinality
LogicalMaxOneRow , the function should visit the inputs.Source§fn visit_logical_project(&mut self, plan: &LogicalProject) -> Cardinality
fn visit_logical_project(&mut self, plan: &LogicalProject) -> Cardinality
LogicalProject , the function should visit the inputs.Source§fn visit_logical_top_n(&mut self, plan: &LogicalTopN) -> Cardinality
fn visit_logical_top_n(&mut self, plan: &LogicalTopN) -> Cardinality
LogicalTopN , the function should visit the inputs.Source§fn visit_logical_filter(&mut self, plan: &LogicalFilter) -> Cardinality
fn visit_logical_filter(&mut self, plan: &LogicalFilter) -> Cardinality
LogicalFilter , the function should visit the inputs.Source§fn visit_logical_scan(&mut self, plan: &LogicalScan) -> Cardinality
fn visit_logical_scan(&mut self, plan: &LogicalScan) -> Cardinality
LogicalScan , the function should visit the inputs.Source§fn visit_logical_union(&mut self, plan: &LogicalUnion) -> Cardinality
fn visit_logical_union(&mut self, plan: &LogicalUnion) -> Cardinality
LogicalUnion , the function should visit the inputs.Source§fn visit_logical_join(&mut self, plan: &LogicalJoin) -> Cardinality
fn visit_logical_join(&mut self, plan: &LogicalJoin) -> Cardinality
LogicalJoin , the function should visit the inputs.Source§fn visit_logical_apply(&mut self, plan: &LogicalApply) -> Cardinality
fn visit_logical_apply(&mut self, plan: &LogicalApply) -> Cardinality
LogicalApply , the function should visit the inputs.Source§fn visit_logical_now(&mut self, plan: &LogicalNow) -> Cardinality
fn visit_logical_now(&mut self, plan: &LogicalNow) -> Cardinality
LogicalNow , the function should visit the inputs.Source§fn visit_logical_expand(&mut self, plan: &LogicalExpand) -> Cardinality
fn visit_logical_expand(&mut self, plan: &LogicalExpand) -> Cardinality
LogicalExpand , the function should visit the inputs.fn visit_logical(&mut self, plan: PlanRef<Logical>) -> Self::Result
Source§fn visit_logical_cdc_scan(&mut self, plan: &LogicalCdcScan) -> Self::Result
fn visit_logical_cdc_scan(&mut self, plan: &LogicalCdcScan) -> Self::Result
LogicalCdcScan , the function should visit the inputs.Source§fn visit_logical_sys_scan(&mut self, plan: &LogicalSysScan) -> Self::Result
fn visit_logical_sys_scan(&mut self, plan: &LogicalSysScan) -> Self::Result
LogicalSysScan , the function should visit the inputs.Source§fn visit_logical_source(&mut self, plan: &LogicalSource) -> Self::Result
fn visit_logical_source(&mut self, plan: &LogicalSource) -> Self::Result
LogicalSource , the function should visit the inputs.Source§fn visit_logical_insert(&mut self, plan: &LogicalInsert) -> Self::Result
fn visit_logical_insert(&mut self, plan: &LogicalInsert) -> Self::Result
LogicalInsert , the function should visit the inputs.Source§fn visit_logical_delete(&mut self, plan: &LogicalDelete) -> Self::Result
fn visit_logical_delete(&mut self, plan: &LogicalDelete) -> Self::Result
LogicalDelete , the function should visit the inputs.Source§fn visit_logical_update(&mut self, plan: &LogicalUpdate) -> Self::Result
fn visit_logical_update(&mut self, plan: &LogicalUpdate) -> Self::Result
LogicalUpdate , the function should visit the inputs.Source§fn visit_logical_hop_window(&mut self, plan: &LogicalHopWindow) -> Self::Result
fn visit_logical_hop_window(&mut self, plan: &LogicalHopWindow) -> Self::Result
LogicalHopWindow , the function should visit the inputs.Source§fn visit_logical_table_function(
&mut self,
plan: &LogicalTableFunction,
) -> Self::Result
fn visit_logical_table_function( &mut self, plan: &LogicalTableFunction, ) -> Self::Result
LogicalTableFunction , the function should visit the inputs.Source§fn visit_logical_multi_join(&mut self, plan: &LogicalMultiJoin) -> Self::Result
fn visit_logical_multi_join(&mut self, plan: &LogicalMultiJoin) -> Self::Result
LogicalMultiJoin , the function should visit the inputs.Source§fn visit_logical_project_set(
&mut self,
plan: &LogicalProjectSet,
) -> Self::Result
fn visit_logical_project_set( &mut self, plan: &LogicalProjectSet, ) -> Self::Result
LogicalProjectSet , the function should visit the inputs.Source§fn visit_logical_intersect(&mut self, plan: &LogicalIntersect) -> Self::Result
fn visit_logical_intersect(&mut self, plan: &LogicalIntersect) -> Self::Result
LogicalIntersect , the function should visit the inputs.Source§fn visit_logical_except(&mut self, plan: &LogicalExcept) -> Self::Result
fn visit_logical_except(&mut self, plan: &LogicalExcept) -> Self::Result
LogicalExcept , the function should visit the inputs.Source§fn visit_logical_match_recognize(
&mut self,
plan: &LogicalMatchRecognize,
) -> Self::Result
fn visit_logical_match_recognize( &mut self, plan: &LogicalMatchRecognize, ) -> Self::Result
LogicalMatchRecognize , the function should visit the inputs.Source§fn visit_logical_kafka_scan(&mut self, plan: &LogicalKafkaScan) -> Self::Result
fn visit_logical_kafka_scan(&mut self, plan: &LogicalKafkaScan) -> Self::Result
LogicalKafkaScan , the function should visit the inputs.Source§fn visit_logical_iceberg_scan(
&mut self,
plan: &LogicalIcebergScan,
) -> Self::Result
fn visit_logical_iceberg_scan( &mut self, plan: &LogicalIcebergScan, ) -> Self::Result
LogicalIcebergScan , the function should visit the inputs.Source§fn visit_logical_iceberg_metadata_scan(
&mut self,
plan: &LogicalIcebergMetadataScan,
) -> Self::Result
fn visit_logical_iceberg_metadata_scan( &mut self, plan: &LogicalIcebergMetadataScan, ) -> Self::Result
LogicalIcebergMetadataScan , the function should visit the inputs.Source§fn visit_logical_iceberg_intermediate_scan(
&mut self,
plan: &LogicalIcebergIntermediateScan,
) -> Self::Result
fn visit_logical_iceberg_intermediate_scan( &mut self, plan: &LogicalIcebergIntermediateScan, ) -> Self::Result
LogicalIcebergIntermediateScan , the function should visit the inputs.Source§fn visit_logical_change_log(&mut self, plan: &LogicalChangeLog) -> Self::Result
fn visit_logical_change_log(&mut self, plan: &LogicalChangeLog) -> Self::Result
LogicalChangeLog , the function should visit the inputs.Source§fn visit_logical_file_scan(&mut self, plan: &LogicalFileScan) -> Self::Result
fn visit_logical_file_scan(&mut self, plan: &LogicalFileScan) -> Self::Result
LogicalFileScan , the function should visit the inputs.Source§fn visit_logical_postgres_query(
&mut self,
plan: &LogicalPostgresQuery,
) -> Self::Result
fn visit_logical_postgres_query( &mut self, plan: &LogicalPostgresQuery, ) -> Self::Result
LogicalPostgresQuery , the function should visit the inputs.Source§fn visit_logical_my_sql_query(
&mut self,
plan: &LogicalMySqlQuery,
) -> Self::Result
fn visit_logical_my_sql_query( &mut self, plan: &LogicalMySqlQuery, ) -> Self::Result
LogicalMySqlQuery , the function should visit the inputs.Source§fn visit_logical_mssql_query(
&mut self,
plan: &LogicalMssqlQuery,
) -> Self::Result
fn visit_logical_mssql_query( &mut self, plan: &LogicalMssqlQuery, ) -> Self::Result
LogicalMssqlQuery , the function should visit the inputs.Source§fn visit_logical_gap_fill(&mut self, plan: &LogicalGapFill) -> Self::Result
fn visit_logical_gap_fill(&mut self, plan: &LogicalGapFill) -> Self::Result
LogicalGapFill , the function should visit the inputs.Source§fn visit_logical_vector_search(
&mut self,
plan: &LogicalVectorSearch,
) -> Self::Result
fn visit_logical_vector_search( &mut self, plan: &LogicalVectorSearch, ) -> Self::Result
LogicalVectorSearch , the function should visit the inputs.Source§fn visit_logical_get_channel_delta_stats(
&mut self,
plan: &LogicalGetChannelDeltaStats,
) -> Self::Result
fn visit_logical_get_channel_delta_stats( &mut self, plan: &LogicalGetChannelDeltaStats, ) -> Self::Result
LogicalGetChannelDeltaStats , the function should visit the inputs.Source§fn visit_logical_locality_provider(
&mut self,
plan: &LogicalLocalityProvider,
) -> Self::Result
fn visit_logical_locality_provider( &mut self, plan: &LogicalLocalityProvider, ) -> Self::Result
LogicalLocalityProvider , the function should visit the inputs.Source§fn visit_logical_vector_search_lookup_join(
&mut self,
plan: &LogicalVectorSearchLookupJoin,
) -> Self::Result
fn visit_logical_vector_search_lookup_join( &mut self, plan: &LogicalVectorSearchLookupJoin, ) -> Self::Result
LogicalVectorSearchLookupJoin , the function should visit the inputs.Auto Trait Implementations§
impl Freeze for CardinalityVisitor
impl RefUnwindSafe for CardinalityVisitor
impl Send for CardinalityVisitor
impl Sync for CardinalityVisitor
impl Unpin for CardinalityVisitor
impl UnsafeUnpin for CardinalityVisitor
impl UnwindSafe for CardinalityVisitor
Blanket Implementations§
impl<T> Allocation for T
impl<T> Allocation for T
§impl<U> As for U
impl<U> As for U
§fn as_<T>(self) -> Twhere
T: CastFrom<U>,
U: Sized,
fn as_<T>(self) -> Twhere
T: CastFrom<U>,
U: Sized,
self to type T. The semantics of numeric casting with the as operator are followed, so <T as As>::as_::<U> can be used in the same way as T as U for numeric conversions. Read more§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: AsAny + ?Sized,
impl<T> Downcast for Twhere
T: AsAny + ?Sized,
§fn downcast_ref<T>(&self) -> Option<&T>where
T: AsAny,
fn downcast_ref<T>(&self) -> Option<&T>where
T: AsAny,
Any.§fn downcast_mut<T>(&mut self) -> Option<&mut T>where
T: AsAny,
fn downcast_mut<T>(&mut self) -> Option<&mut T>where
T: AsAny,
Any.§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 more§impl<T> IntoRequest<T> for T
impl<T> IntoRequest<T> for T
§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<L> LayerExt<L> for L
impl<L> LayerExt<L> for L
§fn named_layer<S>(&self, service: S) -> Layered<<L as Layer<S>>::Service, S>where
L: Layer<S>,
fn named_layer<S>(&self, service: S) -> Layered<<L as Layer<S>>::Service, S>where
L: Layer<S>,
Layered].impl<T> LruValue for T
impl<T> MaybeSend for Twhere
T: Send,
impl<T> MaybeSend for Twhere
T: Send,
impl<T> MaybeSend for Twhere
T: Send,
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.Source§impl<V> PlanVisitor<Logical> for Vwhere
V: LogicalPlanVisitor,
impl<V> PlanVisitor<Logical> for Vwhere
V: LogicalPlanVisitor,
§impl<T> Pointable for T
impl<T> Pointable for T
§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
§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.