Searched defs:newCapacity (Results 1 - 25 of 37) sorted by relevance

12

/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/
H A DIntArrayList.java89 public void ensureCapacity(int newCapacity) { argument
93 elements = new int[newCapacity];
/external/chromium_org/third_party/WebKit/Source/core/xml/
H A DXPathNodeSet.h46 void reserveCapacity(size_t newCapacity) { m_nodes.reserveCapacity(newCapacity); } argument
/external/lzma/CPP/Common/
H A DBuffer.h27 void SetCapacity(size_t newCapacity) argument
29 if (newCapacity == _capacity)
32 if (newCapacity > 0)
34 newBuffer = new T[newCapacity];
36 memmove(newBuffer, _items, MyMin(_capacity, newCapacity) * sizeof(T));
42 _capacity = newCapacity;
H A DMyVector.cpp36 void CBaseRecordVector::Reserve(int newCapacity) argument
38 // if (newCapacity <= _capacity)
39 if (newCapacity == _capacity)
41 if ((unsigned)newCapacity >= ((unsigned)1 << (sizeof(unsigned) * 8 - 1)))
43 size_t newSize = (size_t)(unsigned)newCapacity * _itemSize;
44 if (newSize / _itemSize != (size_t)(unsigned)newCapacity)
52 int numRecordsToMove = (_size < newCapacity ? _size : newCapacity);
57 _capacity = newCapacity;
H A DMyString.h162 void SetCapacity(int newCapacity) argument
164 int realCapacity = newCapacity + 1;
169 if (newCapacity > kMaxStringSize || newCapacity < _length)
/external/qemu/android/utils/
H A Dintmap.c100 int newCapacity; local
111 newCapacity = oldCapacity*2;
113 newCapacity = oldCapacity + (oldCapacity >> 2);
115 AARRAY_RENEW(keys, newCapacity);
116 AARRAY_RENEW(values, newCapacity);
120 map->capacity = newCapacity;
/external/chromium_org/third_party/WebKit/Source/wtf/text/
H A DStringBuilder.cpp190 void StringBuilder::reserveCapacity(unsigned newCapacity) argument
194 if (newCapacity > m_buffer->length()) {
196 reallocateBuffer<LChar>(newCapacity);
198 reallocateBuffer<UChar>(newCapacity);
202 if (newCapacity > m_length) {
205 allocateBuffer(nullPlaceholder, newCapacity);
207 allocateBuffer(m_string.characters8(), newCapacity);
209 allocateBuffer(m_string.characters16(), newCapacity);
/external/chromium_org/third_party/skia/src/core/
H A DSkTDynamicHash.h202 void resize(int newCapacity) { argument
207 reset(newCapacity);
/external/icu4c/i18n/
H A Dsortkey.cpp99 uint8_t *CollationKey::reallocate(int32_t newCapacity, int32_t length) { argument
100 uint8_t *newBytes = static_cast<uint8_t *>(uprv_malloc(newCapacity));
107 fUnion.fFields.fCapacity = newCapacity;
H A Dplurrule.cpp611 int32_t newCapacity = sampleCount < 20 ? 128 : sampleCount * 2; local
612 if (NULL == newSamples.resize(newCapacity, sampleCount)) {
/external/icu4c/layoutex/
H A DRunArrays.cpp55 void RunArray::grow(le_int32 newCapacity) argument
57 fLimits = (le_int32 *) LE_GROW_ARRAY(fLimits, newCapacity);
/external/skia/src/core/
H A DSkTDynamicHash.h202 void resize(int newCapacity) { argument
207 reset(newCapacity);
/external/srec/portable/src/
H A DArrayListImpl.c81 size_t newCapacity = impl->capacity * 2; local
82 void** temp = REALLOC(impl->contents, newCapacity * sizeof(void*));
86 impl->capacity = newCapacity;
126 size_t newCapacity = impl->capacity / 2; local
129 if ((temp = REALLOC(impl->contents, newCapacity * sizeof(void*))) == NULL)
132 impl->capacity = newCapacity;
H A Dphashtable.c278 unsigned int newCapacity = ((oldCapacity << 1) | 0x01); local
284 sizeof(PHashTableEntry *) * newCapacity);
290 table->args.capacity = newCapacity;
291 table->threshold = (unsigned int)(newCapacity * table->args.maxLoadFactor);
293 for (i = oldCapacity; i < newCapacity; ++i)
302 idx = entry->hashCode % newCapacity;
/external/chromium_org/third_party/icu/source/common/
H A Dcmemory.h133 * @param newCapacity must be >0
136 inline T *allocateInsteadAndReset(int32_t newCapacity=1);
142 * @param newCapacity must be >0
148 inline T *allocateInsteadAndCopy(int32_t newCapacity=1, int32_t length=0);
159 inline T *LocalMemory<T>::allocateInsteadAndReset(int32_t newCapacity) { argument
160 if(newCapacity>0) {
161 T *p=(T *)uprv_malloc(newCapacity*sizeof(T));
163 uprv_memset(p, 0, newCapacity*sizeof(T));
175 inline T *LocalMemory<T>::allocateInsteadAndCopy(int32_t newCapacity, int32_t length) { argument
176 if(newCapacity>
314 resize(int32_t newCapacity, int32_t length) argument
484 resize(int32_t newCapacity, int32_t length) argument
[all...]
H A Dunistr.cpp1520 UnicodeString::cloneArrayIfNeeded(int32_t newCapacity, argument
1527 if(newCapacity == -1) {
1528 newCapacity = getCapacity();
1548 newCapacity > getCapacity()
1552 growCapacity = newCapacity;
1553 } else if(newCapacity <= US_STACKBUF_SIZE && growCapacity > US_STACKBUF_SIZE) {
1577 (newCapacity < growCapacity && allocate(newCapacity))
1583 newCapacity = getCapacity();
1584 if(newCapacity < minLengt
[all...]
H A Dnormalizer2impl.cpp182 int32_t newCapacity=length+appendLength; local
184 if(newCapacity<doubleCapacity) {
185 newCapacity=doubleCapacity;
187 if(newCapacity<256) {
188 newCapacity=256;
190 start=str.getBuffer(newCapacity);
/external/chromium_org/third_party/icu/source/tools/toolutil/
H A Dtoolutil.cpp265 int32_t newCapacity; local
275 newCapacity=capacity;
277 newCapacity=2*mem->capacity;
279 newCapacity=mem->maxCapacity;
283 mem->array=uprv_malloc(newCapacity*mem->size);
288 mem->array=uprv_realloc(mem->array, newCapacity*mem->size);
295 mem->capacity=newCapacity;
/external/icu4c/common/
H A Dcmemory.h180 * @param newCapacity must be >0
183 inline T *allocateInsteadAndReset(int32_t newCapacity=1);
189 * @param newCapacity must be >0
195 inline T *allocateInsteadAndCopy(int32_t newCapacity=1, int32_t length=0);
206 inline T *LocalMemory<T>::allocateInsteadAndReset(int32_t newCapacity) { argument
207 if(newCapacity>0) {
208 T *p=(T *)uprv_malloc(newCapacity*sizeof(T));
210 uprv_memset(p, 0, newCapacity*sizeof(T));
222 inline T *LocalMemory<T>::allocateInsteadAndCopy(int32_t newCapacity, int32_t length) { argument
223 if(newCapacity>
363 resize(int32_t newCapacity, int32_t length) argument
538 resize(int32_t newCapacity, int32_t length) argument
[all...]
H A Dustr_wcs.cpp108 int32_t newCapacity = 2 * srcLength; local
109 if(newCapacity <= tempBufCapacity) {
110 newCapacity = _BUFFER_CAPACITY_MULTIPLIER * tempBufCapacity;
113 newCapacity, count, 1)) {
H A Ducharstriebuilder.cpp106 int32_t newCapacity; local
108 newCapacity=1024;
110 newCapacity=4*elementsCapacity;
112 UCharsTrieElement *newElements=new UCharsTrieElement[newCapacity];
122 elementsCapacity=newCapacity;
326 int32_t newCapacity=ucharsCapacity; local
328 newCapacity*=2;
329 } while(newCapacity<=length);
330 UChar *newUChars=static_cast<UChar *>(uprv_malloc(newCapacity*2));
338 u_memcpy(newUChars+(newCapacity
[all...]
H A Dbytestriebuilder.cpp156 int32_t newCapacity; local
158 newCapacity=1024;
160 newCapacity=4*elementsCapacity;
162 BytesTrieElement *newElements=new BytesTrieElement[newCapacity];
172 elementsCapacity=newCapacity;
378 int32_t newCapacity=bytesCapacity; local
380 newCapacity*=2;
381 } while(newCapacity<=length);
382 char *newBytes=static_cast<char *>(uprv_malloc(newCapacity));
390 uprv_memcpy(newBytes+(newCapacity
[all...]
/external/icu4c/tools/toolutil/
H A Dtoolutil.cpp269 int32_t newCapacity; local
279 newCapacity=capacity;
281 newCapacity=2*mem->capacity;
283 newCapacity=mem->maxCapacity;
287 mem->array=uprv_malloc(newCapacity*mem->size);
292 mem->array=uprv_realloc(mem->array, newCapacity*mem->size);
299 mem->capacity=newCapacity;
/external/chromium_org/third_party/WebKit/Source/wtf/
H A DVector.h258 void allocateBuffer(size_t newCapacity) argument
260 ASSERT(newCapacity);
261 RELEASE_ASSERT(newCapacity <= QuantizedAllocation::kMaxUnquantizedAllocation / sizeof(T));
262 size_t sizeToAllocate = allocationSize(newCapacity);
401 void allocateBuffer(size_t newCapacity) argument
404 if (newCapacity > inlineCapacity)
405 Base::allocateBuffer(newCapacity);
550 void reserveCapacity(size_t newCapacity);
603 void shrinkCapacity(size_t newCapacity);
840 void Vector<T, inlineCapacity>::reserveCapacity(size_t newCapacity) argument
861 shrinkCapacity(size_t newCapacity) argument
[all...]
/external/smack/src/org/jivesoftware/smack/util/collections/
H A DAbstractHashedMap.java578 int newCapacity = data.length * 2;
579 if (newCapacity <= MAXIMUM_CAPACITY) {
580 ensureCapacity(newCapacity);
588 * @param newCapacity the new capacity of the array (a power of two, less or equal to max)
590 protected void ensureCapacity(int newCapacity) { argument
592 if (newCapacity <= oldCapacity) {
596 threshold = calculateThreshold(newCapacity, loadFactor);
597 data = new HashEntry[newCapacity];
600 HashEntry<K, V> newEntries[] = new HashEntry[newCapacity];
609 int index = hashIndex(entry.hashCode, newCapacity);
651 calculateThreshold(int newCapacity, float factor) argument
[all...]

Completed in 770 milliseconds

12