30   RedBlackTreeRed,  enumerator
659   Tmp->Color = RedBlackTreeRed;  in OrderedCollectionInsert()
682   while (Tmp != NewRoot && Parent->Color == RedBlackTreeRed) {  in OrderedCollectionInsert()
700       if (Uncle != NULL && Uncle->Color == RedBlackTreeRed) {  in OrderedCollectionInsert()
711         GrandParent->Color = RedBlackTreeRed;  in OrderedCollectionInsert()
769         GrandParent->Color = RedBlackTreeRed;  in OrderedCollectionInsert()
803       if (Uncle != NULL && Uncle->Color == RedBlackTreeRed) {  in OrderedCollectionInsert()
806         GrandParent->Color = RedBlackTreeRed;  in OrderedCollectionInsert()
817         GrandParent->Color = RedBlackTreeRed;  in OrderedCollectionInsert()
1158         if (Sibling->Color == RedBlackTreeRed) {  in OrderedCollectionDelete()
1172           Parent->Color = RedBlackTreeRed;  in OrderedCollectionDelete()
1208           Sibling->Color = RedBlackTreeRed;  in OrderedCollectionDelete()
1239             Sibling->Color = RedBlackTreeRed;  in OrderedCollectionDelete()
1252           ASSERT (RightNephew->Color == RedBlackTreeRed);  in OrderedCollectionDelete()
1296         if (Sibling->Color == RedBlackTreeRed) {  in OrderedCollectionDelete()
1298           Parent->Color = RedBlackTreeRed;  in OrderedCollectionDelete()
1309           Sibling->Color = RedBlackTreeRed;  in OrderedCollectionDelete()
1315             Sibling->Color = RedBlackTreeRed;  in OrderedCollectionDelete()
1321           ASSERT (LeftNephew->Color == RedBlackTreeRed);  in OrderedCollectionDelete()
1371   ASSERT (Node->Color == RedBlackTreeRed || Node->Color == RedBlackTreeBlack);  in RedBlackTreeRecursiveCheck()
1376   if (Node->Color == RedBlackTreeRed) {  in RedBlackTreeRecursiveCheck()