Home
last modified time | relevance | path

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

/oneTBB/doc/main/tbb_userguide/
H A DConcurrent_Queue_Classes.rst67 adds blocking operations and the ability to specify a capacity. The
75 queue's capacity.
79 queue's capacity.
97 the queue capacity with method ``set_capacity``.Setting the capacity
101 large, it is better not to set the capacity. If you do not need the
/oneTBB/test/conformance/
H A Dconformance_concurrent_vector.cpp233 REQUIRE( cv.capacity()>=expected_size ); in CheckVector()
341 REQUIRE( v.capacity()>=old_size ); in TestCapacity()
343 REQUIRE( v.capacity()>=old_size ); in TestCapacity()
344 REQUIRE( v.capacity()>=new_size ); in TestCapacity()
355 REQUIRE( v.capacity() != copy_of_v.capacity() ); in TestCapacity()
358 REQUIRE( v.capacity() == copy_of_v.capacity() ); in TestCapacity()
375 REQUIRE( size <= capacity ); in verify_c_vector_size()
449 std::size_t capacity = victim.capacity(); in TestExceptions() local
454 verify_c_vector_size(size, capacity, req_size); in TestExceptions()
498 REQUIRE_MESSAGE(capacity > 0, "unexpected capacity"); in verify_c_vector_capacity_is_below()
[all …]
H A Dconformance_concurrent_queue.cpp64 std::size_t capacity() const { in capacity() function in ConcQWithCapacity
90 CHECK(queue.capacity()> 0); in TestEmptyQueue()
91 CHECK(size_t(queue.capacity())>= std::size_t(-1)/(sizeof(void*)+sizeof(T))); in TestEmptyQueue()
679 void TestPushPop(typename CQ::size_type prefill, std::ptrdiff_t capacity, std::size_t nthread ) { in TestPushPop() argument
684 if (signed_prefill + 1>= capacity) { in TestPushPop()
697 queue.set_capacity(capacity); in TestPushPop()
1285 CHECK(q2.capacity() == size_type(vec.size())); in bounded_queue_specific_test()
/oneTBB/examples/graph/binpack/
H A DREADME.md2 … that performs binpacking of `N` integer values into a near-optimal number of bins of capacity `V`.
27 * `V` - capacity of each bin.
/oneTBB/include/oneapi/tbb/detail/
H A D_flow_graph_item_buffer_impl.h150 size_type capacity() { return my_array_size; } in capacity() function
153 bool buffer_full() { return size() >= capacity(); } in buffer_full()
158 __TBB_ASSERT(capacity() >= my_tail - my_head, "total items exceed capacity"); in grow_my_array()
H A D_segment_table.h209 size_type capacity() const noexcept { in capacity() function
/oneTBB/test/common/
H A Dconcurrent_unordered_common.h381 std::size_t capacity = std::size_t(buckets * lf); in test_reserve_regression() local
383 for (std::size_t elements = 0; elements < capacity; ++elements) { in test_reserve_regression()
389 container.reserve(capacity * 2); in test_reserve_regression()
H A Ddoctest.h649 size_type capacity; member
700 size_type capacity() const;
3659 data.capacity = data.size + 1;
3660 data.ptr = new char[data.capacity];
3733 data.capacity = data.size + 1;
3739 if(data.capacity > total_size) {
3745 data.capacity *= 2;
3746 if(data.capacity <= total_size)
3747 data.capacity = total_size + 1;
3800 String::size_type String::capacity() const {
[all …]
/oneTBB/include/oneapi/tbb/
H A Dconcurrent_vector.h488 return std::min(this->my_size.load(std::memory_order_acquire), capacity()); in size()
495 size_type capacity() const noexcept { in capacity() function
496 return base_type::capacity(); in capacity()
894 size_type cap = capacity(); in internal_grow_to_at_least()
H A Dconcurrent_queue.h520 size_type capacity() const { in capacity() function
H A Dflow_graph.h1645 if (this->size(new_tail) > this->capacity()) { in __TBB_requires()