HomeSort by relevance Sort by last modified time
    Searched refs:newCapacity (Results 1 - 25 of 133) sorted by null

1 2 3 4 5 6

  /external/lzma/CPP/Common/
MyVector.cpp 36 void CBaseRecordVector::Reserve(int newCapacity)
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;
Buffer.h 27 void SetCapacity(size_t newCapacity)
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;
  /external/icu/icu4c/source/common/
cmemory.h 181 * @param newCapacity must be >0
184 inline T *allocateInsteadAndReset(int32_t newCapacity=1);
190 * @param newCapacity must be >0
196 inline T *allocateInsteadAndCopy(int32_t newCapacity=1, int32_t length=0);
207 inline T *LocalMemory<T>::allocateInsteadAndReset(int32_t newCapacity) {
208 if(newCapacity>0) {
209 T *p=(T *)uprv_malloc(newCapacity*sizeof(T));
211 uprv_memset(p, 0, newCapacity*sizeof(T));
223 inline T *LocalMemory<T>::allocateInsteadAndCopy(int32_t newCapacity, int32_t length) {
224 if(newCapacity>0)
    [all...]
bytestriebuilder.cpp 156 int32_t newCapacity;
158 newCapacity=1024;
160 newCapacity=4*elementsCapacity;
162 BytesTrieElement *newElements=new BytesTrieElement[newCapacity];
172 elementsCapacity=newCapacity;
378 int32_t newCapacity=bytesCapacity;
380 newCapacity*=2;
381 } while(newCapacity<=length);
382 char *newBytes=static_cast<char *>(uprv_malloc(newCapacity));
390 uprv_memcpy(newBytes+(newCapacity-bytesLength)
    [all...]
ucharstriebuilder.cpp 106 int32_t newCapacity;
108 newCapacity=1024;
110 newCapacity=4*elementsCapacity;
112 UCharsTrieElement *newElements=new UCharsTrieElement[newCapacity];
122 elementsCapacity=newCapacity;
326 int32_t newCapacity=ucharsCapacity;
328 newCapacity*=2;
329 } while(newCapacity<=length);
330 UChar *newUChars=static_cast<UChar *>(uprv_malloc(newCapacity*2));
338 u_memcpy(newUChars+(newCapacity-ucharsLength)
    [all...]
  /packages/inputmethods/LatinIME/common/src/com/android/inputmethod/latin/common/
ResizableIntArray.java 75 final int newCapacity = calculateCapacity(minimumCapacity);
76 if (newCapacity > 0) {
78 mArray = Arrays.copyOf(mArray, newCapacity);
109 final int newCapacity = calculateCapacity(ip.mLength);
110 if (newCapacity > 0) {
112 mArray = new int[newCapacity];
  /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/
UVector32.java 38 int newCapacity = buffer.length <= 0xffff ? 4 * buffer.length : 2 * buffer.length;
39 int[] newBuffer = new int[newCapacity];
UVector64.java 38 int newCapacity = buffer.length <= 0xffff ? 4 * buffer.length : 2 * buffer.length;
39 long[] newBuffer = new long[newCapacity];
  /frameworks/support/v4/java/android/support/v4/util/
CircularIntArray.java 31 int newCapacity = n << 1;
32 if (newCapacity < 0) {
35 int[] a = new int[newCapacity];
41 mCapacityBitmask = newCapacity - 1;
CircularArray.java 30 int newCapacity = n << 1;
31 if (newCapacity < 0) {
34 Object[] a = new Object[newCapacity];
40 mCapacityBitmask = newCapacity - 1;
  /external/icu/icu4c/source/tools/toolutil/
toolutil.cpp 295 int32_t newCapacity;
305 newCapacity=capacity;
307 newCapacity=2*mem->capacity;
309 newCapacity=mem->maxCapacity;
313 mem->array=uprv_malloc(newCapacity*mem->size);
318 mem->array=uprv_realloc(mem->array, newCapacity*mem->size);
325 mem->capacity=newCapacity;
  /external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/
BytesTrieBuilder.java 161 int newCapacity=bytes.length;
163 newCapacity*=2;
164 } while(newCapacity<=length);
165 byte[] newBytes=new byte[newCapacity];
CharsTrieBuilder.java 139 int newCapacity=chars.length;
141 newCapacity*=2;
142 } while(newCapacity<=length);
143 char[] newChars=new char[newCapacity];
  /packages/apps/Contacts/src/com/android/contacts/widget/
CompositeListAdapter.java 77 int newCapacity = mSize + 2;
78 ListAdapter[] newAdapters = new ListAdapter[newCapacity];
82 int[] newCounts = new int[newCapacity];
86 int[] newViewTypeCounts = new int[newCapacity];
  /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/
IntArrayList.java 89 public void ensureCapacity(int newCapacity) {
93 elements = new int[newCapacity];
  /frameworks/base/core/java/android/util/
LongArray.java 99 final int newCapacity = targetCap > minCapacity ? targetCap : minCapacity;
100 final long[] newValues = ArrayUtils.newUnpaddedLongArray(newCapacity);
IntArray.java 119 final int newCapacity = targetCap > minCapacity ? targetCap : minCapacity;
120 final int[] newValues = ArrayUtils.newUnpaddedIntArray(newCapacity);
  /external/guava/guava/src/com/google/common/collect/
ImmutableCollection.java 223 int newCapacity = oldCapacity + (oldCapacity >> 1) + 1;
224 if (newCapacity < minCapacity) {
225 newCapacity = Integer.highestOneBit(minCapacity - 1) << 1;
227 if (newCapacity < 0) {
228 newCapacity = Integer.MAX_VALUE;
229 // guaranteed to be >= newCapacity
231 return newCapacity;
  /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/
ExpandedNameTable.java 250 int newCapacity = 2 * oldCapacity + 1;
251 m_capacity = newCapacity;
252 m_threshold = (int)(newCapacity * m_loadFactor);
254 m_table = new HashEntry[newCapacity];
262 int newIndex = e.hash % newCapacity;
  /external/jmonkeyengine/engine/src/core/com/jme3/util/
IntMap.java 142 int newCapacity = 2 * capacity;
143 Entry[] newTable = new Entry[newCapacity];
145 int bucketmask = newCapacity - 1;
160 capacity = newCapacity;
161 threshold = (int) (newCapacity * loadFactor);
  /external/deqp/framework/delibs/depool/
dePoolArray.c 72 int newCapacity = deAlign32(size, 1 << DE_ARRAY_ELEMENTS_PER_PAGE_LOG2);
73 int reqPageTableCapacity = newCapacity >> DE_ARRAY_ELEMENTS_PER_PAGE_LOG2;
127 DE_ASSERT(arr->capacity >= newCapacity);
  /external/icu/icu4c/source/i18n/
sortkey.cpp 99 uint8_t *CollationKey::reallocate(int32_t newCapacity, int32_t length) {
100 uint8_t *newBytes = static_cast<uint8_t *>(uprv_malloc(newCapacity));
107 fUnion.fFields.fCapacity = newCapacity;
  /libcore/luni/src/main/java/libcore/io/
IoUtils.java 240 final int newCapacity = capacity * 2;
241 byte[] newBytes = new byte[newCapacity];
244 capacity = newCapacity;
  /libcore/luni/src/main/java/java/util/
ArrayList.java 154 Object[] newArray = new Object[newCapacity(s)];
173 private static int newCapacity(int currentCapacity) {
197 int newCapacity = newCapacity(newSize - 1); // ~33% growth room
198 Object[] newArray = new Object[newCapacity];
238 int newCapacity = newCapacity(newSize - 1); // ~33% growth room
239 Object[] newArray = new Object[newCapacity];
  /external/icu/icu4c/source/layoutex/
RunArrays.cpp 55 void RunArray::grow(le_int32 newCapacity)
57 fLimits = (le_int32 *) LE_GROW_ARRAY(fLimits, newCapacity);

Completed in 1363 milliseconds

1 2 3 4 5 6