Searched refs:iterator (Results 151 - 175 of 2954) sorted by relevance

1234567891011>>

/external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/
H A DHashtableTest.java203 Iterator iterator = (Iterator) elms;
204 assertFalse(iterator.hasNext());
206 iterator.next();
255 Iterator i = s.iterator();
268 ((Map.Entry) ht10.entrySet().iterator().next()).setValue(null);
317 Iterator iterator = entrySet.iterator();
319 for (expectedHash = 0; iterator.hasNext(); expectedHash += iterator
380 Iterator iterator
[all...]
/external/llvm/include/llvm/Analysis/
H A DAliasSetTracker.h175 class iterator;
176 iterator begin() const { return iterator(PtrList); }
177 iterator end() const { return iterator(); }
183 /// Define an iterator for alias sets... this is just a forward iterator.
184 class iterator : public std::iterator<std::forward_iterator_tag,
188 explicit iterator(PointerRe
392 typedef ilist<AliasSet>::iterator iterator; typedef in class:llvm::AliasSetTracker
[all...]
/external/apache-harmony/text/src/test/java/org/apache/harmony/text/tests/java/text/
H A DSupport_Format.java79 * @param iterator
84 protected static Vector<FieldContainer> findFields(AttributedCharacterIterator iterator) { argument
86 while (iterator.getIndex() != iterator.getEndIndex()) {
87 int start = iterator.getRunStart();
88 int end = iterator.getRunLimit();
90 Iterator<Attribute> it = iterator.getAttributes().keySet().iterator();
93 Object value = iterator.getAttribute(attribute);
100 iterator
[all...]
/external/chromium/chrome/browser/profiles/
H A Dprofile_dependency_manager.cc9 #include <iterator>
31 EdgeMap::iterator it = edges_.begin();
33 EdgeMap::iterator temp = it;
80 std::deque<ProfileKeyedServiceFactory*>::iterator queue_end = queue.end();
95 std::pair<EdgeMap::iterator, EdgeMap::iterator> range =
97 EdgeMap::iterator it = range.first;
100 EdgeMap::iterator temp = it;
105 for (EdgeMap::iterator jt = edges.begin(); jt != edges.end(); ++jt) {
/external/eigen/Eigen/src/StlSupport/
H A DStdDeque.h41 typedef typename deque_base::iterator iterator; \
47 deque(iterator start, iterator end) : deque_base(start, end) {} \
65 typedef typename deque_base::iterator iterator; \
73 deque(iterator start, iterator end) : deque_base(start, end) {} \
105 iterator insert(const_iterator position, const value_type& x)
H A DStdList.h40 typedef typename list_base::iterator iterator; \
46 list(iterator start, iterator end) : list_base(start, end) {} \
65 typedef typename list_base::iterator iterator; \
73 list(iterator start, iterator end) : list_base(start, end) {} \
104 iterator insert(const_iterator position, const value_type& x)
H A DStdVector.h33 typedef vector_base::iterator iterator; \
39 vector(iterator start, iterator end) : vector_base(start, end) {} \
54 typedef typename vector_base::iterator iterator; \
62 vector(iterator start, iterator end) : vector_base(start, end) {} \
92 iterator insert(const_iterator position, const value_type& x)
/external/llvm/include/llvm/ADT/
H A DMapVector.h40 typedef typename VectorType::iterator iterator; typedef in class:llvm::MapVector
47 iterator begin() {
55 iterator end() {
79 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair);
93 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) {
95 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair);
110 iterator find(const KeyT &Key) {
124 typename MapType::iterator Pos = Map.find(Vector.back().first);
/external/webkit/Source/WebCore/inspector/
H A DInspectorDOMStorageAgent.cpp69 DOMStorageResourcesMap::iterator resourcesEnd = m_resources.end();
70 for (DOMStorageResourcesMap::iterator it = m_resources.begin(); it != resourcesEnd; ++it)
76 DOMStorageResourcesMap::iterator domStorageEnd = m_resources.end();
77 for (DOMStorageResourcesMap::iterator it = m_resources.begin(); it != domStorageEnd; ++it)
124 DOMStorageResourcesMap::iterator domStorageEnd = m_resources.end();
125 for (DOMStorageResourcesMap::iterator it = m_resources.begin(); it != domStorageEnd; ++it) {
134 DOMStorageResourcesMap::iterator it = m_resources.find(storageId);
142 DOMStorageResourcesMap::iterator domStorageEnd = m_resources.end();
143 for (DOMStorageResourcesMap::iterator it = m_resources.begin(); it != domStorageEnd; ++it) {
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DAbstractBiMap.java189 @Override public Iterator<K> iterator() { method in class:AbstractBiMap.KeySet
190 final Iterator<Entry<K, V>> iterator = delegate.entrySet().iterator();
196 return iterator.hasNext();
200 entry = iterator.next();
207 iterator.remove();
232 @Override public Iterator<V> iterator() { method in class:AbstractBiMap.ValueSet
233 final Iterator<V> iterator = delegate.values().iterator();
238 return iterator
300 @Override public Iterator<Entry<K, V>> iterator() { method in class:AbstractBiMap.EntrySet
[all...]
/external/apache-xml/src/main/java/org/apache/xpath/objects/
H A DXObjectFactory.java111 DTMIterator iterator = new OneStepIterator(iter, Axis.SELF);
112 iterator.setRoot(dtmRoot, xctxt);
113 result = new XNodeSet(iterator);
125 DTMIterator iterator = new OneStepIterator(iter, Axis.SELF);
126 iterator.setRoot(iter.getStartNode(), xctxt);
127 result = new XNodeSet(iterator);
/external/chromium-trace/trace-viewer/third_party/closure_linter/closure_linter/
H A Derror_fixer.py103 iterator = token.attached_object.type_start_token
104 if iterator.type == Type.DOC_START_BRACE or iterator.string.isspace():
105 iterator = iterator.next
107 leading_space = len(iterator.string) - len(iterator.string.lstrip())
108 iterator.string = '%s?%s' % (' ' * leading_space,
109 iterator.string.lstrip())
112 while iterator an
[all...]
/external/llvm/lib/Target/AArch64/
H A DAArch64InstrInfo.h42 MachineBasicBlock::iterator I, DebugLoc DL,
51 MachineBasicBlock::iterator MI,
56 MachineBasicBlock::iterator MBBI,
72 bool expandPostRAPseudo(MachineBasicBlock::iterator MI) const;
99 void emitRegUpdate(MachineBasicBlock &MBB, MachineBasicBlock::iterator MI,
105 void emitSPUpdate(MachineBasicBlock &MBB, MachineBasicBlock::iterator MI,
/external/stlport/stlport/stl/
H A D_deque.c98 # define iterator __iterator__ macro
102 # define __iterator__ _STLP_TYPENAME_ON_RETURN_TYPE deque<_Tp, _Alloc>::iterator
122 void deque<_Tp, _Alloc >::_M_fill_insert(iterator __pos,
128 iterator __new_start = _M_reserve_elements_at_front(__n);
136 iterator __new_finish = _M_reserve_elements_at_back(__n);
150 void deque<_Tp, _Alloc>::insert(iterator __pos,
157 iterator __new_start = _M_reserve_elements_at_front(__n);
165 iterator __new_finish = _M_reserve_elements_at_back(__n);
178 void deque<_Tp,_Alloc>::insert(iterator __pos,
185 iterator __new_star
814 #undef iterator macro
[all...]
H A D_deque.h54 * For any nonsingular iterator i:
61 * pointer, even if i is a past-the-end iterator.
174 typedef _Deque_iterator<_Tp, _NonConstTraits> iterator; typedef in struct:_Deque_iterator
182 //copy constructor for iterator and constructor from iterator for const_iterator
183 _Deque_iterator(const iterator& __x) :
351 typedef _Deque_iterator<_Tp, _Nonconst_traits<_Tp> > iterator; typedef in class:_Deque_base
385 iterator _M_start;
386 iterator _M_finish;
420 typedef typename _Base::iterator iterato typedef in class:deque
[all...]
H A D_slist.h91 typedef _Slist_iterator<_Tp, _NonConstTraits> iterator; typedef in class:_Slist_iterator
99 //copy constructor for iterator and constructor from iterator for const_iterator
100 _Slist_iterator(const iterator& __x) : _Slist_iterator_base(__x._M_node) {}
239 typedef _STLP_PRIV _Slist_iterator<_Tp, _Nonconst_traits<_Tp> > iterator; typedef in class:slist
406 // non-dereferenceable iterator that, when incremented, yields
407 // begin(). This iterator may be used as the argument to
409 // slist, before_begin() is not the same iterator as end(). It
412 iterator before_begin() { return iterator(
[all...]
/external/stlport/stlport/stl/pointers/
H A D_vector.h51 * won't use iterator wrapping.
64 typedef value_type* iterator; typedef in class:vector
79 iterator begin() { return cast_traits::to_value_type_ptr(_M_impl.begin()); }
81 iterator end() { return cast_traits::to_value_type_ptr(_M_impl.end()); }
176 iterator insert(iterator __pos, const value_type& __x = _STLP_DEFAULT_CONSTRUCTED(value_type))
178 iterator insert(iterator __pos, const value_type& __x)
185 iterator insert(iterator __po
[all...]
/external/webkit/Source/WebCore/platform/text/brew/
H A DTextBreakIteratorBrew.cpp252 DEFINE_STATIC_LOCAL(WordBreakIterator, iterator, ());
253 iterator.reset(string, length);
254 return &iterator;
259 DEFINE_STATIC_LOCAL(CharBreakIterator, iterator, ());
260 iterator.reset(string, length);
261 return &iterator;
282 void releaseLineBreakIterator(TextBreakIterator* iterator) argument
284 ASSERT(iterator);
287 staticLineBreakIterator = iterator;
289 delete iterator;
[all...]
/external/webkit/Source/WebCore/platform/text/wince/
H A DTextBreakIteratorWinCE.cpp233 DEFINE_STATIC_LOCAL(WordBreakIterator, iterator, ());
234 iterator.reset(string, length);
235 return &iterator;
240 DEFINE_STATIC_LOCAL(CharBreakIterator, iterator, ());
241 iterator.reset(string, length);
242 return &iterator;
263 void releaseLineBreakIterator(TextBreakIterator* iterator) argument
265 ASSERT(iterator);
268 staticLineBreakIterator = iterator;
270 delete iterator;
[all...]
/external/webkit/Source/JavaScriptCore/jit/
H A DJIT.h287 void compileOpCallSlowCase(Instruction* instruction, Vector<SlowCaseEntry>::iterator& iter, unsigned callLinkInfoIndex, OpcodeID opcodeID);
288 void compileOpCallVarargsSlowCase(Instruction* instruction, Vector<SlowCaseEntry>::iterator& iter);
327 void linkSlowCaseIfNotJSCell(Vector<SlowCaseEntry>::iterator&, unsigned virtualRegisterIndex);
331 void compileGetByIdSlowCase(int resultVReg, int baseVReg, Identifier* ident, Vector<SlowCaseEntry>::iterator& iter, bool isMethodCheck = false);
565 void compileBinaryArithOpSlowCase(OpcodeID, Vector<SlowCaseEntry>::iterator&, unsigned dst, unsigned src1, unsigned src2, OperandTypes, bool op1HasImmediateIntFastCase, bool op2HasImmediateIntFastCase);
567 void compileBinaryArithOpSlowCase(OpcodeID, Vector<SlowCaseEntry>::iterator&, unsigned dst, unsigned src1, unsigned src2, OperandTypes);
572 void compileGetByIdSlowCase(int resultVReg, int baseVReg, Identifier* ident, Vector<SlowCaseEntry>::iterator& iter, bool isMethodCheck = false);
836 void emitSlow_op_add(Instruction*, Vector<SlowCaseEntry>::iterator&);
837 void emitSlow_op_bitand(Instruction*, Vector<SlowCaseEntry>::iterator&);
838 void emitSlow_op_bitnot(Instruction*, Vector<SlowCaseEntry>::iterator
[all...]
/external/chromium/chrome/browser/automation/
H A Dautomation_provider_list.cc18 iterator iter = automation_providers_.begin();
33 const iterator remove_provider =
/external/chromium/chrome/browser/download/
H A Ddownload_status_updater.cc43 for (DelegateSet::iterator i = delegates_.begin();
58 for (DelegateSet::iterator i = delegates_.begin();
/external/clang/include/clang/Frontend/
H A DTextDiagnosticBuffer.h28 typedef DiagList::iterator iterator; typedef in class:clang::TextDiagnosticBuffer
/external/clang/test/SemaCXX/
H A Dinvalid-member-expr.cpp32 class iterator {}; class in struct:test3::string
37 string::iterator i = s.foo(); // expected-error {{no member named 'foo'}}
/external/guava/guava/src/com/google/common/hash/
H A DHashing.java221 Iterator<HashCode> iterator = hashCodes.iterator();
222 checkArgument(iterator.hasNext(), "Must be at least 1 hash code to combine.");
223 int bits = iterator.next().bits();
247 Iterator<HashCode> iterator = hashCodes.iterator();
248 checkArgument(iterator.hasNext(), "Must be at least 1 hash code to combine.");
249 byte[] resultBytes = new byte[iterator.next().bits() / 8];

Completed in 2633 milliseconds

1234567891011>>