Struct polars_plan::plans::visitor::IRNode

pub struct IRNode { /* private fields */ }

Implementations

impl IRNode

pub fn new(node: Node) -> Self

pub fn node(&self) -> Node

pub fn replace_node(&mut self, node: Node)

pub fn replace(&mut self, ae: IR, arena: &mut Arena<IR>)

Replace the current Node with a new IR.

pub fn to_alp<'a>(&self, arena: &'a Arena<IR>) -> &'a IR

pub fn to_alp_mut<'a>(&mut self, arena: &'a mut Arena<IR>) -> &'a mut IR

pub fn assign(&mut self, ir_node: IR, arena: &mut Arena<IR>)

Trait Implementations

impl Clone for IRNode

fn clone(&self) -> IRNode

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for IRNode

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl TreeWalker for IRNode

type Arena = (Arena<IR>, Arena<AExpr>)

fn apply_children<F: FnMut(&Self, &Self::Arena) -> PolarsResult<VisitRecursion>>( &self, op: &mut F, arena: &Self::Arena, ) -> PolarsResult<VisitRecursion>

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

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

Walks all nodes in depth-first-order.

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

impl Copy for IRNode