Lines Matching defs:fTypes
53 return fRecords[i].visit<R>(fTypes[i], f);
63 return fRecords[i].mutate<R>(fTypes[i], f);
82 fTypes.realloc(fReserved);
85 fTypes[fCount] = T::kType;
99 fTypes[i] = T::kType;
110 SkASSERT(Existing::kType == fTypes[i]);
113 fTypes[i] = T::kType;
147 // We store the types in a parallel fTypes array, mainly so that they can be tightly packed as
183 // visit() and mutate() work with the parallel fTypes array to do the work of a vtable.
226 // fRecords and fTypes need to be data structures that can append fixed length data, and need to
231 SkAutoTMalloc<Type8> fTypes;
232 // fCount and fReserved measure both fRecords and fTypes, which always grow in lock step.
