Home
last modified time | relevance | path

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

/oneTBB/test/common/
H A Dconcurrent_ordered_common.h110 typename Container::iterator l_bound = cont.lower_bound(key); in test_ordered_methods()
117 const_iterator cl_bound = ccont.lower_bound(key); in test_ordered_methods()
320 …REQUIRE_MESSAGE(c.lower_bound(k) == c.lower_bound(key), "Incorrect heterogeneous lower_bound retur…
322 …REQUIRE_MESSAGE(cc.lower_bound(k) == cc.lower_bound(key), "Incorrect const heterogeneous lower_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.h500 iterator lower_bound( const key_type& key ) { in lower_bound() function
504 const_iterator lower_bound( const key_type& key ) const { in lower_bound() function
509 typename std::enable_if<is_transparent<K>::value, iterator>::type lower_bound( const K& key ) { in lower_bound() function
514 …typename std::enable_if<is_transparent<K>::value, const_iterator>::type lower_bound( const K& key … in lower_bound() function
805 const_iterator it = lower_bound(key); in internal_find_unique()
821 iterator lb = get_iterator(lower_bound(key)); in internal_equal_range()