/netbsd-current/external/gpl3/gdb.old/dist/gdbsupport/ |
H A D | gdb_binary_search.h | 48 auto lb = std::lower_bound (first, last, el, lt);
|
/netbsd-current/external/gpl3/gdb/dist/gdbsupport/ |
H A D | gdb_binary_search.h | 48 auto lb = std::lower_bound (first, last, el, lt);
|
/netbsd-current/external/gpl3/gcc.old/dist/libgfortran/runtime/ |
H A D | ISO_Fortran_binding.c | 79 GFC_DESCRIPTOR_LBOUND(d, n) = (index_type)s->dim[n].lower_bound; 81 + s->dim[n].lower_bound - 1); 127 d->dim[n].lower_bound = (CFI_index_t)GFC_DESCRIPTOR_LBOUND(s, n); 129 d->dim[n].lower_bound = 0; 180 CFI_index_t idx = subscripts[i] - dv->dim[i].lower_bound; 187 "lower_bound = %d, upper bound = %d, extend = %d\n", 188 i, i, (int)subscripts[i], (int)dv->dim[i].lower_bound, 189 (int)(dv->dim[i].extent - dv->dim[i].lower_bound), 255 dv->dim[i].lower_bound = lower_bounds[i]; 256 dv->dim[i].extent = upper_bounds[i] - dv->dim[i].lower_bound [all...] |
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/ |
H A D | debug_fn_imps.hpp | 69 PB_DS_DEBUG_VERIFY(lower_bound(PB_DS_V2F(*it)) == it);
|
H A D | ov_tree_map_.hpp | 261 point_iterator it = lower_bound(r_key); 280 point_iterator it = lower_bound(r_key); 293 lower_bound(key_const_reference r_key) function in class:__gnu_pbds::detail::PB_DS_OV_TREE_NAME 309 lower_bound(key_const_reference r_key) const function in class:__gnu_pbds::detail::PB_DS_OV_TREE_NAME 310 { return const_cast<PB_DS_CLASS_C_DEC& >(*this).lower_bound(r_key); } 315 iterator pot_it = lower_bound(r_key); 334 iterator pot_it = lower_bound(r_key);
|
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/ |
H A D | debug_fn_imps.hpp | 69 PB_DS_DEBUG_VERIFY(lower_bound(PB_DS_V2F(*it)) == it);
|
H A D | ov_tree_map_.hpp | 261 point_iterator it = lower_bound(r_key); 280 point_iterator it = lower_bound(r_key); 293 lower_bound(key_const_reference r_key) function in class:__gnu_pbds::detail::PB_DS_OV_TREE_NAME 309 lower_bound(key_const_reference r_key) const function in class:__gnu_pbds::detail::PB_DS_OV_TREE_NAME 310 { return const_cast<PB_DS_CLASS_C_DEC& >(*this).lower_bound(r_key); } 315 iterator pot_it = lower_bound(r_key); 334 iterator pot_it = lower_bound(r_key);
|
/netbsd-current/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.dwarf2/ |
H A D | subrange.exp | 48 {lower_bound 0 DW_FORM_sdata}
|
/netbsd-current/external/gpl3/gdb/dist/gdb/testsuite/gdb.dwarf2/ |
H A D | subrange.exp | 48 {lower_bound 0 DW_FORM_sdata}
|
H A D | subrange-enum.exp | 59 {lower_bound 1 DW_FORM_sdata}
|
/netbsd-current/external/gpl3/gcc/dist/libgfortran/runtime/ |
H A D | ISO_Fortran_binding.c | 86 lb = s->dim[n].lower_bound; 137 d->dim[n].lower_bound = (CFI_index_t)GFC_DESCRIPTOR_LBOUND(s, n); 139 d->dim[n].lower_bound = 0; 190 CFI_index_t idx = subscripts[i] - dv->dim[i].lower_bound; 197 "lower_bound = %" PRIiPTR ", upper bound = %" PRIiPTR 200 (ptrdiff_t)dv->dim[i].lower_bound, 201 (ptrdiff_t)(dv->dim[i].extent - dv->dim[i].lower_bound), 267 dv->dim[i].lower_bound = lower_bounds[i]; 268 dv->dim[i].extent = upper_bounds[i] - dv->dim[i].lower_bound + 1; 424 dv->dim[i].lower_bound [all...] |
/netbsd-current/external/apache2/llvm/dist/clang/lib/Lex/ |
H A D | PPConditionalDirectiveRecord.cpp | 28 CondDirectiveLocsTy::const_iterator low = llvm::lower_bound( 57 CondDirectiveLocsTy::const_iterator low = llvm::lower_bound(
|
/netbsd-current/external/apache2/llvm/dist/llvm/lib/MC/ |
H A D | MCRegisterInfo.cpp | 75 const DwarfLLVMRegPair *I = std::lower_bound(M, M+Size, Key); 89 const DwarfLLVMRegPair *I = std::lower_bound(M, M+Size, Key);
|
/netbsd-current/external/bsd/ntp/dist/scripts/ |
H A D | plot_summary.in | 108 my ($lower_bound, $upper_bound, $rms); 133 $lower_bound = $1 - $2; 135 $line .= "$1 $lower_bound $upper_bound"; 136 $min_offs = min($min_offs, $lower_bound);
|
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/ |
H A D | find_fn_imps.hpp | 46 lower_bound(key_const_reference r_key) const function in class:PB_DS_CLASS_C_DEC 65 lower_bound(key_const_reference r_key) function in class:PB_DS_CLASS_C_DEC
|
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/ |
H A D | find_fn_imps.hpp | 46 lower_bound(key_const_reference r_key) const function in class:PB_DS_CLASS_C_DEC 65 lower_bound(key_const_reference r_key) function in class:PB_DS_CLASS_C_DEC
|
/netbsd-current/external/apache2/llvm/dist/clang/lib/AST/Interp/ |
H A D | Function.cpp | 37 auto It = std::lower_bound(SrcMap.begin(), SrcMap.end(), Elem{Offset, {}},
|
/netbsd-current/external/apache2/llvm/dist/llvm/lib/TextAPI/ |
H A D | InterfaceFile.cpp | 35 lower_bound(Container, Target_, [](const Target &LHS, const Target &RHS) { 62 auto Iter = lower_bound(ParentUmbrellas, Target_, 75 auto Iter = lower_bound(UUIDs, Target_, 122 auto Pos = llvm::lower_bound(Documents, Document,
|
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/ |
H A D | find_fn_imps.hpp | 162 lower_bound(key_const_reference r_key) function in class:PB_DS_CLASS_C_DEC 168 lower_bound(key_const_reference r_key) const function in class:PB_DS_CLASS_C_DEC 178 point_iterator l_bound_it = lower_bound(r_key); 196 point_const_iterator l_bound_it = lower_bound(r_key);
|
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/src/c++11/ |
H A D | hashtable_c++0x.cc | 75 std::lower_bound(__prime_list + 6, __last_prime, __n);
|
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/ |
H A D | find_fn_imps.hpp | 162 lower_bound(key_const_reference r_key) function in class:PB_DS_CLASS_C_DEC 168 lower_bound(key_const_reference r_key) const function in class:PB_DS_CLASS_C_DEC 178 point_iterator l_bound_it = lower_bound(r_key); 196 point_const_iterator l_bound_it = lower_bound(r_key);
|
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/src/c++11/ |
H A D | hashtable_c++0x.cc | 76 std::lower_bound(__prime_list + 6, __last_prime, __n);
|
/netbsd-current/external/gpl3/gcc/dist/gcc/ |
H A D | range-op.cc | 214 wi_fold_in_parts (r, type, lh.lower_bound (), lh.upper_bound (), 215 rh.lower_bound (), rh.upper_bound ()); 225 wide_int lh_lb = lh.lower_bound (x); 227 wide_int rh_lb = rh.lower_bound (y); 571 if (wi::eq_p (op1.lower_bound (), op1.upper_bound ()) 572 && wi::eq_p (op2.lower_bound (), op2.upper_bound ())) 574 if (wi::eq_p (op1.lower_bound (), op2.upper_bound())) 604 if (wi::eq_p (op2.lower_bound(), op2.upper_bound())) 680 if (wi::eq_p (op1.lower_bound (), op1.upper_bound ()) 681 && wi::eq_p (op2.lower_bound (), op 2678 wide_int lower_bound, upper_bound, mask; local [all...] |
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/ |
H A D | stl_map.h | 497 iterator __i = lower_bound(__k); 517 iterator __i = lower_bound(__k); 539 iterator __i = lower_bound(__k); 548 const_iterator __i = lower_bound(__k); 693 iterator __i = lower_bound(__k); 710 iterator __i = lower_bound(__k); 920 iterator __i = lower_bound(__k); 938 iterator __i = lower_bound(__k); 1258 lower_bound(const key_type& __x) function in class:map 1259 { return _M_t.lower_bound(__ 1283 lower_bound(const key_type& __x) const function in class:map [all...] |
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/profile/ |
H A D | multiset.h | 432 lower_bound(const key_type& __x) function in class:__profile::multiset 435 return iterator(_Base::lower_bound(__x), this); 441 lower_bound(const key_type& __x) const function in class:__profile::multiset 445 return const_iterator(_Base::lower_bound(__x), this); 453 lower_bound(const _Kt& __x) function in class:__profile::multiset 457 return { _Base::lower_bound(__x), this }; 464 lower_bound(const _Kt& __x) const function in class:__profile::multiset 468 return { _Base::lower_bound(__x), this };
|