|
|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
References
include/llvm/ADT/STLExtras.h 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))) {
1193 auto find_if(R &&Range, UnaryPredicate P) -> decltype(adl_begin(Range)) {
include/llvm/ADT/iterator_range.h 32 IteratorT begin_iterator, end_iterator;
41 iterator_range(IteratorT begin_iterator, IteratorT end_iterator)
41 iterator_range(IteratorT begin_iterator, IteratorT end_iterator)
45 IteratorT begin() const { return begin_iterator; }
46 IteratorT end() const { return end_iterator; }
54 template <class T> iterator_range<T> make_range(T x, T y) {
54 template <class T> iterator_range<T> make_range(T x, T y) {
54 template <class T> iterator_range<T> make_range(T x, T y) {
include/llvm/Support/TargetRegistry.h 615 bool operator==(const iterator &x) const { return Current == x.Current; }
616 bool operator!=(const iterator &x) const { return !operator==(x); }
619 iterator &operator++() { // Preincrement
624 iterator operator++(int) { // Postincrement
625 iterator tmp = *this;
645 static iterator_range<iterator> targets();
lib/ExecutionEngine/TargetSelect.cpp 50 auto I = find_if(TargetRegistry::targets(),
lib/Support/TargetRegistry.cpp 20 iterator_range<TargetRegistry::iterator> TargetRegistry::targets() {
32 auto I = find_if(targets(),
71 auto I = find_if(targets(), ArchMatch);
78 auto J = std::find_if(std::next(I), targets().end(), ArchMatch);
lib/Target/TargetMachineC.cpp 61 auto I = find_if(TargetRegistry::targets(),
usr/include/c++/7.4.0/bits/move.h 98 move(_Tp&& __t) noexcept
usr/include/c++/7.4.0/bits/predefined_ops.h 282 operator()(_Iterator __it)
usr/include/c++/7.4.0/bits/range_access.h 48 begin(_Container& __cont) -> decltype(__cont.begin())
58 begin(const _Container& __cont) -> decltype(__cont.begin())
68 end(_Container& __cont) -> decltype(__cont.end())
78 end(const _Container& __cont) -> decltype(__cont.end())
usr/include/c++/7.4.0/bits/stl_algo.h 100 inline _InputIterator
101 __find_if(_InputIterator __first, _InputIterator __last,
101 __find_if(_InputIterator __first, _InputIterator __last,
111 _RandomAccessIterator
112 __find_if(_RandomAccessIterator __first, _RandomAccessIterator __last,
112 __find_if(_RandomAccessIterator __first, _RandomAccessIterator __last,
158 inline _Iterator
159 __find_if(_Iterator __first, _Iterator __last, _Predicate __pred)
159 __find_if(_Iterator __first, _Iterator __last, _Predicate __pred)
3922 inline _InputIterator
3923 find_if(_InputIterator __first, _InputIterator __last,
3923 find_if(_InputIterator __first, _InputIterator __last,
usr/include/c++/7.4.0/bits/stl_iterator_base_funcs.h 147 __advance(_InputIterator& __i, _Distance __n, input_iterator_tag)
158 __advance(_BidirectionalIterator& __i, _Distance __n,
174 __advance(_RandomAccessIterator& __i, _Distance __n,
197 advance(_InputIterator& __i, _Distance __n)
200 typename iterator_traits<_InputIterator>::difference_type __d = __n;
207 inline _GLIBCXX17_CONSTEXPR _ForwardIterator
208 next(_ForwardIterator __x, typename
209 iterator_traits<_ForwardIterator>::difference_type __n = 1)
usr/include/c++/7.4.0/bits/stl_iterator_base_types.h 154 typedef typename _Iterator::iterator_category iterator_category;
155 typedef typename _Iterator::value_type value_type;
156 typedef typename _Iterator::difference_type difference_type;
157 typedef typename _Iterator::pointer pointer;
158 typedef typename _Iterator::reference reference;
163 : public __iterator_traits<_Iterator> { };
204 typename iterator_traits<_Iter>::iterator_category
205 __iterator_category(const _Iter&)
usr/include/c++/7.4.0/type_traits 1633 { typedef _Tp type; };