Struct SiblingCache 

pub struct SiblingCache<'tree>(/* private fields */);

The children of each wide node on a walk’s chain, recorded as the walk pushes them, so that Ancestors::siblings_after and Ancestors::siblings_before find a sibling in a flat ERROR without a scan from its start (#1584).

One slot per depth, keyed by the node’s id. A walk descends into a node only after pushing its children, so every wide node on the chain has its slot; a slot left behind by a node the walk has moved past holds another id and is not read. Recording copies what the walk already holds, once per wide node.

Implementations

impl<'tree> SiblingCache<'tree>

pub fn record( &mut self, node: &Node<'tree>, depth: usize, children: impl IntoIterator<Item = Node<'tree>>, )

Records children, in order, as the children of node, which sits at depth in the walk’s chain. A node of no more than a short scan’s children is not recorded.

Trait Implementations

impl<'tree> Debug for SiblingCache<'tree>

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

Formats the value using the given formatter.

impl<'tree> Default for SiblingCache<'tree>

fn default() -> Self

Returns the “default value” for a type.