reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
155 -> decltype(begin(std::forward<ContainerTy>(container))) { 163 -> decltype(end(std::forward<ContainerTy>(container))) { 179 -> decltype(adl_detail::adl_begin(std::forward<ContainerTy>(container))) { 185 -> decltype(adl_detail::adl_end(std::forward<ContainerTy>(container))) { 921 decltype(std::begin(std::declval<RangeTs &>()))...>; 1147 std::is_same<typename std::iterator_traits<decltype( 1186 auto find(R &&Range, const T &Val) -> decltype(adl_begin(Range)) { 1193 auto find_if(R &&Range, UnaryPredicate P) -> decltype(adl_begin(Range)) { 1205 auto remove_if(R &&Range, UnaryPredicate P) -> decltype(adl_begin(Range)) { 1240 typename std::iterator_traits<decltype(adl_begin(Range))>::difference_type { 1254 auto partition(R &&Range, UnaryPredicate P) -> decltype(adl_begin(Range)) { 1261 auto lower_bound(R &&Range, T &&Value) -> decltype(adl_begin(Range)) { 1268 -> decltype(adl_begin(Range)) { 1276 auto upper_bound(R &&Range, T &&Value) -> decltype(adl_begin(Range)) { 1283 -> decltype(adl_begin(Range)) { 1302 auto partition_point(R &&Range, Predicate P) -> decltype(adl_begin(Range)) {include/llvm/ADT/SmallVector.h
119 using reverse_iterator = std::reverse_iterator<iterator>; 127 iterator begin() { return (iterator)this->BeginX; } 129 iterator end() { return begin() + size(); } 319 using iterator = typename SuperClass::iterator;include/llvm/ADT/iterator_range.h
63 iterator_range<decltype(adl_begin(std::declval<T>()))> drop_begin(T &&t,
usr/include/c++/7.4.0/bits/range_access.h48 begin(_Container& __cont) -> decltype(__cont.begin()) 68 end(_Container& __cont) -> decltype(__cont.end())