| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Analysis/ |
| LazyCallGraph.h | 46 #include "llvm/ADT/iterator.h"
57 #include <iterator>
195 /// An iterator used for the edges to both entry nodes and child nodes.
196 class iterator class in class:llvm::LazyCallGraph::Edge::EdgeSequence
197 : public iterator_adaptor_base<iterator, VectorImplT::iterator,
202 VectorImplT::iterator E;
204 // Build the iterator for a specific position in the edge list.
205 iterator(VectorImplT::iterator BaseI, VectorImplT::iterator E function in class:llvm::LazyCallGraph::Edge::EdgeSequence::iterator
[all...] |
| LoopInfo.h | 139 typedef typename std::vector<LoopT *>::const_iterator iterator; typedef in class:llvm::LoopBase
142 iterator begin() const { return getSubLoops().begin(); }
143 iterator end() const { return getSubLoops().end(); }
307 LoopT *removeChildLoop(iterator I) {
309 assert(I != SubLoops.end() && "Cannot remove end iterator!");
628 /// iterator/begin/end - The interface to the top-level loops in the current
631 typedef typename std::vector<LoopT *>::const_iterator iterator; typedef in class:llvm::LoopInfoBase
634 iterator begin() const { return TopLevelLoops.begin(); }
635 iterator end() const { return TopLevelLoops.end(); }
680 LoopT *removeLoop(iterator I)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Support/ |
| OnDiskHashTable.h | 320 class iterator { class in class:llvm::OnDiskChainedHashTable
327 iterator() : Key(), Data(nullptr), Len(0), InfoObj(nullptr) {} function in class:llvm::OnDiskChainedHashTable::iterator
328 iterator(const internal_key_type K, const unsigned char *D, offset_type L, function in class:llvm::OnDiskChainedHashTable::iterator
337 bool operator==(const iterator &X) const { return X.Data == Data; }
338 bool operator!=(const iterator &X) const { return X.Data != Data; }
342 iterator find(const external_key_type &EKey, Info *InfoPtr = nullptr) {
349 iterator find_hashed(const internal_key_type &IKey, hash_value_type KeyHash,
362 return iterator(); // Empty bucket.
396 return iterator(X, Items + L.first, L.second, InfoPtr);
399 return iterator();
[all...] |
| TargetRegistry.h | 33 #include <iterator>
568 class iterator class in struct:llvm::TargetRegistry
569 : public std::iterator<std::forward_iterator_tag, Target, ptrdiff_t> {
574 explicit iterator(Target *T) : Current(T) {} function in class:llvm::TargetRegistry::iterator
577 iterator() = default;
579 bool operator==(const iterator &x) const { return Current == x.Current; }
580 bool operator!=(const iterator &x) const { return !operator==(x); }
582 // Iterator traversal: forward iteration only
583 iterator &operator++() { // Preincrement
584 assert(Current && "Cannot increment end iterator!");
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/clang/Basic/ |
| IdentifierTable.h | 407 /// \brief An iterator that walks over all of the known identifiers
410 /// Since this iterator uses an abstract interface via virtual
412 /// more standard C++ STL iterator interface. In this OO-style
415 /// operation. Subclasses of this iterator type will provide the
428 /// advances the iterator for the following string.
447 /// \brief Retrieve an iterator into the set of all identifiers
455 /// \returns A new iterator into the set of known identifiers. The
456 /// caller is responsible for deleting this iterator.
554 typedef HashTableTy::const_iterator iterator; typedef in class:clang::IdentifierTable
557 iterator begin() const { return HashTable.begin();
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/clang/Sema/ |
| CodeCompleteConsumer.h | 464 typedef const Chunk *iterator; typedef in class:clang::CodeCompletionString
465 iterator begin() const { return reinterpret_cast<const Chunk *>(this + 1); }
466 iterator end() const { return begin() + NumChunks; }
[all...] |
| Lookup.h | 129 typedef UnresolvedSetImpl::iterator iterator; typedef in class:clang::LookupResult
338 iterator begin() const { return iterator(Decls.begin()); }
339 iterator end() const { return iterator(Decls.end()); }
622 LookupResult::iterator I;
656 /// Erase the last element returned from this iterator.
716 for (iterator I = begin(), E = end(); I != E; ++I)
810 typedef llvm::mapped_iterator<decltype(Decls)::iterator, select_second
811 iterator; typedef in class:clang::ADLResult
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/clang/StaticAnalyzer/Core/BugReporter/ |
| BugReporter.h | 67 typedef VisitorList::iterator visitor_iterator;
376 typedef llvm::ilist<BugReport>::iterator iterator; typedef in class:clang::ento::BugReportEquivClass
379 iterator begin() { return Reports.begin(); }
380 iterator end() { return Reports.end(); }
451 /// \brief Iterator over the set of BugTypes tracked by the BugReporter.
452 typedef BugTypesTy::iterator iterator; typedef in class:clang::ento::BugReporter
453 iterator begin() { return BugTypes.begin(); }
454 iterator end() { return BugTypes.end();
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| CoreEngine.h | 232 for (iterator I = Frontier.begin(), E = Frontier.end(); I != E; ++I) {
287 typedef ExplodedNodeSet::iterator iterator; typedef in class:clang::ento::NodeBuilder
289 inline iterator begin() {
294 inline iterator end() {
303 for (ExplodedNodeSet::iterator I = S.begin(), E = S.end(); I != E; ++I )
369 for (ExplodedNodeSet::iterator I = SrcSet.begin(),
460 class iterator { class in class:clang::ento::IndirectGotoNodeBuilder
464 iterator(CFGBlock::const_succ_iterator i) : I(i) {} function in class:clang::ento::IndirectGotoNodeBuilder::iterator
467 iterator &operator++() { ++I; return *this;
506 class iterator { class in class:clang::ento::SwitchNodeBuilder
510 iterator(CFGBlock::const_succ_reverse_iterator i) : I(i) {} function in class:clang::ento::SwitchNodeBuilder::iterator
[all...] |
| ExplodedGraph.h | 336 typedef NodeVector::iterator roots_iterator;
338 typedef NodeVector::iterator eop_iterator;
340 typedef AllNodesTy::iterator node_iterator;
422 typedef ImplTy::iterator iterator; typedef in class:clang::ento::ExplodedNodeSet
438 inline iterator begin() { return Impl.begin(); }
439 inline iterator end() { return Impl.end(); }
|
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Analysis/ |
| LazyCallGraph.h | 46 #include "llvm/ADT/iterator.h"
57 #include <iterator>
195 /// An iterator used for the edges to both entry nodes and child nodes.
196 class iterator class in class:llvm::LazyCallGraph::Edge::EdgeSequence
197 : public iterator_adaptor_base<iterator, VectorImplT::iterator,
202 VectorImplT::iterator E;
204 // Build the iterator for a specific position in the edge list.
205 iterator(VectorImplT::iterator BaseI, VectorImplT::iterator E function in class:llvm::LazyCallGraph::Edge::EdgeSequence::iterator
[all...] |
| LoopInfo.h | 139 typedef typename std::vector<LoopT *>::const_iterator iterator; typedef in class:llvm::LoopBase
142 iterator begin() const { return getSubLoops().begin(); }
143 iterator end() const { return getSubLoops().end(); }
307 LoopT *removeChildLoop(iterator I) {
309 assert(I != SubLoops.end() && "Cannot remove end iterator!");
628 /// iterator/begin/end - The interface to the top-level loops in the current
631 typedef typename std::vector<LoopT *>::const_iterator iterator; typedef in class:llvm::LoopInfoBase
634 iterator begin() const { return TopLevelLoops.begin(); }
635 iterator end() const { return TopLevelLoops.end(); }
680 LoopT *removeLoop(iterator I)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Support/ |
| OnDiskHashTable.h | 320 class iterator { class in class:llvm::OnDiskChainedHashTable
327 iterator() : Key(), Data(nullptr), Len(0), InfoObj(nullptr) {} function in class:llvm::OnDiskChainedHashTable::iterator
328 iterator(const internal_key_type K, const unsigned char *D, offset_type L, function in class:llvm::OnDiskChainedHashTable::iterator
337 bool operator==(const iterator &X) const { return X.Data == Data; }
338 bool operator!=(const iterator &X) const { return X.Data != Data; }
342 iterator find(const external_key_type &EKey, Info *InfoPtr = nullptr) {
349 iterator find_hashed(const internal_key_type &IKey, hash_value_type KeyHash,
362 return iterator(); // Empty bucket.
396 return iterator(X, Items + L.first, L.second, InfoPtr);
399 return iterator();
[all...] |
| TargetRegistry.h | 33 #include <iterator>
568 class iterator class in struct:llvm::TargetRegistry
569 : public std::iterator<std::forward_iterator_tag, Target, ptrdiff_t> {
574 explicit iterator(Target *T) : Current(T) {} function in class:llvm::TargetRegistry::iterator
577 iterator() = default;
579 bool operator==(const iterator &x) const { return Current == x.Current; }
580 bool operator!=(const iterator &x) const { return !operator==(x); }
582 // Iterator traversal: forward iteration only
583 iterator &operator++() { // Preincrement
584 assert(Current && "Cannot increment end iterator!");
[all...] |
| /prebuilts/devtools/tools/lib/ |
| screenshot2.jar | |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/backward/ |
| hashtable.h | 63 #include <iterator>
110 iterator; typedef in struct:_Hashtable_iterator
138 iterator&
141 iterator
145 operator==(const iterator& __it) const
149 operator!=(const iterator& __it) const
161 iterator; typedef in struct:_Hashtable_const_iterator
182 _Hashtable_const_iterator(const iterator& __it)
324 iterator; typedef in class:hashtable
396 iterator
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/ |
| forward_list.h | 116 * @brief A forward_list::iterator.
192 typedef _Fwd_list_iterator<_Tp> iterator; typedef in struct:_Fwd_list_const_iterator
207 _Fwd_list_const_iterator(const iterator& __iter)
254 * @brief Forward list iterator equality comparison.
263 * @brief Forward list iterator inequality comparison.
308 typedef _Fwd_list_iterator<_Tp> iterator; typedef in struct:_Fwd_list_base
427 typedef _Fwd_list_iterator<_Tp> iterator; typedef in class:forward_list
491 * @param __first An input iterator.
492 * @param __last An input iterator.
596 * @param __first An input iterator
[all...] |
| stl_deque.h | 95 * @brief A deque::iterator.
108 typedef _Deque_iterator<_Tp, _Tp&, _Tp*> iterator; typedef in struct:_Deque_iterator
135 _Deque_iterator(const iterator& __x)
327 // operators but also operator- must accept mixed iterator/const_iterator
448 typedef _Deque_iterator<_Tp, _Tp&, _Tp*> iterator; typedef in class:_Deque_base
497 iterator _M_start;
498 iterator _M_finish;
668 * - iterator _M_start, _M_finish
693 * - For any nonsingular iterator i:
701 * pointer, even if i is a past-the-end iterator
746 typedef typename _Base::iterator iterator; typedef in class:deque
[all...] |
| stl_list.h | 120 * @brief A list::iterator.
204 typedef _List_iterator<_Tp> iterator; typedef in struct:_List_const_iterator
219 _List_const_iterator(const iterator& __x)
431 * class holds (as its only data member) a private list::iterator
434 * iterator's next/previous pointers refer to itself, the %list is
455 typedef _List_iterator<_Tp> iterator; typedef in class:list
458 typedef std::reverse_iterator<iterator> reverse_iterator;
465 // iterator types.
613 * @param __first An input iterator.
614 * @param __last An input iterator
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/ov_tree_map_/ |
| ov_tree_map_.hpp | 177 typedef point_iterator iterator; typedef in class:__gnu_pbds::detail::PB_DS_OV_TREE_NAME
185 cond_dtor(value_vector a_vec, iterator& r_last_it,
195 iterator it = m_a_vec;
212 iterator& m_r_last_it;
313 iterator pot_it = lower_bound(r_key);
332 iterator pot_it = lower_bound(r_key);
354 inline iterator
355 erase(iterator it)
356 { return erase_imp<iterator>(it); }
367 inline iterator
[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_.hpp | 41 #include <iterator>
135 typedef typename inode::iterator inode_iterator;
261 typedef typename traits_type::iterator point_iterator;
263 typedef point_iterator iterator; typedef in class:__gnu_pbds::detail::PB_DS_PAT_TRIE_NAME
345 inline iterator
346 erase(iterator);
367 inline iterator
373 inline iterator
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/tr1/ |
| hashtable.h | 92 // __constant_iterators: bool. true if iterator and const_iterator are
93 // both constant iterator types. This is true for unordered_set and
152 iterator; typedef in class:tr1::_Hashtable
217 iterator
220 iterator __i(_M_buckets);
235 iterator
237 { return iterator(_M_buckets + _M_bucket_count); }
324 iterator
333 std::pair<iterator, iterator>
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/backward/ |
| hashtable.h | 63 #include <iterator>
110 iterator; typedef in struct:_Hashtable_iterator
138 iterator&
141 iterator
145 operator==(const iterator& __it) const
149 operator!=(const iterator& __it) const
161 iterator; typedef in struct:_Hashtable_const_iterator
182 _Hashtable_const_iterator(const iterator& __it)
324 iterator; typedef in class:hashtable
396 iterator
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
| forward_list.h | 116 * @brief A forward_list::iterator.
192 typedef _Fwd_list_iterator<_Tp> iterator; typedef in struct:_Fwd_list_const_iterator
207 _Fwd_list_const_iterator(const iterator& __iter)
254 * @brief Forward list iterator equality comparison.
263 * @brief Forward list iterator inequality comparison.
308 typedef _Fwd_list_iterator<_Tp> iterator; typedef in struct:_Fwd_list_base
427 typedef _Fwd_list_iterator<_Tp> iterator; typedef in class:forward_list
491 * @param __first An input iterator.
492 * @param __last An input iterator.
596 * @param __first An input iterator
[all...] |
| stl_deque.h | 95 * @brief A deque::iterator.
108 typedef _Deque_iterator<_Tp, _Tp&, _Tp*> iterator; typedef in struct:_Deque_iterator
135 _Deque_iterator(const iterator& __x)
327 // operators but also operator- must accept mixed iterator/const_iterator
448 typedef _Deque_iterator<_Tp, _Tp&, _Tp*> iterator; typedef in class:_Deque_base
497 iterator _M_start;
498 iterator _M_finish;
668 * - iterator _M_start, _M_finish
693 * - For any nonsingular iterator i:
701 * pointer, even if i is a past-the-end iterator
746 typedef typename _Base::iterator iterator; typedef in class:deque
[all...] |
