|
|
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))) {
include/llvm/ADT/SmallVector.h 277 static void uninitialized_copy(It1 I, It1 E, It2 Dest) {
277 static void uninitialized_copy(It1 I, It1 E, It2 Dest) {
387 void append(in_iter in_start, in_iter in_end) {
387 void append(in_iter in_start, in_iter in_end) {
855 SmallVector(ItTy S, ItTy E) : SmallVectorImpl<T>(N) {
855 SmallVector(ItTy S, ItTy E) : SmallVectorImpl<T>(N) {
usr/include/c++/7.4.0/bits/algorithmfwd.h 659 _IIter
660 find_if(_IIter, _IIter, _Predicate);
660 find_if(_IIter, _IIter, _Predicate);
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)
525 none_of(_InputIterator __first, _InputIterator __last, _Predicate __pred)
525 none_of(_InputIterator __first, _InputIterator __last, _Predicate __pred)
543 any_of(_InputIterator __first, _InputIterator __last, _Predicate __pred)
543 any_of(_InputIterator __first, _InputIterator __last, _Predicate __pred)
usr/include/c++/7.4.0/bits/stl_iterator_base_funcs.h 79 typename iterator_traits<_InputIterator>::difference_type
80 __distance(_InputIterator __first, _InputIterator __last,
80 __distance(_InputIterator __first, _InputIterator __last,
86 typename iterator_traits<_InputIterator>::difference_type __n = 0;
97 typename iterator_traits<_RandomAccessIterator>::difference_type
98 __distance(_RandomAccessIterator __first, _RandomAccessIterator __last,
98 __distance(_RandomAccessIterator __first, _RandomAccessIterator __last,
137 typename iterator_traits<_InputIterator>::difference_type
138 distance(_InputIterator __first, _InputIterator __last)
138 distance(_InputIterator __first, _InputIterator __last)
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/bits/stl_uninitialized.h 76 __uninit_copy(_InputIterator __first, _InputIterator __last,
76 __uninit_copy(_InputIterator __first, _InputIterator __last,
115 uninitialized_copy(_InputIterator __first, _InputIterator __last,
115 uninitialized_copy(_InputIterator __first, _InputIterator __last,
118 typedef typename iterator_traits<_InputIterator>::value_type
126 typedef typename iterator_traits<_InputIterator>::reference _RefType1;
utils/TableGen/CodeGenDAGPatterns.cpp 430 static Iter min_if(Iter B, Iter E, Pred P, Less L) {
430 static Iter min_if(Iter B, Iter E, Pred P, Less L) {
430 static Iter min_if(Iter B, Iter E, Pred P, Less L) {
433 Iter Min = E;
434 for (Iter I = B; I != E; ++I) {
444 static Iter max_if(Iter B, Iter E, Pred P, Less L) {
444 static Iter max_if(Iter B, Iter E, Pred P, Less L) {
444 static Iter max_if(Iter B, Iter E, Pred P, Less L) {
447 Iter Max = E;
448 for (Iter I = B; I != E; ++I) {
525 auto MinS = min_if(S.begin(), S.end(), isScalar, LT);
531 auto MaxS = max_if(B.begin(), B.end(), isScalar, LT);
537 auto MinV = min_if(S.begin(), S.end(), isVector, LT);
543 auto MaxV = max_if(B.begin(), B.end(), isVector, LT);
utils/TableGen/CodeGenDAGPatterns.h 127 const_iterator &operator++() {
134 bool operator==(const const_iterator &It) const {
138 bool operator!=(const const_iterator &It) const {
173 const_iterator begin() const { return const_iterator(this, false); }
175 const_iterator end() const { return const_iterator(this, true); }