Lines Matching refs:fLast
174 Node* fLast;
225 fLast = NULL;
247 return Iter(fLast, this);
334 fLast = NULL;
369 fLast = x;
596 SkASSERT(fLast != x);
617 if (x == fLast) {
619 fLast = fRoot;
625 SkASSERT(fFirst == fLast && x == fFirst);
627 fLast = NULL;
640 if (fLast == x) {
641 fLast = p;
818 } else if (x == fLast) {
820 fLast = c1;
821 while (NULL != fLast->fChildren[kRight_Child]) {
822 fLast = fLast->fChildren[kRight_Child];
824 SkASSERT(fLast == PredecessorNode(x));
850 SkASSERT(NULL != fLast);
855 SkASSERT(fLast == fRoot);
862 SkASSERT(NULL == fLast);
879 SkASSERT(!fComp(fLast->fItem, n->fItem));
