Searched defs:fCapacity (Results 1 - 9 of 9) sorted by relevance

/external/icu/icu4c/source/tools/genrb/
H A Dustr.h55 int32_t fCapacity; member in struct:UString
/external/icu/icu4c/source/i18n/
H A Dnfrlist.h37 uint32_t fCapacity; member in class:NFRuleList
42 , fCapacity(capacity) {}
64 if (fCount == fCapacity) {
65 fCapacity += 10;
66 fStuff = (NFRule**)uprv_realloc(fStuff, fCapacity * sizeof(NFRule*)); // assume success
71 fCapacity = 0;
82 fCapacity = 0;
/external/icu/icu4c/source/i18n/unicode/
H A Dsortkey.h263 return (fFlagAndLength >= 0) ? (int32_t)sizeof(fUnion) : fUnion.fFields.fCapacity;
310 int32_t fCapacity; member in struct:CollationKey::StackBufferOrFields::__anon5704
/external/icu/icu4c/source/layoutex/layout/
H A DRunArrays.h219 le_int32 fCapacity; 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)
/external/skia/include/core/
H A DSkWriter32.h49 fCapacity = externalBytes;
65 if (totalRequired > fCapacity) {
242 size_t fCapacity; // Number of bytes we can write to fData. member in class:SkWriter32
/external/skia/src/core/
H A DSkTDynamicHash.h25 SkTDynamicHash() : fCount(0), fDeleted(0), fCapacity(0), fArray(NULL) {
40 SkASSERT(fCurrentIndex <= fHash->fCapacity);
41 return fCurrentIndex == fHash->fCapacity;
67 SkASSERT(fCurrentIndex <= fHash->fCapacity);
68 return fCurrentIndex == fHash->fCapacity;
92 for (int round = 0; round < fCapacity; round++) {
93 SkASSERT(index >= 0 && index < fCapacity);
103 SkASSERT(fCapacity == 0);
124 sk_bzero(fArray, sizeof(T*)* fCapacity);
133 fCapacity
285 int fCapacity; // Number of entries in fArray. Always a power of 2. member in class:SkTDynamicHash
[all...]
H A DSkTHash.h27 SkTHashTable() : fCount(0), fRemoved(0), fCapacity(0) {}
51 if (4 * (fCount+fRemoved) >= 3 * fCapacity) {
52 this->resize(fCapacity > 0 ? fCapacity * 2 : 4);
60 int index = hash & (fCapacity-1);
61 for (int n = 0; n < fCapacity; n++) {
71 SkASSERT(fCapacity == 0);
80 int index = hash & (fCapacity-1);
81 for (int n = 0; n < fCapacity; n++) {
92 SkASSERT(fCapacity
185 int fCount, fRemoved, fCapacity; member in class:SkTHashTable
[all...]
H A DSkRWBuffer.cpp17 size_t fCapacity; member in struct:SkBufferBlock
21 size_t avail() const { return fCapacity - fUsed; }
29 block->fCapacity = capacity;
45 SkASSERT(fCapacity > 0);
46 SkASSERT(fUsed <= fCapacity);
73 head->fBlock.fCapacity = capacity;
/external/icu/icu4c/source/common/unicode/
H A Dunistr.h3392 // sets fArray, fCapacity, and flags
3562 int32_t fCapacity; // capacity of fArray (in UChars) member in struct:UnicodeString::StackBufferOrFields::__anon5595
3660 US_STACKBUF_SIZE : fUnion.fFields.fCapacity;
4327 fUnion.fFields.fCapacity = capacity;

Completed in 184 milliseconds