/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...] |
/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/base/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/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 22 // This default definition of capacity should work for things like std::vector 24 return x.capacity() * sizeof(typename T::value_type);
|
/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/ |
DoubleArrayBuffer.java | 42 DoubleArrayBuffer(int capacity) { 43 this(capacity, new double[capacity], 0); 46 DoubleArrayBuffer(int capacity, double[] backingArray, int offset) { 47 super(capacity);
|
FloatArrayBuffer.java | 42 FloatArrayBuffer(int capacity) { 43 this(capacity, new float[capacity], 0); 46 FloatArrayBuffer(int capacity, float[] backingArray, int offset) { 47 super(capacity);
|
IntArrayBuffer.java | 42 IntArrayBuffer(int capacity) { 43 this(capacity, new int[capacity], 0); 46 IntArrayBuffer(int capacity, int[] backingArray, int offset) { 47 super(capacity);
|
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/webkit/Tools/TestWebKitAPI/Tests/WTF/ |
VectorBasic.cpp | 37 TEST_ASSERT(intVector.capacity() == 0);
|
/external/jsilver/src/com/google/clearsilver/jsilver/adaptor/ |
LoadPathToFileCache.java | 37 public LoadPathToFileCache(int capacity) { 38 cache = new LRUCache<String, String>(capacity); 116 private final int capacity; field in class:LoadPathToFileCache.LRUCache 118 LRUCache(int capacity) { 119 super(capacity, 0.75f, true); 120 this.capacity = capacity; 126 * Necessary to override because HashMap increases the capacity of the hashtable before 127 * inserting the elements. However, here we have set the max capacity already and will instead 128 * remove eldest elements instead of increasing capacity [all...] |
/frameworks/base/core/java/com/google/android/collect/ |
Lists.java | 59 int capacity = (elements.length * 110) / 100 + 5; local 60 ArrayList<E> list = new ArrayList<E>(capacity);
|
/external/apache-harmony/nio/src/test/java/common/org/apache/harmony/nio/tests/java/nio/ |
FloatBufferTest.java | 52 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); 54 loadTestData1(array, buf.arrayOffset(), buf.capacity()); 55 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); 57 loadTestData2(array, buf.arrayOffset(), buf.capacity()); 58 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); 61 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); 64 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); 69 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); 71 loadTestData1(array, buf.arrayOffset(), buf.capacity()); 72 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); [all...] |
IntBufferTest.java | 52 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); 54 loadTestData1(array, buf.arrayOffset(), buf.capacity()); 55 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); 57 loadTestData2(array, buf.arrayOffset(), buf.capacity()); 58 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); 61 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); 64 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); 69 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); 71 loadTestData1(array, buf.arrayOffset(), buf.capacity()); 72 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); [all...] |
LongBufferTest.java | 52 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); 54 loadTestData1(array, buf.arrayOffset(), buf.capacity()); 55 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); 57 loadTestData2(array, buf.arrayOffset(), buf.capacity()); 58 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); 61 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); 64 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); 69 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); 71 loadTestData1(array, buf.arrayOffset(), buf.capacity()); 72 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); [all...] |
ShortBufferTest.java | 51 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); 53 loadTestData1(array, buf.arrayOffset(), buf.capacity()); 54 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); 56 loadTestData2(array, buf.arrayOffset(), buf.capacity()); 57 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); 60 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); 63 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); 68 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); 70 loadTestData1(array, buf.arrayOffset(), buf.capacity()); 71 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); [all...] |
DoubleBufferTest.java | 76 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); 78 loadTestData1(array, buf.arrayOffset(), buf.capacity()); 79 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); 81 loadTestData2(array, buf.arrayOffset(), buf.capacity()); 82 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); 85 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); 88 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); 93 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); 95 loadTestData1(array, buf.arrayOffset(), buf.capacity()); 96 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity()); [all...] |
/external/emma/core/java12/com/vladium/util/ |
ByteArrayOStream.java | 39 $assert.ASSERT (initialCapacity >= 0, "negative initial capacity: " + initialCapacity); 52 final int capacity = pos + 2; local 56 if (mbuflen < capacity) 58 final byte [] newbuf = new byte [Math.max (mbuflen << 1, capacity)]; 70 m_pos = capacity; 76 final int capacity = pos + 3; local 80 if (mbuflen < capacity) 82 final byte [] newbuf = new byte [Math.max (mbuflen << 1, capacity)]; 95 m_pos = capacity; 101 final int capacity = pos + 4 local 226 public final int capacity () method in class:ByteArrayOStream 244 final int capacity = pos + 1; local 273 final int capacity = pos + length; local [all...] |
/external/srec/shared/src/ |
CircularBuffer.c | 34 ESR_ReturnCode CircularBufferCreate(size_t capacity, const LCHAR* mtag, CircularBuffer** buffer) 37 if (buffer == NULL || capacity <= 0) 40 Interface = (CircularBuffer *) MALLOC(sizeof(CircularBuffer) + capacity, mtag); 43 Interface->capacity = capacity; 68 nbRead = buffer->capacity - buffer-> readIdx; 74 if (buffer->readIdx == buffer->capacity) 101 if (buffer->readIdx >= buffer->capacity) 102 buffer->readIdx -= buffer->capacity; 113 size_t available = buffer->capacity - buffer->size [all...] |