Struct TermDag 

pub struct TermDag {
    pub nodes: Vec<DagNode>,
    pub uses: Vec<usize>,
    pub root: usize,
}

A term as a DAG: each distinct subterm once, every node after its operands — how a large term (a function inlined at each call) is evaluated per element and printed with each shared subterm bound once.

Fields

nodes: Vec<DagNode>

uses: Vec<usize>

How many times each node is an operand of another.

root: usize

Implementations

impl TermDag

pub fn of(term: &ZipTerm) -> TermDag

pub fn types(&self, reads: &[Ty]) -> Option<Vec<Ty>>

Every node’s type when operand k holds a reads[k] (ZipTerm::ty node by node); None when the term is ill-typed.

pub fn value( &self, row: &[Scalar], ints: (i128, i128), reals: f64, ) -> Result<Scalar, Stop>

The term’s value at one element, as ZipTerm::value computes it — each node at most once, and only the arm a select takes.

pub fn value_of( &self, node: usize, row: &[Scalar], ints: (i128, i128), reals: f64, ) -> Result<Scalar, Stop>

The value of node node at one element, as Self::value computes the root’s.

Trait Implementations

impl Clone for TermDag

fn clone(&self) -> TermDag

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TermDag

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

Formats the value using the given formatter.

impl PartialEq for TermDag

fn eq(&self, other: &TermDag) -> 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.

impl Eq for TermDag

impl StructuralPartialEq for TermDag