pub fn node_iter(&self) -> NodeIter {
        match self.inner {
            Some(inner) => unsafe {
                let rev = inner.as_ref().rev;
                let node = inner.as_ref().first;
                NodeIter::new(inner.as_ref().n_nodes, rev, node)
            },
            None => NodeIter::default(),
        }
    }
/// Returns a front-to-back node iterator.
///
/// The iterator will traverse all nodes according the `Route`'s traversal direction. The node iterator
/// will always start with the `Route`'s depot and end at the final [`NodeKind::Request`] node.
Returns a front-to-back node iterator.
The iterator will traverse all nodes according the `Route`'s traversal direction. The node iterator
will always start with the `Route`'s depot and end at the final [`NodeKind::Request`] node.
Returns a front - to - back node iterator . The iterator will traverse all nodes according the ` Route ` ' s traversal direction . The node iterator will always start with the ` Route ` ' s depot and end at the final [ ` NodeKind :: Request ` ] node .
pub fn node_iter(&self) -> NodeIter {
        match self.inner {
            Some(inner) => unsafe {
                let rev = inner.as_ref().rev;
                let node = inner.as_ref().first;
                NodeIter::new(inner.as_ref().n_nodes, rev, node)
            },
            None => NodeIter::default(),
        }
    }
pub fn node_iter ( & self ) -> NodeIter { match self . inner { Some ( inner ) => unsafe { let rev = inner . as_ref ( ) . rev ; let node = inner . as_ref ( ) . first ; NodeIter :: new ( inner . as_ref ( ) . n_nodes , rev , node ) } , None => NodeIter :: default ( ) , } }
Returns a front-to-back node iterator.
Returns a front - to - back node iterator .
&self