Lines Matching refs:fLast
183 Node* fLast; variable
234 fLast = NULL; in GrRedBlackTree()
256 return Iter(fLast, this); in last()
343 fLast = NULL; in reset()
378 fLast = x; in insert()
605 GrAssert(fLast != x); in deleteAtNode()
626 if (x == fLast) { in deleteAtNode()
628 fLast = fRoot; in deleteAtNode()
634 GrAssert(fFirst == fLast && x == fFirst); in deleteAtNode()
636 fLast = NULL; in deleteAtNode()
649 if (fLast == x) { in deleteAtNode()
650 fLast = p; in deleteAtNode()
827 } else if (x == fLast) { in deleteAtNode()
829 fLast = c1; in deleteAtNode()
830 while (NULL != fLast->fChildren[kRight_Child]) { in deleteAtNode()
831 fLast = fLast->fChildren[kRight_Child]; in deleteAtNode()
833 GrAssert(fLast == PredecessorNode(x)); in deleteAtNode()
859 GrAssert(NULL != fLast); in validate()
864 GrAssert(fLast == fRoot); in validate()
871 GrAssert(NULL == fLast); in validate()
888 GrAssert(!fComp(fLast->fItem, n->fItem)); in checkNode()