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