Struct Seq 

pub struct Seq<'a>(pub Vec<Chain<'a>>);

A sequence: zero or more chains delimited by separators (<seq>).

Tuple Fields

0: Vec<Chain<'a>>

Implementations

impl Seq<'_>

pub fn to_json(&self) -> String

Serialize the tree to compact, tagged JSON.

Trait Implementations

impl<'a> Clone for Seq<'a>

fn clone(&self) -> Seq<'a>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a> Debug for Seq<'a>

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

Formats the value using the given formatter.

impl Drop for Seq<'_>

Tear the tree down iteratively, so dropping a deeply-nested tree (the parser bounds nesting only by memory) can’t overflow the stack the way the default recursive Drop would. Item itself has no Drop, so leaves — the vast majority of nodes — drop trivially; the cost falls only on the nesting nodes walked here. The two recursion points are containers (a nested Seq) and Prefixed (a boxed inner Item); both are drained onto a heap worklist before the node holding them drops, so no Drop call nests.

fn drop(&mut self)

Executes the destructor for this type.

impl<'a> PartialEq for Seq<'a>

fn eq(&self, other: &Seq<'a>) -> 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<'a> Eq for Seq<'a>

impl<'a> StructuralPartialEq for Seq<'a>