Searched defs:iterator (Results 51 - 75 of 129) sorted by relevance

123456

/external/guava/src/com/google/common/collect/
H A DImmutableSet.java210 return ImmutableSet.<E>of(collection.iterator().next());
244 // This declaration is needed to make Set.iterator() and
245 // ImmutableCollection.iterator() consistent.
246 @Override public abstract UnmodifiableIterator<E> iterator(); method in class:ImmutableSet
313 @Override public UnmodifiableIterator<E> iterator() { method in class:ImmutableSet.ArrayImmutableSet
377 @Override public UnmodifiableIterator<E> iterator() { method in class:ImmutableSet.TransformedImmutableSet
H A DMultisets.java99 @Override public Iterator<E> iterator() { method in class:Multisets.UnmodifiableMultiset
101 return (Iterator) Iterators.unmodifiableIterator(delegate.iterator());
171 * (except through the iterator's own {@code remove} operation) the results of
292 @Override public Iterator<Entry<E>> iterator() { method in class:Multisets.SetMultiset.EntrySet
294 final Iterator<E> elements = delegate.iterator();
360 @Override public Iterator<Entry<E>> iterator() {
361 final Iterator<Entry<E>> iterator1 = multiset1.entrySet().iterator();
H A DImmutableSortedMap.java472 @Override public UnmodifiableIterator<Entry<K, V>> iterator() { method in class:ImmutableSortedMap.EntrySet
547 @Override public UnmodifiableIterator<V> iterator() { method in class:ImmutableSortedMap.Values
H A DIterators.java65 * Returns the empty iterator.
103 /** Returns an unmodifiable view of {@code iterator}. */
105 final Iterator<T> iterator) {
106 checkNotNull(iterator);
109 return iterator.hasNext();
112 return iterator.next();
118 * Returns the number of elements remaining in {@code iterator}. The iterator
122 public static int size(Iterator<?> iterator) { argument
124 while (iterator
104 unmodifiableIterator( final Iterator<T> iterator) argument
134 contains(Iterator<?> iterator, @Nullable Object element) argument
250 toString(Iterator<?> iterator) argument
269 getOnlyElement(Iterator<T> iterator) argument
295 getOnlyElement( Iterator<T> iterator, @Nullable T defaultValue) argument
310 toArray( Iterator<? extends T> iterator, Class<T> type) argument
324 addAll( Collection<T> addTo, Iterator<? extends T> iterator) argument
341 frequency(Iterator<?> iterator, @Nullable Object element) argument
542 partition( Iterator<T> iterator, int size) argument
563 paddedPartition( Iterator<T> iterator, int size) argument
568 partitionImpl( final Iterator<T> iterator, final int size, final boolean pad) argument
636 any( Iterator<T> iterator, Predicate<? super T> predicate) argument
653 all( Iterator<T> iterator, Predicate<? super T> predicate) argument
676 find(Iterator<T> iterator, Predicate<? super T> predicate) argument
697 indexOf( Iterator<T> iterator, Predicate<? super T> predicate) argument
747 get(Iterator<T> iterator, int position) argument
772 getLast(Iterator<T> iterator) argument
794 consumingIterator(final Iterator<T> iterator) argument
932 asEnumeration(final Iterator<T> iterator) argument
949 private final Iterator<? extends E> iterator; field in class:Iterators.PeekingImpl
953 PeekingImpl(Iterator<? extends E> iterator) argument
1023 peekingIterator( Iterator<? extends T> iterator) argument
[all...]
H A DLinkedListMultimap.java66 * key iteration order to {@code [key2, key1]}. The {@link #entries()} iterator
84 * collections is in progress, except through the iterator's own {@code remove}
265 /** Helper method for verifying that an iterator element is present. */
326 /** Constructs a new iterator over all values for the specified key. */
333 * Constructs a new iterator over all values for the specified key starting
505 Iterator<? extends V> newValues = values.iterator();
557 * progress (except through the iterator's own {@code add}, {@code set} or
571 return Iterators.removeAll(iterator(), c);
574 return Iterators.retainAll(iterator(), c);
588 @Override public Iterator<K> iterator() {
616 @Override public Iterator<K> iterator() { method in class:LinkedListMultimap.MultisetView
816 @Override public Iterator<Entry<K, Collection<V>>> iterator() { method in class:LinkedListMultimap.AsMapEntries
[all...]
H A DSets.java97 Iterator<E> iterator = elements.iterator();
98 if (!iterator.hasNext()) {
105 E first = iterator.next();
107 while (iterator.hasNext()) {
108 set.add(iterator.next());
209 return newHashSet(elements.iterator());
352 Class<E> type = collection.iterator().next().getDeclaringClass();
455 @Override public Iterator<E> iterator() { method in class:Sets.SetFromMap
456 return s.iterator();
836 @Override public UnmodifiableIterator<List<B>> iterator() { method in class:Sets.CartesianSet
[all...]
/external/nist-sip/java/gov/nist/core/
H A DGenericObjectList.java181 * Traverse the list given a list iterator
183 protected GenericObject next(ListIterator iterator) { argument
185 return (GenericObject) iterator.next();
192 * This is the default list iterator.This will not handle nested list
205 * Fetch the next object from the list based on the default list iterator
351 ListIterator iterator = this.listIterator();
352 if (iterator.hasNext()) {
354 Object obj = iterator.next();
361 if (iterator.hasNext())
H A DNameValueList.java95 Iterator<NameValue> iterator = hmap.values().iterator();
96 if (iterator.hasNext()) {
98 Object obj = iterator.next();
105 if (iterator.hasNext())
155 Iterator<String> li = this.hmap.keySet().iterator();
218 Iterator<NameValue> it = this.hmap.values().iterator();
240 * Return an iterator for the name-value pairs of this list.
242 * @return the iterator.
244 public Iterator<NameValue> iterator() { method in class:NameValueList
[all...]
/external/protobuf/java/src/main/java/com/google/protobuf/
H A DFieldSet.java133 * Get an iterator to the field map. This iterator should not be leaked
136 public Iterator<Map.Entry<FieldDescriptorType, Object>> iterator() { method in class:FieldSet
137 return fields.entrySet().iterator();
/external/stlport/stlport/stl/
H A D_iterator_base.h59 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<_Categor
[all...]
H A D_map.h39 //Specific iterator traits creation
85 typedef typename _Rep_type::iterator iterator; typedef in class:map
163 iterator begin() { return _M_t.begin(); }
165 iterator end() { return _M_t.end(); }
176 iterator __i = lower_bound(__k);
188 pair<iterator,bool> insert(const value_type& __x)
190 iterator insert(iterator __pos, const value_type& __x)
203 void erase(iterator __po
278 typedef typename _Rep_type::iterator iterator; typedef in class:multimap
[all...]
H A D_set.h41 //Specific iterator traits creation
60 //Specific iterator traits creation
73 typedef typename _Rep_type::iterator iterator; typedef in class:set
151 iterator begin() { return _M_t.begin(); }
152 iterator end() { return _M_t.end(); }
168 pair<iterator,bool> insert(const value_type& __x)
170 iterator insert(iterator __pos, const value_type& __x)
182 void erase(iterator __po
244 typedef typename _Rep_type::iterator iterator; typedef in class:multiset
[all...]
H A D_tree.c47 # define iterator __iterator__ macro
49 # define __iterator__ _STLP_TYPENAME_ON_RETURN_TYPE _Rb_tree<_Key, _Compare, _Value, _KeyOfValue, _Traits, _Alloc>::iterator
381 return iterator(__new_node);
414 iterator __j = iterator(__y);
417 return pair<iterator,bool>(_M_insert(__y, __val, /* __x*/ __y), true);
422 return pair<iterator,bool>(_M_insert(__y, __val, __x), true);
424 return pair<iterator,bool>(__j, false);
432 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(iterator __position,
453 iterator __afte
723 #undef iterator macro
[all...]
/external/stlport/stlport/stl/debug/
H A D_list.h74 typedef _STLP_PRIV _DBG_iter<_Base, _STLP_PRIV _DbgTraits<_Nonconst_traits<value_type> > > iterator; typedef in class:list
83 void _Invalidate_iterator(const iterator& __it)
85 void _Invalidate_iterators(const iterator& __first, const iterator& __last)
88 typedef typename _Base::iterator _Base_iterator;
154 //Should not invalidate end iterator
163 iterator begin() { return iterator(&_M_iter_list, _M_non_dbg_impl.begin()); }
166 iterator end() { return iterator(
[all...]
H A D_tree.h105 typedef _STLP_PRIV _DBG_iter<_Base, _STLP_PRIV _DbgTraits<_NonConstIteTraits> > iterator; typedef in class:_Rb_tree
112 void _Invalidate_iterator(const iterator& __it)
114 void _Invalidate_iterators(const iterator& __first, const iterator& __last)
117 typedef typename _Base::iterator _Base_iterator;
146 //Should not invalidate end iterator:
156 iterator begin() { return iterator(&_M_iter_list, _M_non_dbg_impl.begin()); }
158 iterator end() { return iterator(
[all...]
H A D_vector.h118 _STLP_PRIV _DbgTraits<_STLP_PRIV _Vector_nonconst_traits<value_type, typename _Base::iterator> > > iterator; typedef in class:vector
121 _STLP_PRIV _DbgTraits<_STLP_PRIV _Vector_const_traits<value_type, typename _Base::iterator> > > const_iterator;
126 void _Invalidate_iterator(const iterator& __it)
128 void _Invalidate_iterators(const iterator& __first, const iterator& __last)
146 iterator begin() { return iterator(&_M_iter_list, _M_non_dbg_impl.begin()); }
148 iterator end() { return iterator(
[all...]
/external/stlport/stlport/stl/pointers/
H A D_vector.h51 * won't use iterator wrapping.
64 typedef value_type* iterator; typedef in class:vector
79 iterator begin() { return cast_traits::to_value_type_ptr(_M_impl.begin()); }
81 iterator end() { return cast_traits::to_value_type_ptr(_M_impl.end()); }
176 iterator insert(iterator __pos, const value_type& __x = _STLP_DEFAULT_CONSTRUCTED(value_type))
178 iterator insert(iterator __pos, const value_type& __x)
185 iterator insert(iterator __po
[all...]
/external/v8/test/cctest/
H A Dtest-heap-profiler.cc66 i::HeapIterator iterator; local
67 for (i::HeapObject* obj = iterator.next(); obj != NULL; obj = iterator.next())
375 i::HeapIterator iterator; local
376 for (i::HeapObject* obj = iterator.next(); obj != NULL; obj = iterator.next())
/external/webkit/JavaScriptCore/API/
H A DJSCallbackObjectFunctions.h414 typedef OpaqueJSClassStaticValuesTable::const_iterator iterator; typedef
415 iterator end = staticValues->end();
416 for (iterator it = staticValues->begin(); it != end; ++it) {
425 typedef OpaqueJSClassStaticFunctionsTable::const_iterator iterator; typedef
426 iterator end = staticFunctions->end();
427 for (iterator it = staticFunctions->begin(); it != end; ++it) {
/external/webkit/JavaScriptCore/wtf/
H A DDeque.h49 typedef DequeIterator<T> iterator; typedef in class:WTF::Deque
64 iterator begin() { return iterator(this, m_start); }
65 iterator end() { return iterator(this, m_end); }
79 void remove(iterator&);
85 iterator findIf(Predicate&);
326 typedef typename Deque<T>::const_iterator iterator;
327 iterator end = collection.end();
328 for (iterator i
[all...]
H A DHashMap.h50 typedef HashTableIteratorAdapter<HashTableType, ValueType> iterator; typedef in class:WTF::HashMap
60 iterator begin();
61 iterator end();
65 iterator find(const KeyType&);
71 // return value is a pair of the iterator to the key location,
73 pair<iterator, bool> set(const KeyType&, const MappedType&);
76 // return value is a pair of the iterator to the key location,
78 pair<iterator, bool> add(const KeyType&, const MappedType&);
81 void remove(iterator);
91 template<typename T, typename HashTranslator> iterator fin
350 typedef typename HashTableType::const_iterator iterator; typedef
365 typedef typename HashTableType::const_iterator iterator; typedef
380 typedef typename HashMap<T, U, V, W, X>::const_iterator::Keys iterator; typedef
393 typedef typename HashMap<T, U, V, W, X>::const_iterator::Values iterator; typedef
[all...]
H A DHashSet.h51 typedef HashTableIteratorAdapter<HashTableType, ValueType> iterator; typedef in class:WTF::HashSet
60 iterator begin();
61 iterator end();
65 iterator find(const ValueType&);
74 template<typename T, typename HashTranslator> iterator find(const T&);
80 pair<iterator, bool> add(const ValueType&);
88 template<typename T, typename HashTranslator> pair<iterator, bool> add(const T&);
91 void remove(iterator);
140 inline typename HashSet<T, U, V>::iterator HashSet<T, U, V>::begin()
146 inline typename HashSet<T, U, V>::iterator HashSe
246 typedef typename HashTableType::const_iterator iterator; typedef
261 typedef typename HashTableType::const_iterator iterator; typedef
276 typedef typename HashSet<T, U, V>::const_iterator iterator; typedef
[all...]
H A DRefPtrHashMap.h67 typedef HashTableIteratorAdapter<HashTableType, ValueType> iterator; typedef in class:WTF::HashMap
77 iterator begin();
78 iterator end();
82 iterator find(const KeyType&);
83 iterator find(RawKeyType);
93 // return value is a pair of the iterator to the key location,
95 pair<iterator, bool> set(const KeyType&, const MappedType&);
96 pair<iterator, bool> set(RawKeyType, const MappedType&);
99 // return value is a pair of the iterator to the key location,
101 pair<iterator, boo
[all...]
/external/webkit/WebCore/platform/text/
H A DAtomicString.cpp90 pair<HashSet<StringImpl*>::iterator, bool> addResult = stringTable().add<const char*, CStringTranslator>(c);
188 pair<HashSet<StringImpl*>::iterator, bool> addResult = stringTable().add<UCharBuffer, UCharBufferTranslator>(buf);
208 pair<HashSet<StringImpl*>::iterator, bool> addResult = stringTable().add<UCharBuffer, UCharBufferTranslator>(buf);
256 pair<HashSet<StringImpl*>::iterator, bool> addResult = stringTable().add<HashAndCharacters, HashAndCharactersTranslator>(buffer);
273 pair<HashSet<StringImpl*>::iterator, bool> addResult = stringTable().add<HashAndCharacters, HashAndCharactersTranslator>(buffer);
290 HashSet<StringImpl*>::iterator iterator = stringTable().find<HashAndCharacters, HashAndCharactersTranslator>(buffer); local
291 if (iterator == stringTable().end())
293 return static_cast<AtomicStringImpl*>(*iterator);
/external/webkit/WebCore/platform/text/gtk/
H A DTextBreakIteratorGtk.cpp47 static TextBreakIterator* setUpIterator(bool& createdIterator, TextBreakIterator*& iterator, argument
54 iterator = new TextBreakIterator();
57 if (!iterator)
66 iterator->m_type = type;
67 iterator->m_length = length;
69 g_free(iterator->m_logAttrs);
70 iterator->m_logAttrs = g_new0(PangoLogAttr, length + 1);
71 iterator->m_index = -1;
72 pango_get_log_attrs(utf8.get(), utf8len, -1, 0, iterator->m_logAttrs, length + 1);
74 return iterator;
[all...]

Completed in 291 milliseconds

123456