Struct polars_plan::logical_plan::visitor::ALogicalPlanNode

pub struct ALogicalPlanNode { /* private fields */ }

Implementations

impl ALogicalPlanNode

pub fn with_context<F, T>( node: Node, arena: &mut Arena<ALogicalPlan>, op: F ) -> T

where F: FnMut(ALogicalPlanNode) -> T,

Safe interface. Take the &mut Arena only for the duration of op.

pub fn node(&self) -> Node

pub fn with_arena<'a, F, T>(&self, op: F) -> T

where F: Fn(&'a Arena<ALogicalPlan>) -> T,

pub fn with_arena_mut<'a, F, T>(&mut self, op: F) -> T

where F: FnOnce(&'a mut Arena<ALogicalPlan>) -> T,

pub fn assign(&mut self, ae: ALogicalPlan)

Add a new ALogicalPlan to the arena and set that node to Self.

pub fn replace(&mut self, ae: ALogicalPlan)

Replace the current Node with a new ALogicalPlan.

pub fn to_alp(&self) -> &ALogicalPlan

pub fn to_alp_mut(&mut self) -> &mut ALogicalPlan

pub fn schema(&self) -> Cow<'_, SchemaRef>

pub fn binary<F, T>(&self, other: Node, op: F) -> T

where F: FnOnce(&ALogicalPlanNode, &ALogicalPlanNode) -> T,

Take a Node and convert it an ALogicalPlanNode and call F with self and the new created ALogicalPlanNode

Trait Implementations

impl TreeWalker for ALogicalPlanNode

fn apply_children<'a>( &'a self, op: &mut dyn FnMut(&Self) -> PolarsResult<VisitRecursion> ) -> PolarsResult<VisitRecursion>

fn map_children( self, op: &mut dyn FnMut(Self) -> PolarsResult<Self> ) -> PolarsResult<Self>

fn visit( &self, visitor: &mut dyn Visitor<Node = Self> ) -> PolarsResult<VisitRecursion>

Walks all nodes in depth-first-order.

fn rewrite( self, rewriter: &mut dyn RewritingVisitor<Node = Self> ) -> PolarsResult<Self>