OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:fCapacity
(Results
1 - 14
of
14
) sorted by null
/external/icu/icu4c/source/tools/genrb/
ustr.h
57
int32_t
fCapacity
;
/external/icu/icu4c/source/i18n/
nfrlist.h
39
uint32_t
fCapacity
;
44
,
fCapacity
(capacity) {}
66
if (fCount ==
fCapacity
) {
67
fCapacity
+= 10;
68
fStuff = (NFRule**)uprv_realloc(fStuff,
fCapacity
* sizeof(NFRule*)); // assume success
73
fCapacity
= 0;
84
fCapacity
= 0;
/external/icu/icu4c/source/i18n/unicode/
sortkey.h
265
return (fFlagAndLength >= 0) ? (int32_t)sizeof(fUnion) : fUnion.fFields.
fCapacity
;
312
int32_t
fCapacity
;
/external/icu/icu4c/source/layoutex/layout/
RunArrays.h
221
le_int32
fCapacity
;
225
: UObject(), fClientArrays(FALSE), fLimits(NULL), fCount(0),
fCapacity
(0)
231
: UObject(), fClientArrays(FALSE), fLimits(NULL), fCount(0),
fCapacity
(0)
237
: UObject(), fClientArrays(TRUE), fLimits(limits), fCount(count),
fCapacity
(count)
/external/skia/include/private/
SkTHash.h
27
SkTHashTable() : fCount(0),
fCapacity
(0) {}
39
size_t approxBytesUsed() const { return
fCapacity
* sizeof(Slot); }
54
if (4 * fCount >= 3 *
fCapacity
) {
55
this->resize(
fCapacity
> 0 ?
fCapacity
* 2 : 4);
63
int index = hash & (
fCapacity
-1);
64
for (int n = 0; n <
fCapacity
; n++) {
74
SkASSERT(
fCapacity
== 0);
83
int index = hash & (
fCapacity
-1);
84
for (int n = 0; n <
fCapacity
; n++)
[
all
...]
/external/skqp/include/private/
SkTHash.h
27
SkTHashTable() : fCount(0),
fCapacity
(0) {}
39
size_t approxBytesUsed() const { return
fCapacity
* sizeof(Slot); }
54
if (4 * fCount >= 3 *
fCapacity
) {
55
this->resize(
fCapacity
> 0 ?
fCapacity
* 2 : 4);
63
int index = hash & (
fCapacity
-1);
64
for (int n = 0; n <
fCapacity
; n++) {
74
SkASSERT(
fCapacity
== 0);
83
int index = hash & (
fCapacity
-1);
84
for (int n = 0; n <
fCapacity
; n++)
[
all
...]
/external/skia/src/core/
SkRWBuffer.cpp
23
const size_t
fCapacity
;
25
SkBufferBlock(size_t capacity) : fNext(nullptr), fUsed(0),
fCapacity
(capacity) {}
29
size_t avail() const { return
fCapacity
- fUsed; }
39
// before spilling into the next, since the reader uses
fCapacity
to know how many it can read.
54
SkASSERT(
fCapacity
> 0);
55
SkASSERT(fUsed <=
fCapacity
);
125
// The reader can only access block.
fCapacity
(which never changes), and cannot access
174
return SkTMin(fBlock->
fCapacity
, fRemaining);
208
// next, since our reader will be using
fCapacity
(min'd against its total available) to know how
SkTDynamicHash.h
25
SkTDynamicHash() : fCount(0), fDeleted(0),
fCapacity
(0), fArray(nullptr) {
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
= 0
[
all
...]
SkWriter32.h
50
fCapacity
= externalBytes;
60
if (totalRequired >
fCapacity
) {
249
size_t
fCapacity
; // Number of bytes we can write to fData.
/external/skqp/src/core/
SkRWBuffer.cpp
23
const size_t
fCapacity
;
25
SkBufferBlock(size_t capacity) : fNext(nullptr), fUsed(0),
fCapacity
(capacity) {}
29
size_t avail() const { return
fCapacity
- fUsed; }
39
// before spilling into the next, since the reader uses
fCapacity
to know how many it can read.
54
SkASSERT(
fCapacity
> 0);
55
SkASSERT(fUsed <=
fCapacity
);
125
// The reader can only access block.
fCapacity
(which never changes), and cannot access
174
return SkTMin(fBlock->
fCapacity
, fRemaining);
208
// next, since our reader will be using
fCapacity
(min'd against its total available) to know how
SkTDynamicHash.h
25
SkTDynamicHash() : fCount(0), fDeleted(0),
fCapacity
(0), fArray(nullptr) {
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
= 0
[
all
...]
SkWriter32.h
50
fCapacity
= externalBytes;
60
if (totalRequired >
fCapacity
) {
249
size_t
fCapacity
; // Number of bytes we can write to fData.
/frameworks/base/core/jni/android/graphics/
CreateJavaOutputStreamAdaptor.cpp
24
,
fCapacity
(capacity)
98
if (size > static_cast<size_t>(
fCapacity
)) {
99
requested =
fCapacity
;
102
//
fCapacity
.
168
const jint
fCapacity
;
219
fCapacity
= env->GetArrayLength(storage);
232
if (size > static_cast<size_t>(
fCapacity
)) {
233
requested =
fCapacity
;
236
//
fCapacity
.
273
jint
fCapacity
;
[
all
...]
/external/icu/icu4c/source/common/unicode/
unistr.h
[
all
...]
Completed in 729 milliseconds