| /external/webkit/JavaScriptCore/wtf/ |
| ListHashSet.h | 70 typedef ListHashSetIterator<ValueType, HashArg> iterator; typedef in class:WTF::ListHashSet
86 iterator begin();
87 iterator end();
91 iterator find(const ValueType&);
95 // the return value is a pair of an iterator to the new value's location,
97 pair<iterator, bool> add(const ValueType&);
99 pair<iterator, bool> insertBefore(const ValueType& beforeValue, const ValueType& newValue);
100 pair<iterator, bool> insertBefore(iterator it, const ValueType&);
103 void remove(iterator);
234 typedef ListHashSetIterator<ValueArg, HashArg> iterator; typedef in class:WTF::ListHashSetIterator
277 typedef ListHashSetIterator<ValueArg, HashArg> iterator; typedef in class:WTF::ListHashSetConstIterator
600 typedef typename HashTableType::const_iterator iterator; typedef
[all...] |
| RefPtrHashMap.h | 67 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, bool> add(const KeyType&, const MappedType&);
[all...] |
| /frameworks/base/media/libdrm/mobile2/src/util/ustl-1.0/ |
| ustring.h | 27 /// where you would use a utf8 iterator.
45 typedef pointer iterator; typedef in class:ustl::string
49 typedef ::ustl::reverse_iterator<iterator> reverse_iterator;
73 inline iterator begin (void) { return (iterator (memblock::begin())); }
75 inline iterator end (void) { return (iterator (memblock::end())); }
85 inline iterator iat (uoff_t pos) { return (begin() + min (pos, size())); }
131 iterator insert (iterator start, const_reference c, size_type n = 1)
[all...] |
| memlink.h | 44 typedef pointer iterator; typedef in class:ustl::memlink
53 inline iterator begin (void) { return (iterator (data())); }
54 inline iterator iat (size_type i) { assert (i <= size()); return (begin() + i); }
55 inline iterator end (void) { return (iat (size())); }
74 void copy (iterator offset, const void* p, size_type n);
76 void fill (iterator start, const void* p, size_type elsize, size_type elCount = 1);
77 inline void insert (iterator start, size_type size);
78 inline void erase (iterator start, size_type size);
84 inline void memlink::insert (iterator start, size_type n
[all...] |
| /external/webkit/WebCore/rendering/ |
| RenderFlexibleBox.cpp | 288 FlexBoxIterator iterator(this);
289 for (RenderBox* child = iterator.first(); child; child = iterator.next())
309 static void gatherFlexChildrenInfo(FlexBoxIterator& iterator, bool relayoutChildren, unsigned int& highestFlexGroup, unsigned int& lowestFlexGroup, bool& haveFlex)
311 RenderBox* child = iterator.first();
329 child = iterator.next();
344 FlexBoxIterator iterator(this);
348 gatherFlexChildrenInfo(iterator, relayoutChildren, highestFlexGroup, lowestFlexGroup, haveFlex);
366 child = iterator.first();
373 child = iterator.next()
[all...] |
| /external/webkit/WebCore/icu/unicode/ |
| usearch.h | 56 * a given pattern. This search iterator allows changing of direction by
86 * not be found in the string "\u00e9" if a character break iterator is used.
179 * Creating a search iterator data struct using the argument locale language
197 * @return search iterator data structure, or NULL if there is an error.
209 * Creating a search iterator data struct using the argument collator language
229 * @return search iterator data structure, or NULL if there is an error.
242 * Destroying and cleaning up the search iterator data struct.
259 * @param strsrch search iterator data struct
274 * @param strsrch search iterator data struct
284 * @param strsrch search iterator data struc
[all...] |
| /external/webkit/JavaScriptCore/jit/ |
| JIT.h | 377 void compileOpCallSlowCase(Instruction* instruction, Vector<SlowCaseEntry>::iterator& iter, unsigned callLinkInfoIndex, OpcodeID opcodeID);
378 void compileOpCallVarargsSlowCase(Instruction* instruction, Vector<SlowCaseEntry>::iterator& iter);
423 void linkSlowCaseIfNotJSCell(Vector<SlowCaseEntry>::iterator&, unsigned virtualRegisterIndex);
427 void compileGetByIdSlowCase(int resultVReg, int baseVReg, Identifier* ident, Vector<SlowCaseEntry>::iterator& iter, bool isMethodCheck = false);
563 void compileBinaryArithOpSlowCase(OpcodeID, Vector<SlowCaseEntry>::iterator&, unsigned dst, unsigned src1, unsigned src2, OperandTypes, bool op1HasImmediateIntFastCase, bool op2HasImmediateIntFastCase);
565 void compileBinaryArithOpSlowCase(OpcodeID, Vector<SlowCaseEntry>::iterator&, unsigned dst, unsigned src1, unsigned src2, OperandTypes);
570 void compileGetByIdSlowCase(int resultVReg, int baseVReg, Identifier* ident, Vector<SlowCaseEntry>::iterator& iter, bool isMethodCheck = false);
[all...] |
| /cts/tools/signature-tools/src/signature/io/html/ |
| ExecutableMemberComparator.java | 33 import java.util.Iterator;
62 Iterator<IParameter> aIt = a.iterator();
63 Iterator<IParameter> bIt = b.iterator();
|
| /dalvik/libcore/x-net/src/main/java/org/apache/harmony/xnet/provider/jsse/ |
| ServerSessionContext.java | 21 import java.util.Iterator;
54 Iterator<SSLSession> sessionIterator() {
58 return Arrays.asList(array).iterator();
67 Iterator<SSLSession> i = sessions.values().iterator();
|
| /dalvik/libcore/xml/src/main/java/org/apache/xpath/axes/ |
| NodeSequence.java | 47 * is a cached iterator, and is being used as random access
53 * A cache of a list of nodes obtained from the iterator so far.
54 * This list is appended to until the iterator is exhausted and
62 * If this iterator needs to cache nodes that are fetched, they
72 * the iterator so far. Note that the cache keeps
73 * growing until the iterator is walked to exhaustion,
90 * If the iterator needs to cache nodes as they are fetched,
116 * This method should be called after the iterator is exhausted.
127 * The functional iterator that fetches nodes.
132 * Set the functional iterator that fetches nodes
[all...] |
| /development/samples/ApiDemos/src/com/example/android/apis/graphics/kube/ |
| GLWorld.java | 23 import java.util.Iterator;
48 Iterator<GLVertex> iter2 = mVertexList.iterator();
54 Iterator<GLShape> iter3 = mShapeList.iterator();
|
| /external/guava/src/com/google/common/collect/ |
| AbstractMapBasedMultiset.java | 31 import java.util.Iterator;
97 @Override public Iterator<Multiset.Entry<E>> iterator() { method in class:AbstractMapBasedMultiset.EntrySet
98 final Iterator<Map.Entry<E, AtomicInteger>> backingEntries
99 = backingMap.entrySet().iterator();
100 return new Iterator<Multiset.Entry<E>>() {
178 @Override public Iterator<E> iterator() {
187 private class MapBasedMultisetIterator implements Iterator<E> {
188 final Iterator<Map.Entry<E, AtomicInteger>> entryIterator
[all...] |
| ConstrainedMap.java | 23 import java.util.Iterator;
101 @Override public Iterator<Entry<K, V>> iterator() {
102 final Iterator<Entry<K, V>> iterator = entries.iterator();
105 return constrainedEntry(iterator.next(), constraint);
107 @Override protected Iterator<Entry<K, V>> delegate() {
108 return iterator;
131 return Iterators.removeAll(iterator(), c)
[all...] |
| /external/webkit/WebCore/bindings/js/ |
| JSSVGContextCache.h | 46 pair<WrapperMap::iterator, bool> result = wrapperMap().add(wrapper, context);
48 WrapperMap::iterator& it = result.first;
58 WrapperMap::iterator it = map.find(wrapper);
68 WrapperMap::iterator it = map.find(wrapper);
83 WrapperMap::iterator it = map.find(wrapper);
|
| /external/webkit/WebCore/platform/text/ |
| BidiResolver.h | 32 template <class Iterator> struct MidpointState {
48 Vector<Iterator> midpoints;
129 template <class Iterator, class Run> class BidiResolver : public Noncopyable {
142 const Iterator& position() const { return current; }
143 void setPosition(const Iterator& position) { current = position; }
160 MidpointState<Iterator>& midpointState() { return m_midpointState; }
165 void createBidiRunsForLine(const Iterator& end, bool visualOrder = false, bool hardLineBreak = false);
184 Iterator current;
185 Iterator sor;
186 Iterator eor
[all...] |
| /frameworks/base/media/libdrm/mobile2/include/util/domcore/ |
| NodeIterator.h | 20 * The Iterator is used to visit DOM_TREE.
21 * <code>Attention</code>:The Iterator is not safe.
22 * When the caller using the Iterator to access the tree,
24 * means we have a <code>restriction</code>: the Iterator can only be used in the case that the tree structure will
52 * and we also can specify the <code>scope</code> if want restrict the range of iterator.
|
| /dalvik/libcore/luni/src/test/java/org/apache/harmony/luni/tests/java/util/ |
| LinkedHashMapTest.java | 30 import java.util.Iterator;
282 Iterator i = s.iterator();
312 assertNull("Failed with null key", m.keySet().iterator().next());
318 Iterator it = map.keySet().iterator();
330 assertTrue("Wrong contents", map.keySet().iterator().next().equals(
336 Iterator it2 = map2.keySet().iterator();
347 assertTrue("Wrong contents 2", map2.keySet().iterator().next().equals
786 Iterator iterator = map.keySet().iterator(); local
[all...] |
| /external/stlport/stlport/stl/debug/ |
| _string.h | 62 typedef _STLP_PRIV _DBG_iter<_Base, _STLP_PRIV _DbgTraits<_Nonconst_traits<value_type> > > iterator; typedef in class:basic_string
80 void _Invalidate_iterator(const iterator& __it)
82 void _Invalidate_iterators(const iterator& __f, const iterator& __l)
183 iterator begin() { return iterator(&_M_iter_list, _M_non_dbg_impl.begin()); }
185 iterator end() { return iterator(&_M_iter_list, _M_non_dbg_impl.end()); }
426 iterator insert(iterator __p, _CharT __c)
[all...] |
| /external/stlport/test/unit/ |
| mvctor_test.cpp | 239 deque<vector<int> >::iterator vdit(vect_deque.begin()), vditEnd(vect_deque.end());
247 deque<vector<int> >::iterator it = vect_deque.end() - 5;
258 deque<vector<int> >::iterator dit(vect_deque.begin()), ditEnd(vect_deque.end());
267 deque<vector<int> >::iterator it = vect_deque.end() - 5;
278 deque<vector<int> >::iterator dit(vect_deque.begin()), ditEnd(vect_deque.end());
287 deque<vector<int> >::iterator it = vect_deque.end() - 5;
298 deque<vector<int> >::iterator dit(vect_deque.begin()), ditEnd(vect_deque.end());
307 deque<vector<int> >::iterator it = vect_deque.end() - 5;
318 deque<vector<int> >::iterator dit(vect_deque.begin()), ditEnd(vect_deque.end());
331 deque<vector<int> >::iterator vdit(vect_deque.begin()), vditEnd(vect_deque.end())
[all...] |
| /frameworks/base/awt/org/apache/harmony/awt/gl/image/ |
| DecodingImageSource.java | 31 import java.util.Iterator;
64 for (Iterator<ImageDecoder> i = decoders.iterator(); i.hasNext();) {
101 for (Iterator<ImageDecoder> i = decoders.iterator(); i.hasNext();) {
121 for (Iterator<ImageConsumer> i = consumersList.iterator(); i.hasNext();) {
148 for (Iterator<ImageDecoder> i = decoders.iterator(); i.hasNext();) {
168 for (Iterator<ImageConsumer> i = consumersList.iterator(); i.hasNext();)
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.tests/unittests/com/android/ide/eclipse/adt/internal/editors/manifest/model/ |
| UiElementNodeTest.java | 25 import java.util.Iterator;
94 Iterator<UiElementNode> ui_child_it = ui.getUiChildren().iterator();
116 Iterator<UiElementNode> ui_child_it = ui.getUiChildren().iterator();
159 Iterator<UiElementNode> ui_child_it = ui.getUiChildren().iterator();
166 Iterator<UiElementNode> app_child_it = application.getUiChildren().iterator();
179 Iterator<UiElementNode> activity_child_it = second_activity.getUiChildren().iterator()
[all...] |
| /dalvik/libcore/luni/src/main/java/java/util/ |
| AbstractSet.java | 23 * abstract methods iterator() and size().
78 Iterator<?> it = iterator();
101 Iterator<?> it = iterator();
109 Iterator<?> it = collection.iterator();
|
| /dalvik/libcore/xml/src/main/java/org/apache/xml/dtm/ |
| DTMAxisIterator.java | 41 * Resets the iterator to the last start node.
44 * iterator.
49 * @return the number of nodes in this iterator. This may be an expensive
70 * Set start to END should 'close' the iterator,
80 * Get start to END should 'close' the iterator,
88 * @return true if this iterator has a reversed axis, else false.
93 * @return a deep copy of this iterator. The clone should not be reset
|
| /external/v8/src/ |
| frames.h | 168 explicit StackFrame(StackFrameIterator* iterator) : iterator_(iterator) { }
179 // Get the top handler from the current stack iterator.
223 explicit EntryFrame(StackFrameIterator* iterator) : StackFrame(iterator) { }
250 explicit EntryConstructFrame(StackFrameIterator* iterator)
251 : EntryFrame(iterator) { }
278 // iterator and the frames following entry frames.
282 explicit ExitFrame(StackFrameIterator* iterator) : StackFrame(iterator) { }
[all...] |
| /packages/apps/Email/src/com/beetstra/jutf7/ |
| CharsetProvider.java | 30 import java.util.Iterator;
71 for (Iterator iter = charsets.iterator(); iter.hasNext();) {
76 for (Iterator iter = charsets.iterator(); iter.hasNext();) {
87 public Iterator charsets() {
88 return charsets.iterator();
|
