Lines Matching refs:Walk
308 RED_BLACK_TREE_NODE *Walk; in OrderedCollectionNext() local
319 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()
337 return Walk; in OrderedCollectionNext()
361 RED_BLACK_TREE_NODE *Walk; in OrderedCollectionPrev() local
372 Walk = Node->Left; in OrderedCollectionPrev()
373 if (Walk != NULL) { in OrderedCollectionPrev()
374 while (Walk->Right != NULL) { in OrderedCollectionPrev()
375 Walk = Walk->Right; in OrderedCollectionPrev()
377 return Walk; in OrderedCollectionPrev()
385 Walk = Child->Parent; in OrderedCollectionPrev()
386 while (Walk != NULL && Child == Walk->Left) { in OrderedCollectionPrev()
387 Child = Walk; in OrderedCollectionPrev()
388 Walk = Child->Parent; in OrderedCollectionPrev()
390 return Walk; in OrderedCollectionPrev()