Struct gearley::forest::Traversal [−] [src]

pub struct Traversal<'a, 'f, 'g, T, V, O> where 'a: 'f, 'g: 'f, T: 'f + Copy, V: 'a {
    // some fields omitted
}

Methods

impl<'a, 'f, 'g, T, V, O> Traversal<'a, 'f, 'g, T, V, O> where O: Order<'a, 'f, T, V>, T: Copy

fn new(bocage: &'f Bocage<'a, 'f, 'g, T, V>, order: O) -> Self

fn traverse(&mut self, root: NodeRef<'a, 'f, T, V>)

fn traverse_deps<'t>(&'t mut self) -> Option<TraverseDeps<'a, 't, 'f, T, V>>

fn traverse_sum<'t>(&'t mut self) -> TraverseSum<'a, 't, 'f, 'g, T, V>

fn finish(&mut self, root: NodeRef<'a, 'f, T, V>) -> &'a [V]