Home
last modified time | relevance | path

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

123456

/llvm-project-15.0.7/libcxx/test/std/containers/associative/set/
H A Dupper_bound.pass.cpp44 r = m.upper_bound(7); in main()
46 r = m.upper_bound(9); in main()
251 r = m.upper_bound(7); in main()
253 r = m.upper_bound(9); in main()
265 r = m.upper_bound(4); in main()
267 r = m.upper_bound(6); in main()
269 r = m.upper_bound(8); in main()
302 r = m.upper_bound(7); in main()
304 r = m.upper_bound(9); in main()
316 r = m.upper_bound(4); in main()
[all …]
/llvm-project-15.0.7/libcxx/test/std/containers/associative/map/map.ops/
H A Dupper_bound.pass.cpp44 r = m.upper_bound(7); in main()
46 r = m.upper_bound(9); in main()
250 r = m.upper_bound(7); in main()
252 r = m.upper_bound(9); in main()
264 r = m.upper_bound(4); in main()
266 r = m.upper_bound(6); in main()
268 r = m.upper_bound(8); in main()
301 r = m.upper_bound(7); in main()
303 r = m.upper_bound(9); in main()
315 r = m.upper_bound(4); in main()
[all …]
H A Dupper_bound0.pass.cpp34 assert(example.upper_bound(C2Int{5}) == example.end()); in main()
39 assert(example.upper_bound(C2Int{5}) == example.end()); in main()
H A Dupper_bound3.compile.fail.cpp36 TEST_IGNORE_NODISCARD M().upper_bound(C2Int{5}); in main()
H A Dupper_bound1.compile.fail.cpp36 TEST_IGNORE_NODISCARD M().upper_bound(C2Int{5}); in main()
H A Dupper_bound2.compile.fail.cpp36 TEST_IGNORE_NODISCARD M().upper_bound(C2Int{5}); in main()
/llvm-project-15.0.7/libcxx/test/std/containers/associative/multimap/multimap.ops/
H A Dupper_bound.pass.cpp46 r = m.upper_bound(5); in main()
174 r = m.upper_bound(5); in main()
176 r = m.upper_bound(6); in main()
178 r = m.upper_bound(7); in main()
180 r = m.upper_bound(8); in main()
182 r = m.upper_bound(9); in main()
220 r = m.upper_bound(5); in main()
222 r = m.upper_bound(6); in main()
224 r = m.upper_bound(7); in main()
226 r = m.upper_bound(8); in main()
[all …]
H A Dupper_bound0.pass.cpp34 assert(example.upper_bound(C2Int{5}) == example.end()); in main()
39 assert(example.upper_bound(C2Int{5}) == example.end()); in main()
H A Dupper_bound2.compile.fail.cpp36 TEST_IGNORE_NODISCARD M().upper_bound(C2Int{5}); in main()
H A Dupper_bound3.compile.fail.cpp36 TEST_IGNORE_NODISCARD M().upper_bound(C2Int{5}); in main()
H A Dupper_bound1.compile.fail.cpp36 TEST_IGNORE_NODISCARD M().upper_bound(C2Int{5}); in main()
/llvm-project-15.0.7/libcxx/test/std/containers/associative/multiset/
H A Dupper_bound.pass.cpp45 r = m.upper_bound(5); in main()
176 r = m.upper_bound(5); in main()
178 r = m.upper_bound(6); in main()
180 r = m.upper_bound(7); in main()
182 r = m.upper_bound(8); in main()
184 r = m.upper_bound(9); in main()
208 r = m.upper_bound(5); in main()
210 r = m.upper_bound(6); in main()
212 r = m.upper_bound(7); in main()
214 r = m.upper_bound(8); in main()
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/upper.bound/
H A Dranges.upper_bound.pass.cpp103 auto ret = std::ranges::upper_bound(It(a), It(a + 5), 2); in test_iterators()
109 auto ret = std::ranges::upper_bound(range, 2); in test_iterators()
117 auto ret = std::ranges::upper_bound(It(a), It(a + 4), 5); in test_iterators()
123 auto ret = std::ranges::upper_bound(range, 5); in test_iterators()
131 auto ret = std::ranges::upper_bound(It(a), It(a + 4), 0); in test_iterators()
137 auto ret = std::ranges::upper_bound(range, 0); in test_iterators()
151 auto ret = std::ranges::upper_bound(range, 1); in test_iterators()
165 auto ret = std::ranges::upper_bound(range, 6); in test_iterators()
179 auto ret = std::ranges::upper_bound(range, 6); in test_iterators()
193 auto ret = std::ranges::upper_bound(range, 1); in test_iterators()
[all …]
H A Dupper_bound.pass.cpp27 return (std::upper_bound(std::begin(ia), std::end(ia), 2) == ia+1) in test_constexpr()
28 && (std::upper_bound(std::begin(ia), std::end(ia), 3) == ia+2) in test_constexpr()
29 && (std::upper_bound(std::begin(ia), std::end(ia), 9) == std::end(ia)) in test_constexpr()
38 Iter i = std::upper_bound(first, last, value); in test()
H A Dupper_bound_comp.pass.cpp30 return (std::upper_bound(std::begin(ia), std::end(ia), 2, lt) == ia+1) in test_constexpr()
31 && (std::upper_bound(std::begin(ia), std::end(ia), 3, lt) == ia+2) in test_constexpr()
32 && (std::upper_bound(std::begin(ia), std::end(ia), 9, lt) == std::end(ia)) in test_constexpr()
41 Iter i = std::upper_bound(first, last, value, std::greater<int>()); in test()
/llvm-project-15.0.7/lldb/source/Plugins/SymbolFile/DWARF/
H A DDWARFASTParser.cpp38 uint64_t upper_bound = 0; in ParseChildArrayInfo() local
82 upper_bound = form_value.Unsigned(); in ParseChildArrayInfo()
92 if (upper_bound_valid && upper_bound >= lower_bound) in ParseChildArrayInfo()
93 num_elements = upper_bound - lower_bound + 1; in ParseChildArrayInfo()
/llvm-project-15.0.7/lldb/source/Breakpoint/
H A DBreakpointSiteList.cpp172 lldb::addr_t upper_bound, in FindInRange() argument
174 if (lower_bound > upper_bound) in FindInRange()
180 if (lower == m_bp_site_list.end() || (*lower).first >= upper_bound) in FindInRange()
194 upper = m_bp_site_list.upper_bound(upper_bound); in FindInRange()
/llvm-project-15.0.7/libcxx/include/__algorithm/
H A Dupper_bound.h49 upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp)… in upper_bound() function
58 upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) { in upper_bound() function
59 return std::upper_bound( in upper_bound()
/llvm-project-15.0.7/mlir/python/mlir/dialects/
H A D_scf_ops_ext.py18 upper_bound, argument
44 for o in [lower_bound, upper_bound, step]
/llvm-project-15.0.7/lldb/include/lldb/Utility/
H A DRangeMap.h427 B upper_bound; member
430 : RangeData<B, S, T>(rd), upper_bound() {} in AugmentedRangeData()
644 entry.upper_bound = entry.base + entry.size; in ComputeUpperBounds()
647 entry.upper_bound = in ComputeUpperBounds()
648 std::max(entry.upper_bound, ComputeUpperBounds(lo, mid)); in ComputeUpperBounds()
651 entry.upper_bound = in ComputeUpperBounds()
652 std::max(entry.upper_bound, ComputeUpperBounds(mid + 1, hi)); in ComputeUpperBounds()
654 return entry.upper_bound; in ComputeUpperBounds()
666 if (addr > entry.upper_bound) in FindEntryIndexesThatContain()
/llvm-project-15.0.7/lldb/source/Plugins/Trace/intel-pt/
H A DDecodedThread.cpp156 auto it = m_cpus.upper_bound(item_index); in GetCPUByIndex()
164 auto next_it = m_tscs.upper_bound(item_index); in GetTSCRangeByIndex()
172 auto next_it = m_nanoseconds.upper_bound(item_index); in GetNanosecondsRangeByIndex()
/llvm-project-15.0.7/libcxx/include/
H A Dset172 iterator upper_bound(const key_type& k);
894 iterator upper_bound(const key_type& __k)
895 {return __tree_.upper_bound(__k);}
898 {return __tree_.upper_bound(__k);}
903 upper_bound(const _K2& __k) {return __tree_.upper_bound(__k);}
907 upper_bound(const _K2& __k) const {return __tree_.upper_bound(__k);}
1426 iterator upper_bound(const key_type& __k)
1427 {return __tree_.upper_bound(__k);}
1430 {return __tree_.upper_bound(__k);}
1435 upper_bound(const _K2& __k) {return __tree_.upper_bound(__k);}
[all …]
/llvm-project-15.0.7/clang-tools-extra/docs/clang-tidy/checks/bugprone/
H A Dunused-return-value.rst21 std::multimap::upper_bound, std::set::count, std::set::find, std::setfill,
22 std::setprecision, std::setw, std::upper_bound, std::vector::at,
/llvm-project-15.0.7/bolt/lib/Profile/
H A DBoltAddressTranslation.cpp204 auto KeyVal = Map.upper_bound(Offset); in translate()
237 auto FromIter = Map.upper_bound(From); in getFallthroughsInTrace()
248 auto ToIter = Map.upper_bound(To); in getFallthroughsInTrace()
/llvm-project-15.0.7/llvm/test/Transforms/SimplifyCFG/
H A Dmultiple-phis.ll9 define i32 @upper_bound(i32* %r, i32 %high, i32 %k) nounwind {
10 ; CHECK-LABEL: @upper_bound(

123456