Struct freya::prelude::Torin

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

Fields§

§results: HashMap<Key, LayoutNode, BuildHasherDefault<FxHasher>>

Layout results of the registered Nodes

§dirty: HashSet<Key, BuildHasherDefault<FxHasher>>

Invalid registered nodes since previous layout measurement

§root_node_candidate: RootNodeCandidate<Key>

Best Root node candidate from where to start measuring

Implementations§

§

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

pub fn new() -> Torin<Key>

Create a new Layout

pub fn size(&self) -> usize

pub fn reset(&mut self)

Reset the layout

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

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: &mut impl DOMAdapter<Key>, invalidate_parent: bool )

Remove a Node from the layout

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

Safely mark as dirty a Node

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

Mark as dirty a Node

pub fn check_dirty_dependants( &mut self, node_id: Key, dom_adapter: &mut 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: &mut impl DOMAdapter<Key>)

Find the best root Node from where to start measuring

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

Measure dirty Nodes

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

Get the layout_node of a Node

pub fn cache_node(&mut self, node_id: Key, layout_node: LayoutNode)

Cache a Node’s layout_node

Trait Implementations§

§

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

§

fn default() -> Torin<Key>

Returns the “default value” for a type. Read more

Auto Trait Implementations§

§

impl<Key> !UnwindSafe for Torin<Key>

Blanket Implementations§

source §

impl<T> Any for T
where T: 'static + ?Sized,

source §

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source §

impl<T> Borrow<T> for T
where T: ?Sized,

source §

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source §

impl<T> BorrowMut<T> for T
where T: ?Sized,

source §

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

§

impl<T> Downcast for T
where T: 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>

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)

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)

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> DowncastSync for T
where T: Any + Send + Sync,

§

fn into_any_arc(self: Arc<T>) -> Arc<dyn Any + Send + Sync>

Convert Arc<Trait> (where Trait: Downcast) to Arc<Any>. Arc<Any> can then be further downcast into Arc<ConcreteType> where ConcreteType implements Trait.

source §