Home
last modified time | relevance | path

Searched refs:upper_bound (Results 1 – 4 of 4) sorted by relevance

/oneTBB/test/common/
H A Dconcurrent_ordered_common.h111 typename Container::iterator u_bound = cont.upper_bound(key); in test_ordered_methods()
118 const_iterator cu_bound = ccont.upper_bound(key); in test_ordered_methods()
321 …REQUIRE_MESSAGE(c.upper_bound(k) == c.upper_bound(key), "Incorrect heterogeneous upper_bound retur…
323 …REQUIRE_MESSAGE(cc.upper_bound(k) == cc.upper_bound(key), "Incorrect const heterogeneous upper_bou…
H A Dconcurrent_lru_cache_common.h248 void fill_up_cache(std::size_t lower_bound, std::size_t upper_bound) { in fill_up_cache()
249 for (std::size_t i = lower_bound; i < upper_bound; ++i) in fill_up_cache()
/oneTBB/include/oneapi/tbb/detail/
H A D_utils.h136 T clamp(T value, T lower_bound, T upper_bound) { in clamp() argument
137 __TBB_ASSERT(lower_bound <= upper_bound, "Incorrect bounds"); in clamp()
138 return value > lower_bound ? (value > upper_bound ? upper_bound : value) : lower_bound; in clamp()
H A D_concurrent_skip_list.h518 iterator upper_bound( const key_type& key ) { in upper_bound() function
522 const_iterator upper_bound( const key_type& key ) const { in upper_bound() function
527 typename std::enable_if<is_transparent<K>::value, iterator>::type upper_bound( const K& key ) { in upper_bound() function
532 …typename std::enable_if<is_transparent<K>::value, const_iterator>::type upper_bound( const K& key … in upper_bound() function