Struct TransSet 

pub struct TransSet<'a>(pub TransRangeList<'a>, pub Vec<(Metadata<'a>, TransRangeList<'a>)>);

Tuple Fields

0: TransRangeList<'a>

1: Vec<(Metadata<'a>, TransRangeList<'a>)>

Implementations

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

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

Iterate across the TransSet and its children

Trait Implementations

impl<'a> Clone for TransSet<'a>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a> Debug for TransSet<'a>

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

Formats the value using the given formatter.

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

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

Converts to this type from the input type.

impl<'a: 'b, 'b> IntoIterator for &'b TransSet<'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 TransSet<'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 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 TransSet<'a>

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