Enum Expression 

pub enum Expression {
    AccessSource(AccessObjectExpression),
    Alias(AliasExpression),
    Cast(CastExpression),
    Constant(ConstantExpression),
    Column(ColumnExpression),
    Add(AddExpression),
    Div(DivExpression),
    Call(CallExpression),
    Rem(RemExpression),
    Mul(MulExpression),
    Sub(SubExpression),
    Tuple(TupleExpression),
    List(ListExpression),
    Record(RecordExpression),
    Prefix(PrefixExpression),
    GreaterThan(GreaterThanExpression),
    GreaterThanEqual(GreaterThanEqExpression),
    LessThan(LessThanExpression),
    LessThanEqual(LessThanEqExpression),
    Equal(EqExpression),
    NotEqual(NotEqExpression),
    Between(BetweenExpression),
    And(AndExpression),
    Or(OrExpression),
    Xor(XorExpression),
    In(InExpression),
    Contains(ContainsExpression),
    Type(TypeExpression),
    Parameter(ParameterExpression),
    Variable(VariableExpression),
    If(IfExpression),
    Map(MapExpression),
    Extend(ExtendExpression),
    SumTypeConstructor(SumTypeConstructorExpression),
    IsVariant(IsVariantExpression),
    FieldAccess(FieldAccessExpression),
}

Variants

AccessSource(AccessObjectExpression)

Alias(AliasExpression)

Cast(CastExpression)

Constant(ConstantExpression)

Column(ColumnExpression)

Add(AddExpression)

Div(DivExpression)

Call(CallExpression)

Rem(RemExpression)

Mul(MulExpression)

Sub(SubExpression)

Tuple(TupleExpression)

List(ListExpression)

Record(RecordExpression)

Prefix(PrefixExpression)

GreaterThan(GreaterThanExpression)

GreaterThanEqual(GreaterThanEqExpression)

LessThan(LessThanExpression)

LessThanEqual(LessThanEqExpression)

Equal(EqExpression)

NotEqual(NotEqExpression)

Between(BetweenExpression)

And(AndExpression)

Or(OrExpression)

Xor(XorExpression)

In(InExpression)

Contains(ContainsExpression)

Type(TypeExpression)

Parameter(ParameterExpression)

Variable(VariableExpression)

If(IfExpression)

Map(MapExpression)

Extend(ExtendExpression)

SumTypeConstructor(SumTypeConstructorExpression)

IsVariant(IsVariantExpression)

FieldAccess(FieldAccessExpression)

Implementations

impl Expression

pub fn lazy_fragment(&self) -> impl Fn() -> Fragment

impl Expression

pub fn full_fragment_owned(&self) -> Fragment

impl Expression

pub fn infer_type(&self) -> Option<ValueType>

Trait Implementations

impl Clone for Expression

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Expression

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Expression

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Display for Expression

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

Formats the value using the given formatter.

impl PartialEq for Expression

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

Equality operator ==.

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

Inequality operator !=.

impl Serialize for Expression

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for Expression

impl TreeNode for Expression

fn apply_children<'n, F: FnMut(&'n Self) -> Result<TreeNodeRecursion>>( &'n self, f: F, ) -> Result<TreeNodeRecursion>

Low-level API used to implement other APIs.

fn map_children<F: FnMut(Self) -> Result<Transformed<Self>>>( self, f: F, ) -> Result<Transformed<Self>>

Low-level API used to implement other APIs.

fn visit<'n, V>( &'n self, visitor: &mut V, ) -> Result<TreeNodeRecursion, DataFusionError>

where V: TreeNodeVisitor<'n, Node = Self>,

Visit the tree node with a TreeNodeVisitor, performing a depth-first walk of the node and its children.

fn rewrite<R>( self, rewriter: &mut R, ) -> Result<Transformed<Self>, DataFusionError>

where R: TreeNodeRewriter<Node = Self>,

Rewrite the tree node with a TreeNodeRewriter, performing a depth-first walk of the node and its children.

fn apply<'n, F>(&'n self, f: F) -> Result<TreeNodeRecursion, DataFusionError>

where F: FnMut(&'n Self) -> Result<TreeNodeRecursion, DataFusionError>,

Applies f to the node then each of its children, recursively (a top-down, pre-order traversal).

fn transform<F>(self, f: F) -> Result<Transformed<Self>, DataFusionError>

where F: FnMut(Self) -> Result<Transformed<Self>, DataFusionError>,

Recursively rewrite the node’s children and then the node using f (a bottom-up post-order traversal).

fn transform_down<F>(self, f: F) -> Result<Transformed<Self>, DataFusionError>

where F: FnMut(Self) -> Result<Transformed<Self>, DataFusionError>,

Recursively rewrite the tree using f in a top-down (pre-order) fashion.

fn transform_up<F>(self, f: F) -> Result<Transformed<Self>, DataFusionError>

where F: FnMut(Self) -> Result<Transformed<Self>, DataFusionError>,

Recursively rewrite the node using f in a bottom-up (post-order) fashion.

fn transform_down_up<FD, FU>( self, f_down: FD, f_up: FU, ) -> Result<Transformed<Self>, DataFusionError>

where FD: FnMut(Self) -> Result<Transformed<Self>, DataFusionError>, FU: FnMut(Self) -> Result<Transformed<Self>, DataFusionError>,

Transforms the node using f_down while traversing the tree top-down (pre-order), and using f_up while traversing the tree bottom-up (post-order).

fn exists<F>(&self, f: F) -> Result<bool, DataFusionError>

where F: FnMut(&Self) -> Result<bool, DataFusionError>,

Returns true if f returns true for any node in the tree.