Lines Matching full:ffirst
175 Node* fFirst;
226 fFirst = NULL;
239 return Iter(fFirst, this);
335 fFirst = NULL;
374 fFirst = x;
597 GrAssert(fFirst != x);
622 } else if (x == fFirst) {
624 fFirst = fRoot;
627 GrAssert(fFirst == fLast && x == fFirst);
628 fFirst = NULL;
645 } else if (fFirst == x) {
646 fFirst = p;
813 if (x == fFirst) {
815 fFirst = c1;
816 while (NULL != fFirst->fChildren[kLeft_Child]) {
817 fFirst = fFirst->fChildren[kLeft_Child];
819 GrAssert(fFirst == SuccessorNode(x));
851 GrAssert(NULL != fFirst);
856 GrAssert(fFirst == fRoot);
863 GrAssert(NULL == fFirst);
880 GrAssert(!fComp(n->fItem, fFirst->fItem));
