Struct ElemLoop

pub struct ElemLoop {
    pub body: Box<Elem>,
    pub next: Box<Elem>,
}

Defines a looping connection between graph Elements.

Simply defines a branch that is taken repeatedly. Any condition that was there is embedded in the branching part, since that’s how the branch is dynamically taken and we can’t know how often any of them is taken anyway.

Fields

body: Box<Elem>

The body (and embedded condition) of the loop.

next: Box<Elem>

The next graph element that this parallel edge connects to.

Trait Implementations

impl Clone for ElemLoop

fn clone(&self) -> ElemLoop

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for ElemLoop

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for ElemLoop

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for ElemLoop

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

where __S: Serializer,

Serialize this value into the given Serde serializer.