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

1234

/external/dng_sdk/source/
H A Ddng_mosaic_info.cpp48 uint32 fCount; member in class:dng_bilinear_kernel
60 : fCount (0)
91 for (uint32 j = 0; j < fCount; j++)
107 DNG_ASSERT (fCount < kMaxCount, "Too many kernel entries")
109 fDelta [fCount] = delta;
110 fWeight32 [fCount] = weight;
112 fCount++;
129 for (j = 0; j < fCount; j++)
157 for (j = 1; j < fCount; j++)
193 for (j = 0; j < fCount;
[all...]
H A Ddng_string_list.h31 uint32 fCount; member in class:dng_string_list
45 return fCount;
H A Ddng_matrix.h163 uint32 fCount; member in class:dng_vector
185 return fCount;
207 return fCount == 0;
H A Ddng_preview.h217 uint32 fCount; member in class:dng_preview_list
229 return fCount;
H A Ddng_misc_opcodes.h164 uint32 fCount; member in class:dng_opcode_MapTable
/external/skia/include/effects/
H A DSkDashPathEffect.h64 int32_t fCount; member in class:SkDashPathEffect
/external/skia/include/private/
H A DSkSemaphore.h23 if (sk_atomic_fetch_add(&fCount, 1, sk_memory_order_release) < 0) {
37 if (sk_atomic_fetch_sub(&fCount, 1, sk_memory_order_acquire) <= 0) {
57 int fCount; member in struct:SkBaseSemaphore
/external/skia/include/core/
H A DSkColorTable.h34 int count() const { return fCount; }
40 SkASSERT(fColors != NULL && (unsigned)index < (unsigned)fCount);
66 int fCount; member in class:SkColorTable
73 if (count < 0 || count > fCount) {
78 fCount = count; // update fCount, in case count is smaller
H A DSkDeque.h36 bool empty() const { return 0 == fCount; }
37 int count() const { return fCount; }
125 int fCount; // number of elements in the deque member in class:SkDeque
H A DSkDataTable.h26 bool isEmpty() const { return 0 == fCount; }
31 int count() const { return fCount; }
100 int fCount; member in class:SkDataTable
/external/skia/include/ports/
H A DSkRemotableFontMgr.h40 int count() const { return fCount; }
46 SkRemotableFontIdentitySet() : fCount(0), fData() { }
50 int fCount; member in class:SkRemotableFontIdentitySet
/external/skia/src/core/
H A DSkMipMap.h46 int fCount; member in class:SkMipMap
H A DSkPerspIter.h45 int fCount; member in class:SkPerspIter
H A DSkVertState.h31 fCount = indexCount;
33 fCount = vCount;
46 int fCount; member in struct:VertState
H A DSkBigPicture.h27 SnapshotArray(const SkPicture* pics[], int count) : fPics(pics), fCount(count) {}
28 ~SnapshotArray() { for (int i = 0; i < fCount; i++) { fPics[i]->unref(); } }
31 int count() const { return fCount; }
34 int fCount; member in class:final::SnapshotArray
H A DSkRTree.h51 int getDepth() const { return fCount ? fRoot.fSubtree->fLevel + 1 : 0; }
53 int getCount() const { return fCount; }
90 int fCount; member in class:SkRTree
H A DSkTMultiMap.h31 SkTMultiMap() : fCount(0) {}
34 SkASSERT(fCount == 0);
53 ++fCount;
80 --fCount;
103 int count() const { return fCount; }
120 int fCount; member in class:SkTMultiMap
/external/icu/icu4c/source/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.cpp74 int fCount; member in struct:__anon16266
96 REPORTER_ASSERT(reporter, gElems[i].fCount == count);
H A DPackBitsTest.cpp27 int fCount; member in struct:__anon16274
38 size_t maxSize = SkPackBits::ComputeMaxSize8(gTests[i].fCount);
40 gTests[i].fCount, dst, maxSize - 1);
43 gTests[i].fCount, dst, sizeof(dst));
46 int srcCount = SkPackBits::Unpack8(dst, dstSize, src, gTests[i].fCount - 1);
49 bool match = gTests[i].fCount == srcCount &&
51 gTests[i].fCount * sizeof(uint8_t)) == 0;
/external/icu/icu4c/source/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/gm/
H A DgradientDirtyLaundry.cpp14 int fCount; member in struct:GradData
39 return SkGradientShader::CreateLinear(pts, data.fColors, data.fPos, data.fCount, tm);
47 data.fPos, data.fCount, tm);
54 return SkGradientShader::CreateSweep(center.fX, center.fY, data.fColors, data.fPos, data.fCount);
/external/skia/src/animator/
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...]
/external/skia/src/gpu/gl/
H A DGrGLVertexArray.cpp12 GrGLint fCount; member in struct:AttribLayout
62 layout.fCount,
71 layout.fCount,

Completed in 448 milliseconds

1234