pub struct TreeUpdate {
pub nodes: Vec<(NodeId, Node)>,
pub tree: Option<Tree>,
pub focus: NodeId,
}
Expand description
A serializable representation of an atomic change to a Tree
.
The sender and receiver must be in sync; the update is only meant to bring the tree from a specific previous state into its next state. Trying to apply it to the wrong tree should immediately panic.
Note that for performance, an update should only include nodes that are new or changed. AccessKit platform adapters will avoid raising extraneous events for nodes that have not changed since the previous update, but there is still a cost in processing these nodes and replacing the previous instances.
Fields§
§nodes: Vec<(NodeId, Node)>
Zero or more new or updated nodes. Order doesn’t matter.
Each node in this list will overwrite any existing node with the same ID. This means that when updating a node, fields that are unchanged from the previous version must still be set to the same values as before.
It is an error for any node in this list to not be either the root or a child of another node. For nodes other than the root, the parent must be either an unchanged node already in the tree, or another node in this list.
To add a child to the tree, the list must include both the child
and an updated version of the parent with the child’s ID added to
Node::children
.
To remove a child and all of its descendants, this list must include
an updated version of the parent node with the child’s ID removed
from Node::children
. Neither the child nor any of its descendants
may be included in this list.
tree: Option<Tree>
Rarely updated information about the tree as a whole. This may be omitted if it has not changed since the previous update, but providing the same information again is also allowed. This is required when initializing a tree.
focus: NodeId
The node within this tree that has keyboard focus when the native host (e.g. window) has focus. If no specific node within the tree has keyboard focus, this must be set to the root. The latest focus state must be provided with every tree update, even if the focus state didn’t change in a given update.
Trait Implementations§
§impl Clone for TreeUpdate
impl Clone for TreeUpdate
§fn clone(&self) -> TreeUpdate
fn clone(&self) -> TreeUpdate
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read more§impl Debug for TreeUpdate
impl Debug for TreeUpdate
§impl<'de> Deserialize<'de> for TreeUpdate
impl<'de> Deserialize<'de> for TreeUpdate
§fn deserialize<__D>(
__deserializer: __D
) -> Result<TreeUpdate, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(
__deserializer: __D
) -> Result<TreeUpdate, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
§impl PartialEq for TreeUpdate
impl PartialEq for TreeUpdate
§fn eq(&self, other: &TreeUpdate) -> bool
fn eq(&self, other: &TreeUpdate) -> bool
self
and other
values to be equal, and is used
by ==
.§impl Serialize for TreeUpdate
impl Serialize for TreeUpdate
§fn serialize<__S>(
&self,
__serializer: __S
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
fn serialize<__S>(
&self,
__serializer: __S
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
impl StructuralPartialEq for TreeUpdate
Auto Trait Implementations§
impl Freeze for TreeUpdate
impl RefUnwindSafe for TreeUpdate
impl Send for TreeUpdate
impl Sync for TreeUpdate
impl Unpin for TreeUpdate
impl UnwindSafe for TreeUpdate
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
source§impl<T> CheckedAs for T
impl<T> CheckedAs for T
source§fn checked_as<Dst>(self) -> Option<Dst>where
T: CheckedCast<Dst>,
fn checked_as<Dst>(self) -> Option<Dst>where
T: CheckedCast<Dst>,
source§impl<Src, Dst> CheckedCastFrom<Src> for Dstwhere
Src: CheckedCast<Dst>,
impl<Src, Dst> CheckedCastFrom<Src> for Dstwhere
Src: CheckedCast<Dst>,
source§fn checked_cast_from(src: Src) -> Option<Dst>
fn checked_cast_from(src: Src) -> Option<Dst>
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
.§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
.§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s.§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s.§impl<T> DowncastSync for T
impl<T> DowncastSync for T
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§impl<T> IntoRequest<T> for T
impl<T> IntoRequest<T> for T
source§fn into_request(self) -> Request<T>
fn into_request(self) -> Request<T>
T
in a tonic::Request