/external/chromium/base/memory/ |
H A D | scoped_vector.h | 57 void reserve(size_t capacity) { v.reserve(capacity); } argument
|
/external/flac/libFLAC/ |
H A D | bitwriter.c | 74 * The default capacity here doesn't matter too much. The buffer always grows 105 unsigned capacity; /* capacity of buffer in words */ member in struct:FLAC__BitWriter 134 if(bw->capacity >= new_capacity) 137 /* round up capacity increase to the nearest FLAC__BITWRITER_DEFAULT_INCREMENT */ 138 if((new_capacity - bw->capacity) % FLAC__BITWRITER_DEFAULT_INCREMENT) 139 new_capacity += FLAC__BITWRITER_DEFAULT_INCREMENT - ((new_capacity - bw->capacity) % FLAC__BITWRITER_DEFAULT_INCREMENT); 141 FLAC__ASSERT(0 == (new_capacity - bw->capacity) % FLAC__BITWRITER_DEFAULT_INCREMENT); 142 FLAC__ASSERT(new_capacity > bw->capacity); 149 bw->capacity [all...] |
/external/icu4c/common/unicode/ |
H A D | unorm2.h | 202 * @param capacity number of UChars that can be written to dest 213 UChar *dest, int32_t capacity, 270 * @param capacity number of UChars that can be written to decomposition 280 UChar32 c, UChar *decomposition, int32_t capacity,
|
H A D | uscript.h | 395 * If required capacity is greater than capacity of the destination buffer then the error code 396 * is set to U_BUFFER_OVERFLOW_ERROR and the required capacity is returned 404 * @param capacity the capacity (size) fo UScriptCode buffer passed in. 410 uscript_getCode(const char* nameOrAbbrOrLocale,UScriptCode* fillIn,int32_t capacity,UErrorCode *err); 470 * If there are more than capacity script codes to be written, then 478 * @param capacity capacity of the scripts array 484 * written to scripts unless U_BUFFER_OVERFLOW_ERROR indicates insufficient capacity [all...] |
H A D | bytestream.h | 70 * Returns a writable buffer for appending and writes the buffer's capacity to 83 * int32_t capacity; 84 * char* buffer = sink->GetAppendBuffer(..., &capacity); 85 * ... Write n bytes into buffer, with n <= capacity. 91 * If a caller cannot provide a reasonable guess at the desired capacity, 100 * @param min_capacity required minimum capacity of the returned buffer; 102 * @param desired_capacity_hint desired capacity of the returned buffer; 105 * @param scratch_capacity capacity of the scratch buffer 107 * capacity of the returned buffer 137 * This sink will not write more than capacity byte [all...] |
/external/icu4c/tools/toolutil/ |
H A D | denseranges.cpp | 87 * Does it make sense to write 1..capacity ranges? 94 * @param capacity Maximum number of ranges. 95 * @return Minimum number of ranges (at most capacity) that have the desired density, 101 int32_t ranges[][2], int32_t capacity) { 119 // See if we can split [minValue, maxValue] into 2..capacity ranges, 120 // divided by the 1..(capacity-1) largest gaps. 121 LargestGaps gaps(capacity-1); 138 // The values are too sparse for capacity or fewer ranges 99 uprv_makeDenseRanges(const int32_t values[], int32_t length, int32_t density, int32_t ranges[][2], int32_t capacity) argument
|
/external/llvm/lib/Support/ |
H A D | raw_ostream.cpp | 706 // capacity. This allows raw_ostream to write directly into the correct place, 715 SetBuffer(OS.end(), OS.capacity() - OS.size()); 729 if (OS.capacity() - OS.size() < 64) 730 OS.reserve(OS.capacity() * 2); 731 SetBuffer(OS.end(), OS.capacity() - OS.size()); 739 assert(OS.size() + Size <= OS.capacity() && "Invalid write_impl() call!"); 749 if (OS.capacity() - OS.size() < 64) 750 OS.reserve(OS.capacity() * 2); 753 SetBuffer(OS.end(), OS.capacity() - OS.size());
|
/external/v8/src/ |
H A D | zone.h | 190 // Construct a new ZoneList with the given capacity; the length is 191 // always zero. The capacity must be non-negative. 192 explicit ZoneList(int capacity) argument 193 : List<T, ZoneListAllocationPolicy>(capacity) { }
|
H A D | unicode.h | 158 unsigned capacity, unsigned* chars_read, unsigned* offset); 193 static inline bool EncodeCharacter(uchar c, byte* buffer, unsigned capacity, 196 unsigned capacity, unsigned& offset); 198 unsigned capacity, unsigned& offset);
|
/external/webkit/Source/WebKit/win/Interfaces/ |
H A D | IWebBackForwardList.idl | 128 @method capacity 131 - (int)capacity; 133 HRESULT capacity([out, retval] int* result);
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Collections/ |
H A D | HashList.cs | 362 public HashList(int capacity) argument 364 if (capacity < 0) 371 _dictionary = new Hashtable(capacity); 372 _insertionOrderList = new ArrayList(capacity);
|
/external/apache-harmony/nio/src/test/java/common/org/apache/harmony/nio/tests/java/nio/ |
H A D | WrappedDoubleBufferTest.java | 85 assertEquals(buf.capacity(), 20);
|
H A D | WrappedFloatBufferTest.java | 85 assertEquals(buf.capacity(), 20);
|
H A D | WrappedIntBufferTest.java | 85 assertEquals(buf.capacity(), 20);
|
H A D | WrappedLongBufferTest.java | 85 assertEquals(buf.capacity(), 20);
|
H A D | WrappedShortBufferTest.java | 85 assertEquals(buf.capacity(), 20);
|
/external/icu4c/common/ |
H A D | unisetspan.cpp | 55 OffsetList() : list(staticList), capacity(0), length(0), start(0) {} 66 capacity=(int32_t)sizeof(staticList); 71 capacity=maxLength; 74 uprv_memset(list, 0, capacity); 78 uprv_memset(list, 0, capacity); 93 if(i>=capacity) { 94 i-=capacity; 107 if(i>=capacity) { 108 i-=capacity; 117 if(i>=capacity) { 155 int32_t capacity; member in class:OffsetList 179 appendUTF8(const UChar *s, int32_t length, uint8_t *t, int32_t capacity) argument [all...] |
/external/icu4c/i18n/unicode/ |
H A D | sortkey.h | 246 * @param capacity Size of the values array. 250 void adopt(uint8_t *values, int32_t capacity, int32_t count); 261 * If this CollationKey has capacity less than newSize, 262 * its internal capacity will be increased to newSize.
|
/external/icu4c/io/ |
H A D | ufile.h | 39 int32_t capacity; /* Capacity of buffer */ member in struct:__anon5937
|
/external/smali/dexlib/src/main/java/org/jf/dexlib/Util/ |
H A D | SparseArray.java | 316 * @param capacity the number of items 318 public void ensureCapacity(int capacity) { argument 323 if (mKeys.length < capacity) { 324 int[] nkeys = new int[capacity]; 325 Object[] nvalues = new Object[capacity];
|
/external/srec/portable/include/ |
H A D | ArrayListImpl.h | 52 * Actual capacity of the array. 54 size_t capacity; member in struct:ArrayListImpl_t 57 * Min capacity of the array.
|
H A D | phashtable.h | 30 * 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/tinyxml/ |
H A D | tinystr.h | 34 * - added swap(), clear(), size(), capacity(), operator+(). 141 // Return capacity of string 142 size_type capacity () const { return rep_->capacity; } function in class:TiXmlString 212 size_type size, capacity; 222 rep_->capacity = cap;
|
/external/webkit/Source/JavaScriptCore/wtf/url/src/ |
H A D | URLBuffer.h | 62 // Returns the current capacity of the buffer. The length() is the number of 63 // characters that have been declared to be written, but the capacity() is 65 // write many characters at once, it can make sure there is enough capacity, 67 int capacity() const { return m_capacity; } function in class:WTF::URLBuffer 80 // FIXME: Add ASSERT(length < capacity());
|
/external/webkit/Source/WebCore/history/ |
H A D | PageCache.h | 50 int capacity() { return m_capacity; } function in class:WebCore::PageCache 52 void add(PassRefPtr<HistoryItem>, Page*); // Prunes if capacity() is exceeded.
|