Type Alias LogicalPlanRef 

pub type LogicalPlanRef = PlanRef<Logical>;

Aliased Type

pub struct LogicalPlanRef(Rc<dyn LogicalPlanNode>);

Tuple Fields

0: Rc<dyn LogicalPlanNode>

Implementations

impl LogicalPlanRef

pub fn common_subplan_sharing<V: Hash + Eq>(self) -> PlanRef

where PlanRef: Semantics<V>,

impl LogicalPlanRef

pub fn prune_share(&self) -> PlanRef

impl LogicalPlanRef

fn prune_col_inner( &self, required_cols: &[usize], ctx: &mut ColumnPruningContext, ) -> LogicalPlanRef

fn predicate_pushdown_inner( &self, predicate: Condition, ctx: &mut PredicatePushdownContext, ) -> LogicalPlanRef

pub fn forbid_snapshot_backfill(&self) -> Option<String>

Trait Implementations

impl ColPrunable for LogicalPlanRef

fn prune_col( &self, required_cols: &[usize], ctx: &mut ColumnPruningContext, ) -> LogicalPlanRef

Transform the plan node to only output the required columns ordered by index number.

impl From<Agg<PlanRef<Logical>>> for LogicalPlanRef

Because From/Into are not transitive

fn from(core: Agg<PlanRef>) -> Self

Converts to this type from the input type.

impl From<CdcScan> for LogicalPlanRef

fn from(core: CdcScan) -> Self

Converts to this type from the input type.

impl From<SysScan> for LogicalPlanRef

fn from(core: SysScan) -> Self

Converts to this type from the input type.

impl From<TableScan> for LogicalPlanRef

fn from(core: TableScan) -> Self

Converts to this type from the input type.

impl LogicalCardinalityExt for LogicalPlanRef

fn max_one_row(&self) -> bool

Returns true if the plan node is guaranteed to yield at most one row.

fn row_count(&self) -> Option<usize>

Returns the number of rows the plan node is guaranteed to yield, if known exactly.

impl PlanCheckApplyEliminationExt for LogicalPlanRef

fn check_subquery_planned(&self) -> Result<(), RwError>

Checks that the planner has turned every subquery expression into an Apply. A subquery left in an expression, e.g., in a lambda body, can be neither hashed nor unnested.

fn check_apply_elimination(&self) -> Result<(), RwError>

Checks if all LogicalApply nodes in the plan have been eliminated, that is, subqueries are successfully unnested, and that no correlated column reference is left.

impl PredicatePushdown for LogicalPlanRef

fn predicate_pushdown( &self, predicate: Condition, ctx: &mut PredicatePushdownContext, ) -> LogicalPlanRef

Push predicate down for every logical plan node.

impl Semantics<PlanRef<Logical>> for LogicalPlanRef

fn semantics(&self) -> PlanRef