reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
198 return adl_begin(RangeOrContainer) == adl_end(RangeOrContainer); 760 zip_longest_iterator<decltype(adl_begin(std::declval<Args>()))...>; 772 return iterator(std::make_pair(adl_begin(std::get<Ns>(ts)), 1104 llvm::sort(adl_begin(C), adl_end(C)); 1118 llvm::sort(adl_begin(C), adl_end(C), Comp); 1159 return std::for_each(adl_begin(Range), adl_end(Range), P); 1166 return std::all_of(adl_begin(Range), adl_end(Range), P); 1173 return std::any_of(adl_begin(Range), adl_end(Range), P); 1180 return std::none_of(adl_begin(Range), adl_end(Range), P); 1186 auto find(R &&Range, const T &Val) -> decltype(adl_begin(Range)) { 1187 return std::find(adl_begin(Range), adl_end(Range), Val); 1193 auto find_if(R &&Range, UnaryPredicate P) -> decltype(adl_begin(Range)) { 1194 return std::find_if(adl_begin(Range), adl_end(Range), P); 1198 auto find_if_not(R &&Range, UnaryPredicate P) -> decltype(adl_begin(Range)) { 1199 return std::find_if_not(adl_begin(Range), adl_end(Range), P); 1205 auto remove_if(R &&Range, UnaryPredicate P) -> decltype(adl_begin(Range)) { 1206 return std::remove_if(adl_begin(Range), adl_end(Range), P); 1213 return std::copy_if(adl_begin(Range), adl_end(Range), Out, P); 1218 return std::copy(adl_begin(Range), adl_end(Range), Out); 1225 return std::find(adl_begin(Range), adl_end(Range), Element) != adl_end(Range); 1232 typename std::iterator_traits<decltype(adl_begin(Range))>::difference_type { 1233 return std::count(adl_begin(Range), adl_end(Range), Element); 1240 typename std::iterator_traits<decltype(adl_begin(Range))>::difference_type { 1241 return std::count_if(adl_begin(Range), adl_end(Range), P); 1248 return std::transform(adl_begin(Range), adl_end(Range), d_first, P); 1254 auto partition(R &&Range, UnaryPredicate P) -> decltype(adl_begin(Range)) { 1255 return std::partition(adl_begin(Range), adl_end(Range), P); 1261 auto lower_bound(R &&Range, T &&Value) -> decltype(adl_begin(Range)) { 1262 return std::lower_bound(adl_begin(Range), adl_end(Range), 1268 -> decltype(adl_begin(Range)) { 1269 return std::lower_bound(adl_begin(Range), adl_end(Range), 1276 auto upper_bound(R &&Range, T &&Value) -> decltype(adl_begin(Range)) { 1277 return std::upper_bound(adl_begin(Range), adl_end(Range), 1283 -> decltype(adl_begin(Range)) { 1284 return std::upper_bound(adl_begin(Range), adl_end(Range), 1290 std::stable_sort(adl_begin(Range), adl_end(Range)); 1295 std::stable_sort(adl_begin(Range), adl_end(Range), C); 1302 auto partition_point(R &&Range, Predicate P) -> decltype(adl_begin(Range)) { 1303 return std::partition_point(adl_begin(Range), adl_end(Range), P); 1312 std::equal(adl_begin(Range) + 1, adl_end(Range), adl_begin(Range))); 1312 std::equal(adl_begin(Range) + 1, adl_end(Range), adl_begin(Range))); 1321 return {adl_begin(Range), adl_end(Range)};include/llvm/ADT/iterator_range.h
63 iterator_range<decltype(adl_begin(std::declval<T>()))> drop_begin(T &&t, 65 return make_range(std::next(adl_begin(t), n), adl_end(t));unittests/ADT/STLExtrasTest.cpp
354 EXPECT_EQ(*adl_begin(s), 1);