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

1 2

  /external/chromium_org/third_party/icu/source/common/
uvectr64.h 128 inline UBool ensureCapacity(int32_t minimumCapacity, UErrorCode &status);
131 UBool expandCapacity(int32_t minimumCapacity, UErrorCode &status);
202 inline UBool UVector64::ensureCapacity(int32_t minimumCapacity, UErrorCode &status) {
203 if ((minimumCapacity >= 0) && (capacity >= minimumCapacity)) {
206 return expandCapacity(minimumCapacity, status);
uvectr32.h 129 inline UBool ensureCapacity(int32_t minimumCapacity, UErrorCode &status);
132 UBool expandCapacity(int32_t minimumCapacity, UErrorCode &status);
213 inline UBool UVector32::ensureCapacity(int32_t minimumCapacity, UErrorCode &status) {
214 if ((minimumCapacity >= 0) && (capacity >= minimumCapacity)) {
217 return expandCapacity(minimumCapacity, status);
uvectr64.cpp 116 UBool UVector64::expandCapacity(int32_t minimumCapacity, UErrorCode &status) {
117 if (minimumCapacity < 0) {
121 if (capacity >= minimumCapacity) {
124 if (maxCapacity>0 && minimumCapacity>maxCapacity) {
133 if (newCap < minimumCapacity) {
134 newCap = minimumCapacity;
140 // We keep the original memory contents on bad minimumCapacity/maxCapacity.
uvectr32.cpp 198 UBool UVector32::expandCapacity(int32_t minimumCapacity, UErrorCode &status) {
199 if (minimumCapacity < 0) {
203 if (capacity >= minimumCapacity) {
206 if (maxCapacity>0 && minimumCapacity>maxCapacity) {
215 if (newCap < minimumCapacity) {
216 newCap = minimumCapacity;
222 // We keep the original memory contents on bad minimumCapacity/maxCapacity.
uvector.cpp 328 UBool UVector::ensureCapacity(int32_t minimumCapacity, UErrorCode &status) {
329 if (minimumCapacity < 0) {
333 if (capacity < minimumCapacity) {
339 if (newCap < minimumCapacity) {
340 newCap = minimumCapacity;
343 // We keep the original memory contents on bad minimumCapacity.
349 // We keep the original contents on the memory failure on realloc or bad minimumCapacity.
uvector.h 190 UBool ensureCapacity(int32_t minimumCapacity, UErrorCode &status);
  /external/icu4c/common/
uvectr64.h 128 inline UBool ensureCapacity(int32_t minimumCapacity, UErrorCode &status);
131 UBool expandCapacity(int32_t minimumCapacity, UErrorCode &status);
202 inline UBool UVector64::ensureCapacity(int32_t minimumCapacity, UErrorCode &status) {
203 if ((minimumCapacity >= 0) && (capacity >= minimumCapacity)) {
206 return expandCapacity(minimumCapacity, status);
uvectr32.h 129 inline UBool ensureCapacity(int32_t minimumCapacity, UErrorCode &status);
132 UBool expandCapacity(int32_t minimumCapacity, UErrorCode &status);
213 inline UBool UVector32::ensureCapacity(int32_t minimumCapacity, UErrorCode &status) {
214 if ((minimumCapacity >= 0) && (capacity >= minimumCapacity)) {
217 return expandCapacity(minimumCapacity, status);
uvectr64.cpp 116 UBool UVector64::expandCapacity(int32_t minimumCapacity, UErrorCode &status) {
117 if (minimumCapacity < 0) {
121 if (capacity >= minimumCapacity) {
124 if (maxCapacity>0 && minimumCapacity>maxCapacity) {
133 if (newCap < minimumCapacity) {
134 newCap = minimumCapacity;
140 // We keep the original memory contents on bad minimumCapacity/maxCapacity.
uvectr32.cpp 198 UBool UVector32::expandCapacity(int32_t minimumCapacity, UErrorCode &status) {
199 if (minimumCapacity < 0) {
203 if (capacity >= minimumCapacity) {
206 if (maxCapacity>0 && minimumCapacity>maxCapacity) {
215 if (newCap < minimumCapacity) {
216 newCap = minimumCapacity;
222 // We keep the original memory contents on bad minimumCapacity/maxCapacity.
uvector.cpp 329 UBool UVector::ensureCapacity(int32_t minimumCapacity, UErrorCode &status) {
330 if (minimumCapacity < 0) {
334 if (capacity < minimumCapacity) {
340 if (newCap < minimumCapacity) {
341 newCap = minimumCapacity;
344 // We keep the original memory contents on bad minimumCapacity.
350 // We keep the original contents on the memory failure on realloc or bad minimumCapacity.
uvector.h 173 UBool ensureCapacity(int32_t minimumCapacity, UErrorCode &status);
  /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/utils/
ResizableIntArray.java 55 * @param minimumCapacity the minimum capacity that the {@code mArray} should have.
59 private int calculateCapacity(final int minimumCapacity) {
61 if (currentCapcity < minimumCapacity) {
63 // The following is the same as return Math.max(minimumCapacity, nextCapacity);
64 return minimumCapacity > nextCapacity ? minimumCapacity : nextCapacity;
69 private void ensureCapacity(final int minimumCapacity) {
70 final int newCapacity = calculateCapacity(minimumCapacity);
  /system/core/libutils/
BasicHashtable.cpp 202 void BasicHashtableImpl::rehash(size_t minimumCapacity, float loadFactor) {
203 if (minimumCapacity < mSize) {
204 minimumCapacity = mSize;
207 determineCapacity(minimumCapacity, loadFactor, &newBucketCount, &newCapacity);
324 void BasicHashtableImpl::determineCapacity(size_t minimumCapacity, float loadFactor,
329 size_t count = ceilf(minimumCapacity / loadFactor) + 1;
337 uint32_t(minimumCapacity), loadFactor);
  /system/core/include/utils/
BasicHashtable.h 72 void rehash(size_t minimumCapacity, float loadFactor);
116 static void determineCapacity(size_t minimumCapacity, float loadFactor,
325 * minimumCapacity: The desired minimum capacity after rehashing.
328 inline void rehash(size_t minimumCapacity, float loadFactor) {
329 BasicHashtableImpl::rehash(minimumCapacity, loadFactor);
  /libcore/luni/src/main/java/java/util/
Vector.java 363 * @param minimumCapacity
368 public synchronized void ensureCapacity(int minimumCapacity) {
369 if (elementData.length < minimumCapacity) {
373 grow(minimumCapacity > next ? minimumCapacity : next);
    [all...]
ArrayList.java 293 * @param minimumCapacity
296 public void ensureCapacity(int minimumCapacity) {
298 if (a.length < minimumCapacity) {
299 Object[] newArray = new Object[minimumCapacity];
  /frameworks/base/core/java/android/util/
ArraySet.java 268 * Ensure the array map can hold at least <var>minimumCapacity</var>
271 public void ensureCapacity(int minimumCapacity) {
272 if (mHashes.length < minimumCapacity) {
275 allocArrays(minimumCapacity);
ArrayMap.java 300 * Ensure the array map can hold at least <var>minimumCapacity</var>
303 public void ensureCapacity(int minimumCapacity) {
304 if (mHashes.length < minimumCapacity) {
307 allocArrays(minimumCapacity);
  /frameworks/support/v4/java/android/support/v4/util/
SimpleArrayMap.java 250 * Ensure the array map can hold at least <var>minimumCapacity</var>
253 public void ensureCapacity(int minimumCapacity) {
254 if (mHashes.length < minimumCapacity) {
257 allocArrays(minimumCapacity);
  /external/chromium_org/third_party/WebKit/Source/wtf/text/
StringBuilder.cpp 37 static const unsigned minimumCapacity = 16;
38 return std::max(requiredLength, std::max(minimumCapacity, capacity * 2));
  /prebuilts/maven_repo/android/com/android/support/support-v4/19.0.0/
support-v4-19.0.0.jar 
  /prebuilts/sdk/10/
android.jar 
  /prebuilts/sdk/11/
android.jar 
  /prebuilts/sdk/13/
android.jar 

Completed in 823 milliseconds

1 2