| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/CodeGen/ |
| ScheduleDAG.h | 23 #include "llvm/ADT/iterator.h"
29 #include <iterator>
264 typedef SmallVectorImpl<SDep>::iterator pred_iterator;
265 typedef SmallVectorImpl<SDep>::iterator succ_iterator;
622 class SUnitIterator : public std::iterator<std::forward_iterator_tag,
681 typedef pointer_iterator<std::vector<SUnit>::iterator> nodes_iterator;
747 typedef std::vector<int>::iterator iterator; typedef in class:llvm::SUnit::ScheduleDAGTopologicalSort
749 iterator begin() { return Index2Node.begin(); }
751 iterator end() { return Index2Node.end();
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/ADT/ |
| STLExtras.h | 25 #include <iterator>
33 #include "llvm/ADT/iterator.h"
130 // Extra additions to <iterator>
133 // mapped_iterator - This is a simple iterator adapter that causes a function to
134 // be applied whenever operator* is invoked on the iterator.
209 template <class Iterator, class Func>
210 inline mapped_iterator<Iterator, Func>
211 operator+(typename mapped_iterator<Iterator, Func>::difference_type N,
212 const mapped_iterator<Iterator, Func> &X) {
213 return mapped_iterator<Iterator, Func>(X.getCurrent() - N, X.getFunc())
620 iterator; typedef in class:llvm::detail::concat_range
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/CodeGen/ |
| DIE.h | 22 #include "llvm/ADT/iterator.h"
31 #include <iterator>
516 class iterator class in class:llvm::IntrusiveBackList
517 : public iterator_facade_base<iterator, std::forward_iterator_tag, T> {
523 iterator() = default;
524 explicit iterator(T *N) : N(N) {} function in class:llvm::IntrusiveBackList::iterator
526 iterator &operator++() {
534 bool operator==(const iterator &X) const { return N == X.N; }
535 bool operator!=(const iterator &X) const { return N != X.N; }
545 // Placate MSVC by explicitly scoping 'iterator'
[all...] |
| ScheduleDAG.h | 23 #include "llvm/ADT/iterator.h"
29 #include <iterator>
264 typedef SmallVectorImpl<SDep>::iterator pred_iterator;
265 typedef SmallVectorImpl<SDep>::iterator succ_iterator;
622 class SUnitIterator : public std::iterator<std::forward_iterator_tag,
681 typedef pointer_iterator<std::vector<SUnit>::iterator> nodes_iterator;
747 typedef std::vector<int>::iterator iterator; typedef in class:llvm::SUnit::ScheduleDAGTopologicalSort
749 iterator begin() { return Index2Node.begin(); }
751 iterator end() { return Index2Node.end();
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/ADT/ |
| STLExtras.h | 25 #include <iterator>
33 #include "llvm/ADT/iterator.h"
130 // Extra additions to <iterator>
133 // mapped_iterator - This is a simple iterator adapter that causes a function to
134 // be applied whenever operator* is invoked on the iterator.
209 template <class Iterator, class Func>
210 inline mapped_iterator<Iterator, Func>
211 operator+(typename mapped_iterator<Iterator, Func>::difference_type N,
212 const mapped_iterator<Iterator, Func> &X) {
213 return mapped_iterator<Iterator, Func>(X.getCurrent() - N, X.getFunc())
620 iterator; typedef in class:llvm::detail::concat_range
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/CodeGen/ |
| DIE.h | 22 #include "llvm/ADT/iterator.h"
31 #include <iterator>
516 class iterator class in class:llvm::IntrusiveBackList
517 : public iterator_facade_base<iterator, std::forward_iterator_tag, T> {
523 iterator() = default;
524 explicit iterator(T *N) : N(N) {} function in class:llvm::IntrusiveBackList::iterator
526 iterator &operator++() {
534 bool operator==(const iterator &X) const { return N == X.N; }
535 bool operator!=(const iterator &X) const { return N != X.N; }
545 // Placate MSVC by explicitly scoping 'iterator'
[all...] |
| ScheduleDAG.h | 23 #include "llvm/ADT/iterator.h"
29 #include <iterator>
264 typedef SmallVectorImpl<SDep>::iterator pred_iterator;
265 typedef SmallVectorImpl<SDep>::iterator succ_iterator;
622 class SUnitIterator : public std::iterator<std::forward_iterator_tag,
681 typedef pointer_iterator<std::vector<SUnit>::iterator> nodes_iterator;
747 typedef std::vector<int>::iterator iterator; typedef in class:llvm::SUnit::ScheduleDAGTopologicalSort
749 iterator begin() { return Index2Node.begin(); }
751 iterator end() { return Index2Node.end();
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/ADT/ |
| STLExtras.h | 25 #include <iterator>
33 #include "llvm/ADT/iterator.h"
130 // Extra additions to <iterator>
133 // mapped_iterator - This is a simple iterator adapter that causes a function to
134 // be applied whenever operator* is invoked on the iterator.
209 template <class Iterator, class Func>
210 inline mapped_iterator<Iterator, Func>
211 operator+(typename mapped_iterator<Iterator, Func>::difference_type N,
212 const mapped_iterator<Iterator, Func> &X) {
213 return mapped_iterator<Iterator, Func>(X.getCurrent() - N, X.getFunc())
620 iterator; typedef in class:llvm::detail::concat_range
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/CodeGen/ |
| DIE.h | 22 #include "llvm/ADT/iterator.h"
31 #include <iterator>
516 class iterator class in class:llvm::IntrusiveBackList
517 : public iterator_facade_base<iterator, std::forward_iterator_tag, T> {
523 iterator() = default;
524 explicit iterator(T *N) : N(N) {} function in class:llvm::IntrusiveBackList::iterator
526 iterator &operator++() {
534 bool operator==(const iterator &X) const { return N == X.N; }
535 bool operator!=(const iterator &X) const { return N != X.N; }
545 // Placate MSVC by explicitly scoping 'iterator'
[all...] |
| ScheduleDAG.h | 23 #include "llvm/ADT/iterator.h"
29 #include <iterator>
264 typedef SmallVectorImpl<SDep>::iterator pred_iterator;
265 typedef SmallVectorImpl<SDep>::iterator succ_iterator;
622 class SUnitIterator : public std::iterator<std::forward_iterator_tag,
681 typedef pointer_iterator<std::vector<SUnit>::iterator> nodes_iterator;
747 typedef std::vector<int>::iterator iterator; typedef in class:llvm::SUnit::ScheduleDAGTopologicalSort
749 iterator begin() { return Index2Node.begin(); }
751 iterator end() { return Index2Node.end();
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/ |
| basic_string.h | 127 typedef __gnu_cxx::__normal_iterator<pointer, basic_string> iterator; typedef in class:basic_string
131 typedef std::reverse_iterator<iterator> reverse_iterator;
305 iterator
307 { return iterator(_M_data()); }
309 iterator
311 { return iterator(_M_data() + this->size()); }
391 _S_copy_chars(_CharT* __p, iterator __k1, iterator __k2)
601 * Returns a read/write iterator that points to the first character in
604 iterator
[all...] |
| regex.h | 114 * iterator range [F1, F2) such that if the character sequence [G1, G2)
164 * the iterator range [__first, __last). Returns an empty string if the
184 * the iterator range [__first, __last). If @p icase is true,
748 typedef _BiIter iterator; typedef in class:sub_match
1458 typedef const_iterator iterator; typedef in class:match_results
[all...] |
| stl_tree.h | 234 typedef _Rb_tree_iterator<_Tp> iterator; typedef in struct:_Rb_tree_const_iterator
250 _Rb_tree_const_iterator(const iterator& __it)
253 iterator
255 { return iterator(static_cast<typename iterator::_Link_type>
256 (const_cast<typename iterator::_Base_ptr>(_M_node))); }
568 typedef _Rb_tree_iterator<value_type> iterator; typedef in class:_Rb_tree
571 typedef std::reverse_iterator<iterator> reverse_iterator;
591 iterator
594 iterator
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/ |
| bitmap_allocator.h | 81 typedef pointer iterator; typedef in class:__detail::__mini_vector
102 // insert(iterator, const_reference), erase(iterator),
112 iterator
116 iterator
129 insert(iterator __pos, const_reference __x);
148 erase(iterator __pos) throw();
158 insert(iterator __pos, const_reference __x)
163 iterator __dest = this->end();
164 iterator __src = this->end() - 1
526 typedef vector_type::iterator iterator; typedef in class:free_list
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/pat_trie_/ |
| pat_trie_base.hpp | 254 /// Constant child iterator.
319 /// Child iterator.
320 struct iterator : public const_iterator struct in struct:__gnu_pbds::detail::pat_trie_base::_Inode
330 iterator(node_pointer_pointer p_p_cur = 0, function in struct:__gnu_pbds::detail::pat_trie_base::_Inode::iterator
335 operator==(const iterator& other) const
339 operator!=(const iterator& other) const
342 iterator&
349 iterator
352 iterator ret_it(*this);
381 iterator
953 typedef Iterator iterator; typedef in class:__gnu_pbds::detail::pat_trie_base::_Node_iter
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
| basic_string.h | 127 typedef __gnu_cxx::__normal_iterator<pointer, basic_string> iterator; typedef in class:basic_string
131 typedef std::reverse_iterator<iterator> reverse_iterator;
305 iterator
307 { return iterator(_M_data()); }
309 iterator
311 { return iterator(_M_data() + this->size()); }
391 _S_copy_chars(_CharT* __p, iterator __k1, iterator __k2)
601 * Returns a read/write iterator that points to the first character in
604 iterator
[all...] |
| regex.h | 114 * iterator range [F1, F2) such that if the character sequence [G1, G2)
164 * the iterator range [__first, __last). Returns an empty string if the
184 * the iterator range [__first, __last). If @p icase is true,
748 typedef _BiIter iterator; typedef in class:sub_match
1458 typedef const_iterator iterator; typedef in class:match_results
[all...] |
| stl_tree.h | 234 typedef _Rb_tree_iterator<_Tp> iterator; typedef in struct:_Rb_tree_const_iterator
250 _Rb_tree_const_iterator(const iterator& __it)
253 iterator
255 { return iterator(static_cast<typename iterator::_Link_type>
256 (const_cast<typename iterator::_Base_ptr>(_M_node))); }
568 typedef _Rb_tree_iterator<value_type> iterator; typedef in class:_Rb_tree
571 typedef std::reverse_iterator<iterator> reverse_iterator;
591 iterator
594 iterator
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/ |
| bitmap_allocator.h | 81 typedef pointer iterator; typedef in class:__detail::__mini_vector
102 // insert(iterator, const_reference), erase(iterator),
112 iterator
116 iterator
129 insert(iterator __pos, const_reference __x);
148 erase(iterator __pos) throw();
158 insert(iterator __pos, const_reference __x)
163 iterator __dest = this->end();
164 iterator __src = this->end() - 1
526 typedef vector_type::iterator iterator; typedef in class:free_list
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/pat_trie_/ |
| pat_trie_base.hpp | 254 /// Constant child iterator.
319 /// Child iterator.
320 struct iterator : public const_iterator struct in struct:__gnu_pbds::detail::pat_trie_base::_Inode
330 iterator(node_pointer_pointer p_p_cur = 0, function in struct:__gnu_pbds::detail::pat_trie_base::_Inode::iterator
335 operator==(const iterator& other) const
339 operator!=(const iterator& other) const
342 iterator&
349 iterator
352 iterator ret_it(*this);
381 iterator
953 typedef Iterator iterator; typedef in class:__gnu_pbds::detail::pat_trie_base::_Node_iter
[all...] |
| /prebuilts/misc/darwin-x86_64/protobuf2.5/include/google/protobuf/ |
| repeated_field.h | 51 #include <iterator>
135 // STL-like iterator support
136 typedef Element* iterator; typedef in class:google::protobuf::RepeatedField
146 iterator begin();
148 iterator end();
151 // Reverse iterator support
153 typedef std::reverse_iterator<iterator> reverse_iterator;
450 // STL-like iterator support
451 typedef internal::RepeatedPtrIterator<Element> iterator; typedef in class:google::protobuf::RepeatedPtrField
461 iterator begin()
1181 typedef RepeatedPtrIterator<Element> iterator; typedef in class:google::protobuf::internal::RepeatedPtrIterator
1272 typedef RepeatedPtrOverPtrsIterator<Element, VoidPtr> iterator; typedef in class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
[all...] |
| /prebuilts/misc/linux-x86_64/protobuf2.5/include/google/protobuf/ |
| repeated_field.h | 51 #include <iterator>
135 // STL-like iterator support
136 typedef Element* iterator; typedef in class:google::protobuf::RepeatedField
146 iterator begin();
148 iterator end();
151 // Reverse iterator support
153 typedef std::reverse_iterator<iterator> reverse_iterator;
450 // STL-like iterator support
451 typedef internal::RepeatedPtrIterator<Element> iterator; typedef in class:google::protobuf::RepeatedPtrField
461 iterator begin()
1181 typedef RepeatedPtrIterator<Element> iterator; typedef in class:google::protobuf::internal::RepeatedPtrIterator
1272 typedef RepeatedPtrOverPtrsIterator<Element, VoidPtr> iterator; typedef in class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
[all...] |
| /prebuilts/misc/windows/protobuf2.5/include/google/protobuf/ |
| repeated_field.h | 51 #include <iterator>
135 // STL-like iterator support
136 typedef Element* iterator; typedef in class:google::protobuf::RepeatedField
146 iterator begin();
148 iterator end();
151 // Reverse iterator support
153 typedef std::reverse_iterator<iterator> reverse_iterator;
450 // STL-like iterator support
451 typedef internal::RepeatedPtrIterator<Element> iterator; typedef in class:google::protobuf::RepeatedPtrField
461 iterator begin()
1181 typedef RepeatedPtrIterator<Element> iterator; typedef in class:google::protobuf::internal::RepeatedPtrIterator
1272 typedef RepeatedPtrOverPtrsIterator<Element, VoidPtr> iterator; typedef in class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
[all...] |
| /prebuilts/ndk/r16/sources/third_party/googletest/googletest/include/gtest/internal/ |
| gtest-internal.h | 829 // will be viable (since both C::iterator* and C::const_iterator* are
832 // the type of argument 0. If C::iterator or C::const_iterator is not
838 // Note that we look for both C::iterator and C::const_iterator. The
840 // class itself (e.g. you can refer to class iterator as either
841 // 'iterator' or 'iterator::iterator'). If we look for C::iterator
843 // iterator is an STL container.
957 typedef Element* iterator; typedef in class:testing::internal::NativeArray
[all...] |
| /prebuilts/ndk/r16/sources/third_party/vulkan/src/tests/gtest-1.7.0/include/gtest/internal/ |
| gtest-internal.h | 840 // will be viable (since both C::iterator* and C::const_iterator* are
843 // the type of argument 0. If C::iterator or C::const_iterator is not
849 // Note that we look for both C::iterator and C::const_iterator. The
968 typedef Element* iterator; typedef in class:testing::internal::NativeArray
[all...] |
