Struct BoundNodeMap
pub struct BoundNodeMap { /* private fields */ }Expand description
Admission metadata for precisely one live widget/Taffy layout.
Implementations§
§impl BoundNodeMap
impl BoundNodeMap
pub fn document_edit_stamp(
&self,
node: NodeId,
document: &AutoCommit,
) -> Result<DocumentEditStamp, BoundDispatchError>
pub fn document_edit_stamp( &self, node: NodeId, document: &AutoCommit, ) -> Result<DocumentEditStamp, BoundDispatchError>
Read the nearest canonical record owner’s document and history stamp. Local writes, remote merges and undo/redo invalidate it, including an edit followed by its inverse. Reading does not open an action or commit.
§Errors
Rejects missing/inactive nodes, retired owners, borrowed records and exhausted generations; callers must cancel deferred text insertion.
pub fn new() -> BoundNodeMap
pub fn clear(&mut self)
pub unsafe fn rebuild(
&mut self,
root: &dyn Widget,
taffy: &TaffyTree,
layout_root: NodeId,
nodes: &HashMap<NodeId, *mut dyn Widget>,
)
pub unsafe fn rebuild( &mut self, root: &dyn Widget, taffy: &TaffyTree, layout_root: NodeId, nodes: &HashMap<NodeId, *mut dyn Widget>, )
Admit raw nodes using their nearest boundary in the matching layout topology.
§Safety
Root, tree, layout root and pointers must belong to the same live build under one exclusive tree owner. No replacement, rebuild or destruction may occur.
Trait Implementations§
§impl Default for BoundNodeMap
impl Default for BoundNodeMap
§fn default() -> BoundNodeMap
fn default() -> BoundNodeMap
Returns the “default value” for a type. Read more
Auto Trait Implementations§
impl Freeze for BoundNodeMap
impl !RefUnwindSafe for BoundNodeMap
impl !Send for BoundNodeMap
impl !Sync for BoundNodeMap
impl Unpin for BoundNodeMap
impl UnsafeUnpin for BoundNodeMap
impl !UnwindSafe for BoundNodeMap
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
Mutably borrows from an owned value. Read more
§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>
Convert
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>
Convert
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)
Convert
&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)
Convert
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.§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>
Converts
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>
Converts
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 more§impl<T> NoneValue for Twhere
T: Default,
impl<T> NoneValue for Twhere
T: Default,
type NoneType = T
§fn null_value() -> T
fn null_value() -> T
The none-equivalent value.