Home
last modified time | relevance | path

Searched refs:cend (Results 1 – 13 of 13) sorted by relevance

/oneTBB/include/oneapi/tbb/detail/
H A D_flow_graph_impl.h322 const_iterator cend() const;
H A D_concurrent_skip_list.h615 const_iterator cend() const { in cend() function
H A D_concurrent_unordered_base.h403 const_iterator cend() const noexcept { return const_iterator(nullptr); } in cend() function
/oneTBB/test/tbb/
H A Dtest_flow_graph.cpp357 for(auto it = g.cbegin(); it != g.cend(); it++)
H A Dtest_concurrent_vector.cpp297 REQUIRE( utils::IsEqual()(*(c.cend()-1), *c.crbegin()) ); in Examine()
H A Dtest_concurrent_hash_map.cpp305 ch_map c10_1( c1.begin(), c1.end() ), c10_2(c1.cbegin(), c1.cend()); in TypeTester()
H A Dtest_flow_graph_whitebox.cpp917 CHECK_MESSAGE((g.cbegin() == g.cend()), "Starting graph is empty");
/oneTBB/test/conformance/
H A Dconformance_parallel_pipeline.cpp184 RootSequence(input.cbegin(), input.cend(), output.begin());
H A Dconformance_concurrent_vector.cpp124 REQUIRE( cp == v.cend() ); in TestSequentialFor()
/oneTBB/include/oneapi/tbb/
H A Dconcurrent_vector.h468 const_iterator cend() const { return const_iterator(*this, size()); } in cend() function
472 const_reverse_iterator crbegin() const { return const_reverse_iterator(cend()); } in crbegin()
H A Dconcurrent_hash_map.h1051 const_iterator cend() const { return const_iterator( *this, 0, nullptr, nullptr ); } in __TBB_requires()
H A Dflow_graph.h521 inline graph::const_iterator graph::cend() const { return const_iterator(this, false); } in cend() function
/oneTBB/test/common/
H A Dconcurrent_associative_common.h457 …REQUIRE_MESSAGE(cont.cbegin() == cont.cend(), "Concurrent container iterators are invalid after co…