| /external/icu/icu4c/source/common/ |
| appendable.cpp | 58 Appendable::getAppendBuffer(int32_t minCapacity,
62 if(minCapacity<1 || scratchCapacity<minCapacity) {
|
| charstr.cpp | 92 char *CharString::getAppendBuffer(int32_t minCapacity,
101 if(appendCapacity>=minCapacity) {
105 if(ensureCapacity(len+minCapacity+1, len+desiredCapacityHint+1, errorCode)) {
|
| charstr.h | 88 * resultCapacity. Guarantees resultCapacity>=minCapacity if U_SUCCESS().
98 * @param minCapacity required minimum capacity of the returned buffer;
106 char *getAppendBuffer(int32_t minCapacity,
|
| unistr.cpp | 492 // fLength>0 and not an "open" src.getBuffer(minCapacity)
[all...] |
| /external/icu/icu4c/source/test/intltest/ |
| textfile.cpp | 144 * Make sure that 'buffer' has at least 'mincapacity' bytes.
149 UBool TextFile::ensureCapacity(int32_t mincapacity) {
150 if (capacity >= mincapacity) {
157 while (i < mincapacity) {
164 mincapacity = i;
168 char* newbuffer = (char*) uprv_malloc(mincapacity);
177 capacity = mincapacity;
|
| /frameworks/support/compat/java/android/support/v4/util/ |
| CircularArray.java | 51 * Creates a circular array with capacity for at least {@code minCapacity}
54 * @param minCapacity the minimum capacity, between 1 and 2^30 inclusive
56 public CircularArray(int minCapacity) {
57 if (minCapacity < 1) {
60 if (minCapacity > (2 << 29)) {
64 // If minCapacity isn't a power of 2, round up to the next highest
67 if (Integer.bitCount(minCapacity) != 1) {
68 arrayCapacity = Integer.highestOneBit(minCapacity - 1) << 1;
70 arrayCapacity = minCapacity;
|
| CircularIntArray.java | 52 * Creates a circular array with capacity for at least {@code minCapacity}
55 * @param minCapacity the minimum capacity, between 1 and 2^30 inclusive
57 public CircularIntArray(int minCapacity) {
58 if (minCapacity < 1) {
61 if (minCapacity > (2 << 29)) {
65 // If minCapacity isn't a power of 2, round up to the next highest
68 if (Integer.bitCount(minCapacity) != 1) {
69 arrayCapacity = Integer.highestOneBit(minCapacity - 1) << 1;
71 arrayCapacity = minCapacity;
|
| /external/universal-tween-engine/java/api/src/aurelienribon/tweenengine/ |
| Pool.java | 47 public void ensureCapacity(int minCapacity) {
48 objects.ensureCapacity(minCapacity);
|
| TweenManager.java | 125 public void ensureCapacity(int minCapacity) {
126 objects.ensureCapacity(minCapacity);
|
| /external/icu/icu4c/source/common/unicode/ |
| appendable.h | 97 * *resultCapacity. Guarantees *resultCapacity>=minCapacity.
99 * scratchCapacity>=minCapacity.
128 * @param minCapacity required minimum capacity of the returned buffer;
136 * @return a buffer with *resultCapacity>=minCapacity
139 virtual UChar *getAppendBuffer(int32_t minCapacity,
202 * *resultCapacity. Guarantees *resultCapacity>=minCapacity.
204 * scratchCapacity>=minCapacity.
210 * @param minCapacity required minimum capacity of the returned buffer;
218 * @return a buffer with *resultCapacity>=minCapacity
221 virtual UChar *getAppendBuffer(int32_t minCapacity,
[all...] |
| /frameworks/base/core/java/android/util/ |
| LongArray.java | 95 final int minCapacity = currentSize + count;
96 if (minCapacity >= mValues.length) {
99 final int newCapacity = targetCap > minCapacity ? targetCap : minCapacity;
|
| IntArray.java | 115 final int minCapacity = currentSize + count;
116 if (minCapacity >= mValues.length) {
119 final int newCapacity = targetCap > minCapacity ? targetCap : minCapacity;
|
| /libcore/ojluni/src/main/java/java/io/ |
| ByteArrayOutputStream.java | 85 * @param minCapacity the desired minimum capacity
86 * @throws OutOfMemoryError if {@code minCapacity < 0}. This is
88 * {@code (long) Integer.MAX_VALUE + (minCapacity - Integer.MAX_VALUE)}.
90 private void ensureCapacity(int minCapacity) {
92 if (minCapacity - buf.length > 0)
93 grow(minCapacity);
100 * @param minCapacity the desired minimum capacity
102 private void grow(int minCapacity) {
106 if (newCapacity - minCapacity < 0)
107 newCapacity = minCapacity;
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| ImmutableCollection.java | 218 static int expandedCapacity(int oldCapacity, int minCapacity) {
219 if (minCapacity < 0) {
224 if (newCapacity < minCapacity) {
225 newCapacity = Integer.highestOneBit(minCapacity - 1) << 1;
330 private void ensureCapacity(int minCapacity) {
331 if (contents.length < minCapacity) {
333 this.contents, expandedCapacity(contents.length, minCapacity));
|
| ImmutableMap.java | 193 private void ensureCapacity(int minCapacity) {
194 if (minCapacity > entries.length) {
196 entries, ImmutableCollection.Builder.expandedCapacity(entries.length, minCapacity));
|
| /libcore/ojluni/src/main/java/java/util/ |
| ArrayList.java | 195 * @param minCapacity the desired minimum capacity
197 public void ensureCapacity(int minCapacity) {
205 if (minCapacity > minExpand) {
206 ensureExplicitCapacity(minCapacity);
210 private void ensureCapacityInternal(int minCapacity) {
212 minCapacity = Math.max(DEFAULT_CAPACITY, minCapacity);
215 ensureExplicitCapacity(minCapacity);
218 private void ensureExplicitCapacity(int minCapacity) {
222 if (minCapacity - elementData.length > 0
[all...] |
| Vector.java | 217 * {@code minCapacity}, then its capacity is increased by replacing its
223 * is still smaller than {@code minCapacity}, then the new capacity will
224 * be {@code minCapacity}.
226 * @param minCapacity the desired minimum capacity
228 public synchronized void ensureCapacity(int minCapacity) {
229 if (minCapacity > 0) {
231 ensureCapacityHelper(minCapacity);
243 private void ensureCapacityHelper(int minCapacity) {
245 if (minCapacity - elementData.length > 0)
246 grow(minCapacity);
[all...] |
| AbstractCollection.java | 236 private static int hugeCapacity(int minCapacity) {
237 if (minCapacity < 0) // overflow
240 return (minCapacity > MAX_ARRAY_SIZE) ?
|
| ComparableTimSort.java | [all...] |
| PriorityQueue.java | 289 * @param minCapacity the desired minimum capacity
291 private void grow(int minCapacity) {
299 newCapacity = hugeCapacity(minCapacity);
303 private static int hugeCapacity(int minCapacity) {
304 if (minCapacity < 0) // overflow
306 return (minCapacity > MAX_ARRAY_SIZE) ?
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/impl/coll/ |
| BOCSU.java | 135 private static void ensureAppendCapacity(ByteArrayWrapper sink, int minCapacity, int desiredCapacity) {
137 if (remainingCapacity >= minCapacity) { return; }
138 if (desiredCapacity < minCapacity) { desiredCapacity = minCapacity; }
|
| /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
| BOCSU.java | 134 private static void ensureAppendCapacity(ByteArrayWrapper sink, int minCapacity, int desiredCapacity) {
136 if (remainingCapacity >= minCapacity) { return; }
137 if (desiredCapacity < minCapacity) { desiredCapacity = minCapacity; }
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ddk/ |
| ntpoapi.h | 243 UCHAR MinCapacity;
|
| /external/libgdx/gdx/src/com/badlogic/gdx/utils/ |
| ComparableTimSort.java | 768 * @param minCapacity the minimum required capacity of the tmp array
770 private Object[] ensureCapacity (int minCapacity) {
771 tmpCount = Math.max(tmpCount, minCapacity);
772 if (tmp.length < minCapacity) {
773 // Compute smallest power of 2 > minCapacity
774 int newSize = minCapacity;
783 newSize = minCapacity;
|
| TimSort.java | 802 * @param minCapacity the minimum required capacity of the tmp array
804 private T[] ensureCapacity (int minCapacity) {
805 tmpCount = Math.max(tmpCount, minCapacity);
806 if (tmp.length < minCapacity) {
807 // Compute smallest power of 2 > minCapacity
808 int newSize = minCapacity;
817 newSize = minCapacity;
|
