Struct nannou::ui::graph::DepthOrder [−][src]
Expand description
Contains Node indices in order of depth, starting with the deepest.
Fields
indices: Vec<NodeIndex<u32>, Global>
The primary Vec storing the DepthOrder’s ordered indices.
Implementations
Construct a new empty 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.
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
Auto Trait Implementations
impl RefUnwindSafe for DepthOrder
impl Send for DepthOrder
impl Sync for DepthOrder
impl Unpin for DepthOrder
impl UnwindSafe for DepthOrder
Blanket Implementations
impl<S, D, Swp, Dwp, T> AdaptInto<D, Swp, Dwp, T> for S where
T: Component + Float,
D: AdaptFrom<S, Swp, Dwp, T>,
Swp: WhitePoint,
Dwp: WhitePoint,
impl<S, D, Swp, Dwp, T> AdaptInto<D, Swp, Dwp, T> for S where
T: Component + Float,
D: AdaptFrom<S, Swp, Dwp, T>,
Swp: WhitePoint,
Dwp: WhitePoint,
Mutably borrows from an owned value. Read more
Convert into T with values clamped to the color defined bounds Read more
Convert into T. The resulting color might be invalid in its color space Read more
Convert into T, returning ok if the color is inside of its defined range,
otherwise an OutOfBounds
error is returned which contains the unclamped color. Read more
pub fn vzip(self) -> V