Lines Matching refs:walk
365 /// walk recursively from start until stop. You can always return
721 /// Walk tree with depth-first-search and fill nodes buffer.
944 /// Walk the entire tree and make a node name to nodes mapping.
1065 /// No new nodes should be created in tree during the walk. A small buffer
1433 /// Walk tree with depth-first-search and fill nodes buffer.
1952 /// As we walk down the nodes, we must track parent nodes so we know
2057 /// Navigates to the next node found during a depth-first walk of root.
2092 /// Walk upwards looking for a node with more children to walk.
2207 // walk rest and decrement their child indexes
3326 // walk nodes looking for start
3337 // now walk until we see stop, filling string buffer with text
4945 // walk backwards until you find a non-UP, non-DOWN node
