Struct ExprIntervalGraphNode

pub struct ExprIntervalGraphNode { /* private fields */ }

This is a node in the DAEG; it encapsulates a reference to the actual PhysicalExpr as well as an interval containing expression bounds.

Implementations

impl ExprIntervalGraphNode

pub fn new_unbounded(expr: Arc<dyn PhysicalExpr>, dt: &DataType) -> Result<Self>

Constructs a new DAEG node with an [-∞, ∞] range.

pub fn new_with_interval( expr: Arc<dyn PhysicalExpr>, interval: Interval, ) -> Self

Constructs a new DAEG node with the given range.

pub fn interval(&self) -> &Interval

Get the interval object representing the range of the expression.

pub fn make_node( node: &ExprTreeNode<NodeIndex>, schema: &Schema, ) -> Result<Self>

This function creates a DAEG node from DataFusion’s ExprTreeNode object. Literals are created with definite, singleton intervals while any other expression starts with an indefinite interval ([-∞, ∞]).

Trait Implementations

impl Clone for ExprIntervalGraphNode

fn clone(&self) -> ExprIntervalGraphNode

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for ExprIntervalGraphNode

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

Formats the value using the given formatter.

impl Display for ExprIntervalGraphNode

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

Formats the value using the given formatter.

impl PartialEq for ExprIntervalGraphNode

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

Tests for self and other values to be equal, and is used by ==.

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

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