Struct CandidateChain

pub struct CandidateChain<'a> { /* private fields */ }

A sequence of nodes that might come next in the file.

While interactively resolving the order of a file, there could be several choices for the next node (let’s call these candidates). Moreover, each candidate might have a sequence of nodes that naturally (but don’t necessarily) come after it. This candidate, plus the sequence of nodes that follow it, make up a CandidateChain.

For example, suppose we have a graggle like this:

   -> B -> C -> D
 /               \
A                 -> H
 \               /
   -> E -> F -> G

If A has already been chosen then B would be the head of a candidate chain containing B, C, and D.

Implementations

impl<'a> CandidateChain<'a>

pub fn first(&self) -> NodeId

Returns the first element of this chain.

pub fn iter(&self) -> impl Iterator<Item = NodeId> + 'a

Returns an iterator over all elements of this chain (including the first).