pub struct Torin<Key: NodeKey> {
pub results: FxHashMap<Key, LayoutNode>,
pub dirty: FxHashMap<Key, DirtyReason>,
pub root_node_candidate: RootNodeCandidate<Key>,
}
Fields§
§results: FxHashMap<Key, LayoutNode>
Layout results of the registered Nodes
dirty: FxHashMap<Key, DirtyReason>
Invalid registered nodes since previous layout measurement
root_node_candidate: RootNodeCandidate<Key>
Best Root node candidate from where to start measuring
Implementations§
source§impl<Key: NodeKey> Torin<Key>
impl<Key: NodeKey> Torin<Key>
pub fn size(&self) -> usize
sourcepub fn get_dirty_nodes(&self) -> &FxHashMap<Key, DirtyReason>
pub fn get_dirty_nodes(&self) -> &FxHashMap<Key, DirtyReason>
Read the HashSet of dirty nodes
sourcepub fn raw_remove(&mut self, node_id: Key)
pub fn raw_remove(&mut self, node_id: Key)
Remove a Node’s result and data
sourcepub fn remove(
&mut self,
node_id: Key,
dom_adapter: &mut impl DOMAdapter<Key>,
invalidate_parent: bool,
)
pub fn remove( &mut self, node_id: Key, dom_adapter: &mut impl DOMAdapter<Key>, invalidate_parent: bool, )
Remove a Node from the layout
sourcepub fn safe_invalidate(
&mut self,
node_id: Key,
dom_adapter: &mut impl DOMAdapter<Key>,
)
pub fn safe_invalidate( &mut self, node_id: Key, dom_adapter: &mut impl DOMAdapter<Key>, )
Safely mark as dirty a Node, with no reason.
sourcepub fn invalidate(&mut self, node_id: Key)
pub fn invalidate(&mut self, node_id: Key)
Mark as dirty a Node, with no reason.
sourcepub fn invalidate_with_reason(&mut self, node_id: Key, reason: DirtyReason)
pub fn invalidate_with_reason(&mut self, node_id: Key, reason: DirtyReason)
Mark as dirty a Node, with a reason.
pub fn check_dirty_dependants( &mut self, node_id: Key, reason: DirtyReason, dom_adapter: &mut impl DOMAdapter<Key>, ignore: bool, )
sourcepub fn get_root_candidate(&self) -> RootNodeCandidate<Key>
pub fn get_root_candidate(&self) -> RootNodeCandidate<Key>
Get the Root Node candidate
sourcepub fn find_best_root(&mut self, dom_adapter: &mut impl DOMAdapter<Key>)
pub fn find_best_root(&mut self, dom_adapter: &mut impl DOMAdapter<Key>)
Find the best root Node from where to start measuring
sourcepub fn measure(
&mut self,
suggested_root_id: Key,
root_area: Area,
measurer: &mut Option<impl LayoutMeasurer<Key>>,
dom_adapter: &mut impl DOMAdapter<Key>,
)
pub fn measure( &mut self, suggested_root_id: Key, root_area: Area, measurer: &mut Option<impl LayoutMeasurer<Key>>, dom_adapter: &mut impl DOMAdapter<Key>, )
Measure dirty Nodes
sourcepub fn get(&self, node_id: Key) -> Option<&LayoutNode>
pub fn get(&self, node_id: Key) -> Option<&LayoutNode>
Get the layout_node of a Node
sourcepub fn cache_node(&mut self, node_id: Key, layout_node: LayoutNode)
pub fn cache_node(&mut self, node_id: Key, layout_node: LayoutNode)
Cache a Node’s layout_node
Trait Implementations§
Auto Trait Implementations§
impl<Key> Freeze for Torin<Key>where
Key: Freeze,
impl<Key> !RefUnwindSafe for Torin<Key>
impl<Key> Send for Torin<Key>where
Key: Send,
impl<Key> Sync for Torin<Key>where
Key: Sync,
impl<Key> Unpin for Torin<Key>where
Key: Unpin,
impl<Key> !UnwindSafe for Torin<Key>
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> 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> Pointable for T
impl<T> Pointable for T
§impl<T, O> SuperFrom<T> for Owhere
O: From<T>,
impl<T, O> SuperFrom<T> for Owhere
O: From<T>,
§fn super_from(input: T) -> O
fn super_from(input: T) -> O
Convert from a type to another type.
§impl<T, O, M> SuperInto<O, M> for Twhere
O: SuperFrom<T, M>,
impl<T, O, M> SuperInto<O, M> for Twhere
O: SuperFrom<T, M>,
§fn super_into(self) -> O
fn super_into(self) -> O
Convert from a type to another type.