Searched defs:capacity (Results 1 - 25 of 229) sorted by relevance

12345678910

/external/flac/libFLAC/include/private/
H A Dmd5.h36 size_t capacity; member in struct:__anon6051
/external/qemu/
H A Dqstring.h23 size_t capacity; member in struct:QString
/external/emma/core/java12/com/vladium/jcd/cls/attribute/
H A DAttributeElementFactory.java20 public static IExceptionHandlerTable newExceptionHandlerTable (final int capacity) argument
22 return new ExceptionHandlerTable (capacity);
H A DDeclaredExceptionTable.java97 DeclaredExceptionTable (final int capacity) argument
99 m_exceptions = capacity < 0 ? new IntVector () : new IntVector (capacity);
H A DExceptionHandlerTable.java103 ExceptionHandlerTable (final int capacity) argument
105 m_exceptions = capacity < 0 ? new ArrayList () : new ArrayList (capacity);
/external/icu4c/common/
H A Dustrfmt.c18 * @param capacity capacity of buffer
23 * capacity.
28 uprv_itou (UChar * buffer, int32_t capacity, argument
40 } while(i && length<capacity);
46 if(length<capacity){
H A Dbytestream.cpp27 CheckedArrayByteSink::CheckedArrayByteSink(char* outbuf, int32_t capacity) argument
28 : outbuf_(outbuf), capacity_(capacity < 0 ? 0 : capacity),
H A Dcharstr.cpp110 UBool CharString::ensureCapacity(int32_t capacity, argument
116 if(capacity>buffer.getCapacity()) {
118 desiredCapacityHint=capacity+buffer.getCapacity();
120 if( (desiredCapacityHint<=capacity || buffer.resize(desiredCapacityHint, len+1)==NULL) &&
121 buffer.resize(capacity, len+1)==NULL
/external/icu4c/i18n/
H A Dupluralrules.cpp36 UChar *keyword, int32_t capacity,
42 if (keyword == NULL ? capacity != 0 : capacity < 0) {
47 return result.extract(keyword, capacity, *status);
34 uplrules_select(const UPluralRules *uplrules, double number, UChar *keyword, int32_t capacity, UErrorCode *status) argument
H A Ducol_cnt.h55 int32_t capacity; member in struct:CntTable
/external/icu4c/test/intltest/
H A Dtextfile.h57 UBool ensureCapacity(int32_t capacity);
64 int32_t capacity; member in class:TextFile
/external/srec/portable/include/
H A DArrayListImpl.h52 * Actual capacity of the array.
54 size_t capacity; member in struct:ArrayListImpl_t
57 * Min capacity of the array.
H A Dphashtable.h30 * The default initial capacity of a hash table.
59 * The HashTable is implemented using an array of linked lists. The capacity
62 * vs the capacity of the table. The lower the load factor, the faster the
63 * look-up is. However, a lower load factor calls for a bigger capacity,
66 * When the load factor exceeds the maximum load factor, the capacity of the
68 * on the new capacity.
99 * Total capacity.
101 size_t capacity; member in struct:PHashTableArgs_t
121 * Creates an hash table. The hash table is created with specified capacity
/external/webkit/Source/WebKit2/Shared/
H A DMutableArray.cpp44 void MutableArray::reserveCapacity(unsigned capacity) argument
46 m_entries.reserveCapacity(capacity);
/external/emma/core/java12/com/vladium/jcd/cls/
H A DElementFactory.java21 public static IAttributeCollection newAttributeCollection (final int capacity) argument
23 return new AttributeCollection (capacity);
26 public static IConstantCollection newConstantCollection (final int capacity) argument
28 return new ConstantCollection (capacity);
31 public static IFieldCollection newFieldCollection (final int capacity) argument
33 return new FieldCollection (capacity);
36 public static IInterfaceCollection newInterfaceCollection (final int capacity) argument
38 return new InterfaceCollection (capacity);
41 public static IMethodCollection newMethodCollection (final int capacity) argument
43 return new MethodCollection (capacity);
[all...]
H A DInterfaceCollection.java99 InterfaceCollection (final int capacity) argument
101 m_interfaces = capacity < 0 ? new IntVector () : new IntVector (capacity);
/external/javassist/src/main/javassist/bytecode/
H A DLongVector.java38 public int capacity() { return objects.length * ASIZE; } method in class:LongVector
/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/h264/
H A DCharCache.java27 public CharCache(int capacity) { argument
28 cache = new char[capacity];
/external/srec/shared/include/
H A DCircularBuffer.h50 * 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 o
[all...]
/external/v8/src/
H A Dlist.h53 INLINE(explicit List(int capacity)) { Initialize(capacity); } argument
82 INLINE(int capacity() const) { return capacity_; }
142 INLINE(void Initialize(int capacity));
152 // Increase the capacity of a full list, and add an element.
/external/valgrind/main/drd/
H A Ddrd_vc.h67 unsigned capacity; /**< number of elements allocated for array vc. */ member in struct:__anon14466
/external/webkit/Source/WebCore/history/
H A DPageCache.h50 int capacity() { return m_capacity; } function in class:WebCore::PageCache
52 void add(PassRefPtr<HistoryItem>, Page*); // Prunes if capacity() is exceeded.
/external/webkit/Source/WebKit/chromium/src/
H A DWebCache.cpp57 size_t minDeadCapacity, size_t maxDeadCapacity, size_t capacity)
63 static_cast<unsigned int>(capacity));
83 result->capacity = cache->m_capacity;
56 setCapacities( size_t minDeadCapacity, size_t maxDeadCapacity, size_t capacity) argument
/external/zlib/src/contrib/dotzlib/DotZLib/
H A DCircularBuffer.cs27 public CircularBuffer(int capacity) argument
29 Debug.Assert( capacity > 0 );
30 _buffer = new byte[capacity];
31 _capacity = capacity;
/external/guava/guava/src/com/google/common/collect/
H A DQueues.java52 public static <E> ArrayBlockingQueue<E> newArrayBlockingQueue(int capacity) { argument
53 return new ArrayBlockingQueue<E>(capacity);
99 * Creates a {@code LinkedBlockingQueue} with the given (fixed) capacity.
101 * @param capacity the capacity of this queue
103 * @throws IllegalArgumentException if {@code capacity} is less than 1
105 public static <E> LinkedBlockingQueue<E> newLinkedBlockingQueue(int capacity) { argument
106 return new LinkedBlockingQueue<E>(capacity);

Completed in 650 milliseconds

12345678910