| /libcore/luni/src/main/java/java/nio/ |
| LongArrayBuffer.java | 42 LongArrayBuffer(int capacity) {
43 this(capacity, new long[capacity], 0);
46 LongArrayBuffer(int capacity, long[] backingArray, int offset) {
47 super(capacity);
|
| ShortArrayBuffer.java | 42 ShortArrayBuffer(int capacity) {
43 this(capacity, new short[capacity], 0);
46 ShortArrayBuffer(int capacity, short[] backingArray, int offset) {
47 super(capacity);
|
| /external/chromium/third_party/icu/source/tools/toolutil/ |
| toolutil.c | 155 int32_t capacity, maxCapacity, size, idx; member in struct:UToolMemory
176 mem->capacity=initialCapacity;
206 utm_hasCapacity(UToolMemory *mem, int32_t capacity) {
207 if(mem->capacity<capacity) {
210 if(mem->maxCapacity<capacity) {
217 if(capacity>=2*mem->capacity) {
218 newCapacity=capacity;
219 } else if(mem->capacity<=mem->maxCapacity/3)
[all...] |
| /external/chromium/third_party/icu/source/test/intltest/ |
| textfile.cpp | 25 capacity(0),
133 if (capacity <= index) {
149 if (capacity >= mincapacity) {
154 // Note: 'capacity' may be 0
156 for (i = capacity || 1024; i < mincapacity; ) {
172 uprv_strncpy(newbuffer, buffer, capacity);
176 capacity = mincapacity;
|
| /external/icu4c/test/intltest/ |
| textfile.cpp | 25 capacity(0),
133 if (capacity <= index) {
149 if (capacity >= mincapacity) {
154 // Note: 'capacity' may be 0
156 for (i = capacity || 1024; i < mincapacity; ) {
172 uprv_strncpy(newbuffer, buffer, capacity);
176 capacity = mincapacity;
|
| /external/icu4c/common/ |
| cmemory.h | 145 * must be no more than the capacity of the old array,
161 * Provides an internal array with fixed capacity. Can alias another array
172 MaybeStackArray() : needToRelease(FALSE), capacity(stackCapacity), ptr(stackArray) {}
178 * Returns the array capacity (number of T items).
179 * @return array capacity
181 int32_t getCapacity() const { return capacity; }
191 T *getArrayLimit() const { return getAlias()+capacity; }
215 capacity=otherCapacity;
224 * @param newCapacity can be less than or greater than the current capacity;
235 * and capacity of the clone when clonin
244 int32_t capacity; member in class:MaybeStackArray
[all...] |
| uvectr32.cpp | 28 capacity(0),
37 capacity(0),
58 capacity = initialCapacity;
195 if (capacity >= minimumCapacity) {
202 int32_t newCap = capacity * 2;
216 capacity = newCap;
226 if (capacity <= maxCapacity || maxCapacity == 0) {
227 // Current capacity is within the new limit.
231 // New maximum capacity is smaller than the current size.
240 capacity = maxCapacity
[all...] |
| unorm_it.c | 50 * capacity: length of allocated arrays
52 int32_t capacity; member in struct:UNormIterator
78 api->start=api->index=api->limit=uni->capacity;
83 api->start=api->index=api->limit=uni->capacity/2;
89 reallocArrays(UNormIterator *uni, int32_t capacity, UBool addAtStart) {
97 states=(uint32_t *)uprv_malloc((capacity+1)*4+capacity*2);
102 chars=(UChar *)(states+(capacity+1));
103 uni->capacity=capacity;
194 int32_t limit, capacity, room; local
264 int32_t start, capacity, room; local
[all...] |
| uscript.c | 30 int32_t capacity,
40 if(nameOrAbbrOrLocale==NULL || fillIn == NULL || capacity<0){
65 if(numFilled<=capacity){
88 if(numFilled<=capacity){
|
| /external/icu4c/i18n/ |
| udatpg.cpp | 59 UChar *bestPattern, int32_t capacity,
63 bestPattern, capacity, pErrorCode);
70 UChar *bestPattern, int32_t capacity,
81 return result.extract(bestPattern, capacity, *pErrorCode);
87 UChar *skeleton, int32_t capacity,
98 return result.extract(skeleton, capacity, *pErrorCode);
104 UChar *skeleton, int32_t capacity,
115 return result.extract(skeleton, capacity, *pErrorCode);
122 UChar *conflictingPattern, int32_t capacity, int32_t *pLength,
135 int32_t length=conflictingPatternString.extract(conflictingPattern, capacity, *pErrorCode)
[all...] |
| /external/astl/tests/ |
| test_vector.cpp | 48 EXPECT_TRUE(vec1.capacity() == 0);
54 EXPECT_TRUE(vec2.capacity() == 100);
64 EXPECT_TRUE(vec3.capacity() == 200);
79 EXPECT_TRUE(vec1.capacity() == 0);
92 EXPECT_TRUE(vec1.capacity() == 0);
98 EXPECT_TRUE(vec1.capacity() == 100);
183 EXPECT_TRUE(vec1.capacity() == 100);
185 EXPECT_TRUE(vec1.capacity() == 200);
189 EXPECT_TRUE(vec1.capacity() == 100);
195 EXPECT_TRUE(vec2.capacity() == 0)
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| Hashtable.java | 44 * Min capacity (other than zero) for a Hashtable. Must be a power of two
50 * Max capacity for a Hashtable. Must be a power of two >= MINIMUM_CAPACITY.
55 * An empty table shared by all zero-capacity maps (typically from default
93 * The value of this field is generally .75 * capacity, except when
94 * the capacity is zero, as described in the EMPTY_TABLE declaration
105 * Constructs a new {@code Hashtable} using the default capacity and load
115 * Constructs a new {@code Hashtable} using the specified capacity and the
118 * @param capacity
119 * the initial capacity.
121 public Hashtable(int capacity) {
1129 int capacity = stream.readInt(); local
[all...] |
| HashMap.java | 59 * Min capacity (other than zero) for a HashMap. Must be a power of two
65 * Max capacity for a HashMap. Must be a power of two >= MINIMUM_CAPACITY.
70 * An empty table shared by all zero-capacity maps (typically from default
114 * The value of this field is generally .75 * capacity, except when
115 * the capacity is zero, as described in the EMPTY_TABLE declaration
135 * Constructs a new {@code HashMap} instance with the specified capacity.
137 * @param capacity
138 * the initial capacity of this hash map.
140 * when the capacity is less than zero.
142 public HashMap(int capacity) {
1030 int capacity = stream.readInt(); local
[all...] |
| /external/stlport/stlport/stl/debug/ |
| _string.h | 76 if (this->capacity() > __old_capacity) {
193 // Size, capacity, etc.
199 if (__n > capacity())
206 size_type capacity() const { return _M_non_dbg_impl.capacity(); } function in class:basic_string
209 if (__s > capacity()) _Invalidate_all();
246 size_type __old_capacity = capacity();
258 size_type __old_capacity = capacity();
266 size_type __old_capacity = capacity();
274 size_type __old_capacity = capacity();
[all...] |
| /ndk/sources/android/stlport/stlport/stl/debug/ |
| _string.h | 76 if (this->capacity() > __old_capacity) {
193 // Size, capacity, etc.
199 if (__n > capacity())
206 size_type capacity() const { return _M_non_dbg_impl.capacity(); } function in class:basic_string
209 if (__s > capacity()) _Invalidate_all();
246 size_type __old_capacity = capacity();
258 size_type __old_capacity = capacity();
266 size_type __old_capacity = capacity();
274 size_type __old_capacity = capacity();
[all...] |
| /external/webkit/WebCore/icu/unicode/ |
| uscript.h | 96 * If required capacity is greater than capacity of the destination buffer then the error code
97 * is set to U_BUFFER_OVERFLOW_ERROR and the required capacity is returned
105 * @param capacity the capacity (size) fo UScriptCode buffer passed in.
111 uscript_getCode(const char* nameOrAbbrOrLocale,UScriptCode* fillIn,int32_t capacity,UErrorCode *err);
|
| /external/webkit/WebKit/mac/icu/unicode/ |
| uscript.h | 96 * If required capacity is greater than capacity of the destination buffer then the error code
97 * is set to U_BUFFER_OVERFLOW_ERROR and the required capacity is returned
105 * @param capacity the capacity (size) fo UScriptCode buffer passed in.
111 uscript_getCode(const char* nameOrAbbrOrLocale,UScriptCode* fillIn,int32_t capacity,UErrorCode *err);
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| LinkedBlockingQueue.java | 34 * <p> The optional capacity bound constructor argument serves as a
35 * way to prevent excessive queue expansion. The capacity, if unspecified,
38 * queue above capacity.
105 /** The capacity bound, or Integer.MAX_VALUE if none */
106 private final int capacity; field in class:LinkedBlockingQueue
215 * Creates a {@code LinkedBlockingQueue} with a capacity of
223 * Creates a {@code LinkedBlockingQueue} with the given (fixed) capacity.
225 * @param capacity the capacity of this queue
226 * @throws IllegalArgumentException if {@code capacity} is not greate
[all...] |
| /external/chromium/third_party/icu/source/common/ |
| uvectr32.cpp | 28 capacity(0),
37 capacity(0),
58 capacity = initialCapacity;
195 if (capacity >= minimumCapacity) {
202 int32_t newCap = capacity * 2;
216 capacity = newCap;
226 if (capacity <= maxCapacity || maxCapacity == 0) {
227 // Current capacity is within the new limit.
231 // New maximum capacity is smaller than the current size.
240 capacity = maxCapacity
[all...] |
| unorm_it.c | 50 * capacity: length of allocated arrays
52 int32_t capacity; member in struct:UNormIterator
78 api->start=api->index=api->limit=uni->capacity;
83 api->start=api->index=api->limit=uni->capacity/2;
89 reallocArrays(UNormIterator *uni, int32_t capacity, UBool addAtStart) {
97 states=(uint32_t *)uprv_malloc((capacity+1)*4+capacity*2);
102 chars=(UChar *)(states+(capacity+1));
103 uni->capacity=capacity;
194 int32_t limit, capacity, room; local
264 int32_t start, capacity, room; local
[all...] |
| uscript.c | 30 int32_t capacity,
40 if(nameOrAbbrOrLocale==NULL || fillIn == NULL || capacity<0){
65 if(numFilled<=capacity){
88 if(numFilled<=capacity){
|
| /external/icu4c/tools/toolutil/ |
| toolutil.cpp | 206 int32_t capacity, maxCapacity, size, idx; member in struct:UToolMemory
227 mem->capacity=initialCapacity;
257 utm_hasCapacity(UToolMemory *mem, int32_t capacity) {
258 if(mem->capacity<capacity) {
261 if(mem->maxCapacity<capacity) {
268 if(capacity>=2*mem->capacity) {
269 newCapacity=capacity;
270 } else if(mem->capacity<=mem->maxCapacity/3)
[all...] |
| /external/chromium/sdch/open-vcdiff/src/ |
| output_string_test.cc | 58 const size_t initial_capacity = string_.capacity();
59 string_.resize(string_.capacity());
60 EXPECT_EQ(initial_capacity, string_.capacity());
62 EXPECT_LE(initial_capacity + 1, string_.capacity());
|
| /external/tinyxml/ |
| tinystr.cpp | 43 if (cap > capacity())
55 size_type cap = capacity();
75 if (newsize > capacity())
77 reserve (newsize + capacity());
|
| /external/webkit/JavaScriptCore/runtime/ |
| ArgList.cpp | 52 // capacity, all our values are allocated on the stack, and
54 // our Vector's inline capacity, though, our values move to the
66 if (m_vector.size() < m_vector.capacity()) {
73 m_vector.reserveCapacity(m_vector.capacity() * 4);
|
