/frameworks/support/v4/java/android/support/v4/app/ |
H A D | TaskStackBuilder.java | 277 public Iterator<Intent> iterator() { method in class:TaskStackBuilder 278 return mIntents.iterator();
|
/frameworks/opt/vcard/java/com/android/vcard/ |
H A D | VCardEntry.java | 1557 * Inner iterator interface. 1584 public final void iterateAllData(EntryElementIterator iterator) { argument 1585 iterator.onIterationStarted(); 1586 iterator.onElementGroupStarted(mNameData.getEntryLabel()); 1587 iterator.onElement(mNameData); 1588 iterator.onElementGroupEnded(); 1590 iterateOneList(mPhoneList, iterator); 1591 iterateOneList(mEmailList, iterator); 1592 iterateOneList(mPostalList, iterator); 1593 iterateOneList(mOrganizationList, iterator); 1615 iterateOneList(List<? extends EntryElement> elemList, EntryElementIterator iterator) argument [all...] |
/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/native/include/utils/ |
H A D | List.h | 99 // this will handle conversions from iterator to const_iterator 123 * handle comparisons between iterator and const_iterator 175 typedef _ListIterator<T, NON_CONST_ITERATOR> iterator; typedef in class:android::List 190 * _Node* we're returning is converted to an "iterator" by a 193 inline iterator begin() { 194 return iterator(mpMiddle->getNext()); 199 inline iterator end() { 200 return iterator(mpMiddle); 210 /* insert before the current node; returns iterator at new node */ 211 iterator inser [all...] |
H A D | Vector.h | 179 typedef TYPE* iterator; typedef in class:android::Vector 182 inline iterator begin() { return editArray(); } 183 inline iterator end() { return editArray() + size(); } 190 inline iterator erase(iterator pos) {
|
/frameworks/native/services/sensorservice/ |
H A D | vec.h | 312 typedef TYPE* iterator; typedef in class:android::vec 314 iterator begin() { return base::v; } 315 iterator end() { return base::v + SIZE; }
|
/frameworks/compile/mclinker/include/mcld/ADT/ |
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 | HashIterator.h | 246 * \brief HashIterator provides a policy-based iterator. 252 * HashIterator is a template policy-based iterator, which can change its 273 nonconst_traits> iterator; typedef in class:mcld::HashIterator
|
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 | TreeAllocator.h | 41 typedef typename Alloc::iterator iterator; typedef in class:mcld::NodeFactory
|
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
|
/frameworks/compile/mclinker/include/mcld/LD/ |
H A D | SectionData.h | 37 typedef FragmentListType::iterator iterator; typedef in class:mcld::SectionData 54 iterator begin() { return m_Fragments.begin(); } 57 iterator end() { return m_Fragments.end(); }
|
H A D | SectionMap.h | 38 typedef SectionMappingTy::iterator iterator; typedef in class:mcld::SectionMap 53 // find - return the iterator to the mapping 54 iterator find(const std::string& pInput); 70 iterator begin() 73 iterator end()
|
H A D | SectionMerger.h | 39 typedef LDSectionMapTy::iterator iterator; typedef in class:mcld::SectionMerger 68 iterator find(const std::string& pName); 70 iterator begin() 73 iterator end()
|
/frameworks/compile/mclinker/include/mcld/MC/ |
H A D | AttributeFactory.h | 32 typedef AttrSet::iterator iterator; typedef in class:mcld::AttributeFactory 78 iterator begin() 81 iterator end()
|
H A D | InputTree.h | 36 typedef PolicyIterator<Input, typename Traits::nonconst_traits, IteratorType> iterator; typedef in class:mcld::PolicyIterator 43 PolicyIterator(const iterator &X) 89 typedef BinaryTree<Input>::iterator iterator; typedef in class:mcld::InputTree 94 * \brief Mover provides the interface for moving iterator forward. 97 * iterator forward in certain direction. @ref Mover::connect 107 * \brief class Succeeder moves the iterator afterward. 120 * \brief class Includer moves the iterator downward. 190 bool isGroup(const InputTree::iterator& pos);
|
H A D | SearchDirs.h | 43 typedef DirList::iterator iterator; typedef in class:mcld::SearchDirs 55 iterator begin() 58 iterator end()
|
H A D | SymbolCategory.h | 31 typedef OutputSymbols::iterator iterator; typedef in class:mcld::SymbolCategory 79 iterator begin(); 80 iterator end(); 84 iterator localBegin(); 85 iterator localEnd(); 89 iterator commonBegin(); 90 iterator commonEnd(); 94 iterator regularBegin(); 95 iterator regularEn [all...] |
/frameworks/compile/mclinker/include/mcld/Support/ |
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 | GCFactory.h | 19 #include <iterator> 58 * \brief DataIterator provides STL compatible iterator for allocators 72 typedef DataIterator<ChunkType, nonconst_traits> iterator; typedef in class:mcld::DataIterator 98 assert(0 && "data iterator goes to a invalid position"); 120 typename Alloc::value_type> > iterator; typedef in class:mcld::GCFactoryBase 174 iterator begin() 175 { return iterator(Alloc::m_pRoot, 0); } 180 iterator end() { 183 iterator(Alloc::m_pCurrent, Alloc::m_pCurrent->bound);
|
H A D | HandleToArea.h | 54 typedef HandleToAreaMap::iterator iterator; typedef in class:mcld::HandleToArea 89 iterator begin() 92 iterator end()
|
H A D | TargetRegistry.h | 130 typedef TargetListTy::iterator iterator; typedef in class:mcld::TargetRegistry 136 static iterator begin() { return s_TargetList.begin(); } 137 static iterator end() { return s_TargetList.end(); } 223 llvm::TargetRegistry::iterator TIter, TEnd = llvm::TargetRegistry::end();
|
/frameworks/compile/mclinker/include/mcld/Target/ |
H A D | ELFDynamic.h | 104 typedef EntryListType::iterator iterator; typedef in class:mcld::ELFDynamic 131 iterator needBegin() 134 iterator needEnd()
|
/frameworks/compile/mclinker/lib/Target/ARM/ |
H A D | ARMGOT.h | 33 typedef SectionData::iterator iterator; typedef in class:mcld::ARMGOT 45 iterator begin(); 49 iterator end(); 73 iterator getNextGOTPLTEntry(); 75 iterator getGOTPLTBegin(); 77 const iterator getGOTPLTEnd(); 81 iterator m_NormalGOTIterator; 85 iterator m_GOTPLTIterator; 88 iterator m_GOTPLTBegi [all...] |
H A D | ARMPLT.h | 39 typedef SectionData::iterator iterator; typedef in class:mcld::ARMPLT 57 iterator begin() { return m_SectionData.begin(); } 61 iterator end() { return m_SectionData.end(); } 78 iterator m_PLTEntryIterator;
|