| /external/testng/src/test/java/test/morten/ |
| SampleTest.java | 7 private int capacity = 10; field in class:SampleTest
24 public SampleTest(int capacity, float loadFactor)
26 System.out.println("CREATING TEST WITH " + capacity);
27 this.capacity=capacity;
34 //HashMap hashTable = new HashMap(capacity, loadFactor);
|
| /external/libgdx/backends/gdx-backends-gwt/src/com/badlogic/gdx/backends/gwt/emu/java/nio/ |
| BufferFactory.java | 35 /** Returns a new array based byte buffer with the specified capacity.
37 * @param capacity The capacity of the new buffer
38 * @return A new array based byte buffer with the specified capacity. */
39 public static ByteBuffer newByteBuffer (int capacity) {
40 return new ReadWriteHeapByteBuffer(capacity);
59 /** Returns a new array based char buffer with the specified capacity.
61 * @param capacity The capacity of the new buffer
62 * @return A new array based char buffer with the specified capacity. *
[all...] |
| /frameworks/base/tests/AccessoryDisplay/common/src/com/android/accessorydisplay/common/ |
| BufferPool.java | 68 int capacity = buffer.capacity(); local
69 if (capacity < needed) {
71 capacity = chooseCapacity(capacity, needed);
72 buffer = ByteBuffer.allocate(capacity);
79 private int chooseCapacity(int capacity, int needed) {
80 while (capacity < needed) {
81 capacity *= 2;
83 if (capacity > mMaxBufferSize)
[all...] |
| /external/icu/icu4c/source/layoutex/ |
| RunArrays.cpp | 50 void RunArray::init(le_int32 capacity)
52 fLimits = LE_NEW_ARRAY(le_int32, capacity);
92 void FontRuns::init(le_int32 capacity)
94 RunArray::init(capacity);
95 fFonts = LE_NEW_ARRAY(const LEFontInstance *, capacity);
98 void FontRuns::grow(le_int32 capacity)
100 RunArray::grow(capacity);
101 fFonts = (const LEFontInstance **) LE_GROW_ARRAY(fFonts, capacity);
144 void LocaleRuns::init(le_int32 capacity)
146 RunArray::init(capacity);
[all...] |
| /frameworks/av/media/libstagefright/foundation/ |
| ABuffer.cpp | 26 ABuffer::ABuffer(size_t capacity)
31 mData = malloc(capacity);
36 mCapacity = capacity;
37 mRangeLength = capacity;
41 ABuffer::ABuffer(void *data, size_t capacity)
44 mCapacity(capacity),
46 mRangeLength(capacity),
52 sp<ABuffer> ABuffer::CreateAsCopy(const void *data, size_t capacity)
54 sp<ABuffer> res = new ABuffer(capacity);
58 memcpy(res->data(), data, capacity);
[all...] |
| /external/icu/icu4c/source/common/ |
| uscript.c | 28 UScriptCode *dest, int32_t capacity, UErrorCode *err) {
31 if(length > capacity) {
42 setOneCode(UScriptCode script, UScriptCode *scripts, int32_t capacity, UErrorCode *err) {
44 if(1 > capacity) {
54 UScriptCode *scripts, int32_t capacity, UErrorCode *err) {
67 return setCodes(JAPANESE, UPRV_LENGTHOF(JAPANESE), scripts, capacity, err);
70 return setCodes(KOREAN, UPRV_LENGTHOF(KOREAN), scripts, capacity, err);
77 return setCodes(HAN_BOPO, UPRV_LENGTHOF(HAN_BOPO), scripts, capacity, err);
86 return setOneCode(scriptCode, scripts, capacity, err);
96 int32_t capacity,
[all...] |
| ustrfmt.h | 14 uprv_itou (UChar * buffer, int32_t capacity, uint32_t i, uint32_t radix, int32_t minwidth);
|
| utrace.c | 88 static void outputChar(char c, char *outBuf, int32_t *outIx, int32_t capacity, int32_t indent) {
93 * 3. When preflighting buffer len (buffer capacity is exceeded), when
100 (c!='\n' && c!=0 && *outIx < capacity && outBuf[(*outIx)-1]=='\n') || /* case 2. */
101 (c=='\n' && *outIx>=capacity)) /* case 3 */
105 if (*outIx < capacity) {
112 if (*outIx < capacity) {
124 char *outBuf, int32_t *outIx, int32_t capacity) {
129 outputChar(c, outBuf, outIx, capacity, 0);
134 static void outputPtrBytes(void *val, char *outBuf, int32_t *outIx, int32_t capacity) {
148 outputHexBytes(*p, 2, outBuf, outIx, capacity);
[all...] |
| ustrfmt.c | 18 * @param capacity capacity of buffer
23 * capacity.
28 uprv_itou (UChar * buffer, int32_t capacity,
40 } while(i && length<capacity);
46 if(length<capacity){
|
| /external/icu/icu4c/source/i18n/ |
| upluralrules.cpp | 41 UChar *keyword, int32_t capacity,
47 if (keyword == NULL ? capacity != 0 : capacity < 0) {
52 return result.extract(keyword, capacity, *status);
|
| collationdatawriter.h | 32 int32_t indexes[], uint8_t *dest, int32_t capacity,
36 int32_t indexes[], uint8_t *dest, int32_t capacity,
45 int32_t indexes[], uint8_t *dest, int32_t capacity,
|
| /external/libcxx/test/std/containers/sequences/vector/vector.capacity/ |
| reserve.pass.cpp | 25 assert(v.capacity() >= 10);
30 assert(v.capacity() == 100);
33 assert(v.capacity() == 100);
36 assert(v.capacity() == 150);
41 assert(v.capacity() == 100);
44 assert(v.capacity() == 100);
47 assert(v.capacity() == 150);
54 assert(v.capacity() >= 10);
59 assert(v.capacity() == 100);
62 assert(v.capacity() == 100)
[all...] |
| capacity.pass.cpp | 12 // size_type capacity() const;
24 assert(v.capacity() == 0);
29 assert(v.capacity() == 100);
31 assert(v.capacity() > 101);
37 assert(v.capacity() == 0);
42 assert(v.capacity() == 100);
44 assert(v.capacity() > 101);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.capacity/ |
| reserve.pass.cpp | 25 assert(v.capacity() >= 10);
30 assert(v.capacity() == 100);
33 assert(v.capacity() == 100);
36 assert(v.capacity() == 150);
41 assert(v.capacity() == 100);
44 assert(v.capacity() == 100);
47 assert(v.capacity() == 150);
54 assert(v.capacity() >= 10);
59 assert(v.capacity() == 100);
62 assert(v.capacity() == 100)
[all...] |
| capacity.pass.cpp | 12 // size_type capacity() const;
24 assert(v.capacity() == 0);
29 assert(v.capacity() == 100);
31 assert(v.capacity() > 101);
37 assert(v.capacity() == 0);
42 assert(v.capacity() == 100);
44 assert(v.capacity() > 101);
|
| /external/clang/test/Rewriter/ |
| rewrite-nest.m | 10 NSUInteger capacity;
22 while (mapTable->capacity) {
|
| /external/guava/guava-tests/benchmark/com/google/common/util/concurrent/ |
| MonitorBenchmark.java | 33 @Param({"10", "100", "1000"}) int capacity; field in class:MonitorBenchmark
47 queue = (BlockingQueue<String>) constructor.newInstance(capacity);
49 strings = new String[capacity];
50 for (int i = 0; i < capacity; i++) {
56 int capacity = this.capacity; local
60 for (int j = 0; j < capacity; j++) {
63 for (int j = 0; j < capacity; j++) {
|
| /external/libcxx/test/std/containers/sequences/vector.bool/ |
| reserve.pass.cpp | 25 assert(v.capacity() >= 10);
29 assert(v.capacity() >= 100);
32 assert(v.capacity() >= 100);
35 assert(v.capacity() >= 150);
41 assert(v.capacity() >= 10);
45 assert(v.capacity() >= 100);
48 assert(v.capacity() >= 100);
51 assert(v.capacity() >= 150);
|
| capacity.pass.cpp | 13 // size_type capacity() const;
24 assert(v.capacity() == 0);
28 assert(v.capacity() >= 100);
30 assert(v.capacity() >= 101);
35 assert(v.capacity() == 0);
39 assert(v.capacity() >= 100);
41 assert(v.capacity() >= 101);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector.bool/ |
| reserve.pass.cpp | 25 assert(v.capacity() >= 10);
29 assert(v.capacity() >= 100);
32 assert(v.capacity() >= 100);
35 assert(v.capacity() >= 150);
41 assert(v.capacity() >= 10);
45 assert(v.capacity() >= 100);
48 assert(v.capacity() >= 100);
51 assert(v.capacity() >= 150);
|
| capacity.pass.cpp | 13 // size_type capacity() const;
24 assert(v.capacity() == 0);
28 assert(v.capacity() >= 100);
30 assert(v.capacity() >= 101);
35 assert(v.capacity() == 0);
39 assert(v.capacity() >= 100);
41 assert(v.capacity() >= 101);
|
| /external/webrtc/webrtc/base/ |
| buffer_unittest.cc | 26 void TestBuf(const Buffer& b1, size_t size, size_t capacity) {
28 EXPECT_EQ(b1.capacity(), capacity);
49 EXPECT_EQ(buf.capacity(), 7u);
56 EXPECT_EQ(buf.capacity(), 14u);
63 EXPECT_EQ(buf.capacity(), 16u);
70 EXPECT_EQ(buf2.capacity(), 16u);
88 EXPECT_EQ(buf.capacity(), 9u);
104 EXPECT_EQ(buf.capacity(), 15u); // Hasn't shrunk.
112 EXPECT_EQ(buf.capacity(), 15u)
[all...] |
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_dynarray.h | 36 * Also, size <= capacity and data != 0 if and only if capacity != 0
37 * capacity will always be the allocation size of data
43 unsigned capacity; member in struct:util_dynarray
67 if(newsize > buf->capacity)
69 unsigned newcap = buf->capacity << 1;
72 buf->data = REALLOC(buf->data, buf->capacity, newcap);
73 buf->capacity = newcap;
90 if (buf->size != buf->capacity) {
92 buf->data = REALLOC(buf->data, buf->capacity, buf->size)
[all...] |
| /external/libgdx/gdx/src/com/badlogic/gdx/graphics/g3d/particles/batches/ |
| BufferedParticleBatch.java | 43 public void ensureCapacity(int capacity){
44 if(currentCapacity >= capacity) return;
45 sorter.ensureCapacity(capacity);
46 allocParticlesData(capacity);
47 currentCapacity = capacity;
54 protected abstract void allocParticlesData(int capacity);
|
| /external/compiler-rt/test/asan/TestCases/ |
| contiguous_container.cc | 11 void TestContainer(size_t capacity) {
12 char *beg = new char[capacity];
13 char *end = beg + capacity;
14 char *mid = beg + capacity;
18 size_t size = rand() % (capacity + 1);
19 assert(size <= capacity);
26 for (size_t idx = size; idx < capacity; idx++)
45 for (size_t idx = 0; idx < capacity; idx++)
|
