Enum NodeKind 

#[non_exhaustive]
pub enum NodeKind {
    Filter {
        filter_name: String,
    },
    SubGraph {
        graph: Box<Graph>,
    },
    Loop {
        max_iterations: Option<usize>,
    },
    Branch,
}

What kind of computation a node represents.

Variants (Non-exhaustive)

Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.

Filter

A single filter (the common case).

Fields

filter_name: String

SubGraph

A nested sub-graph (compiled recursively).

Fields

graph: Box<Graph>

Loop

A loop node — body is the sub-graph of successors.

Fields

max_iterations: Option<usize>

Branch

A branch/conditional node — arms determined by control edges.

Trait Implementations

impl Clone for NodeKind

fn clone(&self) -> NodeKind

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for NodeKind

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for NodeKind

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for NodeKind

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

where __S: Serializer,

Serialize this value into the given Serde serializer.