pub struct Logical;
Expand description
The marker for logical convention.
Trait Implementations§
Source§impl ConventionMarker for Logical
impl ConventionMarker for Logical
type PlanNodeType = LogicalPlanNodeType
type PlanRefDyn = dyn LogicalPlanNode
Source§impl ExprRewritable<Logical> for LogicalAgg
impl ExprRewritable<Logical> for LogicalAgg
fn has_rewritable_expr(&self) -> bool
fn rewrite_exprs(&self, r: &mut dyn ExprRewriter) -> PlanRef
Source§impl ExprRewritable<Logical> for LogicalApply
impl ExprRewritable<Logical> for LogicalApply
fn has_rewritable_expr(&self) -> bool
fn rewrite_exprs(&self, r: &mut dyn ExprRewriter) -> PlanRef
Source§impl ExprRewritable<Logical> for LogicalCdcScan
impl ExprRewritable<Logical> for LogicalCdcScan
fn has_rewritable_expr(&self) -> bool
fn rewrite_exprs(&self, r: &mut dyn ExprRewriter) -> PlanRef
Source§impl ExprRewritable<Logical> for LogicalChangeLog
impl ExprRewritable<Logical> for LogicalChangeLog
fn has_rewritable_expr(&self) -> bool
fn rewrite_exprs(&self, _r: &mut dyn ExprRewriter) -> PlanRef<C>
Source§impl ExprRewritable<Logical> for LogicalCteRef
impl ExprRewritable<Logical> for LogicalCteRef
fn has_rewritable_expr(&self) -> bool
fn rewrite_exprs(&self, _r: &mut dyn ExprRewriter) -> PlanRef<C>
Source§impl ExprRewritable<Logical> for LogicalDedup
impl ExprRewritable<Logical> for LogicalDedup
fn has_rewritable_expr(&self) -> bool
fn rewrite_exprs(&self, _r: &mut dyn ExprRewriter) -> PlanRef<C>
Source§impl ExprRewritable<Logical> for LogicalDelete
impl ExprRewritable<Logical> for LogicalDelete
fn has_rewritable_expr(&self) -> bool
fn rewrite_exprs(&self, _r: &mut dyn ExprRewriter) -> PlanRef<C>
Source§impl ExprRewritable<Logical> for LogicalExcept
impl ExprRewritable<Logical> for LogicalExcept
fn has_rewritable_expr(&self) -> bool
fn rewrite_exprs(&self, _r: &mut dyn ExprRewriter) -> PlanRef<C>
Source§impl ExprRewritable<Logical> for LogicalExpand
impl ExprRewritable<Logical> for LogicalExpand
fn has_rewritable_expr(&self) -> bool
fn rewrite_exprs(&self, _r: &mut dyn ExprRewriter) -> PlanRef<C>
Source§impl ExprRewritable<Logical> for LogicalFileScan
impl ExprRewritable<Logical> for LogicalFileScan
fn has_rewritable_expr(&self) -> bool
fn rewrite_exprs(&self, _r: &mut dyn ExprRewriter) -> PlanRef<C>
Source§impl ExprRewritable<Logical> for LogicalFilter
impl ExprRewritable<Logical> for LogicalFilter
fn has_rewritable_expr(&self) -> bool
fn rewrite_exprs(&self, r: &mut dyn ExprRewriter) -> PlanRef
Source§impl ExprRewritable<Logical> for LogicalHopWindow
impl ExprRewritable<Logical> for LogicalHopWindow
fn has_rewritable_expr(&self) -> bool
fn rewrite_exprs(&self, _r: &mut dyn ExprRewriter) -> PlanRef<C>
Source§impl ExprRewritable<Logical> for LogicalIcebergScan
impl ExprRewritable<Logical> for LogicalIcebergScan
fn has_rewritable_expr(&self) -> bool
fn rewrite_exprs(&self, _r: &mut dyn ExprRewriter) -> PlanRef<C>
Source§impl ExprRewritable<Logical> for LogicalInsert
impl ExprRewritable<Logical> for LogicalInsert
fn has_rewritable_expr(&self) -> bool
fn rewrite_exprs(&self, r: &mut dyn ExprRewriter) -> PlanRef
Source§impl ExprRewritable<Logical> for LogicalIntersect
impl ExprRewritable<Logical> for LogicalIntersect
fn has_rewritable_expr(&self) -> bool
fn rewrite_exprs(&self, _r: &mut dyn ExprRewriter) -> PlanRef<C>
Source§impl ExprRewritable<Logical> for LogicalJoin
impl ExprRewritable<Logical> for LogicalJoin
fn has_rewritable_expr(&self) -> bool
fn rewrite_exprs(&self, r: &mut dyn ExprRewriter) -> PlanRef
Source§impl ExprRewritable<Logical> for LogicalKafkaScan
impl ExprRewritable<Logical> for LogicalKafkaScan
fn has_rewritable_expr(&self) -> bool
fn rewrite_exprs(&self, _r: &mut dyn ExprRewriter) -> PlanRef<C>
Source§impl ExprRewritable<Logical> for LogicalLimit
impl ExprRewritable<Logical> for LogicalLimit
fn has_rewritable_expr(&self) -> bool
fn rewrite_exprs(&self, _r: &mut dyn ExprRewriter) -> PlanRef<C>
Source§impl ExprRewritable<Logical> for LogicalMaxOneRow
impl ExprRewritable<Logical> for LogicalMaxOneRow
fn has_rewritable_expr(&self) -> bool
fn rewrite_exprs(&self, _r: &mut dyn ExprRewriter) -> PlanRef<C>
Source§impl ExprRewritable<Logical> for LogicalMultiJoin
impl ExprRewritable<Logical> for LogicalMultiJoin
fn rewrite_exprs(&self, _r: &mut dyn ExprRewriter) -> PlanRef
fn has_rewritable_expr(&self) -> bool
Source§impl ExprRewritable<Logical> for LogicalMySqlQuery
impl ExprRewritable<Logical> for LogicalMySqlQuery
fn has_rewritable_expr(&self) -> bool
fn rewrite_exprs(&self, _r: &mut dyn ExprRewriter) -> PlanRef<C>
Source§impl ExprRewritable<Logical> for LogicalNow
impl ExprRewritable<Logical> for LogicalNow
fn has_rewritable_expr(&self) -> bool
fn rewrite_exprs(&self, _r: &mut dyn ExprRewriter) -> PlanRef<C>
Source§impl ExprRewritable<Logical> for LogicalOverWindow
impl ExprRewritable<Logical> for LogicalOverWindow
fn has_rewritable_expr(&self) -> bool
fn rewrite_exprs(&self, _r: &mut dyn ExprRewriter) -> PlanRef<C>
Source§impl ExprRewritable<Logical> for LogicalPostgresQuery
impl ExprRewritable<Logical> for LogicalPostgresQuery
fn has_rewritable_expr(&self) -> bool
fn rewrite_exprs(&self, _r: &mut dyn ExprRewriter) -> PlanRef<C>
Source§impl ExprRewritable<Logical> for LogicalProject
impl ExprRewritable<Logical> for LogicalProject
fn has_rewritable_expr(&self) -> bool
fn rewrite_exprs(&self, r: &mut dyn ExprRewriter) -> PlanRef
Source§impl ExprRewritable<Logical> for LogicalProjectSet
impl ExprRewritable<Logical> for LogicalProjectSet
fn has_rewritable_expr(&self) -> bool
fn rewrite_exprs(&self, r: &mut dyn ExprRewriter) -> PlanRef
Source§impl ExprRewritable<Logical> for LogicalRecursiveUnion
impl ExprRewritable<Logical> for LogicalRecursiveUnion
fn has_rewritable_expr(&self) -> bool
fn rewrite_exprs(&self, _r: &mut dyn ExprRewriter) -> PlanRef<C>
Source§impl ExprRewritable<Logical> for LogicalScan
impl ExprRewritable<Logical> for LogicalScan
fn has_rewritable_expr(&self) -> bool
fn rewrite_exprs(&self, r: &mut dyn ExprRewriter) -> PlanRef
fn has_rewritable_expr(&self) -> bool
fn rewrite_exprs(&self, _r: &mut dyn ExprRewriter) -> PlanRef<C>
Source§impl ExprRewritable<Logical> for LogicalSource
impl ExprRewritable<Logical> for LogicalSource
fn has_rewritable_expr(&self) -> bool
fn rewrite_exprs(&self, r: &mut dyn ExprRewriter) -> PlanRef
Source§impl ExprRewritable<Logical> for LogicalSysScan
impl ExprRewritable<Logical> for LogicalSysScan
fn has_rewritable_expr(&self) -> bool
fn rewrite_exprs(&self, _r: &mut dyn ExprRewriter) -> PlanRef<C>
Source§impl ExprRewritable<Logical> for LogicalTableFunction
impl ExprRewritable<Logical> for LogicalTableFunction
fn has_rewritable_expr(&self) -> bool
fn rewrite_exprs(&self, r: &mut dyn ExprRewriter) -> PlanRef
Source§impl ExprRewritable<Logical> for LogicalTopN
impl ExprRewritable<Logical> for LogicalTopN
fn has_rewritable_expr(&self) -> bool
fn rewrite_exprs(&self, _r: &mut dyn ExprRewriter) -> PlanRef<C>
Source§impl ExprRewritable<Logical> for LogicalUnion
impl ExprRewritable<Logical> for LogicalUnion
fn has_rewritable_expr(&self) -> bool
fn rewrite_exprs(&self, _r: &mut dyn ExprRewriter) -> PlanRef<C>
Source§impl ExprRewritable<Logical> for LogicalUpdate
impl ExprRewritable<Logical> for LogicalUpdate
fn has_rewritable_expr(&self) -> bool
fn rewrite_exprs(&self, r: &mut dyn ExprRewriter) -> PlanRef
Source§impl ExprRewritable<Logical> for LogicalValues
impl ExprRewritable<Logical> for LogicalValues
fn has_rewritable_expr(&self) -> bool
fn rewrite_exprs(&self, r: &mut dyn ExprRewriter) -> PlanRef
Source§impl InfallibleRule<Logical> for AggCallMergeRule
impl InfallibleRule<Logical> for AggCallMergeRule
Source§impl InfallibleRule<Logical> for AggProjectMergeRule
impl InfallibleRule<Logical> for AggProjectMergeRule
Source§impl InfallibleRule<Logical> for ApplyEliminateRule
impl InfallibleRule<Logical> for ApplyEliminateRule
Source§impl InfallibleRule<Logical> for ApplyToJoinRule
impl InfallibleRule<Logical> for ApplyToJoinRule
Source§impl InfallibleRule<Logical> for DagToTreeRule
impl InfallibleRule<Logical> for DagToTreeRule
Source§impl InfallibleRule<Logical> for DistinctAggRule
impl InfallibleRule<Logical> for DistinctAggRule
Source§impl InfallibleRule<Logical> for EmptyAggRemoveRule
impl InfallibleRule<Logical> for EmptyAggRemoveRule
Source§impl InfallibleRule<Logical> for ExceptMergeRule
impl InfallibleRule<Logical> for ExceptMergeRule
Source§impl InfallibleRule<Logical> for ExceptToAntiJoinRule
impl InfallibleRule<Logical> for ExceptToAntiJoinRule
Source§impl InfallibleRule<Logical> for ExpandToProjectRule
impl InfallibleRule<Logical> for ExpandToProjectRule
Source§impl InfallibleRule<Logical> for IndexSelectionRule
impl InfallibleRule<Logical> for IndexSelectionRule
Source§impl InfallibleRule<Logical> for IntersectMergeRule
impl InfallibleRule<Logical> for IntersectMergeRule
Source§impl InfallibleRule<Logical> for JoinCommuteRule
impl InfallibleRule<Logical> for JoinCommuteRule
Source§impl InfallibleRule<Logical> for LimitPushDownRule
impl InfallibleRule<Logical> for LimitPushDownRule
Source§impl InfallibleRule<Logical> for MergeMultiJoinRule
impl InfallibleRule<Logical> for MergeMultiJoinRule
Source§impl InfallibleRule<Logical> for MinMaxOnIndexRule
impl InfallibleRule<Logical> for MinMaxOnIndexRule
Source§impl InfallibleRule<Logical> for OverWindowMergeRule
impl InfallibleRule<Logical> for OverWindowMergeRule
Source§impl InfallibleRule<Logical> for OverWindowSplitRule
impl InfallibleRule<Logical> for OverWindowSplitRule
Source§impl InfallibleRule<Logical> for OverWindowToTopNRule
impl InfallibleRule<Logical> for OverWindowToTopNRule
Source§impl InfallibleRule<Logical> for ProjectEliminateRule
impl InfallibleRule<Logical> for ProjectEliminateRule
Source§impl InfallibleRule<Logical> for ProjectJoinMergeRule
impl InfallibleRule<Logical> for ProjectJoinMergeRule
Source§impl InfallibleRule<Logical> for ProjectMergeRule
impl InfallibleRule<Logical> for ProjectMergeRule
Source§impl InfallibleRule<Logical> for PullUpHopRule
impl InfallibleRule<Logical> for PullUpHopRule
Source§impl InfallibleRule<Logical> for RewriteLikeExprRule
impl InfallibleRule<Logical> for RewriteLikeExprRule
Source§impl InfallibleRule<Logical> for SplitNowAndRule
impl InfallibleRule<Logical> for SplitNowAndRule
Source§impl InfallibleRule<Logical> for SplitNowOrRule
impl InfallibleRule<Logical> for SplitNowOrRule
Source§impl InfallibleRule<Logical> for TopNOnIndexRule
impl InfallibleRule<Logical> for TopNOnIndexRule
Source§impl InfallibleRule<Logical> for TranslateApplyRule
impl InfallibleRule<Logical> for TranslateApplyRule
Source§impl InfallibleRule<Logical> for UnionMergeRule
impl InfallibleRule<Logical> for UnionMergeRule
Source§impl InfallibleRule<Logical> for UnionToDistinctRule
impl InfallibleRule<Logical> for UnionToDistinctRule
Source§impl PlanTreeNode<Logical> for LogicalAgg
impl PlanTreeNode<Logical> for LogicalAgg
Source§impl PlanTreeNode<Logical> for LogicalApply
impl PlanTreeNode<Logical> for LogicalApply
Source§impl PlanTreeNode<Logical> for LogicalCdcScan
impl PlanTreeNode<Logical> for LogicalCdcScan
Source§impl PlanTreeNode<Logical> for LogicalChangeLog
impl PlanTreeNode<Logical> for LogicalChangeLog
Source§impl PlanTreeNode<Logical> for LogicalCteRef
impl PlanTreeNode<Logical> for LogicalCteRef
Source§impl PlanTreeNode<Logical> for LogicalDedup
impl PlanTreeNode<Logical> for LogicalDedup
Source§impl PlanTreeNode<Logical> for LogicalDelete
impl PlanTreeNode<Logical> for LogicalDelete
Source§impl PlanTreeNode<Logical> for LogicalExcept
impl PlanTreeNode<Logical> for LogicalExcept
Source§impl PlanTreeNode<Logical> for LogicalExpand
impl PlanTreeNode<Logical> for LogicalExpand
Source§impl PlanTreeNode<Logical> for LogicalFileScan
impl PlanTreeNode<Logical> for LogicalFileScan
Source§impl PlanTreeNode<Logical> for LogicalFilter
impl PlanTreeNode<Logical> for LogicalFilter
Source§impl PlanTreeNode<Logical> for LogicalHopWindow
impl PlanTreeNode<Logical> for LogicalHopWindow
Source§impl PlanTreeNode<Logical> for LogicalIcebergScan
impl PlanTreeNode<Logical> for LogicalIcebergScan
Source§impl PlanTreeNode<Logical> for LogicalInsert
impl PlanTreeNode<Logical> for LogicalInsert
Source§impl PlanTreeNode<Logical> for LogicalIntersect
impl PlanTreeNode<Logical> for LogicalIntersect
Source§impl PlanTreeNode<Logical> for LogicalJoin
impl PlanTreeNode<Logical> for LogicalJoin
Source§impl PlanTreeNode<Logical> for LogicalKafkaScan
impl PlanTreeNode<Logical> for LogicalKafkaScan
Source§impl PlanTreeNode<Logical> for LogicalLimit
impl PlanTreeNode<Logical> for LogicalLimit
Source§impl PlanTreeNode<Logical> for LogicalMaxOneRow
impl PlanTreeNode<Logical> for LogicalMaxOneRow
Source§impl PlanTreeNode<Logical> for LogicalMultiJoin
impl PlanTreeNode<Logical> for LogicalMultiJoin
Source§impl PlanTreeNode<Logical> for LogicalMySqlQuery
impl PlanTreeNode<Logical> for LogicalMySqlQuery
Source§impl PlanTreeNode<Logical> for LogicalNow
impl PlanTreeNode<Logical> for LogicalNow
Source§impl PlanTreeNode<Logical> for LogicalOverWindow
impl PlanTreeNode<Logical> for LogicalOverWindow
Source§impl PlanTreeNode<Logical> for LogicalPostgresQuery
impl PlanTreeNode<Logical> for LogicalPostgresQuery
Source§impl PlanTreeNode<Logical> for LogicalProject
impl PlanTreeNode<Logical> for LogicalProject
Source§impl PlanTreeNode<Logical> for LogicalProjectSet
impl PlanTreeNode<Logical> for LogicalProjectSet
Source§impl PlanTreeNode<Logical> for LogicalRecursiveUnion
impl PlanTreeNode<Logical> for LogicalRecursiveUnion
Source§impl PlanTreeNode<Logical> for LogicalScan
impl PlanTreeNode<Logical> for LogicalScan
Source§impl PlanTreeNode<Logical> for LogicalSource
impl PlanTreeNode<Logical> for LogicalSource
Source§impl PlanTreeNode<Logical> for LogicalSysScan
impl PlanTreeNode<Logical> for LogicalSysScan
Source§impl PlanTreeNode<Logical> for LogicalTableFunction
impl PlanTreeNode<Logical> for LogicalTableFunction
Source§impl PlanTreeNode<Logical> for LogicalTopN
impl PlanTreeNode<Logical> for LogicalTopN
Source§impl PlanTreeNode<Logical> for LogicalUnion
impl PlanTreeNode<Logical> for LogicalUnion
Source§impl PlanTreeNode<Logical> for LogicalUpdate
impl PlanTreeNode<Logical> for LogicalUpdate
Source§impl PlanTreeNode<Logical> for LogicalValues
impl PlanTreeNode<Logical> for LogicalValues
Source§impl PlanTreeNodeBinary<Logical> for LogicalApply
impl PlanTreeNodeBinary<Logical> for LogicalApply
fn left(&self) -> PlanRef
fn right(&self) -> PlanRef
fn clone_with_left_right(&self, left: PlanRef, right: PlanRef) -> Self
Source§fn rewrite_with_left_right(
&self,
_left: PlanRef<C>,
_left_col_change: ColIndexMapping,
_right: PlanRef<C>,
_right_col_change: ColIndexMapping,
) -> (Self, ColIndexMapping)where
Self: Sized,
fn rewrite_with_left_right(
&self,
_left: PlanRef<C>,
_left_col_change: ColIndexMapping,
_right: PlanRef<C>,
_right_col_change: ColIndexMapping,
) -> (Self, ColIndexMapping)where
Self: Sized,
Rewrites the plan node according to the schema change of its input nodes during rewriting. Read more
Source§impl PlanTreeNodeBinary<Logical> for LogicalJoin
impl PlanTreeNodeBinary<Logical> for LogicalJoin
fn left(&self) -> PlanRef
fn right(&self) -> PlanRef
fn clone_with_left_right(&self, left: PlanRef, right: PlanRef) -> Self
Source§fn rewrite_with_left_right(
&self,
left: PlanRef,
left_col_change: ColIndexMapping,
right: PlanRef,
right_col_change: ColIndexMapping,
) -> (Self, ColIndexMapping)
fn rewrite_with_left_right( &self, left: PlanRef, left_col_change: ColIndexMapping, right: PlanRef, right_col_change: ColIndexMapping, ) -> (Self, ColIndexMapping)
Rewrites the plan node according to the schema change of its input nodes during rewriting. Read more
Source§impl PlanTreeNodeUnary<Logical> for LogicalAgg
impl PlanTreeNodeUnary<Logical> 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)
Rewrites the plan node according to the schema change of its input node during rewriting. Read more
Source§impl PlanTreeNodeUnary<Logical> for LogicalChangeLog
impl PlanTreeNodeUnary<Logical> for LogicalChangeLog
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)
Rewrites the plan node according to the schema change of its input node during rewriting. Read more
Source§impl PlanTreeNodeUnary<Logical> for LogicalDedup
impl PlanTreeNodeUnary<Logical> for LogicalDedup
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)
Rewrites the plan node according to the schema change of its input node during rewriting. Read more
Source§impl PlanTreeNodeUnary<Logical> for LogicalDelete
impl PlanTreeNodeUnary<Logical> for LogicalDelete
fn input(&self) -> PlanRef
fn clone_with_input(&self, input: PlanRef) -> Self
Source§fn rewrite_with_input(
&self,
_input: PlanRef<C>,
_input_col_change: ColIndexMapping,
) -> (Self, ColIndexMapping)where
Self: Sized,
fn rewrite_with_input(
&self,
_input: PlanRef<C>,
_input_col_change: ColIndexMapping,
) -> (Self, ColIndexMapping)where
Self: Sized,
Rewrites the plan node according to the schema change of its input node during rewriting. Read more
Source§impl PlanTreeNodeUnary<Logical> for LogicalExpand
impl PlanTreeNodeUnary<Logical> for LogicalExpand
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)
Rewrites the plan node according to the schema change of its input node during rewriting. Read more
Source§impl PlanTreeNodeUnary<Logical> for LogicalFilter
impl PlanTreeNodeUnary<Logical> for LogicalFilter
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)
Rewrites the plan node according to the schema change of its input node during rewriting. Read more
Source§impl PlanTreeNodeUnary<Logical> for LogicalHopWindow
impl PlanTreeNodeUnary<Logical> for LogicalHopWindow
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)
Rewrites the plan node according to the schema change of its input node during rewriting. Read more
Source§impl PlanTreeNodeUnary<Logical> for LogicalInsert
impl PlanTreeNodeUnary<Logical> for LogicalInsert
fn input(&self) -> PlanRef
fn clone_with_input(&self, input: PlanRef) -> Self
Source§fn rewrite_with_input(
&self,
_input: PlanRef<C>,
_input_col_change: ColIndexMapping,
) -> (Self, ColIndexMapping)where
Self: Sized,
fn rewrite_with_input(
&self,
_input: PlanRef<C>,
_input_col_change: ColIndexMapping,
) -> (Self, ColIndexMapping)where
Self: Sized,
Rewrites the plan node according to the schema change of its input node during rewriting. Read more
Source§impl PlanTreeNodeUnary<Logical> for LogicalLimit
impl PlanTreeNodeUnary<Logical> for LogicalLimit
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)
Rewrites the plan node according to the schema change of its input node during rewriting. Read more
Source§impl PlanTreeNodeUnary<Logical> for LogicalMaxOneRow
impl PlanTreeNodeUnary<Logical> for LogicalMaxOneRow
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)
Rewrites the plan node according to the schema change of its input node during rewriting. Read more
Source§impl PlanTreeNodeUnary<Logical> for LogicalOverWindow
impl PlanTreeNodeUnary<Logical> for LogicalOverWindow
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)
Rewrites the plan node according to the schema change of its input node during rewriting. Read more
Source§impl PlanTreeNodeUnary<Logical> for LogicalProject
impl PlanTreeNodeUnary<Logical> for LogicalProject
fn input(&self) -> LogicalPlanRef
fn clone_with_input(&self, input: LogicalPlanRef) -> 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)
Rewrites the plan node according to the schema change of its input node during rewriting. Read more
Source§impl PlanTreeNodeUnary<Logical> for LogicalProjectSet
impl PlanTreeNodeUnary<Logical> for LogicalProjectSet
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)
Rewrites the plan node according to the schema change of its input node during rewriting. Read more
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)
Rewrites the plan node according to the schema change of its input node during rewriting. Read more
Source§impl PlanTreeNodeUnary<Logical> for LogicalTopN
impl PlanTreeNodeUnary<Logical> for LogicalTopN
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)
Rewrites the plan node according to the schema change of its input node during rewriting. Read more
Source§impl PlanTreeNodeUnary<Logical> for LogicalUpdate
impl PlanTreeNodeUnary<Logical> for LogicalUpdate
fn input(&self) -> PlanRef
fn clone_with_input(&self, input: PlanRef) -> Self
Source§fn rewrite_with_input(
&self,
_input: PlanRef<C>,
_input_col_change: ColIndexMapping,
) -> (Self, ColIndexMapping)where
Self: Sized,
fn rewrite_with_input(
&self,
_input: PlanRef<C>,
_input_col_change: ColIndexMapping,
) -> (Self, ColIndexMapping)where
Self: Sized,
Rewrites the plan node according to the schema change of its input node during rewriting. Read more
fn replace_input(&self, plan: PlanRef)
impl Eq for Logical
impl StructuralPartialEq for Logical
Auto Trait Implementations§
impl Freeze for Logical
impl RefUnwindSafe for Logical
impl Send for Logical
impl Sync for Logical
impl Unpin for Logical
impl UnwindSafe for Logical
Blanket Implementations§
§impl<T> AsAny for T
impl<T> AsAny for T
§fn any_ref(&self) -> &(dyn Any + Send + Sync + 'static)
fn any_ref(&self) -> &(dyn Any + Send + Sync + 'static)
Obtains a
dyn Any
reference to the object: Read more§fn as_any(self: Arc<T>) -> Arc<dyn Any + Send + Sync>
fn as_any(self: Arc<T>) -> Arc<dyn Any + Send + Sync>
Obtains an
Arc<dyn Any>
reference to the object: Read more§fn into_any(self: Box<T>) -> Box<dyn Any + Send + Sync>
fn into_any(self: Box<T>) -> Box<dyn Any + Send + Sync>
Converts the object to
Box<dyn Any>
: Read more§fn type_name(&self) -> &'static str
fn type_name(&self) -> &'static str
Convenient wrapper for
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
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§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>
Converts
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>
Converts
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)
Converts
&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)
Converts
&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<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> 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,
Causes
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,
Causes
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,
Causes
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,
Causes
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,
Causes
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,
Causes
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,
Causes
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,
Causes
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,
Formats each item in a sequence. 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>
Creates a shared type from an unshared type.
§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>
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> 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,
Pipes by value. This is generally the method you want to use. Read more
§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,
Borrows
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,
Mutably borrows
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
Borrows
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
Mutably borrows
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
Borrows
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
Source§impl<T> SameOrElseExt for Twhere
T: Eq,
impl<T> SameOrElseExt for Twhere
T: Eq,
Source§fn same_or_else(self, other: T, f: impl FnOnce() -> T) -> T
fn same_or_else(self, other: T, f: impl FnOnce() -> T) -> T
Check if
self
and other
are equal, if so, return self
, otherwise return the result of f()
.§impl<T> Scope for T
impl<T> Scope 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
Immutable access to the
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
Mutable access to the
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
Immutable access to the
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
Mutable access to the
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
Immutable access to the
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
Mutable access to the
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
Calls
.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
Calls
.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
Calls
.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
Calls
.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
Calls
.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
Calls
.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
Calls
.tap_deref()
only in debug builds, and is erased in release
builds.