Struct dioxus_core::LazyNodes

pub struct LazyNodes<'a, 'b> { /* fields omitted */ }

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

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

pub fn new_some<F>(_val: F) -> Self where
    F: FnOnce(NodeFactory<'a>) -> VNode<'a> + 'b, 

pub fn new_boxed<F>(_val: F) -> Self where
    F: FnOnce(NodeFactory<'a>) -> VNode<'a> + 'b, 

force this call onto the stack

pub fn new(_val: impl FnOnce(NodeFactory<'a>) -> VNode<'a> + 'b) -> Self

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

Trait Implementations

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

type Item = LazyNodes<'a, 'b>

The type of the elements being iterated over.

type IntoIter = Once<Self::Item>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

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

fn into_vnode(self, cx: NodeFactory<'a>) -> VNode<'a>