Lines Matching refs:Child
309 CONST RED_BLACK_TREE_NODE *Child; in OrderedCollectionNext() local
331 Child = Node; 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()
362 CONST RED_BLACK_TREE_NODE *Child; in OrderedCollectionPrev() local
384 Child = Node; 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()
930 RED_BLACK_TREE_NODE *Child; in OrderedCollectionDelete() local
958 Child = (OrigLeftChild != NULL) ? OrigLeftChild : OrigRightChild; in OrderedCollectionDelete()
961 if (Child != NULL) { in OrderedCollectionDelete()
962 Child->Parent = Parent; in OrderedCollectionDelete()
965 NewRoot = Child; in OrderedCollectionDelete()
968 OrigParent->Left = Child; in OrderedCollectionDelete()
970 OrigParent->Right = Child; in OrderedCollectionDelete()
1003 Child = OrigRightChild->Right; in OrderedCollectionDelete()
1022 Child = ToRelink->Right; in OrderedCollectionDelete()
1037 Parent->Left = Child; in OrderedCollectionDelete()
1038 if (Child != NULL) { in OrderedCollectionDelete()
1039 Child->Parent = Parent; in OrderedCollectionDelete()
1137 while (Child != NewRoot && NodeIsNullOrBlack (Child)) { in OrderedCollectionDelete()
1142 if (Child == Parent->Left) { in OrderedCollectionDelete()
1209 Child = Parent; in OrderedCollectionDelete()
1285 Child = NewRoot; in OrderedCollectionDelete()
1310 Child = Parent; in OrderedCollectionDelete()
1328 Child = NewRoot; in OrderedCollectionDelete()
1333 if (Child != NULL) { in OrderedCollectionDelete()
1334 Child->Color = RedBlackTreeBlack; in OrderedCollectionDelete()