Searched defs:fCount (Results 1 - 25 of 52) sorted by relevance

123

/external/skia/include/effects/
H A DSkDashPathEffect.h49 int32_t fCount; member in class:SkDashPathEffect
H A DSkTestImageFilters.h92 int fCount; member in class:SkMergeImageFilter
95 // of the filters and modes (unless fCount is so large we can't fit).
H A DSkLayerDrawLooper.h127 int fCount; member in class:SkLayerDrawLooper
/external/skia/src/images/
H A DSkImageRefPool.h37 int fCount; member in class:SkImageRefPool
/external/icu4c/i18n/unicode/
H A Dsortkey.h290 int32_t fCount; member in class:CollationKey
321 count = fCount;
H A Dfmtable.h432 { count=fValue.fArrayAndCount.fCount; return fValue.fArrayAndCount.fArray; }
635 int32_t fCount; member in struct:Formattable::__anon5379::__anon5380
/external/skia/include/core/
H A DSkDeque.h21 bool empty() const { return 0 == fCount; }
22 int count() const { return fCount; }
69 int fCount; member in class:SkDeque
H A DSkPerspIter.h45 int fCount; member in class:SkPerspIter
H A DSkTDStack.h17 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
107 int fCount, fTotalCount; member in class:SkTDStack
[all...]
H A DSkDescriptor.h38 fCount = 0;
55 fCount += 1;
75 int count = fCount;
124 uint32_t getCount() const { return fCount; }
130 uint32_t fCount; member in class:SkDescriptor
/external/icu4c/i18n/
H A Dnfrlist.h36 uint32_t fCount; member in class:NFRuleList
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 >
[all...]
/external/skia/tests/
H A DMetaDataTest.cpp73 int fCount; member in struct:__anon10787
95 REPORTER_ASSERT(reporter, gElems[i].fCount == count);
H A DPackBitsTest.cpp26 int fCount; member in struct:__anon10788
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; member in struct:__anon10789
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/
H A DRunArrays.h218 le_int32 fCount; member in class:RunArray
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/junit/src/org/junit/runner/
H A DResult.java19 private AtomicInteger fCount = new AtomicInteger(); field in class:Result
29 return fCount.get();
81 fCount.getAndIncrement();
/external/skia/src/text/
H A DSkTextLayout.cpp55 int fCount; member in struct:SkTextLayout::GlyphRun
58 SkTextLayout::GlyphRun::GlyphRun() : fLocs(NULL), fGlyphIDs(NULL), fCount(0) {}
/external/skia/include/utils/
H A DSkJSON.h216 int count() const { return fCount; }
266 int fCount; member in class:SkJSON::Array
/external/skia/samplecode/
H A DOverView.cpp63 int fCount; member in class:OverView
74 fCount = count;
90 for (int i = 0; i < fCount; i++) {
H A DSampleAnimatedGradient.cpp20 int fCount; member in struct:GradientView::GradData
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);
H A DSampleGradients.cpp45 int fCount; member in struct:GradData
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/animator/
H A DSkMemberInfo.h32 // if fCount == 0, record is member property
38 int fCount; // for properties, actual type (count is always assumed to be 1) member in struct:SkMemberInfo
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?
/external/skia/src/gpu/
H A DGrAllocator.h36 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);
135 int fCount; member in class:GrAllocator
[all...]
H A DGrTDArray.h27 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;
182 int fAllocated, fCount; member in class:GrTDArray
[all...]
/external/icu4c/tools/genrb/
H A Dreslist.h107 uint32_t fCount; member in struct:SResTable
117 uint32_t fCount; member in struct:SResArray
145 uint32_t fCount; member in struct:SResIntVector
/external/skia/gm/
H A Dgradients.cpp14 int fCount; member in struct:skiagm::GradData
39 data.fCount, tm, mapper);
48 data.fPos, data.fCount, tm, mapper);
57 data.fPos, data.fCount, mapper);
70 data.fColors, data.fPos, data.fCount, tm, mapper);

Completed in 376 milliseconds

123