/external/libcxx/test/support/ |
H A D | nasty_containers.hpp | 24 typedef typename nested_container::iterator iterator; typedef in class:nasty_vector 51 iterator begin() _NOEXCEPT { return v_.begin(); } 53 iterator end() _NOEXCEPT { return v_.end(); } 98 template <class... Args> iterator emplace(const_iterator pos, Args&&... args) 103 iterator insert(const_iterator pos, const value_type& x) { return v_.insert(pos, x); } 105 iterator insert(const_iterator pos, value_type&& x) { return v_.insert(pos, std::forward<value_type>(x)); } 107 iterator insert(const_iterator pos, size_type n, const value_type& x) { return v_.insert(pos, n, x); } 109 iterator insert(const_iterator pos, InputIterator first, InputIterator last) 113 iterator inser 145 typedef typename nested_container::iterator iterator; typedef in class:nasty_list [all...] |
/external/lldb/include/lldb/Core/ |
H A D | Disassembler.h | 192 typedef collection::iterator iterator; typedef in class:lldb_private::InstructionList
|
H A D | Section.h | 30 typedef collection::iterator iterator; typedef in class:lldb_private::SectionList
|
H A D | UniqueCStringMap.h | 327 iterator end = m_map.end(); 328 iterator begin = m_map.begin(); 329 iterator lower_pos = std::lower_bound (begin, end, search_entry); 334 iterator upper_pos = std::upper_bound (lower_pos, end, search_entry); 351 typedef typename collection::iterator iterator; typedef in class:lldb_private::UniqueCStringMap
|
/external/lldb/source/Core/ |
H A D | ConstString.cpp | 167 typedef StringPool::iterator iterator; typedef in class:Pool
|
/external/lldb/source/Plugins/DynamicLoader/MacOSX-DYLD/ |
H A D | DynamicLoaderMacOSXDYLD.h | 255 typedef collection::iterator iterator; typedef in struct:DynamicLoaderMacOSXDYLD::DYLDImageInfo
|
/external/lldb/source/Plugins/DynamicLoader/POSIX-DYLD/ |
H A D | AuxVector.h | 85 typedef EntryVector::const_iterator iterator; typedef in class:AuxVector 87 iterator begin() const { return m_auxv.begin(); } 88 iterator end() const { return m_auxv.end(); } 90 iterator
|
H A D | DYLDRendezvous.h | 158 typedef SOEntryList::const_iterator iterator; typedef in class:DYLDRendezvous 161 iterator begin() const { return m_soentries.begin(); } 162 iterator end() const { return m_soentries.end(); } 166 iterator loaded_begin() const { return m_added_soentries.begin(); } 167 iterator loaded_end() const { return m_added_soentries.end(); } 171 iterator unloaded_begin() const { return m_removed_soentries.begin(); } 172 iterator unloaded_end() const { return m_removed_soentries.end(); }
|
/external/lldb/source/Plugins/SymbolFile/DWARF/ |
H A D | DWARFDebugLine.h | 109 typedef collection::iterator iterator; typedef in struct:DWARFDebugLine::Row 248 typedef LineTableMap::iterator LineTableIter;
|
/external/llvm/include/llvm/ADT/ |
H A D | DenseSet.h | 64 typename MapTy::iterator I; 67 typedef typename MapTy::iterator::difference_type difference_type; 73 Iterator(const typename MapTy::iterator &i) : I(i) {} 103 typedef Iterator iterator; typedef in class:llvm::DenseSet 106 iterator begin() { return Iterator(TheMap.begin()); } 107 iterator end() { return Iterator(TheMap.end()); } 112 iterator find(const ValueT &V) { return Iterator(TheMap.find(V)); } 116 std::pair<iterator, bool> insert(const ValueT &V) {
|
H A D | EquivalenceClasses.h | 42 /// for (EquivalenceClasses<int>::iterator I = EC.begin(), E = EC.end(); 124 for (iterator I = RHS.begin(), E = RHS.end(); I != E; ++I) 138 /// iterator* - Provides a way to iterate over all values in the set. 139 typedef typename std::set<ECValue>::const_iterator iterator; typedef in class:llvm::EquivalenceClasses 140 iterator begin() const { return TheMapping.begin(); } 141 iterator end() const { return TheMapping.end(); } 148 member_iterator member_begin(iterator I) const { 156 /// findValue - Return an iterator to the specified value. If it does not 158 iterator findValue(const ElemTy &V) const { 184 for (iterator [all...] |
H A D | ImmutableList.h | 81 class iterator { class in class:llvm::ImmutableList 84 iterator() : L(0) {} function in class:llvm::ImmutableList::iterator 85 iterator(ImmutableList l) : L(l.getInternalPointer()) {} function in class:llvm::ImmutableList::iterator 87 iterator& operator++() { L = L->getTail(); return *this; } 88 bool operator==(const iterator& I) const { return L == I.L; } 89 bool operator!=(const iterator& I) const { return L != I.L; } 94 /// begin - Returns an iterator referring to the head of the list, or 95 /// an iterator denoting the end of the list if the list is empty. 96 iterator begin() const { return iterator( [all...] |
H A D | ScopedHashTable.h | 180 typename DenseMap<K, ValTy*, KInfo>::iterator I = TopLevelMap.find(Key); 191 typedef ScopedHashTableIterator<K, V, KInfo> iterator; typedef in class:llvm::ScopedHashTable 193 iterator end() { return iterator(0); } 195 iterator begin(const K &Key) { 196 typename DenseMap<K, ValTy*, KInfo>::iterator I = 199 return iterator(I->second);
|
/external/llvm/include/llvm/Analysis/ |
H A D | IVUsers.h | 160 typedef ilist<IVStrideUse>::iterator iterator; typedef in class:llvm::IVUsers 162 iterator begin() { return IVUses.begin(); } 163 iterator end() { return IVUses.end(); }
|
/external/llvm/include/llvm/CodeGen/ |
H A D | GCMetadata.h | 87 typedef std::vector<GCPoint>::iterator iterator; typedef in class:llvm::GCFunctionInfo 88 typedef std::vector<GCRoot>::iterator roots_iterator; 146 iterator begin() { return SafePoints.begin(); } 147 iterator end() { return SafePoints.end(); } 158 live_iterator live_begin(const iterator &p) { return roots_begin(); } 159 live_iterator live_end (const iterator &p) { return roots_end(); } 160 size_t live_size(const iterator &p) const { return roots_size(); } 178 typedef list_type::const_iterator iterator; typedef in class:llvm::GCModuleInfo 191 iterator begi [all...] |
H A D | LiveRangeEdit.h | 136 typedef SmallVectorImpl<unsigned>::const_iterator iterator; typedef in class:llvm::LiveRangeEdit 137 iterator begin() const { return NewRegs.begin()+FirstNew; } 138 iterator end() const { return NewRegs.end(); } 192 MachineBasicBlock::iterator MI,
|
/external/llvm/include/llvm/IR/ |
H A D | BasicBlock.h | 100 typedef InstListType::iterator iterator; typedef in class:llvm::BasicBlock 153 /// \brief Returns an iterator to the first instruction in this block that is 157 iterator getFirstInsertionPt(); 196 /// Instruction iterator methods 198 inline iterator begin() { return InstList.begin(); } 200 inline iterator end () { return InstList.end(); } 256 /// Note that all instructions BEFORE the specified iterator stay as part of 260 /// This function invalidates the specified iterator. 269 BasicBlock *splitBasicBlock(iterator [all...] |
H A D | Metadata.h | 55 typedef StringRef::iterator iterator; typedef in class:llvm::MDString 58 iterator begin() const { return getName().begin(); } 61 iterator end() const { return getName().end(); } 213 public std::iterator<std::bidirectional_iterator_tag, T2> {
|
/external/llvm/include/llvm/Option/ |
H A D | ArgList.h | 38 /// bother to factor this into two separate iterator implementations. 42 // iterator combinator which takes multiple iterators which can be 99 typedef arglist_type::iterator iterator; typedef in class:llvm::opt::ArgList 133 iterator begin() { return Args.begin(); } 134 iterator end() { return Args.end(); }
|
/external/llvm/include/llvm/Support/ |
H A D | Registry.h | 68 class iterator; 88 friend class iterator; 108 class iterator { class in class:llvm::Registry 112 explicit iterator(const node *N) : Cur(N) {} function in class:llvm::Registry::iterator 114 bool operator==(const iterator &That) const { return Cur == That.Cur; } 115 bool operator!=(const iterator &That) const { return Cur != That.Cur; } 116 iterator &operator++() { Cur = Cur->Next; return *this; } 121 static iterator begin() { return iterator(Head); } 122 static iterator en [all...] |
/external/llvm/lib/IR/ |
H A D | AttributeImpl.h | 169 typedef const Attribute *iterator; typedef in class:llvm::AttributeSetNode 170 iterator begin() const { return reinterpret_cast<iterator>(this + 1); } 171 iterator end() const { return begin() + NumAttrs; } 247 typedef AttributeSetNode::iterator iterator; typedef in class:llvm::AttributeSetImpl 248 iterator begin(unsigned Slot) const { return getSlotNode(Slot)->begin(); } 249 iterator end(unsigned Slot) const { return getSlotNode(Slot)->end(); }
|
/external/mesa3d/src/glsl/ |
H A D | list.h | 227 class iterator { class 244 class exec_list_iterator : public iterator { 278 for (iter_type iter = (container) . iterator(); iter.has_next(); iter.next()) 442 exec_list_iterator iterator() function in struct:exec_list 447 exec_list_iterator iterator() const function in struct:exec_list
|
/external/mockito/cglib-and-asm/src/org/mockito/asm/tree/ |
H A D | InsnList.java | 177 * Returns an iterator over the instructions in this list.
179 * @return an iterator over the instructions in this list.
181 public ListIterator iterator() {
method in class:InsnList 182 return iterator(0);
186 * Returns an iterator over the instructions in this list.
188 * @return an iterator over the instructions in this list.
190 public ListIterator iterator(int index) {
method in class:InsnList
|
/external/nist-sip/java/gov/nist/core/ |
H A D | GenericObjectList.java | 181 * Traverse the list given a list iterator 183 protected GenericObject next(ListIterator iterator) { argument 185 return (GenericObject) iterator.next(); 192 * This is the default list iterator.This will not handle nested list 205 * Fetch the next object from the list based on the default list iterator 351 ListIterator iterator = this.listIterator(); 352 if (iterator.hasNext()) { 354 Object obj = iterator.next(); 361 if (iterator.hasNext())
|
H A D | NameValueList.java | 95 Iterator<NameValue> iterator = hmap.values().iterator(); 96 if (iterator.hasNext()) { 98 Object obj = iterator.next(); 105 if (iterator.hasNext()) 155 Iterator<String> li = this.hmap.keySet().iterator(); 218 Iterator<NameValue> it = this.hmap.values().iterator(); 240 * Return an iterator for the name-value pairs of this list. 242 * @return the iterator. 244 public Iterator<NameValue> iterator() { method in class:NameValueList [all...] |