Lines Matching defs:fLeft
129 : fLeft(left),
131 SkASSERT(fLeft.get());
137 // Try allocating the range inside fLeft's internal gaps.
138 fLeft.reset(fLeft->internalAllocate(outName));
144 if (fLeft->end() + 1 == fRight->first()) {
145 // It closed the gap between fLeft and fRight; merge.
148 *outName = fLeft->appendNames(1 + removedCount);
150 return fLeft.detach();
156 // There is guaranteed to be a gap between fLeft and fRight, and the
158 SkASSERT(fLeft->end() + 1 < fRight->first());
159 *outName = fLeft->appendNames(1);
164 fLeft.reset(fLeft->removeLeftmostContiguousRange(removedCount));
165 if (NULL == fLeft) {
182 GrGLuint name = fLeft->prependNames(count);
183 SkASSERT(fLeft->first() == fFirst - count);
189 if (name < fLeft->end()) {
190 fLeft.reset(fLeft->free(name));
191 if (NULL == fLeft) {
192 // fLeft became empty after the free.
201 return fLeft.detach();
212 if (fLeft->height() > fRight->height() + 1) {
213 return this->rebalanceImpl<&SparseNameTree::fLeft, &SparseNameTree::fRight>();
215 if (fRight->height() > fLeft->height() + 1) {
216 return this->rebalanceImpl<&SparseNameTree::fRight, &SparseNameTree::fLeft>();
260 SkASSERT(fLeft->end() < fRight->first()); // There must be a gap between left and right.
261 fFirst = fLeft->first();
263 fHeight = 1 + SkMax32(fLeft->height(), fRight->height());
266 SkAutoTUnref<SparseNameRange> fLeft;
