Struct RsCase 

pub struct RsCase<'a>(pub Metadata<'a>, pub Metadata<'a>, pub CaseExpression<'a>, pub Metadata<'a>, pub RsCaseItem<'a>, pub Vec<RsCaseItem<'a>>, pub Metadata<'a>);

Tuple Fields

0: Metadata<'a>

1: Metadata<'a>

2: CaseExpression<'a>

3: Metadata<'a>

4: RsCaseItem<'a>

5: Vec<RsCaseItem<'a>>

6: Metadata<'a>

Implementations

impl<'a: 'b, 'b> RsCase<'a>

pub fn iter(&'b self) -> NodeIter<'a, 'b>

Iterate across the RsCase and its children

Trait Implementations

impl<'a> Clone for RsCase<'a>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a> Debug for RsCase<'a>

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

Formats the value using the given formatter.

impl<'a: 'b, 'b> From<&'b RsCase<'a>> for Node<'a, 'b>

fn from(value: &'b RsCase<'a>) -> Self

Converts to this type from the input type.

impl<'a: 'b, 'b> IntoIterator for &'b RsCase<'a>

type Item = Node<'a, 'b>

The type of the elements being iterated over.

type IntoIter = NodeIter<'a, 'b>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a: 'b, 'b> Nodes<'a, 'b> for RsCase<'a>

fn nodes(&'b self) -> NodeIter<'a, 'b>

The nodes of the object

fn add_nodes( &'b self, dest: &mut Vec<Node<'a, 'b>>, pred: fn(Node<'a, 'b>) -> bool, )

Add all children nodes satisfying the given predicate to the provided Vec

fn span(&'b self) -> Span<'a>

The overall Span of the nodes.

fn find(&'b self, pred: fn(Node<'a, 'b>) -> bool) -> Vec<Node<'a, 'b>>

Find all children nodes satisfying the given predicate

impl<'a> PartialEq for RsCase<'a>

fn eq(&self, other: &RsCase<'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> StructuralPartialEq for RsCase<'a>