Struct conrod_core::graph::depth_order::DepthOrder

[+] Show declaration

pub struct DepthOrder {
    pub indices: Vec<Id>,
    // some fields omitted
}

[−] Expand description

Contains Node indices in order of depth, starting with the deepest.

Fields

indices: Vec<Id>

[−] Expand description

The primary Vec storing the DepthOrder's ordered indices.

Implementations

impl DepthOrder[−]

pub fn new() -> DepthOrder[−]

Construct a new empty DepthOrder.

pub fn with_node_capacity(n_nodes: usize) -> DepthOrder[−]

Construct a new empty DepthOrder.

There can be at most two indices per widget (the widget and the widget's scrollbar). Thus we'll reserve double the number of nodes given.

pub fn update(
    &mut self,
    graph: &Graph,
    root: Id,
    updated_widgets: &FnvHashSet<Id>
)[−]

Update the DepthOrder (starting with the deepest) for all nodes in the given Graph.

FIXME: This likely needs to be re-written, and will probably fail for graphs with many floating widgets instantiated upon other floating widgets.

The proper algorithm should be a full toposort where the neighbours of each node are visited in the order specified within visit_by_depth.

The visit_by_depth algorithm should not be recursive and instead use either looping, walking or iteration.

Trait Implementations

impl Debug for DepthOrder[+]

[+] Show hidden undocumented items

fn fmt(&self, f: &mut Formatter<'_>) -> Result[−]

Formats the value using the given formatter.