Struct OverDepthSiblingIdxData

pub struct OverDepthSiblingIdxData;

Yields (depth, sibling_idx, data) tuple of the nodes; where data might be data and data_mut.

The depth is relative to the root of the traversal, rather than the root of the tree. In other words, the depth of the node that the traversal is initiated from will be 0; and depth of its descendants will be evaluated relative to this.

Sibling indices of all nodes except for the root of the traversal are naturally equal to the sibling indices of the nodes in the tree.

However, sibling index of the root will be 0. This is because the root is the only sibling in the subtree that the traversal considers.

Trait Implementations

impl Over for OverDepthSiblingIdxData

type Enumeration = DepthSiblingIdxVal

Enumeration of the traversal, which might be only the node item; or it might include one or both of the depth and sibling index.

type NodeItem<'a, V, M, P> = &'a <V as Variant>::Item where M: MemoryPolicy, P: PinnedStorage, V: TreeVariant + 'a, Self: 'a

Part of the iterator item which only depends on the node’s internal data.

type IntoOverData = OverDepthSiblingIdxData

Transformed version of the over item where it yields data rather than Node.

type IntoOverNode = OverDepthSiblingIdxNode

Transformed version of the over item where it yields Node rather than data.

type IntoWithDepth = OverDepthSiblingIdxData

Transformed version of the over item where it yields

type IntoWithSiblingIdx = OverDepthSiblingIdxData

Transformed version of the over item where it yields

impl OverMut for OverDepthSiblingIdxData

type NodeItemMut<'a, V, M, P> = &'a mut <V as Variant>::Item where M: MemoryPolicy, P: PinnedStorage, V: TreeVariant + 'a, Self: 'a

Part of the mutable iterator item which only depends on the node’s internal data.