HomeSort by relevance Sort by last modified time
    Searched full:capacity (Results 251 - 275 of 2810) sorted by null

<<11121314151617181920>>

  /system/core/libutils/
VectorImpl.cpp 108 size_t VectorImpl::capacity() const function in class:android::VectorImpl
308 ALOG_ASSERT(index<capacity(),
309 "[%p] editItemLocation: index=%d, capacity=%d, count=%d",
310 this, (int)index, (int)capacity(), (int)mCount);
312 if (index < capacity()) {
323 ALOG_ASSERT(index<capacity(),
324 "[%p] itemLocation: index=%d, capacity=%d, count=%d",
325 this, (int)index, (int)capacity(), (int)mCount);
327 if (index < capacity()) {
338 // The capacity must always be greater than or equal to the siz
    [all...]
  /libcore/ojluni/src/main/java/java/util/stream/
SpinedBuffer.java 49 * {@link ArrayList}, as when the capacity of the list needs to be increased
90 * Constructs an empty list with the specified initial capacity.
92 * @param initialCapacity the initial capacity of the list
93 * @throws IllegalArgumentException if the specified initial capacity
103 * Constructs an empty list with an initial capacity of sixteen.
112 * Returns the current capacity of the buffer
114 protected long capacity() { method in class:SpinedBuffer
130 * Ensure that the buffer has at least capacity to hold the target size
134 long capacity = capacity(); local
155 ensureCapacity(capacity() + 1); method
485 protected long capacity() { method in class:SpinedBuffer.OfPrimitive
500 long capacity = capacity(); local
518 ensureCapacity(capacity() + 1); method
    [all...]
  /art/compiler/utils/
assembler.h 115 if (new_size > Capacity()) {
190 // Make sure that extending the capacity leaves a big enough gap
193 // Mark the buffer as having ensured the capacity.
211 int ComputeGap() { return buffer_->Capacity() - buffer_->Size(); }
230 // capacity needed for emitting, we add a dummy method in non-debug mode.
238 size_t Capacity() const {
243 // Unconditionally increase the capacity.
244 // The provided `min_capacity` must be higher than current `Capacity()`.
272 // Compute the limit based on the data area and the capacity. See
274 static uint8_t* ComputeLimit(uint8_t* data, size_t capacity) {
    [all...]
  /libcore/ojluni/src/main/java/java/lang/
StringBuffer.java 66 * Every string buffer has a capacity. As long as the length of the
68 * the capacity, it is not necessary to allocate a new internal
93 * initial capacity of 16 characters.
101 * the specified initial capacity.
103 * @param capacity the initial capacity.
104 * @exception NegativeArraySizeException if the <code>capacity</code>
107 public StringBuffer(int capacity) {
108 super(capacity);
113 * specified string. The initial capacity of the string buffer i
147 public synchronized int capacity() { method in class:StringBuffer
    [all...]
  /external/v8/src/heap/
slot-set.h 279 chunk_ = new Chunk(chunk_, NextCapacity(chunk_->capacity));
326 static int NextCapacity(int capacity) {
327 return Min(kMaxBufferSize, capacity * 2);
334 explicit Chunk(Chunk* next_chunk, int capacity)
335 : next(next_chunk), count(0), capacity(capacity) {
336 buffer = NewArray<TypedSlot>(capacity);
339 if (count == capacity) return false;
346 int capacity;
  /libcore/ojluni/src/main/java/java/io/
ByteArrayOutputStream.java 58 * Creates a new byte array output stream. The buffer capacity is
66 * Creates a new byte array output stream, with a buffer capacity of
81 * Increases the capacity if necessary to ensure that it can hold
83 * capacity argument.
85 * @param minCapacity the desired minimum capacity
87 * interpreted as a request for the unsatisfiably large capacity
97 * Increases the capacity to ensure that it can hold at least the
98 * number of elements specified by the minimum capacity argument.
100 * @param minCapacity the desired minimum capacity
  /art/runtime/gc/space/
bump_pointer_space.h 45 static BumpPointerSpace* Create(const std::string& name, size_t capacity, uint8_t* requested_begin);
77 // Removes the fork time growth limit on capacity, allowing the application to allocate up to the
83 // Override capacity so that we only return the possibly limited capacity
84 size_t Capacity() const {
space.cc 80 const size_t capacity = static_cast<size_t>(std::numeric_limits<uint32_t>::max()); local
82 capacity));
85 capacity));
  /cts/suite/audio_quality/lib/src/audio/
Buffer.cpp 24 Buffer::Buffer(size_t capacity, size_t size, bool stereo)
25 : mCapacity(capacity),
30 mData = new char[capacity];
31 //LOGV("Buffer %d data %x", capacity, (unsigned int)mData);
36 memset(mData, 0, capacity);
  /external/apache-http/src/org/apache/http/util/
ByteArrayBuffer.java 53 public ByteArrayBuffer(int capacity) {
55 if (capacity < 0) {
56 throw new IllegalArgumentException("Buffer capacity may not be negative");
58 this.buffer = new byte[capacity];
140 public int capacity() { method in class:ByteArrayBuffer
  /external/flac/libFLAC/
bitwriter.c 61 * The default capacity here doesn't matter too much. The buffer always grows
76 unsigned capacity; /* capacity of buffer in words */ member in struct:FLAC__BitWriter
99 if(bw->capacity >= new_capacity)
102 /* round up capacity increase to the nearest FLAC__BITWRITER_DEFAULT_INCREMENT */
103 if((new_capacity - bw->capacity) % FLAC__BITWRITER_DEFAULT_INCREMENT)
104 new_capacity += FLAC__BITWRITER_DEFAULT_INCREMENT - ((new_capacity - bw->capacity) % FLAC__BITWRITER_DEFAULT_INCREMENT);
106 FLAC__ASSERT(0 == (new_capacity - bw->capacity) % FLAC__BITWRITER_DEFAULT_INCREMENT);
107 FLAC__ASSERT(new_capacity > bw->capacity);
114 bw->capacity = new_capacity
    [all...]
  /external/icu/icu4c/source/common/
charstr.cpp 127 UBool CharString::ensureCapacity(int32_t capacity,
133 if(capacity>buffer.getCapacity()) {
135 desiredCapacityHint=capacity+buffer.getCapacity();
137 if( (desiredCapacityHint<=capacity || buffer.resize(desiredCapacityHint, len+1)==NULL) &&
138 buffer.resize(capacity, len+1)==NULL
charstr.h 87 * Returns a writable buffer for appending and writes the buffer's capacity to
98 * @param minCapacity required minimum capacity of the returned buffer;
100 * @param desiredCapacityHint desired capacity of the returned buffer;
102 * @param resultCapacity will be set to the capacity of the returned buffer
130 UBool ensureCapacity(int32_t capacity, int32_t desiredCapacityHint, UErrorCode &errorCode);
unistr_case.cpp 113 int32_t capacity; local
115 capacity = US_STACKBUF_SIZE;
117 capacity = oldLength + 20;
120 if(!cloneArrayIfNeeded(capacity, capacity, FALSE, &bufferToDelete, TRUE)) {
uscript_props.cpp 226 uscript_getSampleString(UScriptCode script, UChar *dest, int32_t capacity, UErrorCode *pErrorCode) {
228 if(capacity < 0 || (capacity > 0 && dest == NULL)) {
238 if(length <= capacity) {
243 return u_terminateUChars(dest, capacity, length, pErrorCode);
  /external/webrtc/webrtc/base/
bytebuffer_unittest.cc 105 // For a resize by writing Capacity() number of bytes.
106 size_t capacity = buffer.Capacity(); local
107 buffer.ReserveWriteBuffer(buffer.Capacity());
108 EXPECT_EQ(capacity + 3U, buffer.Length());
  /packages/apps/Gallery2/src/com/android/photos/data/
SparseArrayBitmapPool.java 55 * @param capacityBytes Maximum capacity of the pool in bytes.
68 * Set the maximum capacity of the pool, and if necessary trim it down to size.
73 // No-op unless current size exceeds the new capacity.
127 * @return Capacity of the pool in bytes.
209 // Clearing is equivalent to ensuring all the capacity is available.
  /packages/apps/TV/usbtuner/src/com/android/usbtuner/util/
ByteArrayBuffer.java 42 public ByteArrayBuffer(int capacity) {
44 if (capacity < 0) {
45 throw new IllegalArgumentException("Buffer capacity may not be negative");
47 this.buffer = new byte[capacity];
122 public int capacity() { method in class:ByteArrayBuffer
  /external/vulkan-validation-layers/loader/
loader.c 485 if (layer_list->capacity == 0) {
496 layer_list->capacity = sizeof(struct loader_layer_properties) * 64;
501 layer_list->capacity) {
503 inst, layer_list->list, layer_list->capacity,
504 layer_list->capacity * 2, VK_SYSTEM_ALLOCATION_SCOPE_INSTANCE);
509 layer_list->capacity *= 2;
531 if (dev_ext_list->capacity > 0 &&
543 if (layer_list->capacity > 0) {
544 layer_list->capacity = 0;
682 list_info->capacity = 32 * element_size
4124 uint32_t capacity = *pPropertyCount; local
    [all...]
  /libcore/ojluni/src/main/java/java/util/
Deque.java 46 * they may contain, but this interface supports capacity-restricted
55 * designed specifically for use with capacity-restricted
195 * possible to do so immediately without violating capacity restrictions,
197 * available. When using a capacity-restricted deque, it is generally
202 * time due to capacity restrictions
214 * possible to do so immediately without violating capacity restrictions,
216 * available. When using a capacity-restricted deque, it is generally
223 * time due to capacity restrictions
235 * violate capacity restrictions. When using a capacity-restricted deque
    [all...]
  /external/apache-commons-math/src/main/java/org/apache/commons/math/util/
OpenIntToDoubleHashMap.java 121 final int capacity = computeCapacity(expectedSize); local
122 keys = new int[capacity];
123 values = new double[capacity];
124 states = new byte[capacity];
126 mask = capacity - 1;
148 * Compute the capacity needed for a given size.
150 * @return capacity to use for the specified size
156 final int capacity = (int) FastMath.ceil(expectedSize / LOAD_FACTOR); local
157 final int powerOfTwo = Integer.highestOneBit(capacity);
158 if (powerOfTwo == capacity) {
    [all...]
OpenIntToFieldHashMap.java 132 final int capacity = computeCapacity(expectedSize); local
133 keys = new int[capacity];
134 values = buildArray(capacity);
135 states = new byte[capacity];
137 mask = capacity - 1;
160 * Compute the capacity needed for a given size.
162 * @return capacity to use for the specified size
168 final int capacity = (int) FastMath.ceil(expectedSize / LOAD_FACTOR); local
169 final int powerOfTwo = Integer.highestOneBit(capacity);
170 if (powerOfTwo == capacity) {
    [all...]
  /external/guava/guava/src/com/google/common/collect/
LinkedHashMultiset.java 49 * capacity.
88 super(new LinkedHashMap<E, Count>(Maps.capacity(distinctElements)));
107 Maps.capacity(distinctElements)));
  /external/icu/icu4c/source/i18n/unicode/
upluralrules.h 132 * @param capacity The capacity of keyword.
140 UChar *keyword, int32_t capacity,
  /external/libgdx/backends/gdx-backends-gwt/src/com/badlogic/gdx/backends/gwt/emu/java/nio/
DirectReadOnlyByteBuffer.java 32 DirectReadOnlyByteBuffer buf = new DirectReadOnlyByteBuffer(other.byteArray.buffer(), other.capacity(),
41 DirectReadOnlyByteBuffer (ArrayBuffer backingArray, int capacity, int arrayOffset) {
42 super(backingArray, capacity, arrayOffset);

Completed in 1773 milliseconds

<<11121314151617181920>>