HomeSort by relevance Sort by last modified time
    Searched full:capacity (Results 76 - 100 of 1135) sorted by null

1 2 34 5 6 7 8 91011>>

  /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/
virtio_blk.h 15 /* The capacity (in 512-byte sectors). */
16 __le64 capacity; member in struct:virtio_blk_config
  /libcore/luni/src/main/java/java/util/
PriorityQueue.java 52 * Constructs a priority queue with an initial capacity of 11 and natural
60 * Constructs a priority queue with the specified capacity and natural
64 * the specified capacity.
73 * Constructs a priority queue with the specified capacity and comparator.
76 * the specified capacity.
93 * The constructed priority queue has the initial capacity of 110% of the
118 * priority queue. The constructed priority queue has the initial capacity
132 * The constructed priority queue has the initial capacity of 110% of the
304 int capacity = in.readInt(); local
305 elements = newElementArray(capacity);
395 int capacity = (int) Math.ceil(c.size() local
    [all...]
  /external/icu4c/common/
charstr.cpp 110 UBool CharString::ensureCapacity(int32_t capacity,
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
charstr.h 84 * Returns a writable buffer for appending and writes the buffer's capacity to
95 * @param minCapacity required minimum capacity of the returned buffer;
97 * @param desiredCapacityHint desired capacity of the returned buffer;
99 * @param resultCapacity will be set to the capacity of the returned buffer
114 UBool ensureCapacity(int32_t capacity, int32_t desiredCapacityHint, UErrorCode &errorCode);
  /external/qemu/hw/
goldfish_mmc.c 233 uint64_t capacity; local
238 capacity = sector_count * 512;
239 if (capacity > 2147483648U) {
243 // CSD bits borrowed from a real SDHC card, with capacity bits zeroed out
249 // stuff in the real capacity
251 m = (uint32_t)(capacity / (512*1024)) - 1;
254 fprintf(stderr, "SD card too big (%lld bytes). Maximum SDHC card size is 128 gigabytes.\n", (long long)capacity);
266 // CSD bits borrowed from a real SD card, with capacity bits zeroed out
272 // stuff in the real capacity
275 // csd->capacity = (1 + m) << (e + 2)
    [all...]
goldfish_battery.c 46 int capacity; member in struct:goldfish_battery_state
60 QFIELD_INT32(capacity),
108 return s->capacity;
161 s->capacity = 50; // 50% charged
193 battery_state->capacity = value;
258 sprintf(buffer, "capacity: %d\r\n", battery_state->capacity);
  /external/clang/include/clang/Analysis/Support/
BumpVector.h 54 T *Begin, *End, *Capacity;
58 : Begin(NULL), End(NULL), Capacity(NULL) {
150 if (End < Capacity) {
165 if (End + Cnt <= Capacity) {
179 if (unsigned(Capacity-Begin) < N)
183 /// capacity - Return the total number of elements in the currently allocated
185 size_t capacity() const { return Capacity - Begin; } function in class:clang::BumpVector
216 size_t CurCapacity = Capacity-Begin;
240 Capacity = Begin+NewCapacity
    [all...]
  /libcore/luni/src/main/java/java/nio/
ReadWriteDirectByteBuffer.java 37 new ReadWriteDirectByteBuffer(other.block, other.capacity(), other.offset);
45 ReadWriteDirectByteBuffer(int capacity) {
46 super(MemoryBlock.allocate(capacity), capacity, 0); local
50 ReadWriteDirectByteBuffer(int address, int capacity) {
51 super(MemoryBlock.wrapFromJni(address, capacity), capacity, 0); local
54 ReadWriteDirectByteBuffer(MemoryBlock block, int capacity, int offset) {
55 super(block, capacity, offset);
67 limit = capacity;
    [all...]
ReadOnlyCharArrayBuffer.java 36 new ReadOnlyCharArrayBuffer(other.capacity(), other.backingArray, other.offset);
43 ReadOnlyCharArrayBuffer(int capacity, char[] backingArray, int arrayOffset) {
44 super(capacity, backingArray, arrayOffset);
ReadOnlyDirectByteBuffer.java 33 ReadOnlyDirectByteBuffer buf = new ReadOnlyDirectByteBuffer(other.block, other.capacity(), other.offset);
40 protected ReadOnlyDirectByteBuffer(MemoryBlock block, int capacity, int offset) {
41 super(block, capacity, offset);
ReadOnlyDoubleArrayBuffer.java 36 new ReadOnlyDoubleArrayBuffer(other.capacity(), other.backingArray, other.offset);
43 ReadOnlyDoubleArrayBuffer(int capacity, double[] backingArray, int arrayOffset) {
44 super(capacity, backingArray, arrayOffset);
ReadOnlyFloatArrayBuffer.java 36 new ReadOnlyFloatArrayBuffer(other.capacity(), other.backingArray, other.offset);
43 ReadOnlyFloatArrayBuffer(int capacity, float[] backingArray, int arrayOffset) {
44 super(capacity, backingArray, arrayOffset);
ReadOnlyHeapByteBuffer.java 36 new ReadOnlyHeapByteBuffer(other.backingArray, other.capacity(), other.offset);
43 ReadOnlyHeapByteBuffer(byte[] backingArray, int capacity, int arrayOffset) {
44 super(backingArray, capacity, arrayOffset);
ReadOnlyIntArrayBuffer.java 36 new ReadOnlyIntArrayBuffer(other.capacity(), other.backingArray, other.offset);
43 ReadOnlyIntArrayBuffer(int capacity, int[] backingArray, int arrayOffset) {
44 super(capacity, backingArray, arrayOffset);
ReadOnlyLongArrayBuffer.java 36 new ReadOnlyLongArrayBuffer(other.capacity(), other.backingArray, other.offset);
43 ReadOnlyLongArrayBuffer(int capacity, long[] backingArray, int arrayOffset) {
44 super(capacity, backingArray, arrayOffset);
ReadOnlyShortArrayBuffer.java 36 new ReadOnlyShortArrayBuffer(other.capacity(), other.backingArray, other.offset);
43 ReadOnlyShortArrayBuffer(int capacity, short[] backingArray, int arrayOffset) {
44 super(capacity, backingArray, arrayOffset);
  /external/astl/tests/
test_string.cpp 48 EXPECT_TRUE(empty_str1.capacity() == 0);
152 EXPECT_TRUE(str01.capacity() == 0);
158 EXPECT_TRUE(str02.capacity() == 10);
168 EXPECT_TRUE(str03.capacity() == i + 20);
249 size_t capacity = str01.capacity(); local
251 EXPECT_TRUE(0 == capacity);
254 EXPECT_TRUE(5 == str01.capacity());
256 EXPECT_TRUE(0 == str01.capacity());
259 EXPECT_TRUE(7 == str02.capacity());
    [all...]
  /external/v8/src/
list-inl.h 69 // Grow the list capacity by 50%, but make sure to let it grow
70 // even when the capacity is zero (possible initial case).
196 void List<T, P>::Initialize(int capacity) {
197 ASSERT(capacity >= 0);
198 data_ = (capacity > 0) ? NewData(capacity) : NULL;
199 capacity_ = capacity;
  /external/icu4c/i18n/
fpositer.cpp 62 int32_t FieldPositionIterator::getData(int32_t *dest, int32_t capacity) const {
65 if (capacity < len) {
66 len = -len; // error, insufficient capacity
  /external/srec/portable/include/
ArrayListImpl.h 52 * Actual capacity of the array.
54 size_t capacity; member in struct:ArrayListImpl_t
57 * Min capacity of the array.
  /external/webkit/Source/WebCore/platform/text/
AtomicStringKeyedMRUCache.h 33 template<typename T, size_t capacity = 4>
55 if (m_cache.size() == capacity)
67 typedef Vector<Entry, capacity> Cache;
  /external/webkit/Source/JavaScriptCore/wtf/
Vector.h 313 size_t capacity() const { return m_capacity; } function in class:WTF::VectorBufferBase
330 VectorBufferBase(T* buffer, size_t capacity)
332 , m_capacity(capacity)
357 VectorBuffer(size_t capacity)
361 if (capacity)
362 allocateBuffer(capacity);
384 using Base::capacity;
403 VectorBuffer(size_t capacity)
406 if (capacity > inlineCapacity)
407 Base::allocateBuffer(capacity);
532 size_t capacity() const { return m_buffer.capacity(); } function in class:WTF::Vector
    [all...]
  /external/clang/test/SemaCXX/
flexible-array-test.cpp 62 unsigned capacity; member in struct:rdar9065507::StorageBase
  /external/guava/src/com/google/common/collect/
HashBiMap.java 41 * Returns a new, empty {@code HashBiMap} with the default initial capacity
61 * bimap is created with an initial capacity sufficient to hold the mappings
76 super(new HashMap<K, V>(Maps.capacity(expectedSize)),
77 new HashMap<V, K>(Maps.capacity(expectedSize)));
  /external/qemu/
qstring.h 23 size_t capacity; member in struct:QString

Completed in 1331 milliseconds

1 2 34 5 6 7 8 91011>>