Home
last modified time | relevance | path

Searched refs:capacity (Results 1 – 25 of 1002) sorted by relevance

12345678910>>...41

/external/icu/icu4c/source/common/
Dutrace.cpp93 static void outputChar(char c, char *outBuf, int32_t *outIx, int32_t capacity, int32_t indent) { in outputChar() argument
105 (c!='\n' && c!=0 && *outIx < capacity && outBuf[(*outIx)-1]=='\n') || /* case 2. */ in outputChar()
106 (c=='\n' && *outIx>=capacity)) /* case 3 */ in outputChar()
110 if (*outIx < capacity) { in outputChar()
117 if (*outIx < capacity) { in outputChar()
129 char *outBuf, int32_t *outIx, int32_t capacity) { in outputHexBytes() argument
134 outputChar(c, outBuf, outIx, capacity, 0); in outputHexBytes()
139 static void outputPtrBytes(void *val, char *outBuf, int32_t *outIx, int32_t capacity) { in outputPtrBytes() argument
153 outputHexBytes(*p, 2, outBuf, outIx, capacity); in outputPtrBytes()
158 static void outputString(const char *s, char *outBuf, int32_t *outIx, int32_t capacity, int32_t ind… in outputString() argument
[all …]
Duscript.cpp30 UScriptCode *dest, int32_t capacity, UErrorCode *err) { in setCodes() argument
33 if(length > capacity) { in setCodes()
44 setOneCode(UScriptCode script, UScriptCode *scripts, int32_t capacity, UErrorCode *err) { in setOneCode() argument
46 if(1 > capacity) { in setOneCode()
56 UScriptCode *scripts, int32_t capacity, UErrorCode *err) { in getCodesFromLocale() argument
69 return setCodes(JAPANESE, UPRV_LENGTHOF(JAPANESE), scripts, capacity, err); in getCodesFromLocale()
72 return setCodes(KOREAN, UPRV_LENGTHOF(KOREAN), scripts, capacity, err); in getCodesFromLocale()
79 return setCodes(HAN_BOPO, UPRV_LENGTHOF(HAN_BOPO), scripts, capacity, err); in getCodesFromLocale()
88 return setOneCode(scriptCode, scripts, capacity, err); in getCodesFromLocale()
98 int32_t capacity, in uscript_getCode() argument
[all …]
Dcmemory.h293 MaybeStackArray() : ptr(stackArray), capacity(stackCapacity), needToRelease(FALSE) {} in MaybeStackArray()
300 if (capacity < newCapacity) { resize(newCapacity); } in MaybeStackArray()
318 int32_t getCapacity() const { return capacity; } in getCapacity()
328 T *getArrayLimit() const { return getAlias()+capacity; } in getArrayLimit()
355 capacity=otherCapacity; in aliasInstead()
383 int32_t capacity; variable
393 capacity=stackCapacity; in resetToStackArray()
421 : ptr(src.ptr), capacity(src.capacity), needToRelease(src.needToRelease) { in MaybeStackArray()
424 uprv_memcpy(stackArray, src.stackArray, sizeof(T) * src.capacity); in MaybeStackArray()
434 capacity = src.capacity;
[all …]
Duvectr64.cpp28 capacity(0), in UOBJECT_DEFINE_RTTI_IMPLEMENTATION()
37 capacity(0), in UVector64()
61 capacity = initialCapacity; in _init()
126 if (capacity >= minimumCapacity) { in expandCapacity()
133 if (capacity > (INT32_MAX - 1) / 2) { // integer overflow check in expandCapacity()
137 int32_t newCap = capacity * 2; in expandCapacity()
156 capacity = newCap; in expandCapacity()
170 if (capacity <= maxCapacity || maxCapacity == 0) { in setMaxCapacity()
184 capacity = maxCapacity; in setMaxCapacity()
185 if (count > capacity) { in setMaxCapacity()
[all …]
/external/icu/icu4c/source/layoutex/
DRunArrays.cpp52 void RunArray::init(le_int32 capacity) in init() argument
54 fLimits = LE_NEW_ARRAY(le_int32, capacity); in init()
94 void FontRuns::init(le_int32 capacity) in init() argument
96 RunArray::init(capacity); in init()
97 fFonts = LE_NEW_ARRAY(const LEFontInstance *, capacity); in init()
100 void FontRuns::grow(le_int32 capacity) in grow() argument
102 RunArray::grow(capacity); in grow()
103 fFonts = (const LEFontInstance **) LE_GROW_ARRAY(fFonts, capacity); in grow()
146 void LocaleRuns::init(le_int32 capacity) in init() argument
148 RunArray::init(capacity); in init()
[all …]
/external/emma/core/java12/com/vladium/util/
DByteArrayOStream.java52 final int capacity = pos + 2; in write2() local
56 if (mbuflen < capacity) in write2()
58 final byte [] newbuf = new byte [Math.max (mbuflen << 1, capacity)]; in write2()
70 m_pos = capacity; in write2()
76 final int capacity = pos + 3; in write3() local
80 if (mbuflen < capacity) in write3()
82 final byte [] newbuf = new byte [Math.max (mbuflen << 1, capacity)]; in write3()
95 m_pos = capacity; in write3()
101 final int capacity = pos + 4; in write4() local
105 if (mbuflen < capacity) in write4()
[all …]
/external/emma/core/java12/com/vladium/jcd/cls/
DElementFactory.java21 public static IAttributeCollection newAttributeCollection (final int capacity) in newAttributeCollection() argument
23 return new AttributeCollection (capacity); in newAttributeCollection()
26 public static IConstantCollection newConstantCollection (final int capacity) in newConstantCollection() argument
28 return new ConstantCollection (capacity); in newConstantCollection()
31 public static IFieldCollection newFieldCollection (final int capacity) in newFieldCollection() argument
33 return new FieldCollection (capacity); in newFieldCollection()
36 public static IInterfaceCollection newInterfaceCollection (final int capacity) in newInterfaceCollection() argument
38 return new InterfaceCollection (capacity); in newInterfaceCollection()
41 public static IMethodCollection newMethodCollection (final int capacity) in newMethodCollection() argument
43 return new MethodCollection (capacity); in newMethodCollection()
/external/perfetto/include/perfetto/base/
Dcontainer_annotations.h26 #define ANNOTATE_NEW_BUFFER(buffer, capacity, new_size) \ argument
28 __sanitizer_annotate_contiguous_container(buffer, (buffer) + (capacity), \
29 (buffer) + (capacity), \
32 #define ANNOTATE_DELETE_BUFFER(buffer, capacity, old_size) \ argument
34 __sanitizer_annotate_contiguous_container(buffer, (buffer) + (capacity), \
36 (buffer) + (capacity)); \
38 #define ANNOTATE_CHANGE_SIZE(buffer, capacity, old_size, new_size) \ argument
40 __sanitizer_annotate_contiguous_container(buffer, (buffer) + (capacity), \
50 #define ANNOTATE_NEW_BUFFER(buffer, capacity, new_size) argument
51 #define ANNOTATE_DELETE_BUFFER(buffer, capacity, old_size) argument
[all …]
/external/libcxx/test/std/containers/sequences/vector/vector.capacity/
Dreserve.pass.cpp25 assert(v.capacity() >= 10); in main()
30 assert(v.capacity() == 100); in main()
33 assert(v.capacity() == 100); in main()
36 assert(v.capacity() == 150); in main()
42 assert(v.capacity() == 100); in main()
45 assert(v.capacity() == 100); in main()
48 assert(v.capacity() == 150); in main()
55 assert(v.capacity() >= 10); in main()
60 assert(v.capacity() == 100); in main()
63 assert(v.capacity() == 100); in main()
[all …]
Dresize_size.pass.cpp29 assert(v.capacity() == 100); in main()
33 assert(v.capacity() >= 200); in main()
41 assert(v.capacity() == 100); in main()
45 assert(v.capacity() >= 200); in main()
53 assert(v.capacity() == 100); in main()
57 assert(v.capacity() >= 200); in main()
65 assert(v.capacity() == 100); in main()
69 assert(v.capacity() >= 200); in main()
76 assert(v.capacity() == 100); in main()
80 assert(v.capacity() >= 200); in main()
/external/webrtc/webrtc/base/
Dbuffer_unittest.cc26 void TestBuf(const Buffer& b1, size_t size, size_t capacity) { in TestBuf() argument
28 EXPECT_EQ(b1.capacity(), capacity); in TestBuf()
49 EXPECT_EQ(buf.capacity(), 7u); in TEST()
56 EXPECT_EQ(buf.capacity(), 14u); in TEST()
63 EXPECT_EQ(buf.capacity(), 16u); in TEST()
70 EXPECT_EQ(buf2.capacity(), 16u); in TEST()
88 EXPECT_EQ(buf.capacity(), 9u); in TEST()
104 EXPECT_EQ(buf.capacity(), 15u); // Hasn't shrunk. in TEST()
112 EXPECT_EQ(buf.capacity(), 15u); in TEST()
115 EXPECT_EQ(buf.capacity(), 20u); // Has grown. in TEST()
[all …]
/external/tensorflow/tensorflow/python/training/
Dinput.py129 capacity=32, argument
192 q = data_flow_ops.FIFOQueue(capacity=capacity,
202 math_ops.cast(q.size(), dtypes.float32) * (1. / capacity))
216 capacity=32, argument
274 capacity=capacity,
277 summary_name="fraction_of_%d_full" % capacity,
287 capacity=32, shared_name=None, name=None): argument
319 range_tensor, [], num_epochs, shuffle, seed, capacity,
320 shared_name, "fraction_of_%d_full" % capacity, name)
330 capacity=32, shared_name=None, name=None): argument
[all …]
/external/google-fruit/include/fruit/impl/util/
Dhash_helpers.defn.h32 inline HashSet<T> createHashSet(size_t capacity) { in createHashSet() argument
33 return HashSet<T>(capacity, std::hash<T>()); in createHashSet()
37 inline HashSetWithArenaAllocator<T> createHashSetWithArenaAllocator(size_t capacity, MemoryPool& me… in createHashSetWithArenaAllocator() argument
38 …return HashSetWithArenaAllocator<T>(capacity, std::hash<T>(), std::equal_to<T>(), ArenaAllocator<T… in createHashSetWithArenaAllocator()
43 createHashSetWithArenaAllocatorAndCustomFunctors(size_t capacity, MemoryPool& memory_pool, Hasher h… in createHashSetWithArenaAllocatorAndCustomFunctors() argument
45 …return HashSetWithArenaAllocator<T, Hasher, EqualityComparator>(capacity, hasher, equality_compara… in createHashSetWithArenaAllocatorAndCustomFunctors()
55 inline HashMap<Key, Value> createHashMap(size_t capacity) { in createHashMap() argument
56 return HashMap<Key, Value>(capacity, std::hash<Key>()); in createHashMap()
60 inline HashMapWithArenaAllocator<Key, Value> createHashMapWithArenaAllocator(std::size_t capacity, in createHashMapWithArenaAllocator() argument
62 …return createHashMapWithArenaAllocatorAndCustomFunctors<Key, Value>(capacity, memory_pool, std::ha… in createHashMapWithArenaAllocator()
[all …]
/external/skqp/tests/
DDynamicHashTest.cpp30 int capacity() const { return this->INHERITED::capacity(); } in capacity() function in __anon31efb7e40111::Hash
49 ASSERT(hash.capacity() == 0); in DEF_TEST()
52 ASSERT(hash.capacity() == 4); in DEF_TEST()
55 ASSERT(hash.capacity() == 4); in DEF_TEST()
58 ASSERT(hash.capacity() == 4); in DEF_TEST()
61 ASSERT(hash.capacity() == 8); in DEF_TEST()
64 ASSERT(hash.capacity() == 8); in DEF_TEST()
77 ASSERT(hash.capacity() == 0); in DEF_TEST()
80 ASSERT(hash.capacity() == 4); in DEF_TEST()
84 ASSERT(hash.capacity() == 4); in DEF_TEST()
[all …]
/external/skia/tests/
DDynamicHashTest.cpp30 int capacity() const { return this->INHERITED::capacity(); } in capacity() function in __anonf8f7600d0111::Hash
49 ASSERT(hash.capacity() == 0); in DEF_TEST()
52 ASSERT(hash.capacity() == 4); in DEF_TEST()
55 ASSERT(hash.capacity() == 4); in DEF_TEST()
58 ASSERT(hash.capacity() == 4); in DEF_TEST()
61 ASSERT(hash.capacity() == 8); in DEF_TEST()
64 ASSERT(hash.capacity() == 8); in DEF_TEST()
77 ASSERT(hash.capacity() == 0); in DEF_TEST()
80 ASSERT(hash.capacity() == 4); in DEF_TEST()
84 ASSERT(hash.capacity() == 4); in DEF_TEST()
[all …]
/external/libcxx/test/std/containers/sequences/vector.bool/
Dreserve.pass.cpp25 assert(v.capacity() >= 10); in main()
29 assert(v.capacity() >= 100); in main()
32 assert(v.capacity() >= 100); in main()
35 assert(v.capacity() >= 150); in main()
41 assert(v.capacity() >= 10); in main()
45 assert(v.capacity() >= 100); in main()
48 assert(v.capacity() >= 100); in main()
51 assert(v.capacity() >= 150); in main()
Dswap.pass.cpp27 assert(v1.capacity() >= 200); in main()
29 assert(v2.capacity() >= 100); in main()
37 assert(v1.capacity() >= 200); in main()
39 assert(v2.capacity() >= 100); in main()
49 assert(v1.capacity() >= 200); in main()
51 assert(v2.capacity() >= 100); in main()
71 assert(v1.capacity() >= 200); in main()
73 assert(v2.capacity() >= 100); in main()
81 assert(v1.capacity() >= 200); in main()
83 assert(v2.capacity() >= 100); in main()
/external/google-fruit/include/fruit/impl/normalized_component_storage/
Dnormalized_component_storage.defn.h26 NormalizedComponentStorage::createLazyComponentWithNoArgsSet(size_t capacity, MemoryPool& memory_po… in createLazyComponentWithNoArgsSet() argument
28 capacity, memory_pool, NormalizedComponentStorage::HashLazyComponentWithNoArgs(), in createLazyComponentWithNoArgsSet()
33 NormalizedComponentStorage::createLazyComponentWithArgsSet(size_t capacity, MemoryPool& memory_pool… in createLazyComponentWithArgsSet() argument
35 capacity, memory_pool, NormalizedComponentStorage::HashLazyComponentWithArgs(), in createLazyComponentWithArgsSet()
40 NormalizedComponentStorage::createLazyComponentWithNoArgsReplacementMap(size_t capacity, MemoryPool… in createLazyComponentWithNoArgsReplacementMap() argument
42 capacity, memory_pool, NormalizedComponentStorage::HashLazyComponentWithNoArgs(), in createLazyComponentWithNoArgsReplacementMap()
47 NormalizedComponentStorage::createLazyComponentWithArgsReplacementMap(size_t capacity, MemoryPool& … in createLazyComponentWithArgsReplacementMap() argument
49 capacity, memory_pool, NormalizedComponentStorage::HashLazyComponentWithArgs(), in createLazyComponentWithArgsReplacementMap()
/external/libchrome/ipc/
Dipc_channel_reader_unittest.cc84 EXPECT_LT(reader.input_overflow_buf_.capacity(), header.payload_size); in TEST()
90 EXPECT_GE(reader.input_overflow_buf_.capacity(), header.payload_size); in TEST()
98 size_t capacity_before = reader.input_overflow_buf_.capacity(); in TEST()
104 EXPECT_LE(reader.input_overflow_buf_.capacity(), capacity_before); in TEST()
110 EXPECT_LE(reader.input_overflow_buf_.capacity(), capacity_before); in TEST()
116 EXPECT_LE(reader.input_overflow_buf_.capacity(), capacity_before); in TEST()
127 trimmed_buffer_size = buf.capacity(); in TEST()
141 EXPECT_LE(reader.input_overflow_buf_.capacity(), trimmed_buffer_size); in TEST()
149 EXPECT_EQ(reader.input_overflow_buf_.capacity(), trimmed_buffer_size); in TEST()
166 EXPECT_GE(reader.input_overflow_buf_.capacity(), message.size()); in TEST()
[all …]
/external/mesa3d/src/intel/compiler/
Dbrw_ir_allocator.h37 sizes(NULL), offsets(NULL), count(0), total_size(0), capacity(0) in simple_allocator()
50 if (capacity <= count) { in allocate()
51 capacity = MAX2(16, capacity * 2); in allocate()
52 sizes = (unsigned *)realloc(sizes, capacity * sizeof(unsigned)); in allocate()
53 offsets = (unsigned *)realloc(offsets, capacity * sizeof(unsigned)); in allocate()
83 unsigned capacity;
/external/mesa3d/src/util/
Du_dynarray.h49 unsigned capacity; member
85 if (newsize > buf->capacity) { in util_dynarray_resize()
86 if (buf->capacity == 0) in util_dynarray_resize()
87 buf->capacity = DYN_ARRAY_INITIAL_SIZE; in util_dynarray_resize()
89 while (newsize > buf->capacity) in util_dynarray_resize()
90 buf->capacity *= 2; in util_dynarray_resize()
93 buf->data = reralloc_size(buf->mem_ctx, buf->data, buf->capacity); in util_dynarray_resize()
95 buf->data = realloc(buf->data, buf->capacity); in util_dynarray_resize()
114 if (buf->size != buf->capacity) { in util_dynarray_trim()
121 buf->capacity = buf->size; in util_dynarray_trim()
[all …]
/external/google-fruit/include/fruit/impl/data_structures/
Dmemory_pool.defn.h29 inline MemoryPool::MemoryPool() : first_free(nullptr), capacity(0) {} in MemoryPool()
32 …chunks(std::move(other.allocated_chunks)), first_free(other.first_free), capacity(other.capacity) { in MemoryPool()
42 capacity = other.capacity;
69 if (required_space_in_chunk > capacity) { in allocate()
71 if (allocated_chunks.size() == allocated_chunks.capacity()) { in allocate()
80 capacity = CHUNK_SIZE - required_space; in allocate()
88 capacity -= required_space_in_chunk; in allocate()
Dfixed_size_vector.defn.h32 inline FixedSizeVector<T, Allocator>::FixedSizeVector(std::size_t capacity, Allocator allocator) in FixedSizeVector() argument
33 : capacity(capacity), allocator(allocator) { in FixedSizeVector()
34 if (capacity == 0) { // LCOV_EXCL_BR_LINE in FixedSizeVector()
37 v_begin = allocator.allocate(capacity); in FixedSizeVector()
45 if (capacity != 0) { in ~FixedSizeVector()
46 allocator.deallocate(v_begin, capacity); in ~FixedSizeVector()
82 std::swap(capacity, x.capacity); in swap()
88 FruitAssert(v_end != v_begin + capacity); in push_back()
93 FruitAssert(v_end <= v_begin + capacity); in push_back()
/external/guava/guava-tests/benchmark/com/google/common/util/concurrent/
DMonitorBenchmark.java33 @Param({"10", "100", "1000"}) int capacity; field in MonitorBenchmark
47 queue = (BlockingQueue<String>) constructor.newInstance(capacity); in setUp()
49 strings = new String[capacity]; in setUp()
50 for (int i = 0; i < capacity; i++) { in setUp()
56 int capacity = this.capacity; in addsAndRemoves() local
60 for (int j = 0; j < capacity; j++) { in addsAndRemoves()
63 for (int j = 0; j < capacity; j++) { in addsAndRemoves()
/external/libchrome/base/task/sequence_manager/
Dlazily_deallocated_deque_unittest.cc98 EXPECT_EQ(1020u, d.capacity()); in TEST_F()
106 EXPECT_EQ(512u, d.capacity()); in TEST_F()
112 EXPECT_EQ(512u, d.capacity()); in TEST_F()
118 EXPECT_EQ(11u, d.capacity()); in TEST_F()
128 EXPECT_EQ(1020u, d.capacity()); in TEST_F()
135 EXPECT_EQ(1020u, d.capacity()); in TEST_F()
140 EXPECT_EQ(1020u, d.capacity()); in TEST_F()
146 EXPECT_EQ(1020u, d.capacity()); in TEST_F()
162 EXPECT_EQ(LazilyDeallocatedDeque<int>::kMinimumRingSize, d.capacity()); in TEST_F()
178 EXPECT_EQ(1020u, d.capacity()); in TEST_F()
[all …]

12345678910>>...41