Searched refs:Walk (Results 1 – 2 of 2) sorted by relevance
308 RED_BLACK_TREE_NODE *Walk; in OrderedCollectionNext() local319 Walk = Node->Right; in OrderedCollectionNext()320 if (Walk != NULL) { in OrderedCollectionNext()321 while (Walk->Left != NULL) { in OrderedCollectionNext()322 Walk = Walk->Left; in OrderedCollectionNext()324 return Walk; in OrderedCollectionNext()332 Walk = Child->Parent; in OrderedCollectionNext()333 while (Walk != NULL && Child == Walk->Right) { in OrderedCollectionNext()334 Child = Walk; in OrderedCollectionNext()335 Walk = Child->Parent; in OrderedCollectionNext()[all …]
2500 * Walk a string "{ A .. Z }" where A..Z is a space separated list