| /external/chromium/third_party/icu/public/i18n/unicode/ |
| choicfmt.h | 679 * Each ChoiceFormat divides the range -Inf..+Inf into fCount
685 * fCount-2: fChoiceLimits[fCount-2]..fChoiceLimits[fCount-1]
686 * fCount-1: fChoiceLimits[fCount-1]..+Inf
718 int32_t fCount;
|
| sortkey.h | 285 int32_t fCount;
316 count = fCount;
|
| fmtable.h | 412 { count=fValue.fArrayAndCount.fCount; return fValue.fArrayAndCount.fArray; }
555 int32_t fCount;
|
| /external/icu4c/i18n/unicode/ |
| choicfmt.h | 682 * Each ChoiceFormat divides the range -Inf..+Inf into fCount
688 * fCount-2: fChoiceLimits[fCount-2]..fChoiceLimits[fCount-1]
689 * fCount-1: fChoiceLimits[fCount-1]..+Inf
721 int32_t fCount;
|
| sortkey.h | 285 int32_t fCount;
316 count = fCount;
|
| fmtable.h | 432 { count=fValue.fArrayAndCount.fCount; return fValue.fArrayAndCount.fArray; }
636 int32_t fCount;
|
| /external/skia/include/effects/ |
| SkDashPathEffect.h | 52 int32_t fCount;
|
| SkLayerDrawLooper.h | 51 int fCount;
|
| /external/skia/src/images/ |
| SkImageRefPool.h | 30 int fCount;
|
| SkImageDecoder_libpvjpeg.cpp | 45 MyObserver() : fCount(0) {}
47 if (fCount != 0) {
48 SkDebugf("--- pvjpeg left %d allocations\n", fCount);
53 ++fCount;
56 SkDebugf("--- pvjpeg alloc [%d] %d addr=%p\n", fCount, buffersize, buffer);
60 SkDebugf("--- pvjpeg free [%d] addr=%p\n", fCount, buffer);
61 --fCount;
66 int fCount;
|
| /external/chromium/third_party/icu/source/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...] |
| digitlst.h | 105 * you hit the decimal point, you set myDigitList.fDecimalAt = myDigitList.fCount;
207 * is > fCount, then trailing zeros between the fDigits[fCount-1] and the
216 * unlimited magnitude. The fCount value contains the number of significant
219 * Zero is represented by any DigitList with fCount == 0 or with each fDigits[i]
220 * for all i <= fCount == '0'.
223 int32_t fCount;
251 if (fCount < MAX_DIGITS)
252 fDigits[fCount++] = digit;
|
| /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 | 28 bool empty() const { return 0 == fCount; }
29 int count() const { return fCount; }
69 int fCount;
|
| SkPerspIter.h | 52 int fCount;
|
| SkTDStack.h | 24 SkTDStack() : fCount(0), fTotalCount(0)
29 // fCount = kSlotCount;
48 SkASSERT(fCount <= kSlotCount);
49 if (fCount == kSlotCount)
54 fCount = 0;
57 return &fRec->fSlots[fCount++];
62 SkASSERT(fRec && fCount > idx);
63 return fRec->fSlots[fCount - idx - 1];
67 SkASSERT(fRec && fCount > idx);
68 return fRec->fSlots[fCount - idx - 1]
[all...] |
| SkDescriptor.h | 45 fCount = 0;
62 fCount += 1;
82 int count = fCount;
130 uint32_t getCount() const { return fCount; }
136 uint32_t fCount;
|
| SkString.h | 157 int count() const { return fCount; }
163 int fCount;
|
| /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/gm/ |
| gradients.cpp | 7 int fCount;
32 data.fCount, tm, mapper);
41 data.fPos, data.fCount, tm, mapper);
50 data.fPos, data.fCount, mapper);
|
| /external/skia/tests/ |
| PackBitsTest.cpp | 19 int fCount;
30 gTests[i].fCount, dst);
33 bool match = gTests[i].fCount == srcCount && memcmp(gTests[i].fSrc, src,
34 gTests[i].fCount * sizeof(uint16_t)) == 0;
69 int fCount;
80 size_t maxSize = SkPackBits::ComputeMaxSize8(gTests[i].fCount);
82 gTests[i].fCount, dst);
86 bool match = gTests[i].fCount == srcCount &&
88 gTests[i].fCount * sizeof(uint8_t)) == 0;
|
| /external/chromium/third_party/icu/source/tools/genrb/ |
| reslist.h | 41 int32_t fCount;
78 uint32_t fCount;
88 uint32_t fCount;
107 uint32_t fCount;
|
| /external/skia/bench/ |
| TextBench.cpp | 21 int fCount;
38 fCount = fPaint.getTextWidths(fText.c_str(), fText.size(), widths);
39 fPos = new SkPoint[fCount];
41 for (int i = 0; i < fCount; i++) {
46 fCount = 0;
|
| /external/skia/src/animator/ |
| SkMemberInfo.h | 40 // if fCount == 0, record is member property
46 int fCount; // for properties, actual type (count is always assumed to be 1)
51 signed char fCount;
55 return (SkDisplayTypes) fCount; // hack, but worth it?
64 fType == SkType_MemberFunction ? 1 : fCount;
71 fType == SkType_MemberFunction ? (SkDisplayTypes) fCount : (SkDisplayTypes) fType;
86 return (SkDisplayTypes) fCount; // hack, but worth it?
|
| SkTDArray_Experimental.h | 61 bool isEmpty() const { return fCount == 0; }
62 int count() const { return fCount; }
66 SkASSERT(index + count <= fCount);
67 fCount = SkToU16(fCount - count);
68 memmove(fArray + index, fArray + index + count, sizeof(int32_t) * (fCount - index));
80 fReserve = fCount = 0;
84 SkASSERT(fReserve == 0 && fCount == 0);
91 this->growBy(count - fCount);
93 fCount = SkToU16(count)
[all...] |
