pub fn push(mut self, mut edge: EdgeNodeHandle<IdRef<'id, Node<K, V>>>)
                    -> PushResult<'a, K, V> {
            let to_insert = edge.as_raw();
            match edge.edge_mut() {
                None => {
                    Done(VacantSearchStack {
                        map: self.map,
                        stack: self.stack,
                        top: to_insert,
                    })
                },
                Some(node) => {
                    self.stack.push(to_insert);
                    Grew(PartialSearchStack {
                        map: self.map,
                        stack: self.stack,
                        next: node as *mut _,
                    })
                },
            }
        }
/// Pushes the requested child of the stack's current top on top of the stack. If the child
/// exists, then a new PartialSearchStack is yielded. Otherwise, a VacantSearchStack is
/// yielded.
Pushes the requested child of the stack's current top on top of the stack. If the child
exists, then a new PartialSearchStack is yielded. Otherwise, a VacantSearchStack is
yielded.
Pushes the requested child of the stack ' s current top on top of the stack . If the child exists then a new PartialSearchStack is yielded . Otherwise a VacantSearchStack is yielded .
pub fn push(mut self, mut edge: EdgeNodeHandle<IdRef<'id, Node<K, V>>>)
                    -> PushResult<'a, K, V> {
            let to_insert = edge.as_raw();
            match edge.edge_mut() {
                None => {
                    Done(VacantSearchStack {
                        map: self.map,
                        stack: self.stack,
                        top: to_insert,
                    })
                },
                Some(node) => {
                    self.stack.push(to_insert);
                    Grew(PartialSearchStack {
                        map: self.map,
                        stack: self.stack,
                        next: node as *mut _,
                    })
                },
            }
        }
pub fn push ( mut self , mut edge : EdgeNodeHandle < IdRef < ' id , Node < K , V > > > ) -> PushResult < ' a , K , V > { let to_insert = edge . as_raw ( ) ; match edge . edge_mut ( ) { None => { Done ( VacantSearchStack { map : self . map , stack : self . stack , top : to_insert , } ) } , Some ( node ) => { self . stack . push ( to_insert ) ; Grew ( PartialSearchStack { map : self . map , stack : self . stack , next : node as * mut _ , } ) } , } }
Pushes the requested child of the stack's current top on top of the stack.
Pushes the requested child of the stack ' s current top on top of the stack .
mut self
edge
EdgeNodeHandle<IdRef<'id, Node<K, V>>>