| /development/tools/apkcheck/src/com/android/apkcheck/ |
| PackageInfo.java | 20 import java.util.Iterator;
73 * Returns an iterator for the set of classes in this package.
75 public Iterator<ClassInfo> getClassIterator() {
76 return mClassList.values().iterator();
|
| /external/e2fsprogs/tests/progs/test_data/ |
| test.brel | 30 # Test the iterator functions
|
| /external/freetype/include/freetype/ |
| ftlist.h | 176 /* An FT_List iterator function which is called during a list parse */
196 /* Parse a list and calls a given iterator function on each element. */
197 /* Note that parsing is stopped as soon as one of the iterator calls */
202 /* iterator :: An iterator function, called on each node of the list. */
204 /* argument to the iterator. */
207 /* The result (a FreeType error code) of the last iterator call. */
211 FT_List_Iterator iterator,
221 /* An @FT_List iterator function which is called during a list */
|
| /external/guava/src/com/google/common/collect/ |
| AbstractIterator.java | 25 * This class provides a skeletal implementation of the {@code Iterator}
29 * <p>{@code Iterator} requires its implementations to support querying the
30 * end-of-data status without changing the iterator's state, using the {@link
38 * <p>Another example is an iterator that skips over null elements in a backing
39 * iterator. This could be implemented as: <pre> {@code
41 * public static Iterator<String> skipNulls(final Iterator<String> in) {
93 * further attempts to use the iterator will result in an {@link
105 * attempts to use the iterator will result in an
|
| ForwardingCollection.java | 22 import java.util.Iterator;
40 public Iterator<E> iterator() { method in class:ForwardingCollection
41 return delegate().iterator();
|
| Maps.java | 37 import java.util.Iterator;
256 * Iterator<Long> it = set.iterator(); // Must be in synchronized block
550 @Override public Iterator<Entry<K, V>> iterator() {
551 final Iterator<Entry<K, V>> delegate = super.iterator();
556 @Override protected Iterator<Entry<K, V>> delegate() {
790 @Override public Iterator<Entry<K, V2>> iterator() {
[all...] |
| /external/guava/src/com/google/common/io/ |
| MultiInputStream.java | 21 import java.util.Iterator;
32 private Iterator<? extends InputSupplier<? extends InputStream>> it;
38 * @param it an iterator of I/O suppliers that will provide each substream
41 Iterator<? extends InputSupplier<? extends InputStream>> it)
|
| /external/icu4c/common/ |
| ulocimp.h | 14 * Create an iterator over the specified keywords list
|
| /external/icu4c/common/unicode/ |
| dbbi.h | 20 * \brief C++ API: Dictionary Based Break Iterator
|
| ucasemap.h | 143 * titlecase exactly the characters at breaks from the iterator.
146 * By default, titlecasing will take each break iterator index,
169 * Get the break iterator that is used for titlecasing.
170 * Do not modify the returned break iterator.
172 * @return titlecasing break iterator
179 * Set the break iterator that is used for titlecasing.
180 * The UCaseMap service object releases a previously set break iterator
185 * Break iterator operations are not thread-safe. Therefore, titlecasing
190 * @param iterToAdopt Break iterator to be adopted for titlecasing.
208 * Titlecasing uses a break iterator to find the first characters of word
[all...] |
| /external/icu4c/samples/uresb/ |
| root.txt | 30 breakit { "ROOT break iterator help topic" }
|
| sr.txt | 32 breakit { "This is break iterator help topic" }
|
| /external/opencore/oscl/oscl/osclutil/src/ |
| oscl_priqueue.h | 122 typedef typename Container::iterator iterator; typedef in class:OsclPriorityQueue
182 void push_heap(iterator first, iterator last)
187 void pop_heap(iterator first, iterator last)
192 iterator find_heap(const value_type& input, iterator first, iterator last)
|
| /external/stlport/test/unit/ |
| advance_test.cpp | 34 IntVector::iterator location = v.begin();
|
| /external/webkit/WebCore/platform/text/ |
| TextBreakIterator.h | 31 // Note: The returned iterator is good only until you get another iterator.
39 // This is similar to character break iterator in most cases, but is subject to
41 // from character break iterator is Thai prepend characters, see bug 24342.
|
| /frameworks/base/media/libdrm/mobile2/src/rights/ |
| RoManager.cpp | 46 for (vector<Ro*>::iterator it = mRoList.begin();
75 for (vector<Ro*>::iterator it = mRoList.begin();
78 for (vector<Asset*>::iterator ita = (*it)->mAssetList.begin();
94 for (vector<Ro*>::iterator it = mRoList.begin();
|
| /frameworks/base/media/libdrm/mobile2/src/util/ustl-1.0/ |
| memblock.h | 46 iterator insert (iterator start, size_type size);
47 iterator erase (iterator start, size_type size);
|
| /dalvik/libcore/luni/src/test/java/tests/api/java/util/ |
| LinkedHashMapTest.java | 29 import java.util.Iterator;
288 Iterator i = s.iterator();
314 s1.remove(m2.entrySet().iterator().next());
315 assertEquals("jumbo", s1.iterator().next().getKey());
338 assertNull("Failed with null key", m.keySet().iterator().next());
344 Iterator it = map.keySet().iterator();
356 assertTrue("Wrong contents", map.keySet().iterator().next().equals(
362 Iterator it2 = map2.keySet().iterator()
517 Iterator<Map.Entry<String,String>> iterator = hm1.entrySet().iterator(); local
[all...] |
| /dalvik/libcore/xml/src/main/java/org/apache/xml/dtm/ |
| DTMIterator.java | 29 * <p>A DTMIterator is a somewhat unusual type of iterator, in that it
75 * iterator may be passed without a DTMManager, this allows the
76 * caller to easily get the DTM using just the iterator.
86 * iterator may be passed without a DTMManager, this allows the
87 * caller to easily get the DTMManager using just the iterator.
111 * The environment in which this iterator operates, which should provide:
127 * Reset the iterator to the start. After resetting, the next node returned
135 * iterator. The available set of constants is defined above.
146 * reference nodes are visible to the iterator. If false, they and
154 * iterator. To produce a view of the document that has entity referenc
[all...] |
| /external/stlport/stlport/stl/ |
| _iterator_base.h | 59 struct iterator { struct
67 struct iterator<output_iterator_tag, void, void, void, void> { struct
81 //Old HP iterator queries do not give information about the iterator
106 * iterators we have to map std iterator categories to stlport ones. This
114 # include_next <iterator>
116 # include _STLP_NATIVE_HEADER(iterator)
249 inline _Category _STLP_CALL iterator_category(const iterator<_Category,_Tp,_Distance,_Pointer,_Reference>&) { return _Category(); }
251 inline _Tp* _STLP_CALL value_type(const iterator<_Category,_Tp,_Distance,_Pointer,_Reference>&) { return __STATIC_CAST(_Tp*, 0); }
253 inline _Distance* _STLP_CALL distance_type(const iterator<_Category,_Tp,_Distance,_Pointer,_Reference>&) { return __STATIC_CAST(_Distance*, 0);
[all...] |
| _rope.h | 163 // Buffer should really be an arbitrary output iterator.
165 // This is thoroughly impossible, since iterator types don't
194 class sequence_buffer : public iterator <output_iterator_tag, void, void, void, void> {
644 * Dereferencing a nonconst iterator has to return something
746 * When we run out of cache, we have to reconstruct the iterator
953 // Perhaps we should instead copy the iterator
1095 typedef _Rope_iterator<_CharT,_Alloc> iterator; typedef in class:rope
[all...] |
| _string.h | 87 // (2) Each iterator in [start, finish) points to a valid object
92 // (5) Each iterator in [finish + 1, end_of_storage) points to
143 typedef value_type* iterator; typedef in class:basic_string
258 // it can't be an iterator.
385 iterator begin() { return this->_M_Start(); }
386 iterator end() { return this->_M_Finish(); }
501 // it can't be an iterator.
593 // it can't be an iterator.
658 iterator insert(iterator __p, _CharT __c)
[all...] |
| /external/opencore/oscl/oscl/osclbase/src/ |
| oscl_tree.h | 102 typedef Oscl_Rb_Tree_Iterator<Value> iterator; typedef in struct:Oscl_Rb_Tree_Iterator
114 Oscl_Rb_Tree_Iterator(const iterator& it)
338 typedef Oscl_Rb_Tree_Iterator<value_type> iterator; typedef in class:Oscl_Rb_Tree
416 iterator begin()
424 iterator end()
445 Oscl_Pair<iterator, bool> insert_unique(const value_type& v)
456 iterator j = iterator(y);
460 return Oscl_Pair<iterator, bool>(insert(x, y, v), true);
465 return Oscl_Pair<iterator, bool>(insert(x, y, v), true)
[all...] |
| /dalvik/libcore/text/src/main/java/java/text/ |
| CollationElementIterator.java | 42 * and 'e', the iterator returns two collation elements for the single character
52 * This constant is returned by the iterator in the methods
61 CollationElementIterator(com.ibm.icu4jni.text.CollationElementIterator iterator) {
62 this.icuIterator = iterator;
145 * If the {@code RuleBasedCollator} used by this iterator has had its
146 * attributes changed, calling {@code reset()} reinitializes the iterator to
167 * Points the iterator at the collation element associated with the
173 * sequence that maps to a single collation element then the iterator is
179 * decomposable range of source text, the iterator may not return a correct
193 * Sets a new source string iterator for iteration, and resets the offset t
[all...] |
| /external/astl/include/ |
| algorithm | 35 #include <iterator>
106 // TODO: for simple case and wrapper iterator, should degrade to memmove.
133 // begin and end params. Fix this when iterator are defined.
253 // @param begin1 An input iterator.
254 // @param end1 An input iterator.
255 // @param begin2 An input iterator.
257 // TODO: When we have a proper structure for iterator as opposed to
259 // referenced by the iterator and default to memcmp for simple types.
276 // @param begin1 An input iterator.
277 // @param end1 An input iterator
[all...] |
