OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:newCap
(Results
1 - 10
of
10
) sorted by null
/external/lzma/CPP/Common/
DynamicBuffer.h
20
size_t
newCap
= this->_capacity + delta;
21
if (
newCap
< delta)
22
newCap
= this->_capacity + size;
23
SetCapacity(
newCap
);
/external/chromium_org/third_party/icu/source/common/
uvectr64.cpp
132
int32_t
newCap
= capacity * 2;
133
if (
newCap
< minimumCapacity) {
134
newCap
= minimumCapacity;
136
if (maxCapacity > 0 &&
newCap
> maxCapacity) {
137
newCap
= maxCapacity;
139
if (
newCap
> (int32_t)(INT32_MAX / sizeof(int64_t))) { // integer overflow check
144
int64_t* newElems = (int64_t *)uprv_realloc(elements, sizeof(int64_t)*
newCap
);
151
capacity =
newCap
;
uvectr32.cpp
214
int32_t
newCap
= capacity * 2;
215
if (
newCap
< minimumCapacity) {
216
newCap
= minimumCapacity;
218
if (maxCapacity > 0 &&
newCap
> maxCapacity) {
219
newCap
= maxCapacity;
221
if (
newCap
> (int32_t)(INT32_MAX / sizeof(int32_t))) { // integer overflow check
226
int32_t* newElems = (int32_t *)uprv_realloc(elements, sizeof(int32_t)*
newCap
);
233
capacity =
newCap
;
uvector.cpp
338
int32_t
newCap
= capacity * 2;
339
if (
newCap
< minimumCapacity) {
340
newCap
= minimumCapacity;
342
if (
newCap
> (int32_t)(INT32_MAX / sizeof(UHashTok))) { // integer overflow check
347
UHashTok* newElems = (UHashTok *)uprv_realloc(elements, sizeof(UHashTok)*
newCap
);
354
capacity =
newCap
;
/external/icu/icu4c/source/common/
uvectr64.cpp
132
int32_t
newCap
= capacity * 2;
133
if (
newCap
< minimumCapacity) {
134
newCap
= minimumCapacity;
136
if (maxCapacity > 0 &&
newCap
> maxCapacity) {
137
newCap
= maxCapacity;
139
if (
newCap
> (int32_t)(INT32_MAX / sizeof(int64_t))) { // integer overflow check
144
int64_t* newElems = (int64_t *)uprv_realloc(elements, sizeof(int64_t)*
newCap
);
151
capacity =
newCap
;
uvectr32.cpp
214
int32_t
newCap
= capacity * 2;
215
if (
newCap
< minimumCapacity) {
216
newCap
= minimumCapacity;
218
if (maxCapacity > 0 &&
newCap
> maxCapacity) {
219
newCap
= maxCapacity;
221
if (
newCap
> (int32_t)(INT32_MAX / sizeof(int32_t))) { // integer overflow check
226
int32_t* newElems = (int32_t *)uprv_realloc(elements, sizeof(int32_t)*
newCap
);
233
capacity =
newCap
;
uvector.cpp
339
int32_t
newCap
= capacity * 2;
340
if (
newCap
< minimumCapacity) {
341
newCap
= minimumCapacity;
343
if (
newCap
> (int32_t)(INT32_MAX / sizeof(UElement))) { // integer overflow check
348
UElement* newElems = (UElement *)uprv_realloc(elements, sizeof(UElement)*
newCap
);
355
capacity =
newCap
;
/libcore/luni/src/main/java/java/util/concurrent/
PriorityBlockingQueue.java
256
int
newCap
= oldCap + ((oldCap < 64) ?
259
if (
newCap
- MAX_ARRAY_SIZE > 0) { // possible overflow
263
newCap
= MAX_ARRAY_SIZE;
265
if (
newCap
> oldCap && queue == array)
266
newArray = new Object[
newCap
];
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/
Antlr.Runtime.Tools.pas
573
newCap
: Integer;
582
newCap
:= 4;
583
while
newCap
< ACapacity do
584
newCap
:=
newCap
shl 1;
585
Rehash(
newCap
);
591
newCap
: Integer;
593
newCap
:= Length(FItems) * 2;
594
if
newCap
= 0 then
595
newCap
:= 4
[
all
...]
/frameworks/base/services/core/java/com/android/server/
ConnectivityService.java
[
all
...]
Completed in 732 milliseconds