Home
last modified time | relevance | path

Searched refs:rp (Results 1 – 2 of 2) sorted by relevance

/oneTBB/test/conformance/
H A Dconformance_concurrent_vector.cpp189 typename V::reverse_iterator rp = v.rbegin(); in TestSequentialFor() local
190 for( std::size_t i=v.size(); i>0; --i, ++rp ) { in TestSequentialFor()
191 typename V::reference pref = *rp; in TestSequentialFor()
193 REQUIRE( (rp!=v.rend()) ); in TestSequentialFor()
195 REQUIRE( rp==v.rend() ); in TestSequentialFor()
834 …e_t sum(std::size_t accumulator, grain_map::range_part const& rp){ return accumulator + rp.number_… in sum()
848 static bool is_not(range_part const& rp){ return !rp.distribute;} in is_not()
849 static bool is_yes(range_part const& rp){ return rp.distribute;} in is_yes()
1010 const grain_map::range_part& rp =concurrent_grow_single_range_map[i]; in TestConcurrentGrowBy() local
1011 switch (rp.expected_element_state){ in TestConcurrentGrowBy()
[all …]
/oneTBB/examples/parallel_for/polygon_overlay/
H A Dpolyover.cpp269 RPolygon *rp = i->p(); in check_my_map() local
270 assert(rp->xmax() >= my_range.begin()); in check_my_map()
271 assert(rp->xmin() < my_range.end()); in check_my_map()
274 RPolygon *rp = i->p(); in check_my_map() local
275 assert(rp->xmax() >= my_range.begin()); in check_my_map()
276 assert(rp->xmin() < my_range.end()); in check_my_map()