| /frameworks/compile/mclinker/lib/LD/ |
| Archive.cpp | 135 ArchiveMemberMapType::iterator it = m_ArchiveMemberMap.find(pName); local
136 if (it != m_ArchiveMemberMap.end())
137 return &(it.getEntry()->value());
|
| /frameworks/compile/mclinker/lib/Target/AArch64/ |
| AArch64PLT.cpp | 107 AArch64PLT::iterator it = m_pSectionData->begin(); local
109 assert(it != ie && "FragmentList is empty, applyPLT1 failed!");
117 ++it; // skip PLT0
122 while (it != ie) {
123 plt1 = &(llvm::cast<AArch64PLT1>(*it));
138 ++it;
149 iterator it = begin(); local
153 llvm::cast<AArch64PLT0>((*it)).getValue(),
156 ++it;
160 while (it != ie)
[all...] |
| /frameworks/compile/mclinker/lib/Target/ARM/ |
| ARMPLT.cpp | 102 ARMPLT::iterator it = m_pSectionData->begin(); local
104 assert(it != ie && "FragmentList is empty, applyPLT1 failed!");
111 ++it; // skip PLT0
116 while (it != ie) {
117 plt1 = &(llvm::cast<ARMPLT1>(*it));
132 ++it;
143 iterator it = begin(); local
146 memcpy(buffer, llvm::cast<ARMPLT0>((*it)).getValue(), ARMPLT0::EntrySize);
148 ++it;
152 while (it != ie)
[all...] |
| /frameworks/compile/mclinker/lib/Target/Hexagon/ |
| HexagonPLT.cpp | 70 HexagonPLT::iterator it = begin(); local
71 ++it;
72 if (end() != it) {
74 PLTEntryBase* plt1 = &(llvm::cast<PLTEntryBase>(*it));
126 HexagonPLT::iterator it = m_pSectionData->begin(); local
128 assert(it != ie && "FragmentList is empty, applyPLT1 failed!");
136 ++it; // skip PLT0
141 while (it != ie) {
142 plt1 = &(llvm::cast<HexagonPLT1>(*it));
161 ++it;
170 iterator it = begin(); local
[all...] |
| /frameworks/compile/mclinker/lib/Target/X86/ |
| X86PLT.cpp | 93 X86PLT::iterator it = begin(); local
94 ++it;
95 if (end() != it) {
97 PLTEntryBase* plt1 = &(llvm::cast<PLTEntryBase>(*it));
141 // FIXME: It only works on little endian machine.
163 // FIXME: It only works on little endian machine.
167 X86PLT::iterator it = m_pSectionData->begin(); local
169 assert(it != ie && "FragmentList is empty, applyPLT1 failed!");
180 ++it;
186 while (it != ie)
250 X86PLT::iterator it = m_pSectionData->begin(); local
[all...] |
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/text/ |
| Support_Format.java | 87 Iterator<Attribute> it = iterator.getAttributes().keySet().iterator(); local
88 while (it.hasNext()) {
89 AttributedCharacterIterator.Attribute attribute = it.next();
|
| /libcore/jsr166-tests/src/test/java/jsr166/ |
| ConcurrentLinkedQueueTest.java | 434 Iterator it = q.iterator(); local
436 for (i = 0; it.hasNext(); i++)
437 assertTrue(q.contains(it.next()));
439 assertIteratorExhausted(it);
459 for (Iterator it = q.iterator(); it.hasNext();) {
460 assertEquals(++k, it.next());
475 for (Iterator it = q.iterator(); it.hasNext();) {
477 it.next()
491 Iterator it = q.iterator(); local
[all...] |
| CopyOnWriteArrayListTest.java | 114 * addIfAbsent will not add the element if it already exists in the list
123 * addIfAbsent adds the element when it does not exist in the list
161 * adding at an index places it in the indicated index
261 Iterator it = full.iterator(); local
263 assertTrue(it.hasNext());
264 assertEquals(elements[j], it.next());
266 assertIteratorExhausted(it);
282 Iterator it = full.iterator(); local
283 it.next();
285 it.remove()
[all...] |
| DelayQueueTest.java | 622 Iterator it = q.iterator(); local
623 while (it.hasNext()) {
624 assertTrue(q.contains(it.next()));
628 assertIteratorExhausted(it);
646 Iterator it = q.iterator(); local
647 it.next();
648 it.remove();
649 it = q.iterator();
650 assertEquals(new PDelay(2), it.next());
651 assertEquals(new PDelay(3), it.next())
[all...] |
| LinkedBlockingQueueTest.java | 641 Iterator it = q.iterator(); local
643 for (i = 0; it.hasNext(); i++)
644 assertTrue(q.contains(it.next()));
646 assertIteratorExhausted(it);
648 it = q.iterator();
649 for (i = 0; it.hasNext(); i++)
650 assertEquals(it.next(), q.take());
652 assertIteratorExhausted(it);
671 Iterator it = q.iterator(); local
672 it.next()
[all...] |
| LinkedListTest.java | 386 Iterator it = q.iterator(); local
388 for (i = 0; it.hasNext(); i++)
389 assertTrue(q.contains(it.next()));
391 assertIteratorExhausted(it);
410 for (Iterator it = q.iterator(); it.hasNext();) {
411 assertEquals(++k, it.next());
425 Iterator it = q.iterator(); local
426 assertEquals(1, it.next());
427 it.remove()
440 Iterator it = q.descendingIterator(); local
477 Iterator it = q.descendingIterator(); local
[all...] |
| PriorityBlockingQueueTest.java | 581 Iterator it = q.iterator(); local
583 for (i = 0; it.hasNext(); i++)
584 assertTrue(q.contains(it.next()));
586 assertIteratorExhausted(it);
605 Iterator it = q.iterator(); local
606 it.next();
607 it.remove();
609 it = q.iterator();
610 assertEquals(it.next(), new Integer(2));
611 assertEquals(it.next(), new Integer(3))
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| AbstractExecutorService.java | 134 Iterator<? extends Callable<T>> it = tasks.iterator(); local
137 futures.add(ecs.submit(it.next()));
146 futures.add(ecs.submit(it.next()));
|
| /libcore/luni/src/test/java/tests/security/cert/ |
| CertificateFactory3Test.java | 112 Iterator<? extends Certificate> it = col.iterator(); local
114 assertEquals("Incorrect Certificate in Collection", cert, it.next());
137 Iterator<? extends Certificate> it = list1.iterator(); local
138 assertEquals("Incorrect Certificate in CertPath", cert, it.next());
172 Iterator<String> it = certFs[0].getCertPathEncodings(); local
174 assertTrue("no CertPath encodings", it.hasNext());
176 assertEquals("Incorrect default encoding", certPathEncoding, it
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| list_test.cpp | 247 * so it has preference under 23.2.2.3, by my opinion.
466 typedef list<IncompleteClass>::iterator it; typedef in class:IncompleteClass
|
| /ndk/tests/device/test-stlport/unit/ |
| list_test.cpp | 247 * so it has preference under 23.2.2.3, by my opinion.
466 typedef list<IncompleteClass>::iterator it; typedef in class:IncompleteClass
|
| /packages/apps/DeskClock/src/com/android/deskclock/timer/ |
| Timers.java | 77 for (Iterator<TimerObj> it = result.iterator(); it.hasNext();) {
78 if (!it.next().isInUse()) {
79 it.remove();
87 for (Iterator<TimerObj> it = result.iterator(); it.hasNext();) {
88 if (it.next().mState != TimerObj.STATE_TIMESUP) {
89 it.remove();
|
| /packages/inputmethods/LatinIME/native/jni/src/dictionary/header/ |
| header_policy.cpp | 61 DictionaryHeaderStructurePolicy::AttributeMap::const_iterator it = local
63 if (it == mAttributeMap.end()) {
69 const int terminalIndex = std::min(static_cast<int>(it->second.size()), outValueSize - 1);
71 outValue[i] = it->second[i];
|
| /packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/backward/v402/content/ |
| bigram_dict_content.cpp | 149 for (TerminalPositionLookupTable::TerminalIdMap::const_iterator it = terminalIdMap->begin();
150 it != terminalIdMap->end(); ++it) {
152 originalBigramDictContent->getBigramListHeadPos(it->first);
172 if (!getUpdatableAddressLookupTable()->set(it->second, bigramListPos)) {
174 it->second, bigramListPos);
197 TerminalPositionLookupTable::TerminalIdMap::const_iterator it = local
199 if (it == terminalIdMap->end()) {
205 originalBigramEntry.updateTargetTerminalIdAndGetEntry(it->second);
|
| /packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/backward/v402/ |
| ver4_patricia_trie_writing_helper.cpp | 292 TerminalPositionLookupTable::TerminalIdMap::const_iterator it = local
294 if (it == mTerminalIdMap->end()) {
299 if (!mPtNodeWriter->updateTerminalId(ptNodeParams, it->second)) {
300 AKLOGE("Cannot update terminal id. %d -> %d", it->first, it->second);
|
| /packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/v4/ |
| ver4_patricia_trie_node_writer.cpp | 245 PtNodeWriter::PtNodePositionRelocationMap::const_iterator it = local
247 if (it != dictPositionRelocationMap->mPtNodePositionRelocationMap.end()) {
248 parentPos = it->second;
262 PtNodeWriter::PtNodeArrayPositionRelocationMap::const_iterator it = local
264 if (it != dictPositionRelocationMap->mPtNodeArrayPositionRelocationMap.end()) {
265 childrenPos = it->second;
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/ |
| debug_map_base.hpp | 6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
33 // purpose. It is provided "as is" without express or implied
178 iterator it = find(r_key); local
179 if (it == m_keys.end())
184 m_keys.erase(it);
263 for (iterator_type it = m_keys.begin(); it != m_keys.end(); ++it)
275 iterator it = m_keys.begin(); local
312 iterator it = m_keys.begin(); local
328 iterator it = other.m_keys.begin(); local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/ |
| debug_map_base.hpp | 6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
33 // purpose. It is provided "as is" without express or implied
178 iterator it = find(r_key); local
179 if (it == m_keys.end())
184 m_keys.erase(it);
263 for (iterator_type it = m_keys.begin(); it != m_keys.end(); ++it)
275 iterator it = m_keys.begin(); local
312 iterator it = m_keys.begin(); local
328 iterator it = other.m_keys.begin(); local
[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/ |
| debug_map_base.hpp | 6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
33 // purpose. It is provided "as is" without express or implied
178 iterator it = find(r_key); local
179 if (it == m_keys.end())
184 m_keys.erase(it);
263 for (iterator_type it = m_keys.begin(); it != m_keys.end(); ++it)
275 iterator it = m_keys.begin(); local
312 iterator it = m_keys.begin(); local
328 iterator it = other.m_keys.begin(); local
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/ |
| debug_map_base.hpp | 6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
33 // purpose. It is provided "as is" without express or implied
184 key_set_iterator it = find(r_key); local
185 if (it == m_key_set.end())
190 m_key_set.erase(it);
266 for (iterator_type it = m_key_set.begin(); it != m_key_set.end(); ++it)
278 key_set_iterator it = m_key_set.begin(); local
321 key_set_iterator it = m_key_set.begin(); local
341 key_set_iterator it = other.m_key_set.begin(); local
[all...] |
