Struct HStack 

pub struct HStack {
    pub spacing: f32,
    /* private fields */
}

A horizontal arrangement of UI nodes with configurable spacing.

Nodes can be reordered and added/removed at any time.

Nodes always appear at their minimum size horizontally, regardless of alignment. Vertical alignment still applies.

Fields

spacing: f32

Implementations

impl HStack

pub fn new() -> Self

pub fn with_child(self, index: TdIndex) -> Self

Add a new child to the stack.

pub fn with_align(self, align: (Alignment, Alignment)) -> Self

Set the horizontal and vertical alignment.

A horizontal alignment of Full will not function as expected, and will have the same appearance as Begin.

pub fn with_spacing(self, spacing: f32) -> Self

Set the spacing between children. Defaults to 0.

No spacing appears before the first child or after the last child.

pub fn add_child(&mut self, index: TdIndex)

Add a child to the stack. The child will appear at the end.

pub fn len(&self) -> usize

Returns the number of children in the stack.

pub fn is_empty(&self) -> bool

Returns true if the stack is empty.

Equivalent to len() == 0.

pub fn remove_child(&mut self, index: usize, tree: &mut UiTree) -> bool

Remove a child from the stack.

Returns true if the child was removed.

pub fn set_child_position(&mut self, index: usize, position: usize) -> bool

Move a child to a new index.

Returns true if the child was moved.

pub fn get_child_index(&self, index: usize) -> Option<TdIndex>

Returns the tree index associated with a child at a given stack index.

Trait Implementations

impl Default for HStack

fn default() -> Self

Returns the “default value” for a type.

impl UiNode for HStack

fn get_align(&self) -> (Alignment, Alignment)

Get the alignment of the node.

fn get_align_mut(&mut self) -> (&mut Alignment, &mut Alignment)

Get a mutable reference to the alignment of the node.

fn calculate_min_size(&self, tree: &UiTree) -> (f32, f32)

Calculate the minimum size of the node.

fn calculate_rects(&self, cache: &NodeCache, tree: &UiTree) -> Vec<Rect>

Recalculate the position and size of child nodes, in the same order and count as get_visible_children.

fn get_children(&self) -> Vec<TdIndex>

Get all children of the node, if applicable.

fn get_visible_children(&self) -> Vec<TdIndex>

Get all visible children of the node, if applicable.