| /external/emma/core/java12/com/vladium/jcd/cls/ |
| ElementFactory.java | 21 public static IAttributeCollection newAttributeCollection (final int capacity)
23 return new AttributeCollection (capacity);
26 public static IConstantCollection newConstantCollection (final int capacity)
28 return new ConstantCollection (capacity);
31 public static IFieldCollection newFieldCollection (final int capacity)
33 return new FieldCollection (capacity);
36 public static IInterfaceCollection newInterfaceCollection (final int capacity)
38 return new InterfaceCollection (capacity);
41 public static IMethodCollection newMethodCollection (final int capacity)
43 return new MethodCollection (capacity);
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/vector/vector.capacity/ |
| capacity.pass.cpp | 12 // size_type capacity() const;
21 assert(v.capacity() == 0);
25 assert(v.capacity() == 100);
27 assert(v.capacity() > 101);
|
| reserve.pass.cpp | 23 assert(v.capacity() >= 10);
27 assert(v.capacity() == 100);
30 assert(v.capacity() == 100);
33 assert(v.capacity() == 150);
37 assert(v.capacity() == 100);
40 assert(v.capacity() == 100);
43 assert(v.capacity() == 150);
|
| resize_size.pass.cpp | 26 assert(v.capacity() == 100);
29 assert(v.capacity() >= 200);
35 assert(v.capacity() == 100);
38 assert(v.capacity() >= 200);
45 assert(v.capacity() == 100);
48 assert(v.capacity() >= 200);
54 assert(v.capacity() == 100);
57 assert(v.capacity() >= 200);
|
| swap.pass.cpp | 24 assert(v1.capacity() == 200);
26 assert(v2.capacity() == 100);
|
| shrink_to_fit.pass.cpp | 24 assert(v.capacity() == 101);
31 assert(v.capacity() == 101);
38 assert(v.capacity() == 200);
|
| resize_size_value.pass.cpp | 24 assert(v.capacity() == 100);
28 assert(v.capacity() >= 200);
38 assert(v.capacity() == 100);
41 assert(v.capacity() >= 200);
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/vector.bool/ |
| capacity.pass.cpp | 13 // size_type capacity() const;
22 assert(v.capacity() == 0);
26 assert(v.capacity() >= 100);
28 assert(v.capacity() >= 101);
|
| reserve.pass.cpp | 23 assert(v.capacity() >= 10);
27 assert(v.capacity() >= 100);
30 assert(v.capacity() >= 100);
33 assert(v.capacity() >= 150);
|
| resize_size.pass.cpp | 24 assert(v.capacity() >= 100);
27 assert(v.capacity() >= 200);
|
| shrink_to_fit.pass.cpp | 24 assert(v.capacity() >= 101);
|
| /external/emma/core/java12/com/vladium/jcd/cls/attribute/ |
| AttributeElementFactory.java | 20 public static IExceptionHandlerTable newExceptionHandlerTable (final int capacity)
22 return new ExceptionHandlerTable (capacity);
|
| /frameworks/av/media/libstagefright/foundation/ |
| ABuffer.cpp | 25 ABuffer::ABuffer(size_t capacity)
26 : mData(malloc(capacity)),
27 mCapacity(capacity),
29 mRangeLength(capacity),
34 ABuffer::ABuffer(void *data, size_t capacity)
36 mCapacity(capacity),
38 mRangeLength(capacity),
|
| /libcore/luni/src/main/java/java/util/ |
| LinkedHashSet.java | 49 * capacity.
51 * @param capacity
52 * the initial capacity of this {@code LinkedHashSet}.
54 public LinkedHashSet(int capacity) {
55 super(new LinkedHashMap<E, HashSet<E>>(capacity));
60 * capacity and load factor.
62 * @param capacity
63 * the initial capacity.
67 public LinkedHashSet(int capacity, float loadFactor) {
68 super(new LinkedHashMap<E, HashSet<E>>(capacity, loadFactor))
[all...] |
| /external/icu4c/common/ |
| 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.h | 14 uprv_itou (UChar * buffer, int32_t capacity, uint32_t i, uint32_t radix, int32_t minwidth);
|
| /external/webkit/Source/WebKit2/Shared/ |
| MutableArray.cpp | 44 void MutableArray::reserveCapacity(unsigned capacity)
46 m_entries.reserveCapacity(capacity);
|
| /external/icu4c/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...] |
| /external/srec/shared/include/ |
| CircularBuffer.h | 50 * Total buffer capacity.
52 size_t capacity; member in struct:CircularBuffer_t
73 * Creates a circular buffer of the specified capacity.
75 * @param capacity the capacity in number of bytes of the data buffer.
79 ESR_SHARED_API ESR_ReturnCode CircularBufferCreate(size_t capacity, const LCHAR* mtag, CircularBuffer** buffer);
82 * Returns the capacity of the buffer.
84 #define CircularBufferGetCapacity(buffer) ((buffer)->capacity + 0)
99 #define CircularBufferIsFull(buffer) ((buffer)->size == (buffer)->capacity)
109 * Determines the residual capacity of the circular buffer
[all...] |
| /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...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/strings/basic.string/string.capacity/ |
| shrink_to_fit.pass.cpp | 21 typename S::size_type old_cap = s.capacity();
26 assert(s.capacity() <= old_cap);
27 assert(s.capacity() >= s.size());
|
| /external/icu4c/i18n/ |
| upluralrules.cpp | 41 UChar *keyword, int32_t capacity,
47 if (keyword == NULL ? capacity != 0 : capacity < 0) {
52 return result.extract(keyword, capacity, *status);
|
| /external/icu4c/tools/toolutil/ |
| denseranges.h | 23 * Does it make sense to write 1..capacity ranges?
30 * @param capacity Maximum number of ranges.
31 * @return Minimum number of ranges (at most capacity) that have the desired density,
37 int32_t ranges[][2], int32_t capacity);
|
| /external/llvm/include/llvm/Support/ |
| Capacity.h | 1 //===--- Capacity.h - Generic computation of ADT memory use -----*- C++ -*-===//
10 // This file defines the capacity function that computes the amount of
24 // This default definition of capacity should work for things like std::vector
26 return x.capacity() * sizeof(typename T::value_type);
|
| /external/webkit/Tools/TestWebKitAPI/Tests/WTF/ |
| VectorBasic.cpp | 37 TEST_ASSERT(intVector.capacity() == 0);
|
