/frameworks/compile/mclinker/include/mcld/ADT/ |
H A D | TreeAllocator.h | 38 typedef typename Alloc::iterator iterator; typedef in class:mcld::NodeFactory
|
/frameworks/compile/mclinker/lib/Script/ |
H A D | SectionsCmd.cpp | 24 for (iterator it = begin(), ie = end(); it != ie; ++it) { 78 iterator assign, assignEnd = assignments.end();
|
/frameworks/compile/mclinker/lib/Target/Mips/ |
H A D | MipsGOTPLT.cpp | 34 for (iterator it = begin(), ie = end(); it != ie; ++it, ++buffer) { 55 iterator it = begin();
|
/frameworks/compile/mclinker/include/mcld/LD/ |
H A D | BranchIsland.h | 36 typedef SectionData::iterator iterator; typedef in class:mcld::BranchIsland 40 typedef RelocationListType::iterator reloc_iterator; 59 iterator begin(); 63 iterator end();
|
H A D | Archive.h | 68 typedef HashEntry<uint32_t, InputTree::iterator, OffsetCompare<uint32_t> > 78 InputTree::iterator lastPos; 138 /// @param pIter - the iterator in the input tree built from this archive 139 bool addObjectMember(uint32_t pFileOffset, InputTree::iterator pIter); 158 InputTree::iterator pLastPos,
|
/frameworks/compile/mclinker/lib/Target/AArch64/ |
H A D | AArch64GOT.cpp | 58 SectionData::iterator frag, fragEnd = m_SectionData->end(); 105 SectionData::iterator entry(m_pGOTPLTFront); 106 SectionData::iterator e_end; 110 e_end = SectionData::iterator(m_pGOTFront); 123 for (iterator it = begin(), ie = end(); it != ie; ++it, ++buffer) {
|
/frameworks/compile/mclinker/lib/Target/ARM/ |
H A D | ARMException.h | 89 typedef SectMap::iterator iterator; typedef in class:mcld::ARMInputExMap 118 /// begin - return the iterator to the begin of the map 119 iterator begin() { return m_SectToExData.begin(); } 122 /// end - return the iterator to the end of the map 123 iterator end() { return m_SectToExData.end(); } 127 void erase(iterator it) { m_SectToExData.erase(it); }
|
H A D | ARMGOT.cpp | 55 SectionData::iterator frag, fragEnd = m_SectionData->end(); 102 SectionData::iterator entry(m_pGOTPLTFront); 103 SectionData::iterator e_end; 107 e_end = SectionData::iterator(m_pGOTFront); 120 for (iterator it = begin(), ie = end(); it != ie; ++it, ++buffer) {
|
/frameworks/compile/mclinker/unittests/ |
H A D | InputTreeTest.cpp | 62 std::vector<InputAction*>::iterator action; 68 InputTree::iterator node = m_pTestee->root(); 95 InputTree::iterator node = m_pTestee->root(); 120 InputTree::iterator node = m_pTestee->root(); 139 InputTree::iterator node = m_pTestee->root();
|
/frameworks/support/v17/leanback/src/android/support/v17/leanback/util/ |
H A D | StateMachine.java | 196 for (Iterator<Map.Entry<State, ArrayList<State>>> iterator = 197 edges.entrySet().iterator(); iterator.hasNext();) { 198 Map.Entry<State, ArrayList<State>> entry = iterator.next(); 206 iterator.remove();
|
/frameworks/compile/mclinker/include/mcld/Support/ |
H A D | GCFactory.h | 16 #include <iterator> 54 * \brief DataIterator provides STL compatible iterator for allocators 67 typedef DataIterator<ChunkType, nonconst_traits> iterator; typedef in class:mcld::DataIterator 86 "data iterator goes to a invalid position"); 106 NonConstTraits<typename Alloc::value_type> > iterator; typedef in class:mcld::GCFactoryBase 154 iterator begin() { return iterator(Alloc::m_pRoot, 0); } 158 iterator end() { 161 : iterator(Alloc::m_pCurrent, Alloc::m_pCurrent->bound);
|
/frameworks/compile/mclinker/lib/Target/Hexagon/ |
H A D | HexagonPLT.cpp | 54 iterator first = m_pSectionData->getFragmentList().begin(); 70 HexagonPLT::iterator it = begin(); 80 SectionData::iterator frag, fragEnd = m_pSectionData->end(); 126 HexagonPLT::iterator it = m_pSectionData->begin(); 127 HexagonPLT::iterator ie = m_pSectionData->end(); 170 iterator it = begin(); 180 HexagonPLT::iterator ie = end();
|
/frameworks/compile/mclinker/lib/Target/X86/ |
H A D | X86PLT.cpp | 93 X86PLT::iterator it = begin(); 103 SectionData::iterator frag, fragEnd = m_pSectionData->end(); 122 iterator first = m_pSectionData->getFragmentList().begin(); 167 X86PLT::iterator it = m_pSectionData->begin(); 168 X86PLT::iterator ie = m_pSectionData->end(); 250 X86PLT::iterator it = m_pSectionData->begin(); 251 X86PLT::iterator ie = m_pSectionData->end();
|
/frameworks/base/location/tests/locationtests/src/android/location/ |
H A D | GpsStatusTest.java | 63 Iterator<GpsSatellite> iterator = mStatus.getSatellites().iterator(); 64 assertTrue("hasNext(1)", iterator.hasNext()); 65 assertTrue("hasNext(1) does not overflow", iterator.hasNext()); 66 GpsSatellite satellite1 = iterator.next(); 68 assertTrue("hasNext(2)", iterator.hasNext()); 69 assertTrue("hasNext(2) does not overflow", iterator.hasNext()); 70 GpsSatellite satellite2 = iterator.next(); 72 assertFalse("hasNext() no elements", iterator.hasNext());
|
/frameworks/base/drm/java/android/drm/ |
H A D | DrmUtils.java | 178 * This method returns an iterator object that can be used to iterate over 181 * @return The iterator object. 183 public Iterator<String> iterator() { method in class:DrmUtils.ExtendedMetadataParser 184 return mMap.values().iterator(); 188 * This method returns an iterator object that can be used to iterate over 191 * @return The iterator object. 194 return mMap.keySet().iterator();
|
/frameworks/base/media/mca/filterfw/native/base/ |
H A D | utilities.h | 44 // For hash_[multi]set, it is important that this deletes behind the iterator 45 // because the hash_set may call the hash function on the iterator when it is 64 for (typename T::iterator i = v->begin(); i != v->end(); ++i) { 116 typename std::set<T>::iterator iter = items_.find(item); 152 std::pair<typename Collection::iterator, bool> ret =
|
/frameworks/base/media/mca/filterpacks/native/base/ |
H A D | utilities.h | 44 // For hash_[multi]set, it is important that this deletes behind the iterator 45 // because the hash_set may call the hash function on the iterator when it is 64 for (typename T::iterator i = v->begin(); i != v->end(); ++i) { 116 typename std::set<T>::iterator iter = items_.find(item); 152 std::pair<typename Collection::iterator, bool> ret =
|
/frameworks/compile/mclinker/lib/LD/ |
H A D | BranchIslandFactory.cpp | 41 for (Module::iterator sect = pModule.begin(), sectEnd = pModule.end(); 46 for (SectionData::iterator it = sd.begin(), ie = sd.end(); it != ie; 81 for (iterator it = begin(), ie = end(), prev = ie; it != ie;
|
/frameworks/ml/bordeaux/service/src/android/bordeaux/services/ |
H A D | FeatureAssembly.java | 74 Iterator itr = mUseFeatures.iterator(); 87 itr = mUsePairedFeatures.iterator(); 105 Iterator itr = mUseFeatures.iterator();
|
/frameworks/av/media/libstagefright/ |
H A D | FrameRenderTracker.cpp | 57 std::list<Info>::iterator renderInfo = mRenderQueue.end(); 58 for (std::list<Info>::iterator it = mRenderQueue.begin(); 114 for (std::list<Info>::iterator it = mRenderQueue.begin(); 158 for (std::list<Info>::iterator it = mRenderQueue.begin();
|
/frameworks/av/media/libstagefright/foundation/ |
H A D | AAtomizer.cpp | 43 List<AString>::iterator it = entry.begin();
|
/frameworks/base/core/java/android/util/ |
H A D | FastImmutableArraySet.java | 24 * The same iterator instance is reused each time to avoid creating lots of garbage. 39 public Iterator<T> iterator() { method in class:FastImmutableArraySet
|
/frameworks/base/packages/Osu/src/com/android/hotspot2/pps/ |
H A D | DomainMatcher.java | 70 mRoot.addDomain(secondaryLabel.iterator(), Match.Secondary); 73 mRoot.addDomain(primary.iterator(), Match.Primary); 103 Iterator<String> l1 = arg1.iterator(); 104 Iterator<String> l2 = arg2.iterator();
|
/frameworks/compile/mclinker/include/mcld/Script/ |
H A D | OutputSectDesc.h | 155 typedef OutputSectCmds::iterator iterator; typedef in class:mcld::OutputSectDesc 164 iterator begin() { return m_OutputSectCmds.begin(); } 166 iterator end() { return m_OutputSectCmds.end(); }
|
H A D | ScriptFile.h | 50 typedef CommandQueue::iterator iterator; typedef in class:mcld::ScriptFile 59 iterator begin() { return m_CommandQueue.begin(); } 61 iterator end() { return m_CommandQueue.end(); }
|