Struct layout_2013::traversal::ComputeStackingRelativePositions

pub struct ComputeStackingRelativePositions<'a> {
    pub layout_context: &'a LayoutContext<'a>,
}

Fields

layout_context: &'a LayoutContext<'a>

Trait Implementations

impl<'a> PreorderFlowTraversal for ComputeStackingRelativePositions<'a>

fn should_process_subtree(&self, flow: &mut dyn Flow) -> bool

Returns true if this node should be processed and false if neither this node nor its descendants should be processed.

fn process(&self, flow: &mut dyn Flow)

The operation to perform. Return true to continue or false to stop.

fn should_process(&self, _flow: &mut dyn Flow) -> bool

Returns true if this node must be processed in-order. If this returns false, we skip the operation for this node, but continue processing the descendants. This is called after parent nodes are visited.

fn traverse(&self, flow: &mut dyn Flow)

Traverses the tree in preorder.

fn traverse_absolute_flows(&self, flow: &mut dyn Flow)

Traverse the Absolute flow tree in preorder.