| /external/stlport/test/unit/ |
| vector_test.cpp | 30 CPPUNIT_TEST(capacity);
53 void capacity();
90 CPPUNIT_ASSERT( (*it).capacity() == 0 );
110 size_t v1Cap = v1.capacity();
111 size_t v2Cap = v2.capacity();
116 CPPUNIT_ASSERT( v1.capacity() == v2Cap );
120 CPPUNIT_ASSERT( v2.capacity() == v1Cap );
293 void VectorTest::capacity() function in class:VectorTest
298 CPPUNIT_ASSERT( v.capacity() == 0 );
300 CPPUNIT_ASSERT( v.capacity() >= 1 )
[all...] |
| mvctor_test.h | 45 size_t cur_capacity= vec_cont.capacity();
47 while (cur_capacity == vec_cont.capacity()) {
|
| /external/v8/src/ |
| hashmap.h | 89 // The capacity of the table. The implementation
91 // the table capacity.
92 uint32_t capacity() const { return capacity_; } function in class:v8::internal::HashMap
114 void Initialize(uint32_t capacity);
|
| /external/webkit/Source/JavaScriptCore/wtf/ |
| Deque.h | 62 size_t size() const { return m_start <= m_end ? m_end - m_start : m_end + m_buffer.capacity() - m_start; }
261 // In this implementation a capacity of 1 would confuse append() and
262 // other places that assume the index after capacity - 1 is 0.
263 ASSERT(m_buffer.capacity() != 1);
265 if (!m_buffer.capacity()) {
269 ASSERT(m_start < m_buffer.capacity());
270 ASSERT(m_end < m_buffer.capacity());
277 ASSERT(index <= m_buffer.capacity());
315 , m_buffer(other.m_buffer.capacity())
325 TypeOperations::uninitializedCopy(otherBuffer + m_start, otherBuffer + m_buffer.capacity(), m_buffer.buffer() + m_start)
[all...] |
| /frameworks/base/libs/utils/ |
| VectorImpl.cpp | 90 sb = SharedBuffer::alloc(capacity() * mItemSize);
101 size_t VectorImpl::capacity() const function in class:android::VectorImpl
294 LOG_ASSERT(index<capacity(),
295 "[%p] editItemLocation: index=%d, capacity=%d, count=%d",
296 this, (int)index, (int)capacity(), (int)mCount);
306 LOG_ASSERT(index<capacity(),
307 "[%p] itemLocation: index=%d, capacity=%d, count=%d",
308 this, (int)index, (int)capacity(), (int)mCount);
318 size_t current_capacity = capacity();
321 // we can't reduce the capacity
[all...] |
| /libcore/luni/src/main/java/java/nio/ |
| DoubleBuffer.java | 42 * @param capacity
43 * the capacity of the new buffer.
46 * if {@code capacity} is less than zero.
48 public static DoubleBuffer allocate(int capacity) {
49 if (capacity < 0) {
52 return new ReadWriteDoubleArrayBuffer(capacity);
73 * {@code start + doubleCount}, capacity will be the length of the array.
95 DoubleBuffer(int capacity) {
96 super(3, capacity, null);
111 * buffer is read-only itself. The new buffer's position, limit, capacity
[all...] |
| FloatBuffer.java | 41 * @param capacity
42 * the capacity of the new buffer.
45 * if {@code capacity} is less than zero.
47 public static FloatBuffer allocate(int capacity) {
48 if (capacity < 0) {
51 return new ReadWriteFloatArrayBuffer(capacity);
72 * {@code start + floatCount}, capacity will be the length of the array.
96 FloatBuffer(int capacity) {
97 super(2, capacity, null);
112 * buffer is read-only itself. The new buffer's position, limit, capacity
[all...] |
| IntBuffer.java | 39 * @param capacity
40 * the capacity of the new buffer.
43 * if {@code capacity} is less than zero.
45 public static IntBuffer allocate(int capacity) {
46 if (capacity < 0) {
49 return new ReadWriteIntArrayBuffer(capacity);
70 * {@code start + intCount}, capacity will be the length of the array.
92 IntBuffer(int capacity) {
93 super(2, capacity, null);
108 * is read-only itself. The new buffer's position, limit, capacity and mar
[all...] |
| LongBuffer.java | 41 * @param capacity
42 * the capacity of the new buffer.
45 * if {@code capacity} is less than zero.
47 public static LongBuffer allocate(int capacity) {
48 if (capacity < 0) {
51 return new ReadWriteLongArrayBuffer(capacity);
72 * {@code start + longCount}, capacity will be the length of the array.
94 LongBuffer(int capacity) {
95 super(3, capacity, null);
110 * buffer is read-only itself. The new buffer's position, limit, capacity
[all...] |
| ShortBuffer.java | 41 * @param capacity
42 * the capacity of the new buffer.
45 * if {@code capacity} is less than zero.
47 public static ShortBuffer allocate(int capacity) {
48 if (capacity < 0) {
51 return new ReadWriteShortArrayBuffer(capacity);
72 * {@code start + shortCount}, capacity will be the length of the array.
94 ShortBuffer(int capacity) {
95 super(1, capacity, null);
110 * buffer is read-only itself. The new buffer's position, limit, capacity
[all...] |
| BaseByteBuffer.java | 25 protected BaseByteBuffer(int capacity, MemoryBlock block) {
26 super(capacity, block);
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| vector_test.cpp | 30 CPPUNIT_TEST(capacity);
53 void capacity();
90 CPPUNIT_ASSERT( (*it).capacity() == 0 );
110 size_t v1Cap = v1.capacity();
111 size_t v2Cap = v2.capacity();
116 CPPUNIT_ASSERT( v1.capacity() == v2Cap );
120 CPPUNIT_ASSERT( v2.capacity() == v1Cap );
293 void VectorTest::capacity() function in class:VectorTest
298 CPPUNIT_ASSERT( v.capacity() == 0 );
300 CPPUNIT_ASSERT( v.capacity() >= 1 )
[all...] |
| mvctor_test.h | 45 size_t cur_capacity= vec_cont.capacity();
47 while (cur_capacity == vec_cont.capacity()) {
|
| /ndk/tests/device/test-stlport/unit/ |
| vector_test.cpp | 30 CPPUNIT_TEST(capacity);
53 void capacity();
90 CPPUNIT_ASSERT( (*it).capacity() == 0 );
110 size_t v1Cap = v1.capacity();
111 size_t v2Cap = v2.capacity();
116 CPPUNIT_ASSERT( v1.capacity() == v2Cap );
120 CPPUNIT_ASSERT( v2.capacity() == v1Cap );
293 void VectorTest::capacity() function in class:VectorTest
298 CPPUNIT_ASSERT( v.capacity() == 0 );
300 CPPUNIT_ASSERT( v.capacity() >= 1 )
[all...] |
| mvctor_test.h | 45 size_t cur_capacity= vec_cont.capacity();
47 while (cur_capacity == vec_cont.capacity()) {
|
| /system/core/libpixelflinger/tinyutils/ |
| VectorImpl.cpp | 91 sb = SharedBuffer::alloc(capacity() * mItemSize);
102 size_t VectorImpl::capacity() const function in class:android::VectorImpl
220 LOG_ASSERT(index<capacity(),
221 "[%p] itemLocation: index=%d, capacity=%d, count=%d",
222 this, (int)index, (int)capacity(), (int)mCount);
232 LOG_ASSERT(index<capacity(),
233 "[%p] editItemLocation: index=%d, capacity=%d, count=%d",
234 this, (int)index, (int)capacity(), (int)mCount);
244 size_t current_capacity = capacity();
247 // we can't reduce the capacity
[all...] |
| /external/icu4c/common/unicode/ |
| uscript.h | 229 * If required capacity is greater than capacity of the destination buffer then the error code
230 * is set to U_BUFFER_OVERFLOW_ERROR and the required capacity is returned
238 * @param capacity the capacity (size) fo UScriptCode buffer passed in.
244 uscript_getCode(const char* nameOrAbbrOrLocale,UScriptCode* fillIn,int32_t capacity,UErrorCode *err);
304 * If there are more than capacity script codes to be written, then
312 * @param capacity capacity of the scripts array
318 * written to scripts unless U_BUFFER_OVERFLOW_ERROR indicates insufficient capacity
[all...] |
| /external/icu4c/common/ |
| unistr_cnv.cpp | 159 int32_t capacity; local
161 // Assume that the capacity is real and a limit pointer won't wrap around.
162 capacity = (int32_t)dstSize;
164 // Pin the capacity so that a limit pointer does not wrap around.
168 capacity = (int32_t)(targetLimit - target);
177 return u_terminateChars(target, capacity, 0, &status);
185 return toUTF8(start, length, target, capacity);
191 if(length <= capacity) {
194 destLength = capacity;
197 return u_terminateChars(target, capacity, length, &status)
[all...] |
| uloc_tag.c | 923 _appendLanguageToLanguageTag(const char* localeID, char* appendAt, int32_t capacity, UBool strict, UErrorCode* status) {
945 if (reslen < capacity) {
946 uprv_memcpy(appendAt + reslen, LANG_UND, uprv_min(LANG_UND_LEN, capacity - reslen));
955 if (reslen < capacity) {
956 uprv_memcpy(appendAt + reslen, LANG_UND, uprv_min(LANG_UND_LEN, capacity - reslen));
968 if (reslen < capacity) {
969 uprv_memcpy(appendAt + reslen, buf, uprv_min(len, capacity - reslen));
973 u_terminateChars(appendAt, capacity, reslen, status);
978 _appendScriptToLanguageTag(const char* localeID, char* appendAt, int32_t capacity, UBool strict, UErrorCode* status) {
1004 if (reslen < capacity) {
[all...] |
| /external/icu4c/test/intltest/ |
| textfile.h | 57 UBool ensureCapacity(int32_t capacity);
64 int32_t capacity; member in class:TextFile
|
| /external/webkit/Source/WebKit2/Shared/ |
| MutableArray.cpp | 44 void MutableArray::reserveCapacity(unsigned capacity)
46 m_entries.reserveCapacity(capacity);
|
| /frameworks/base/media/java/android/mtp/ |
| MtpStorageInfo.java | 47 * Returns the maximum storage capacity for the storage unit in bytes
49 * @return the maximum capacity
|
| /libcore/luni/src/main/java/org/apache/harmony/luni/lang/reflect/ |
| ListOfTypes.java | 29 ListOfTypes(int capacity) {
30 types = new ArrayList<Type>(capacity);
|
| /external/emma/core/java12/com/vladium/util/ |
| IntVector.java | 125 final int capacity = m_values.length; local
126 if (capacity == m_size)
128 final int [] values = new int [1 + (capacity << 1)];
129 if (capacity < COPY_THRESHOLD)
131 for (int i = 0; i < capacity; ++ i) values [i] = m_values [i];
135 System.arraycopy (m_values, 0, values, 0, capacity);
|
| /external/qemu/android/utils/ |
| intmap.c | 30 int capacity; member in struct:AIntMap
46 map->capacity = 4;
63 map->capacity = 0;
99 int oldCapacity = map->capacity;
120 map->capacity = newCapacity;
142 if (map->size >= map->capacity)
|
