[−][src]Struct libjp::resolver::CandidateChain

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

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.

Methods

impl<'a> CandidateChain<'a>[src]

pub fn first(&self) -> NodeId[src]

Returns the first element of this chain.

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

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

Auto Trait Implementations

impl<'a> Send for CandidateChain<'a>

impl<'a> Sync for CandidateChain<'a>

Blanket Implementations

impl<T> From for T[src]

impl<T, U> Into for T where
    U: From<T>, [src]

impl<T, U> TryFrom for T where
    U: Into<T>, [src]

type Error = !

🔬 This is a nightly-only experimental API. (try_from)

The type returned in the event of a conversion error.

impl<T> Borrow for T where
    T: ?Sized, [src]

impl<T> Any for T where
    T: 'static + ?Sized, [src]

impl<T> BorrowMut for T where
    T: ?Sized, [src]

impl<T, U> TryInto for T where
    U: TryFrom<T>, [src]

type Error = <U as TryFrom<T>>::Error

🔬 This is a nightly-only experimental API. (try_from)

The type returned in the event of a conversion error.

impl<T> Same for T

type Output = T

Should always be Self