Struct polars_plan::logical_plan::visitor::AexprNode

pub struct AexprNode { /* private fields */ }

Implementations

impl AexprNode

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

where F: FnOnce(AexprNode) -> T,

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

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

where F: FnOnce(AexprNode, &mut Arena<AExpr>) -> T,

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

pub fn node(&self) -> Node

Get the Node.

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

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

Apply an operation with the underlying Arena.

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

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

Apply an operation with the underlying Arena.

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

Assign an AExpr to underlying arena.

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

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

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

pub fn to_aexpr(&self) -> &AExpr

pub fn to_expr(&self) -> Expr

pub fn to_field(&self, schema: &Schema) -> PolarsResult<Field>

Trait Implementations

impl Clone for AexprNode

fn clone(&self) -> AexprNode

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for AexprNode

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

Formats the value using the given formatter.

impl PartialEq for AexprNode

fn eq(&self, other: &Self) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl TreeWalker for AexprNode

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>

impl Copy for AexprNode