Struct Tree 

pub struct Tree {
    pub roots: Vec<Node>,
}

A full a11y tree as exchanged on the wire.

Fields

roots: Vec<Node>

Implementations

impl Tree

pub fn new() -> Self

pub fn from_root(root: Node) -> Self

pub fn iter(&self) -> TreeIter<'_>

Iterate all nodes in the tree in pre-order.

pub fn encode(&self) -> String

Encode the tree as a sequence of indented lines (no trailing blank line, no envelope). The result is the body that follows a success envelope on the wire.

pub fn parse(input: &str) -> Result<Self>

Parse the body of a vs_view response. The input must contain only tree lines — no envelope, no warnings.

Trait Implementations

impl Clone for Tree

fn clone(&self) -> Tree

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Tree

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

Formats the value using the given formatter.

impl Default for Tree

fn default() -> Tree

Returns the “default value” for a type.

impl<'a> IntoIterator for &'a Tree

type Item = &'a Node

The type of the elements being iterated over.

type IntoIter = TreeIter<'a>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl PartialEq for Tree

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

impl StructuralPartialEq for Tree