Struct LayoutTree 

pub struct LayoutTree { /* private fields */ }

LayoutTree that manages the flexbox algorithm and some additional details, like the roots of the layout tree.

Implementations

impl LayoutTree

pub fn new() -> LayoutTree

Returns a new layout tree.

pub fn flexbox(&self) -> &Flexbox

Returns a reference to the underlying flexbox implementation.

pub fn flexbox_mut(&mut self) -> &mut Flexbox

Returns a mutable reference to the underlying flexbox implementation.

pub fn roots(&self) -> &[Node]

Returns a reference to the roots of the layout tree.

pub fn roots_mut(&mut self) -> &mut Vec<Node>

Returns a mutable reference to the roots of the layout tree.

pub fn add_child(&mut self, parent: Node, child: Node)

Adds a child node to a parent node within the layout tree. It also keeps track of the parent by itself, so that we don’t need to remember which parent the child belongs to when we want to remove it.

pub fn remove(&mut self, node: Node)

Removes the given node from the layout tree. Note that the layout tree internally stores a reference to the parent node of every child node, so we don’t have to pass that to this function.

pub fn recompute_roots(&mut self)

Recomputes the layout of all roots of the layout tree.