Struct freya::prelude::Torin

pub struct Torin<Key>
where
    Key: NodeKey,
{
    pub results: HashMap<Key, LayoutNode, FxBuildHasher>,
    pub dirty: HashMap<Key, DirtyReason, FxBuildHasher>,
    pub root_node_candidate: RootNodeCandidate<Key>,
}

Fields§

§results: HashMap<Key, LayoutNode, FxBuildHasher>

Layout results of the registered Nodes

§dirty: HashMap<Key, DirtyReason, FxBuildHasher>

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) -> &HashMap<Key, DirtyReason, FxBuildHasher>

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, with no reason.

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

Mark as dirty a Node, with no reason.

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, )

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> 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> 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 + Sync + Send>

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

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

§

impl<T> Instrument for T

§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided [Span], returning an Instrumented wrapper. Read more
§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> IntoEither for T

source§

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 more
source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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 T
where T: Default,

§

type NoneType = T

§

fn null_value() -> T

The none-equivalent value.
§

impl<T> Pointable for T

§

const ALIGN: usize = _

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
source§

impl<R, P> ReadPrimitive<R> for P
where R: Read + ReadEndian<P>, P: Default,

source§

fn read_from_little_endian(read: &mut R) -> Result<Self, Error>

Read this value from the supplied reader. Same as ReadEndian::read_from_little_endian().
source§

fn read_from_big_endian(read: &mut R) -> Result<Self, Error>

Read this value from the supplied reader. Same as ReadEndian::read_from_big_endian().
source§

fn read_from_native_endian(read: &mut R) -> Result<Self, Error>

Read this value from the supplied reader. Same as ReadEndian::read_from_native_endian().
source§

impl<T> Same for T

source§

type Output = T

Should always be Self
§

impl<T, O> SuperFrom<T> for O
where O: From<T>,

§

fn super_from(input: T) -> O

Convert from a type to another type.
§

impl<T, O, M> SuperInto<O, M> for T
where O: SuperFrom<T, M>,

§

fn super_into(self) -> O

Convert from a type to another type.
§

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

§

fn to<T>(self) -> T
where Self: Into<T>,

Converts to T by calling Into<T>::into.
§

fn try_to<T>(self) -> Result<T, Self::Error>
where Self: TryInto<T>,

Tries to convert to T by calling TryInto<T>::try_into.
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

source§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V

§

impl<T> WithSubscriber for T

§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a [WithDispatch] wrapper. Read more
§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a [WithDispatch] wrapper. Read more
§

impl<T> ErasedDestructor for T
where T: 'static,

§

impl<T> MaybeSendSync for T