Home
last modified time | relevance | path

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

123456789

/llvm-project-15.0.7/libcxx/test/std/containers/associative/map/map.ops/
H A Dlower_bound.pass.cpp45 r = m.lower_bound(7); in main()
47 r = m.lower_bound(9); in main()
252 r = m.lower_bound(7); in main()
254 r = m.lower_bound(9); in main()
266 r = m.lower_bound(4); in main()
268 r = m.lower_bound(6); in main()
270 r = m.lower_bound(8); in main()
338 r = m.lower_bound(7); in main()
340 r = m.lower_bound(9); in main()
352 r = m.lower_bound(4); in main()
[all …]
H A Dlower_bound0.pass.cpp34 assert(example.lower_bound(C2Int{5}) == example.end()); in main()
39 assert(example.lower_bound(C2Int{5}) == example.end()); in main()
/llvm-project-15.0.7/libcxx/test/std/containers/associative/set/
H A Dlower_bound.pass.cpp44 r = m.lower_bound(7); in main()
46 r = m.lower_bound(9); in main()
251 r = m.lower_bound(7); in main()
253 r = m.lower_bound(9); in main()
265 r = m.lower_bound(4); in main()
267 r = m.lower_bound(6); in main()
269 r = m.lower_bound(8); in main()
302 r = m.lower_bound(7); in main()
304 r = m.lower_bound(9); in main()
316 r = m.lower_bound(4); in main()
[all …]
/llvm-project-15.0.7/libcxx/test/std/containers/associative/multimap/multimap.ops/
H A Dlower_bound.pass.cpp46 r = m.lower_bound(5); in main()
174 r = m.lower_bound(5); in main()
176 r = m.lower_bound(6); in main()
178 r = m.lower_bound(7); in main()
180 r = m.lower_bound(8); in main()
182 r = m.lower_bound(9); in main()
221 r = m.lower_bound(5); in main()
223 r = m.lower_bound(6); in main()
225 r = m.lower_bound(7); in main()
227 r = m.lower_bound(8); in main()
[all …]
H A Dlower_bound0.pass.cpp34 assert(example.lower_bound(C2Int{5}) == example.end()); in main()
39 assert(example.lower_bound(C2Int{5}) == example.end()); in main()
/llvm-project-15.0.7/libcxx/test/std/containers/associative/multiset/
H A Dlower_bound.pass.cpp177 r = m.lower_bound(5); in main()
179 r = m.lower_bound(6); in main()
181 r = m.lower_bound(7); in main()
183 r = m.lower_bound(8); in main()
185 r = m.lower_bound(9); in main()
187 r = m.lower_bound(11); in main()
209 r = m.lower_bound(5); in main()
211 r = m.lower_bound(6); in main()
213 r = m.lower_bound(7); in main()
215 r = m.lower_bound(8); in main()
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/lower.bound/
H A Dranges.lower_bound.pass.cpp104 auto ret = std::ranges::lower_bound(It(a), It(a + 5), 2); in test_iterators()
110 auto ret = std::ranges::lower_bound(range, 2); in test_iterators()
118 auto ret = std::ranges::lower_bound(It(a), It(a + 4), 5); in test_iterators()
124 auto ret = std::ranges::lower_bound(range, 5); in test_iterators()
132 auto ret = std::ranges::lower_bound(It(a), It(a + 4), 0); in test_iterators()
138 auto ret = std::ranges::lower_bound(range, 0); in test_iterators()
152 auto ret = std::ranges::lower_bound(range, 1); in test_iterators()
166 auto ret = std::ranges::lower_bound(range, 6); in test_iterators()
180 auto ret = std::ranges::lower_bound(range, 6); in test_iterators()
194 auto ret = std::ranges::lower_bound(range, 1); in test_iterators()
[all …]
H A Dlower_bound.pass.cpp30 return (std::lower_bound(std::begin(ia), std::end(ia), 2) == ia+1) in test_constexpr()
31 && (std::lower_bound(std::begin(ia), std::end(ia), 3) == ia+1) in test_constexpr()
32 && (std::lower_bound(std::begin(ia), std::end(ia), 9) == std::end(ia)) in test_constexpr()
42 Iter i = std::lower_bound(first, last, value); in test()
H A Dlower_bound_comp.pass.cpp30 return (std::lower_bound(std::begin(ia), std::end(ia), 2, lt) == ia+1) in test_constexpr()
31 && (std::lower_bound(std::begin(ia), std::end(ia), 3, lt) == ia+1) in test_constexpr()
32 && (std::lower_bound(std::begin(ia), std::end(ia), 9, lt) == std::end(ia)) in test_constexpr()
41 Iter i = std::lower_bound(first, last, value, std::greater<int>()); in test()
/llvm-project-15.0.7/flang/runtime/
H A DISO_Fortran_binding.cpp33 p += (subscripts[j] - dim->lower_bound) * dim->sm; in CFI_address()
75 dim->lower_bound = extent == 0 ? 1 : lb; in CFI_allocate()
278 constexpr std::size_t lower_bound{0}; in CFI_establish() local
281 descriptor->dim[j].lower_bound = lower_bound; in CFI_establish()
332 const CFI_index_t srcLB{dim.lower_bound}; in CFI_section()
365 result->dim[resRank].lower_bound = extent[j] == 0 ? 1 in CFI_section()
367 : source->dim[j].lower_bound; in CFI_section()
403 result->dim[j].lower_bound = 0; in CFI_select_part()
445 result->dim[j].lower_bound = extent == 0 ? 1 in CFI_setpointer()
446 : copySrcLB ? source->dim[j].lower_bound in CFI_setpointer()
/llvm-project-15.0.7/lldb/source/Plugins/SymbolFile/DWARF/
H A DDWARFASTParser.cpp37 uint64_t lower_bound = 0; in ParseChildArrayInfo() local
77 lower_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/flang/unittests/Evaluate/
H A DISO-Fortran-binding.cpp63 dv->dim[i].lower_bound = -42; in AddNoiseToCdesc()
216 dv->dim[i].lower_bound = sub[i]; in EstablishLowerBounds()
309 MATCH(lower_bounds[i], dv->dim[i].lower_bound); in check_CFI_allocate()
455 const CFI_index_t lbs0{source->dim[0].lower_bound}; in run_CFI_section_tests()
456 const CFI_index_t lbs1{source->dim[1].lower_bound}; in run_CFI_section_tests()
457 const CFI_index_t lbs2{source->dim[2].lower_bound}; in run_CFI_section_tests()
459 CFI_index_t resJ{result->dim[1].lower_bound}; in run_CFI_section_tests()
462 CFI_index_t resI{result->dim[0].lower_bound}; in run_CFI_section_tests()
486 resJ = result->dim[1].lower_bound; in run_CFI_section_tests()
562 result->dim[0].lower_bound + i, result->dim[1].lower_bound + j}; in run_CFI_select_part_tests()
[all …]
/llvm-project-15.0.7/libcxx/test/std/numerics/rand/rand.dist/rand.dist.samp/rand.dist.samp.pconst/
H A Deval.pass.cpp61 I lb = std::lower_bound(u.begin(), u.end(), b[i]); in test1()
62 I ub = std::lower_bound(u.begin(), u.end(), b[i+1]); in test1()
124 I lb = std::lower_bound(u.begin(), u.end(), b[i]); in test2()
125 I ub = std::lower_bound(u.begin(), u.end(), b[i+1]); in test2()
187 I lb = std::lower_bound(u.begin(), u.end(), b[i]); in test3()
188 I ub = std::lower_bound(u.begin(), u.end(), b[i+1]); in test3()
250 I lb = std::lower_bound(u.begin(), u.end(), b[i]); in test4()
313 I lb = std::lower_bound(u.begin(), u.end(), b[i]); in test5()
376 I lb = std::lower_bound(u.begin(), u.end(), b[i]); in test6()
439 I lb = std::lower_bound(u.begin(), u.end(), b[i]); in test7()
[all …]
H A Deval_param.pass.cpp64 I lb = std::lower_bound(u.begin(), u.end(), b[i]); in main()
65 I ub = std::lower_bound(u.begin(), u.end(), b[i+1]); in main()
/llvm-project-15.0.7/libcxx/include/__algorithm/
H A Dlower_bound.h52 _ForwardIterator lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value,… in lower_bound() function
61 _ForwardIterator lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value)… in lower_bound() function
62 return std::lower_bound(__first, __last, __value, in lower_bound()
/llvm-project-15.0.7/lldb/source/Breakpoint/
H A DBreakpointSiteList.cpp171 bool BreakpointSiteList::FindInRange(lldb::addr_t lower_bound, in FindInRange() argument
174 if (lower_bound > upper_bound) in FindInRange()
179 lower = m_bp_site_list.lower_bound(lower_bound); in FindInRange()
190 if (prev_bp->GetLoadAddress() + prev_bp->GetByteSize() > lower_bound) in FindInRange()
/llvm-project-15.0.7/clang-tools-extra/test/clang-tidy/checkers/performance/
H A Dinefficient-algorithm.cpp59 FwIt lower_bound(FwIt, FwIt end, const K &) { return end; } in lower_bound() function
62 FwIt lower_bound(FwIt, FwIt end, const K &, Ord) { return end; } in lower_bound() function
119 lower_bound(us.begin(), us.end(), 10); in main()
163 lower_bound(container.begin(), container.end(), value, Ordering()); in g()
/llvm-project-15.0.7/llvm/lib/TextAPI/
H A DInterfaceFile.cpp35 lower_bound(Container, Target_, [](const Target &LHS, const Target &RHS) { in addEntry()
62 auto Iter = lower_bound(ParentUmbrellas, Target_, in addParentUmbrella()
75 auto Iter = lower_bound(UUIDs, Target_, in addUUID()
122 auto Pos = llvm::lower_bound(Documents, Document, in addDocument()
/llvm-project-15.0.7/mlir/python/mlir/dialects/
H A D_scf_ops_ext.py17 lower_bound, argument
44 for o in [lower_bound, upper_bound, step]
/llvm-project-15.0.7/flang/include/flang/Runtime/
H A Ddescriptor.h47 SubscriptValue LowerBound() const { return raw_.lower_bound; } in LowerBound()
54 raw_.lower_bound = lower; in SetBounds()
57 raw_.lower_bound = 1; in SetBounds()
65 raw_.lower_bound = lower; in SetLowerBound()
69 auto lower{raw_.lower_bound}; in SetUpperBound()
/llvm-project-15.0.7/flang/include/flang/Lower/
H A DIntervalSet.h35 auto i = m.lower_bound(lo); in merge()
74 auto i = m.lower_bound(pt); in find()
/llvm-project-15.0.7/libcxx/test/std/numerics/rand/rand.dist/rand.dist.samp/rand.dist.samp.plinear/
H A Deval.pass.cpp79 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1; in test1()
131 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1; in test2()
183 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1; in test3()
235 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1; in test4()
289 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1; in test5()
342 int k = std::lower_bound(b, b+Np+1, u[i]) - b - 1; in test6()
/llvm-project-15.0.7/lldb/source/Plugins/Process/POSIX/
H A DCrashReason.cpp24 void AppendBounds(std::string &str, lldb::addr_t lower_bound, in AppendBounds() argument
27 if ((unsigned long)addr < lower_bound) in AppendBounds()
34 stream.write_hex(lower_bound); in AppendBounds()
/llvm-project-15.0.7/libcxx/include/
H A Dset165 iterator lower_bound(const key_type& k);
876 iterator lower_bound(const key_type& __k)
877 {return __tree_.lower_bound(__k);}
880 {return __tree_.lower_bound(__k);}
885 lower_bound(const _K2& __k) {return __tree_.lower_bound(__k);}
890 lower_bound(const _K2& __k) const {return __tree_.lower_bound(__k);}
1408 iterator lower_bound(const key_type& __k)
1409 {return __tree_.lower_bound(__k);}
1412 {return __tree_.lower_bound(__k);}
1417 lower_bound(const _K2& __k) {return __tree_.lower_bound(__k);}
[all …]
/llvm-project-15.0.7/lldb/include/lldb/Utility/
H A DRangeMap.h187 auto pos = std::lower_bound(begin, end, entry); in Insert()
320 std::lower_bound(begin, end, entry, BaseLessThan); in FindEntryIndexThatContains()
342 std::lower_bound(begin, end, entry, BaseLessThan); in FindEntryThatContains()
364 std::lower_bound(begin, end, range, BaseLessThan); in FindEntryThatContains()
569 std::lower_bound(begin, end, range, BaseLessThan); in FindEntryThatContains()
586 auto pos = std::lower_bound(begin, end, Entry(addr, 1), BaseLessThan); in FindEntryStartsAt()
610 std::lower_bound(m_entries.begin(), end, addr, in FindEntryThatContainsOrFollows()
774 std::lower_bound(begin, end, entry, BaseLessThan); in FindEntry()

123456789