Struct freya::prelude::Torin

pub struct Torin<Key>where
    Key: NodeKey,{
    pub results: HashMap<Key, NodeAreas, BuildHasherDefault<FxHasher>>,
    pub dirty: HashSet<Key, RandomState>,
    pub root_node_candidate: RootNodeCandidate<Key>,
}

Fields

results: HashMap<Key, NodeAreas, BuildHasherDefault<FxHasher>>

Layout results of the registered Nodes

dirty: HashSet<Key, RandomState>

Invalid registered nodes since previous layout measurement

root_node_candidate: RootNodeCandidate<Key>

Best Root node candidate from where to start measuring

Implementations

impl Torin<EntityId>

pub fn apply_mutations( &mut self, mutations: &Mutations<'_>, dioxus_integration_state: &DioxusState, dom_adapter: &impl DOMAdapter<EntityId> )

impl<Key> Torin<Key>where Key: NodeKey,

pub fn new() -> Torin<Key>

Create a new Layout

pub fn reset(&mut self)

Reset the layout

pub fn get_dirty_nodes(&self) -> &HashSet<Key, RandomState>

Read the HashSet of dirty nodes

pub fn raw_remove(&mut self, node_id: Key)

Remove a Node’s result and data

pub fn remove( &mut self, node_id: Key, dom_adapter: &impl DOMAdapter<Key>, invalidate_parent: bool )

Remove a Node from the layout

pub fn invalidate(&mut self, node_id: Key)

Mark as dirty a Node

pub fn safe_invalidate( &mut self, node_id: Key, dom_adapter: &impl DOMAdapter<Key> )

pub fn check_dirty_dependants( &mut self, node_id: Key, dom_adapter: &impl DOMAdapter<Key>, ignore: bool )

pub fn get_root_candidate(&self) -> RootNodeCandidate<Key>

Get the Root Node candidate

pub fn find_best_root(&mut self, dom_adapter: &impl DOMAdapter<Key>)

Find the best root Node from where to start measuring

pub fn measure( &mut self, suggested_root_id: Key, suggested_root_area: Rect<f32, Measure>, measurer: &mut Option<impl LayoutMeasurer<Key>>, dom_adapter: &impl DOMAdapter<Key> )

Measure dirty Nodes

pub fn get(&self, node_id: Key) -> Option<&NodeAreas>

Get the areas of a Node

pub fn cache_node(&mut self, node_id: Key, areas: NodeAreas)

Cache a Node’s areas

Trait Implementations

impl<Key> Default for Torin<Key>where Key: NodeKey,

fn default() -> Torin<Key>

Returns the “default value” for a type.