HomeSort by relevance Sort by last modified time
    Searched defs:fCount (Results 1 - 25 of 56) sorted by null

1 2 3

  /external/icu4c/i18n/unicode/
sortkey.h 290 int32_t fCount;
321 count = fCount;
fmtable.h 432 { count=fValue.fArrayAndCount.fCount; return fValue.fArrayAndCount.fArray; }
635 int32_t fCount;
  /external/skia/include/effects/
SkDashPathEffect.h 49 int32_t fCount;
SkTestImageFilters.h 92 int fCount;
95 // of the filters and modes (unless fCount is so large we can't fit).
SkLayerDrawLooper.h 127 int fCount;
  /external/skia/src/images/
SkImageRefPool.h 37 int fCount;
  /external/icu4c/i18n/
nfrlist.h 36 uint32_t fCount;
41 , fCount(0)
45 for(uint32_t i = 0; i < fCount; ++i) {
57 fCount -= 1;
58 for (uint32_t i = index; i < fCount; ++i) { // assumes small arrays
64 if (fCount == fCapacity) {
69 fStuff[fCount++] = thing;
72 fCount = 0;
75 uint32_t size() const { return fCount; }
76 NFRule* last() const { return (fCount > 0 && fStuff != NULL) ? fStuff[fCount-1] : NULL;
    [all...]
  /external/skia/include/core/
SkDeque.h 21 bool empty() const { return 0 == fCount; }
22 int count() const { return fCount; }
69 int fCount;
SkPerspIter.h 45 int fCount;
SkTDStack.h 17 SkTDStack() : fCount(0), fTotalCount(0) {
21 // fCount = kSlotCount;
38 SkASSERT(fCount <= kSlotCount);
39 if (fCount == kSlotCount) {
43 fCount = 0;
46 return &fRec->fSlots[fCount++];
52 SkASSERT(fRec && fCount > idx);
53 return fRec->fSlots[fCount - idx - 1];
57 SkASSERT(fRec && fCount > idx);
58 return fRec->fSlots[fCount - idx - 1]
    [all...]
SkDescriptor.h 38 fCount = 0;
55 fCount += 1;
75 int count = fCount;
124 uint32_t getCount() const { return fCount; }
130 uint32_t fCount;
SkTArray.h 21 memcpy(self->fMemArray, array, self->fCount * sizeof(T));
25 memcpy(newMemArray, self->fMemArray, self->fCount * sizeof(T));
30 for (int i = 0; i < self->fCount; ++i) {
36 for (int i = 0; i < self->fCount; ++i) {
55 fCount = 0;
74 this->init(array.fItemArray, array.fCount, NULL, 0);
90 for (int i = 0; i < fCount; ++i) {
93 fCount = 0;
95 fCount = array.count();
101 for (int i = 0; i < fCount; ++i)
    [all...]
  /external/junit/src/org/junit/runner/
Result.java 19 private AtomicInteger fCount = new AtomicInteger();
29 return fCount.get();
81 fCount.getAndIncrement();
  /external/skia/tests/
MetaDataTest.cpp 73 int fCount;
95 REPORTER_ASSERT(reporter, gElems[i].fCount == count);
PackBitsTest.cpp 26 int fCount;
37 gTests[i].fCount, dst);
40 bool match = gTests[i].fCount == srcCount && memcmp(gTests[i].fSrc, src,
41 gTests[i].fCount * sizeof(uint16_t)) == 0;
76 int fCount;
87 size_t maxSize = SkPackBits::ComputeMaxSize8(gTests[i].fCount);
89 gTests[i].fCount, dst);
93 bool match = gTests[i].fCount == srcCount &&
95 gTests[i].fCount * sizeof(uint8_t)) == 0;
  /external/icu4c/layoutex/layout/
RunArrays.h 218 le_int32 fCount;
223 : UObject(), fClientArrays(FALSE), fLimits(NULL), fCount(0), fCapacity(0)
229 : UObject(), fClientArrays(FALSE), fLimits(NULL), fCount(0), fCapacity(0)
235 : UObject(), fClientArrays(TRUE), fLimits(limits), fCount(count), fCapacity(count)
242 return fCount;
247 fCount = 0;
252 if (run < 0 || run >= fCount) {
261 return getLimit(fCount - 1);
  /external/skia/samplecode/
OverView.cpp 63 int fCount;
74 fCount = count;
90 for (int i = 0; i < fCount; i++) {
SampleAnimatedGradient.cpp 20 int fCount;
58 pts, data.fColors, data.fPos,data.fCount,
67 s, 100, data.fColors, data.fPos, data.fCount,
74 p, 0, q, 100, data.fColors, data.fPos, data.fCount,
81 100, 100, data.fColors, data.fPos, data.fCount);
SampleGradients.cpp 45 int fCount;
70 data.fCount, tm, mapper);
79 data.fPos, data.fCount, tm, mapper);
88 data.fPos, data.fCount, mapper);
101 data.fColors, data.fPos, data.fCount, tm, mapper);
112 data.fColors, data.fPos, data.fCount, tm, mapper);
  /external/skia/src/text/
SkTextLayout.cpp 55 int fCount;
58 SkTextLayout::GlyphRun::GlyphRun() : fLocs(NULL), fGlyphIDs(NULL), fCount(0) {}
  /external/skia/include/utils/
SkJSON.h 216 int count() const { return fCount; }
266 int fCount;
  /external/skia/src/animator/
SkMemberInfo.h 32 // if fCount == 0, record is member property
38 int fCount; // for properties, actual type (count is always assumed to be 1)
43 signed char fCount;
47 return (SkDisplayTypes) fCount; // hack, but worth it?
56 fType == SkType_MemberFunction ? 1 : fCount;
63 fType == SkType_MemberFunction ? (SkDisplayTypes) fCount : (SkDisplayTypes) fType;
78 return (SkDisplayTypes) fCount; // hack, but worth it?
SkTDArray_Experimental.h 53 bool isEmpty() const { return fCount == 0; }
54 int count() const { return fCount; }
58 SkASSERT(index + count <= fCount);
59 fCount = SkToU16(fCount - count);
60 memmove(fArray + index, fArray + index + count, sizeof(int32_t) * (fCount - index));
72 fReserve = fCount = 0;
76 SkASSERT(fReserve == 0 && fCount == 0);
83 this->growBy(count - fCount);
85 fCount = SkToU16(count)
    [all...]
  /external/skia/src/gpu/
GrAllocator.h 36 fCount(0) {
49 int indexInBlock = fCount % fItemsPerBlock;
52 if (0 != fCount) {
58 void* ret = (char*)fBlocks[fCount/fItemsPerBlock] +
60 ++fCount;
69 GrUIDivRoundUp(fCount, fItemsPerBlock));
78 fCount = 0;
85 return fCount;
91 bool empty() const { return fCount == 0; }
97 GrAssert(fCount);
    [all...]
GrTDArray.h 27 GrTDArray() : fArray(NULL), fAllocated(0), fCount(0) {}
29 fCount = fAllocated = src.fCount;
31 memcpy(fArray, src.fArray, fCount * sizeof(T));
39 bool isEmpty() const { return 0 == fCount; }
40 int count() const { return fCount; }
43 GrAssert((unsigned)index < (unsigned)fCount);
47 GrAssert((unsigned)index < (unsigned)fCount);
55 if (fAllocated < src.fCount) {
56 fAllocated = src.fCount;
    [all...]

Completed in 483 milliseconds

1 2 3