Struct AccessTree 

pub struct AccessTree {
    pub nodes: Vec<AccessNode>,
    pub focus: Option<Key>,
    pub hash: u64,
}

The semantic nodes of a finished frame, in tree order (a parent always precedes its descendants; the root comes first).

Fields

nodes: Vec<AccessNode>

focus: Option<Key>

The node holding keyboard focus, if any.

hash: u64

A hash of everything above: a driver that sent the tree once sends it again only when this changes.

Implementations

impl AccessTree

pub fn to_value(&self, h: Handles) -> Value

{nodes, focus, hash}, every node by AccessNode::to_value, the focus key spelled by h and the hash as sixteen hex digits.

pub fn get(&self, key: Key) -> Option<&AccessNode>

pub fn children(&self, key: Key) -> impl Iterator<Item = &AccessNode>

The nodes whose parent is key, in order.

pub fn root(&self) -> Option<&AccessNode>

The root (the window), when a frame has been built.

Trait Implementations

impl Clone for AccessTree

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for AccessTree

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

Formats the value using the given formatter.

impl Default for AccessTree

fn default() -> Self

Returns the “default value” for a type.

impl PartialEq for AccessTree

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for AccessTree