Struct Stack 

pub struct Stack { /* private fields */ }

Draws its children on top of each other in one cell, each stretched to the size of the largest. Later children are on top.

Implementations

impl Stack

pub fn new() -> Stack

An empty stack.

pub fn child(self, child: impl Widget) -> Self

Adds child after the children added so far.

pub fn children_keyed<T, K, W>( self, items: impl FnMut() -> Vec<T> + 'static, key: impl FnMut(&T) -> K + 'static, view: impl FnMut(&Cx, Memo<T>) -> W + 'static, ) -> Self

where T: Clone + PartialEq + 'static, K: Eq + Hash + 'static, W: Widget,

Adds one child per item, after the children added so far.

items runs in an effect, so the list updates when a signal it read changes. key names each item. view builds the child for a key the first time it appears, and that child is kept while its key stays in the list, even if it moves. view receives the item’s Cx and a Memo that updates when that item’s value changes. When a key leaves the list, its child and everything created in view are freed. If two items share a key, only the first is shown and the duplicate is logged.

pub fn style(self, style: impl IntoProp<Style>) -> Self

Sets the widget’s Style.

Trait Implementations

impl Default for Stack

fn default() -> Self

Returns the “default value” for a type.

impl Widget for Stack

fn into_element(self: Box<Self>) -> Element

Turns the description, and everything inside it, into the element the window builds nodes from. It runs when the window is created or a list item first appears, before the window’s tree is touched and without recording what it reads, so it only describes.