Enum SketchNode

pub enum SketchNode<L> {
    Any,
    Node(L),
    Contains(Id),
    OnlyContains(Id),
    Or(Vec<Id>),
}

The language of Sketches.

Variants

Any

Any program of the underlying [Language].

Corresponds to the ? syntax.

Node(L)

Programs made from this [Language] node whose children satisfy the given sketches.

Corresponds to the (language_node s1 .. sn) syntax.

Contains(Id)

Programs that contain at least one sub-program satisfying the given sketch.

Corresponds to the (contains s) syntax.

OnlyContains(Id)

Programs that only contain sub-programs satisfying the given sketch.

Corresponds to the (onlyContains s) syntax.

Or(Vec<Id>)

Programs that satisfy any of these sketches.

Corresponds to the (or s1 .. sn) syntax.

Trait Implementations

impl<L: Clone> Clone for SketchNode<L>

fn clone(&self) -> SketchNode<L>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<L: Debug> Debug for SketchNode<L>

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

Formats the value using the given formatter.

impl<L: Language + Display> Display for SketchNode<L>

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

Formats the value using the given formatter.

impl<L: FromOp> FromOp for SketchNode<L>

type Error = SketchParseError<<L as FromOp>::Error>

The error type returned by from_op if its arguments do not represent a valid e-node.

fn from_op(op: &str, children: Vec<Id>) -> Result<Self, Self::Error>

Parse an e-node with operator op and children children.

impl<L: Hash> Hash for SketchNode<L>

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<L: Language> Language for SketchNode<L>

type Discriminant = SketchDiscriminant<L>

Type representing the cases of this language.

fn discriminant(&self) -> Self::Discriminant

Return the Discriminant of this node.

fn matches(&self, _other: &Self) -> bool

Returns true if this enode matches another enode. This should only consider the operator and the arity, not the children Ids.

fn children(&self) -> &[Id]

Returns the children of this e-node.

fn children_mut(&mut self) -> &mut [Id]

Returns a mutable slice of the children of this e-node.

fn for_each<F>(&self, f: F)

where F: FnMut(Id),

Runs a given function on each child Id.

fn for_each_mut<F>(&mut self, f: F)

where F: FnMut(&mut Id),

Runs a given function on each child Id, allowing mutation of that Id.

fn try_for_each<E, F>(&self, f: F) -> Result<(), E>

where F: FnMut(Id) -> Result<(), E>, E: Clone,

Runs a falliable function on each child, stopping if the function returns an error.

fn len(&self) -> usize

Returns the number of the children this enode has.

fn is_leaf(&self) -> bool

Returns true if this enode has no children.

fn update_children<F>(&mut self, f: F)

where F: FnMut(Id) -> Id,

Runs a given function to replace the children.

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

where F: FnMut(Id) -> Id,

Creates a new enode with children determined by the given function.

fn fold<F, T>(&self, init: T, f: F) -> T

where F: FnMut(T, Id) -> T, T: Clone,

Folds over the children, given an initial accumulator.

fn all<F>(&self, f: F) -> bool

where F: FnMut(Id) -> bool,

Returns true if the predicate is true on all children. Does not short circuit.

fn any<F>(&self, f: F) -> bool

where F: FnMut(Id) -> bool,

Returns true if the predicate is true on any children. Does not short circuit.

fn join_recexprs<F, Expr>(&self, child_recexpr: F) -> RecExpr<Self>

where F: FnMut(Id) -> Expr, Expr: AsRef<[Self]>,

Make a [RecExpr] by mapping this enodes children to other [RecExpr]s.

fn build_recexpr<F>(&self, get_node: F) -> RecExpr<Self>

where F: FnMut(Id) -> Self,

Build a [RecExpr] from an e-node.

fn try_build_recexpr<F, Err>(&self, get_node: F) -> Result<RecExpr<Self>, Err>

where F: FnMut(Id) -> Result<Self, Err>,

Same as [Language::build_recexpr], but fallible.

impl<L: Ord> Ord for SketchNode<L>

fn cmp(&self, other: &SketchNode<L>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<L: PartialEq> PartialEq for SketchNode<L>

fn eq(&self, other: &SketchNode<L>) -> 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<L: PartialOrd> PartialOrd for SketchNode<L>

fn partial_cmp(&self, other: &SketchNode<L>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<L: Eq> Eq for SketchNode<L>

impl<L> StructuralPartialEq for SketchNode<L>