Struct BoundExpression 

pub struct BoundExpression { /* private fields */ }

An Expression that has been type-checked against a Scope.

Every node carries its own dtype, so reading one is a field access rather than a walk of the subtree. Holding a BoundExpression is proof that the whole tree type-checked.

Binding is purely logical: it deals only in DTypes and never sees an array, a length, or an encoding.

Implementations

impl BoundExpression

pub fn new_root(dtype: DType) -> Self

Create a bound root expression with the given dtype.

pub fn try_new( scalar_fn: ScalarFnRef, children: impl IntoIterator<Item = BoundExpression>, ) -> VortexResult<Self>

Create a bound scalar node from a scalar function and already-bound children.

pub fn with_children( self, children: impl IntoIterator<Item = BoundExpression>, ) -> VortexResult<Self>

Rebuild this node with new bound children, recomputing its dtype.

pub fn dtype(&self) -> &DType

The dtype this expression evaluates to.

pub fn kind(&self) -> &BoundKind

The per-variant contents of this node.

pub fn children(&self) -> &[BoundExpression]

The bound children of this node, in argument order. Empty for BoundKind::Root.

pub fn child(&self, index: usize) -> &BoundExpression

Return the child at index.

pub fn as_scalar(&self) -> Option<&ScalarFnRef>

The scalar function for this node, or None if it is the scope root.

pub fn is<V: ScalarFnVTable>(&self) -> bool

Return whether this node uses the given scalar-function vtable.

pub fn contains<V: ScalarFnVTable>(&self) -> VortexResult<bool>

Return whether this expression tree contains a node using the given scalar-function vtable.

pub fn as_opt<V: ScalarFnVTable>(&self) -> Option<&V::Options>

Return the typed scalar-function options when this node uses the given vtable.

pub fn as_<V: ScalarFnVTable>(&self) -> &V::Options

Return the typed scalar-function options for this node.

Panics

Panics when this node is the scope root or uses a different scalar-function vtable.

pub fn is_root(&self) -> bool

Whether this node is the scope root.

pub fn falsify( &self, session: &VortexSession, ) -> VortexResult<Option<BoundExpression>>

Return an expression that proves this predicate is definitely false from statistics.

pub fn satisfy( &self, session: &VortexSession, ) -> VortexResult<Option<BoundExpression>>

Return an expression that proves this predicate is definitely true from statistics.

pub fn display_tree(&self) -> impl Display

Display the bound expression as a formatted tree structure.

Trait Implementations

impl Clone for BoundExpression

fn clone(&self) -> BoundExpression

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for BoundExpression

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

Formats the value using the given formatter.

impl Display for BoundExpression

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

Formats the value using the given formatter.

impl Drop for BoundExpression

Iterative drop to avoid stack overflows on deep trees.

fn drop(&mut self)

Executes the destructor for this type.

fn pin_drop(self: Pin<&mut Self>)

🔬This is a nightly-only experimental API. (pin_ergonomics)

Execute the destructor for this type, but different to Drop::drop, it requires self to be pinned.

impl Eq for BoundExpression

impl ExprDisplay for BoundExpression

fn display_child(&self, index: usize) -> &dyn ExprDisplay

Return the child at index.

fn display_children_count(&self) -> usize

Return the number of children in this node.

impl Hash for BoundExpression

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Node for BoundExpression

fn apply_children<'a, F: FnMut(&'a Self) -> VortexResult<TraversalOrder>>( &'a self, f: F, ) -> VortexResult<TraversalOrder>

Walk the node’s children by applying f to them.

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

Rewrite the node’s children by applying f to them.

fn iter_children<T>( &self, f: impl FnOnce(&mut dyn Iterator<Item = &Self>) -> T, ) -> T

This is a lower level API that other functions rely on for their implementation.

fn children_count(&self) -> usize

This is a lower level API that other functions rely on for their implementation.

impl PartialEq for BoundExpression

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for BoundExpression