Searched refs:iterator (Results 201 - 225 of 6149) sorted by relevance

1234567891011>>

/external/llvm/include/llvm/ADT/
H A Dilist.h45 #include <iterator>
146 : public std::iterator<std::bidirectional_iterator_tag, NodeTy, ptrdiff_t> {
150 typedef std::iterator<std::bidirectional_iterator_tag,
160 // ilist_iterator is not a random-access iterator, but it has an
180 // This is templated so that we can allow constructing a const iterator from
181 // a nonconst iterator...
186 // This is templated so that we can allow assigning to a const iterator from
187 // a nonconst iterator...
250 // the iterator, which could very likely be pointing to end().
299 /// pointer is null. When in this form, any query for an iterator (
344 typedef ilist_iterator<NodeTy> iterator; typedef in class:llvm::iplist
642 typedef typename iplist<NodeTy>::iterator iterator; typedef in struct:llvm::ilist
[all...]
H A DMapVector.h38 typedef typename VectorType::iterator iterator; typedef in class:llvm::MapVector
45 iterator begin() {
53 iterator end() {
77 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair);
91 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) {
93 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair);
108 iterator find(const KeyT &Key) {
122 typename MapType::iterator Pos = Map.find(Vector.back().first);
128 /// Returns an iterator t
[all...]
/external/chromium_org/net/base/
H A Dlinked_hash_map.h13 // iterator pointing to an element that was just deleted.
28 // We also keep a map<Key, list::iterator> for find. Since std::list is a
34 typedef base::hash_map<Key, typename ListType::iterator> MapType;
37 typedef typename ListType::iterator iterator; typedef in class:linked_hash_map
48 // Returns an iterator to the first (insertion-ordered) element. Like a map,
50 iterator begin() {
57 // Returns an iterator beyond the last element.
58 iterator end() {
65 // Returns an iterator t
[all...]
/external/javassist/src/main/javassist/bytecode/
H A DAttributeInfo.java203 ListIterator iterator = list.listIterator();
204 while (iterator.hasNext()) {
205 AttributeInfo ai = (AttributeInfo)iterator.next();
217 ListIterator iterator = list.listIterator();
218 while (iterator.hasNext()) {
219 AttributeInfo ai = (AttributeInfo)iterator.next();
221 iterator.remove();
262 Iterator iterator = attributes.iterator();
263 while (iterator
[all...]
/external/chromium_org/chrome/browser/task_manager/
H A Dbackground_information.cc135 for (std::vector<BackgroundContents*>::iterator iterator = contents.begin();
136 iterator != contents.end();
137 ++iterator) {
138 callback.Run((*iterator)->web_contents());
153 for (std::vector<BackgroundContents*>::iterator iterator = contents.begin();
154 iterator != contents.end();
155 ++iterator) {
156 if ((*iterator)
[all...]
/external/clang/include/clang/Rewrite/Core/
H A DRewriteRope.h22 #include <iterator>
113 public std::iterator<std::forward_iterator_tag, const char, ptrdiff_t> {
122 // begin iterator.
124 // end iterator
169 typedef RopePieceBTreeIterator iterator; typedef in class:clang::RopePieceBTree
170 iterator begin() const { return iterator(Root); }
171 iterator end() const { return iterator(); }
210 typedef RopePieceBTree::iterator iterato typedef in class:clang::RewriteRope
[all...]
/external/libcxx/test/containers/sequences/vector/
H A Ddb_iterators_5.pass.cpp12 // Add to iterator out of bounds.
20 #include <iterator>
32 C::iterator i = c.begin();
44 C::iterator i = c.begin();
/external/libcxx/test/containers/unord/unord.map/
H A Ddb_iterators_7.pass.cpp12 // Increment iterator past end.
21 #include <iterator>
33 C::iterator i = c.begin();
45 C::iterator i = c.begin();
H A Ddb_iterators_8.pass.cpp12 // Dereference non-dereferenceable iterator.
21 #include <iterator>
33 C::iterator i = c.end();
43 C::iterator i = c.end();
/external/libcxx/test/containers/unord/unord.map/unord.map.swap/
H A Ddb_swap_1.pass.cpp34 std::unordered_map<int, int>::iterator i1 = c1.begin();
35 std::unordered_map<int, int>::iterator i2 = c2.begin();
39 std::unordered_map<int, int>::iterator j = i1;
/external/libcxx/test/containers/unord/unord.multimap/
H A Ddb_iterators_7.pass.cpp12 // Increment iterator past end.
21 #include <iterator>
33 C::iterator i = c.begin();
45 C::iterator i = c.begin();
H A Ddb_iterators_8.pass.cpp12 // Dereference non-dereferenceable iterator.
21 #include <iterator>
33 C::iterator i = c.end();
43 C::iterator i = c.end();
/external/libcxx/test/containers/unord/unord.multimap/unord.multimap.swap/
H A Ddb_swap_1.pass.cpp34 std::unordered_multimap<int, int>::iterator i1 = c1.begin();
35 std::unordered_multimap<int, int>::iterator i2 = c2.begin();
39 std::unordered_multimap<int, int>::iterator j = i1;
/external/libcxx/test/containers/unord/unord.multiset/unord.multiset.swap/
H A Ddb_swap_1.pass.cpp33 std::unordered_multiset<int>::iterator i1 = c1.begin();
34 std::unordered_multiset<int>::iterator i2 = c2.begin();
38 std::unordered_multiset<int>::iterator j = i1;
/external/libcxx/test/containers/unord/unord.set/unord.set.swap/
H A Ddb_swap_1.pass.cpp33 std::unordered_set<int>::iterator i1 = c1.begin();
34 std::unordered_set<int>::iterator i2 = c2.begin();
38 std::unordered_set<int>::iterator j = i1;
/external/libcxx/test/iterators/stream.iterators/istream.iterator/
H A Dtypes.pass.cpp10 // <iterator>
15 // : public iterator<input_iterator_tag, T, Distance, const T*, const T&>
23 #include <iterator>
30 std::iterator<std::input_iterator_tag, double, std::ptrdiff_t,
37 std::iterator<std::input_iterator_tag, unsigned, std::ptrdiff_t,
/external/libcxx/test/iterators/stream.iterators/ostream.iterator/
H A Dtypes.pass.cpp10 // <iterator>
15 // : public iterator<output_iterator_tag, void, void, void, void>
23 #include <iterator>
30 std::iterator<std::output_iterator_tag, void, void, void, void> >::value), "");
36 std::iterator<std::output_iterator_tag, void, void, void, void> >::value), "");
/external/libcxx/test/iterators/stream.iterators/ostreambuf.iterator/ostreambuf.iter.cons/
H A DAndroid.mk17 test_makefile := external/libcxx/test/iterators/stream.iterators/ostreambuf.iterator/ostreambuf.iter.cons/Android.mk
19 test_name := iterators/stream.iterators/ostreambuf.iterator/ostreambuf.iter.cons/ostream
23 test_name := iterators/stream.iterators/ostreambuf.iterator/ostreambuf.iter.cons/streambuf
/external/libcxx/test/strings/basic.string/string.iterators/
H A Ddb_iterators_5.pass.cpp12 // Add to iterator out of bounds.
20 #include <iterator>
31 C::iterator i = c.begin();
42 C::iterator i = c.begin();
/external/llvm/include/llvm/Support/
H A DRegistry.h68 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/Target/ARM/
H A DThumb1FrameLowering.h34 MachineBasicBlock::iterator MI,
38 MachineBasicBlock::iterator MI,
47 MachineBasicBlock::iterator MI) const override;
H A DThumb1InstrInfo.h42 MachineBasicBlock::iterator I, DebugLoc DL,
46 MachineBasicBlock::iterator MBBI,
52 MachineBasicBlock::iterator MBBI,
/external/llvm/lib/Target/Hexagon/
H A DHexagonFrameLowering.h30 MachineBasicBlock::iterator MI,
37 MachineBasicBlock::iterator I) const override;
41 MachineBasicBlock::iterator MI,
/external/llvm/lib/Target/MSP430/
H A DMSP430FrameLowering.h35 MachineBasicBlock::iterator I) const override;
38 MachineBasicBlock::iterator MI,
42 MachineBasicBlock::iterator MI,
/external/llvm/lib/Target/Mips/
H A DMips16FrameLowering.h31 MachineBasicBlock::iterator I) const override;
34 MachineBasicBlock::iterator MI,
39 MachineBasicBlock::iterator MI,

Completed in 3833 milliseconds

1234567891011>>