Struct dioxus::prelude::LazyNodes [−][src]
pub struct LazyNodes<'a, 'b> { /* fields omitted */ }
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 maintain separate implementations of IntoVNode.
ⓘ
LazyNodes::new(|f| f.element("div", [], [], [] None))
Implementations
pub fn new_some<F>(_val: F) -> LazyNodes<'a, 'b> where
F: 'b + FnOnce(NodeFactory<'a>) -> VNode<'a>,
force this call onto the stack
pub fn new<F>(_val: F) -> LazyNodes<'a, 'b> where
F: 'b + FnOnce(NodeFactory<'a>) -> VNode<'a>,
Trait Implementations
type IntoIter = Once<<LazyNodes<'a, 'b> as IntoIterator>::Item>
type IntoIter = Once<<LazyNodes<'a, 'b> as IntoIterator>::Item>
Which kind of iterator are we turning this into?