/frameworks/compile/mclinker/include/mcld/Target/ |
H A D | OutputRelocSection.h | 46 typedef SymRelMapType::iterator SymRelMapIterator; 48 typedef SectionData::iterator FragmentIterator;
|
H A D | ELFDynamic.h | 104 typedef EntryListType::iterator iterator; typedef in class:mcld::ELFDynamic 131 iterator needBegin() 134 iterator needEnd()
|
/frameworks/opt/calendar/src/com/android/calendarcommon2/ |
H A D | RecurrenceProcessor.java | 195 private static int filter(EventRecurrence r, Time iterator) argument 204 iterator.month + 1); 215 iterator.getWeekNumber(), 216 iterator.getActualMaximum(Time.WEEK_NUM)); 226 iterator.yearDay, iterator.getActualMaximum(Time.YEAR_DAY)); 234 iterator.monthDay, 235 iterator.getActualMaximum(Time.MONTH_DAY)); 246 int v = EventRecurrence.timeDay2Day(iterator.weekDay); 258 iterator 430 get(Time iterator, int day) argument [all...] |
/frameworks/compile/mclinker/include/mcld/ADT/ |
H A D | HashTable.h | 60 typedef entry_iterator iterator; typedef in class:mcld::HashTable 85 iterator find(const key_type& pKey); 105 iterator begin(); 106 iterator end();
|
H A D | TypeTraits.h | 53 typedef typename DataType::const_iterator iterator; typedef in struct:mcld::ConstIteratorTraits 65 typedef typename DataType::iterator iterator; typedef in struct:mcld::NonConstIteratorTraits
|
H A D | BinTree.h | 19 #include <iterator> 112 typedef PolicyIteratorBase<value_type, nonconst_traits, IteratorType> iterator; typedef in class:mcld::PolicyIteratorBase 123 PolicyIteratorBase(const iterator &X) 149 typedef PolicyIterator<DataType, typename Traits::nonconst_traits, IteratorType> iterator; typedef in class:mcld::PolicyIterator 156 PolicyIterator(const iterator &X) 180 * \brief TreeIterator provides full functions of binary tree's iterator. 201 typedef TreeIterator<value_type, nonconst_traits> iterator; typedef in struct:mcld::TreeIterator 212 TreeIterator(const iterator &X) 282 typedef typename NodeFactory<DataType>::iterator iterator; typedef in class:mcld::BinaryTreeBase::TreeImpl 372 typedef TreeIterator<value_type, NonConstTraits<value_type> > iterator; typedef in class:mcld::BinaryTree [all...] |
H A D | TreeAllocator.h | 41 typedef typename Alloc::iterator iterator; typedef in class:mcld::NodeFactory
|
/frameworks/compile/mclinker/include/mcld/Support/ |
H A D | HandleToArea.h | 54 typedef HandleToAreaMap::iterator iterator; typedef in class:mcld::HandleToArea 89 iterator begin() 92 iterator end()
|
H A D | Directory.h | 43 typedef DirIterator iterator; typedef in class:mcld::sys::fs::Directory 84 // Thus, we only provide non-constant iterator. 85 iterator begin(); 86 iterator end(); 103 * If the end of the directory elements is reached, the iterator becomes 104 * equal to the end iterator value - DirIterator(). 125 const DirCache::iterator& pIter); 146 DirCache::iterator m_Iter; // for full situation
|
H A D | UniqueGCFactory.h | 47 typename KeyMap::iterator dataIter = f_KeyMap.find(pKey); 61 typename KeyMap::iterator dataIter = f_KeyMap.find(pKey); 74 typename KeyMap::iterator dataIter = f_KeyMap.find(pKey);
|
/frameworks/compile/mclinker/lib/MC/ |
H A D | SearchDirs.cpp | 34 iterator dir, dirEnd = end(); 52 DirList::iterator mcld_dir, mcld_dir_end = m_DirList.end(); 55 MCLDDirectory::iterator entry = (*mcld_dir)->begin(); 56 MCLDDirectory::iterator enEnd = (*mcld_dir)->end();
|
H A D | InputTree.cpp | 35 pMover.connect(pRoot, iterator(pTree.m_Root.node.right)); 52 pMover.connect(pRoot, iterator(node)); 60 pMover.connect(pRoot, iterator(node)); 70 pMover.connect(pRoot, iterator(node)); 78 bool mcld::isGroup(const InputTree::iterator& pos)
|
/frameworks/av/include/drm/ |
H A D | DrmInfo.h | 86 Iterator(const Iterator& iterator); 87 Iterator& operator=(const Iterator& iterator); 157 Iterator iterator() const;
|
H A D | DrmInfoRequest.h | 100 Iterator(const Iterator& iterator); 101 Iterator& operator=(const Iterator& iterator); 164 Iterator iterator() const;
|
H A D | DrmMetadata.h | 63 Iterator(const Iterator& iterator); 64 Iterator& operator=(const Iterator& iterator); 98 Iterator iterator();
|
H A D | DrmConstraints.h | 100 Iterator(const Iterator& iterator); 101 Iterator& operator=(const Iterator& iterator); 172 Iterator iterator();
|
/frameworks/base/drm/java/android/drm/ |
H A D | DrmInfo.java | 112 * Retrieves an iterator object that you can use to iterate over the keys associated with 115 * @return The iterator object. 118 return mAttributes.keySet().iterator(); 122 * Retrieves an iterator object that you can use to iterate over the values associated with 125 * @return The iterator object. 127 public Iterator<Object> iterator() { method in class:DrmInfo 128 return mAttributes.values().iterator();
|
H A D | DrmInfoRequest.java | 118 * Retrieves an iterator object that you can use to iterate over the keys associated with 121 * @return The iterator object. 124 return mRequestInformation.keySet().iterator(); 128 * Retrieves an iterator object that you can use to iterate over the values associated with 131 * @return The iterator object. 133 public Iterator<Object> iterator() { method in class:DrmInfoRequest 134 return mRequestInformation.values().iterator();
|
H A D | DrmSupportInfo.java | 68 * Retrieves an iterator object that you can use to iterate over the MIME types that 71 * @return The iterator object 74 return mMimeTypeList.iterator(); 78 * Retrieves an iterator object that you can use to iterate over the file suffixes that 81 * @return The iterator object. 84 return mFileSuffixList.iterator();
|
/frameworks/compile/mclinker/unittests/ |
H A D | FactoriesTest.cpp | 65 NodeAlloc::iterator data = m_pNodeAlloc->begin(); 66 NodeAlloc::iterator dEnd = m_pNodeAlloc->end(); 86 NodeAlloc::iterator data = m_pNodeAlloc->begin(); 87 NodeAlloc::iterator dEnd = m_pNodeAlloc->end(); 108 NodeAlloc::iterator data = m_pNodeAlloc->begin(); 109 NodeAlloc::iterator dEnd = m_pNodeAlloc->end(); 144 NodeAlloc::iterator data = m_pNodeAlloc->begin(); 145 NodeAlloc::iterator dEnd = m_pNodeAlloc->end(); 211 MCLDFileFactory::iterator file = m_pFileAlloc->begin(); 212 MCLDFileFactory::iterator fEn [all...] |
H A D | BinTreeTest.cpp | 50 BinaryTree<int>::iterator pos = m_pTestee->root(); 60 BinaryTree<int>::iterator pos2 = mergeTree->root(); 74 BinaryTree<int>::iterator pos = m_pTestee->root(); 93 BinaryTree<int>::iterator pos = m_pTestee->root(); 103 BinaryTree<int>::iterator pos2 = mergeTree->root(); 113 BinaryTree<int>::iterator pos = m_pTestee->root(); 116 BinaryTree<int>::iterator pos2 = mergeTree->root(); 128 BinaryTree<int>::iterator pos = m_pTestee->root(); 158 BinaryTree<int>::iterator pos = m_pTestee->root(); 188 BinaryTree<int>::iterator po [all...] |
/frameworks/compile/mclinker/lib/Support/ |
H A D | Directory.cpp | 123 Directory::iterator Directory::begin() 127 PathCache::iterator iter = m_Cache.begin(); 130 return iterator(this, iter); 133 Directory::iterator Directory::end() 135 return iterator(0, m_Cache.end()); 150 const DirIterator::DirCache::iterator& pIter)
|
/frameworks/compile/mclinker/lib/Target/Mips/ |
H A D | MipsGOT.cpp | 43 iterator it = m_SectionData.begin(); 57 MipsGOT::iterator MipsGOT::begin() 62 MipsGOT::iterator MipsGOT::end() 84 for (iterator it = begin(), ie = end(); 111 // Move global entries iterator forward. 125 iterator& it = m_LocalGOTIterator; 138 iterator& it = isLocal(&pInfo) ? m_LocalGOTIterator : m_GlobalGOTIterator;
|
/frameworks/compile/mclinker/lib/Target/X86/ |
H A D | X86GOTPLT.cpp | 45 iterator it = m_SectionData.begin(); 61 X86GOTPLT::iterator X86GOTPLT::begin() 71 X86GOTPLT::iterator X86GOTPLT::end() 103 iterator it = begin();
|
/frameworks/opt/vcard/tests/src/com/android/vcard/tests/ |
H A D | VCardEntryTests.java | 204 MockEntryElementIterator iterator = new MockEntryElementIterator(); 216 iterator.addExpectedElement(nameData); 224 iterator.addExpectedElement(phoneData); 232 iterator.addExpectedElement(emailData); 242 iterator.addExpectedElement(postalData); 250 iterator.addExpectedElement(organizationData); 259 iterator.addExpectedElement(imData); 268 iterator.addExpectedElement(photoData); 275 iterator.addExpectedElement(sipData); 282 iterator [all...] |