Struct freya::prelude::LazyNodes

pub struct LazyNodes<'a, 'b> { /* private fields */ }
Expand description

A concrete type provider for closures that build VNode structures.

This struct wraps lazy structs that build VNode trees Normally, we cannot perform a blanket implementation over closures, but if we wrap the closure in a concrete type, we can use it for different branches in matching.

LazyNodes::new(|f| {
       static TEMPLATE: dioxus::core::Template = dioxus::core::Template {
        name: "main.rs:5:5:20", // Source location of the template for hot reloading
        roots: &[
            dioxus::core::TemplateNode::Element {
                tag: dioxus_elements::div::TAG_NAME,
                namespace: dioxus_elements::div::NAME_SPACE,
                attrs: &[],
                children: &[],
            },
        ],
        node_paths: &[],
        attr_paths: &[],
    };
    dioxus::core::VNode {
        parent: None,
        key: None,
        template: std::cell::Cell::new(TEMPLATE),
        root_ids: dioxus::core::exports::bumpalo::collections::Vec::with_capacity_in(
                1usize,
                f.bump(),
            )
            .into(),
        dynamic_nodes: f.bump().alloc([]),
        dynamic_attrs: f.bump().alloc([]),
    })
}

Find more information about how to construct VNode at https://dioxuslabs.com/learn/0.4/contributing/walkthrough_readme#the-rsx-macro

Implementations§

§

impl<'a, 'b> LazyNodes<'a, 'b>

pub fn new( val: impl FnOnce(&'a ScopeState) -> VNode<'a> + 'b ) -> LazyNodes<'a, 'b>

Create a new LazyNodes closure, optimistically placing it onto the stack.

If the closure cannot fit into the stack allocation (16 bytes), then it is placed on the heap. Most closures will fit into the stack, and is the most optimal way to use the creation function.

pub fn call(self, f: &'a ScopeState) -> VNode<'a>

Call the closure with the given factory to produce real VNode.

let f = LazyNodes::new(/* Closure for creating VNodes */);

let node = f.call(cac);

Trait Implementations§

§

impl<'a, 'b> IntoDynNode<'a, ()> for LazyNodes<'a, 'b>

§

fn into_vnode(self, cx: &'a ScopeState) -> DynamicNode<'a>

Consume this item along with a scopestate and produce a DynamicNode Read more

Auto Trait Implementations§

§

impl<'a, 'b> !RefUnwindSafe for LazyNodes<'a, 'b>

§

impl<'a, 'b> !Send for LazyNodes<'a, 'b>

§

impl<'a, 'b> !Sync for LazyNodes<'a, 'b>

§

impl<'a, 'b> !Unpin for LazyNodes<'a, 'b>

§

impl<'a, 'b> !UnwindSafe for LazyNodes<'a, 'b>

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
§

impl<T> Downcast for Twhere T: Any,

§

fn into_any(self: Box<T, Global>) -> Box<dyn Any, Global>

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, Global>) -> Rc<dyn Any, Global>

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.
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 Twhere 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.

§

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<T> Same<T> for T

§

type Output = T

Should always be Self
§

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

§

fn to<T>(self) -> Twhere 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 Twhere U: Into<T>,

§

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 Twhere U: TryFrom<T>,

§

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 Twhere 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