| /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/apache-harmony/nio/src/test/java/common/org/apache/harmony/nio/tests/java/nio/ |
| AbstractBufferTest.java | 43 && baseBuf.limit() <= baseBuf.capacity());
54 assertEquals(baseBuf.limit(), baseBuf.capacity());
111 && baseBuf.limit() <= baseBuf.capacity());
126 baseBuf.limit(baseBuf.capacity());
127 assertEquals(baseBuf.limit(), baseBuf.capacity());
133 if (baseBuf.capacity() > 0) {
134 baseBuf.limit(baseBuf.capacity());
135 baseBuf.position(baseBuf.capacity());
137 baseBuf.limit(baseBuf.capacity() - 1);
156 baseBuf.limit(baseBuf.capacity() + 1)
[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 | 40 * Min capacity (other than zero) for a Hashtable. Must be a power of two
46 * Max capacity for a Hashtable. Must be a power of two >= MINIMUM_CAPACITY.
51 * An empty table shared by all zero-capacity maps (typically from default
89 * The value of this field is generally .75 * capacity, except when
90 * the capacity is zero, as described in the EMPTY_TABLE declaration
101 * Constructs a new {@code Hashtable} using the default capacity and load
111 * Constructs a new {@code Hashtable} using the specified capacity and the
114 * @param capacity
115 * the initial capacity.
117 public Hashtable(int capacity) {
1119 int capacity = stream.readInt(); local
[all...] |
| HashMap.java | 55 * Min capacity (other than zero) for a HashMap. Must be a power of two
61 * Max capacity for a HashMap. Must be a power of two >= MINIMUM_CAPACITY.
66 * An empty table shared by all zero-capacity maps (typically from default
110 * The value of this field is generally .75 * capacity, except when
111 * the capacity is zero, as described in the EMPTY_TABLE declaration
131 * Constructs a new {@code HashMap} instance with the specified capacity.
133 * @param capacity
134 * the initial capacity of this hash map.
136 * when the capacity is less than zero.
138 public HashMap(int capacity) {
1020 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/cxx-stl/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...] |
| /prebuilt/ndk/android-ndk-r5/sources/cxx-stl/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...] |
| /prebuilt/ndk/android-ndk-r6/sources/cxx-stl/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/Source/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/Source/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/icu4c/tools/toolutil/ |
| toolutil.cpp | 212 int32_t capacity, maxCapacity, size, idx; member in struct:UToolMemory
233 mem->capacity=initialCapacity;
263 utm_hasCapacity(UToolMemory *mem, int32_t capacity) {
264 if(mem->capacity<capacity) {
267 if(mem->maxCapacity<capacity) {
274 if(capacity>=2*mem->capacity) {
275 newCapacity=capacity;
276 } 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/icu4c/common/ |
| 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/tinyxml/ |
| tinystr.cpp | 43 if (cap > capacity())
55 size_type cap = capacity();
75 if (newsize > capacity())
77 reserve (newsize + capacity());
|
| /external/webkit/Source/JavaScriptCore/runtime/ |
| ArgList.cpp | 54 // capacity, all our values are allocated on the stack, and
56 // our Vector's inline capacity, though, our values move to the
68 if (m_vector.size() < m_vector.capacity()) {
75 m_vector.reserveCapacity(m_vector.capacity() * 4);
|
| /system/core/libcutils/ |
| buffer.h | 50 size_t capacity; member in struct:__anon25777
64 * Creates a new buffer with the given initial capacity.
71 Buffer* bufferWrap(char* data, size_t capacity, size_t size);
79 * Prepares buffer to read 'expected' number of bytes. Expands capacity if
|
| /system/media/mca/filterfw/native/core/ |
| native_frame.h | 52 // Resize the frame. You can only resize to a size that fits within the frame's capacity.
61 // Returns the capacity of the frame in bytes.
62 int Capacity() {
76 // Capacity of data buffer in bytes.
|
| /libcore/luni/src/main/java/java/nio/ |
| Buffer.java | 24 * <li>Capacity: the number of elements a buffer can hold. Capacity may not be
32 * and not greater than capacity.</li>
54 * The capacity of this buffer, which never changes.
56 final int capacity; field in class:Buffer
60 * Limit must be no less than zero and no greater than <code>capacity</code>.
97 Buffer(int elementSizeShift, int capacity, MemoryBlock block) {
99 if (capacity < 0) {
100 throw new IllegalArgumentException("capacity < 0: " + capacity);
147 public final int capacity() { method in class:Buffer
[all...] |
| HeapByteBuffer.java | 47 HeapByteBuffer(int capacity) {
48 this(new byte[capacity], capacity, 0);
51 HeapByteBuffer(byte[] backingArray, int capacity, int offset) {
52 super(capacity, null);
55 if (offset + capacity > backingArray.length) {
57 ", capacity=" + capacity + ", offset=" + offset);
|
| /dalvik/vm/test/ |
| TestIndirectRefTable.cpp | 87 if (irt.capacity() != 0) {
119 if (irt.capacity() != 0) {
137 if (irt.capacity() != 3) {
138 LOGE("expected 3 entries, found %d", irt.capacity());
159 if (irt.capacity() != 0) {
183 if (irt.capacity() != 4) {
191 if (irt.capacity() != 3) {
199 if (irt.capacity() != 0) {
221 if (irt.capacity() != 0) {
245 if (irt.capacity() != 0)
[all...] |
| /external/javassist/src/main/javassist/scopedpool/ |
| SoftValueHashMap.java | 84 * capacity and the given load factor.
87 * The initial capacity of the <code>WeakHashMap</code>
93 * If the initial capacity is less than zero, or if the load
102 * capacity and the default load factor, which is <code>0.75</code>.
105 * The initial capacity of the <code>WeakHashMap</code>
108 * If the initial capacity is less than zero
116 * initial capacity and the default load factor, which is <code>0.75</code>.
125 * an initial capacity of twice the number of mappings in the specified map
|
| /external/srec/portable/src/ |
| ArrayListImpl.c | 60 impl->capacity = minCapacity;
78 if (impl->size >= impl->capacity)
81 size_t newCapacity = impl->capacity * 2;
86 impl->capacity = newCapacity;
122 if (impl->capacity > impl->minCapacity &&
123 impl->size <= impl->capacity / 4)
126 size_t newCapacity = impl->capacity / 2;
132 impl->capacity = newCapacity;
|
