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>
impl<'a, 'b> LazyNodes<'a, 'b>
pub fn new(
val: impl FnOnce(&'a ScopeState) -> VNode<'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>
pub fn call(self, f: &'a ScopeState) -> VNode<'a>
Trait Implementations§
§impl<'a, 'b> IntoDynNode<'a, ()> for LazyNodes<'a, 'b>
impl<'a, 'b> IntoDynNode<'a, ()> for LazyNodes<'a, 'b>
§fn into_vnode(self, cx: &'a ScopeState) -> DynamicNode<'a>
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> 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> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere T: Any,
§fn into_any(self: Box<T, Global>) -> Box<dyn Any, Global>
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>
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)
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)
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.