| /libcore/luni/src/test/java/libcore/xml/ |
| PullParserDtdTest.java | 41 while (parser.next() != XmlPullParser.END_DOCUMENT) {
64 assertEquals(XmlPullParser.START_TAG, parser.next());
65 assertEquals(XmlPullParser.TEXT, parser.next());
67 assertEquals(XmlPullParser.END_TAG, parser.next());
68 assertEquals(XmlPullParser.END_DOCUMENT, parser.next());
76 assertEquals(XmlPullParser.START_TAG, parser.next());
77 assertEquals(XmlPullParser.TEXT, parser.next());
79 assertEquals(XmlPullParser.END_TAG, parser.next());
80 assertEquals(XmlPullParser.END_DOCUMENT, parser.next());
86 assertEquals(XmlPullParser.START_TAG, parser.next());
[all...] |
| /external/skia/src/views/ |
| SkTagList.cpp | 38 SkTagList* next = rec->fNext;
43 prev->fNext = next;
45 *head = next;
50 rec = next;
58 SkTagList* next = rec->fNext;
60 rec = next;
|
| /libcore/luni/src/main/java/java/util/ |
| AbstractSet.java | 79 Object next = it.next(); local
80 result += next == null ? 0 : next.hashCode();
102 if (collection.contains(it.next())) {
110 result = remove(it.next()) || result;
|
| AbstractCollection.java | 76 if (add(it.next())) {
102 it.next();
130 if (object.equals(it.next())) {
136 if (it.next() == null) {
167 if (!contains(it.next())) {
228 if (object.equals(it.next())) {
235 if (it.next() == null) {
277 if (collection.contains(it.next())) {
318 if (!collection.contains(it.next())) {
343 array[index++] = it.next();
381 Object next = it.next(); local
[all...] |
| /system/core/include/cutils/ |
| list.h | 28 struct listnode *next; member in struct:listnode
37 .next = &name, \
42 for (node = (list)->next; node != (list); node = node->next)
51 #define list_empty(list) ((list) == (list)->next)
52 #define list_head(list) ((list)->next)
|
| /dalvik/vm/mterp/x86-atom/ |
| OP_CONST_16.S | 32 FFETCH_ADV 2, %eax # %eax<- next instruction hi; fetch, advance
34 FGETOP_JMP 2, %eax # jump to next instruction; getop, jmp
|
| OP_NOP.S | 30 FINISH 1 # jump to next instruction
|
| /external/dhcpcd/ |
| control.h | 36 struct fd_list *next; member in struct:fd_list
|
| eloop.c | 46 struct event *next; member in struct:event
55 struct timeout *next; member in struct:timeout
68 for (e = events; e; e = e->next) {
80 free_events = e->next;
86 e->next = NULL;
88 last->next = e;
98 for (e = events; e; e = e->next) {
101 last->next = e->next;
103 events = e->next;
[all...] |
| /external/e2fsprogs/lib/et/ |
| error_table.h | 18 struct et_list *next; member in struct:et_list
|
| /external/skia/include/core/ |
| SkAutoKern.h | 15 #define SkAutoKern_AdjustF(prev, next) (((next) - (prev) + 32) >> 6 << 16)
16 #define SkAutoKern_AdjustS(prev, next) SkIntToScalar(((next) - (prev) + 32) >> 6)
|
| /external/webkit/Source/JavaScriptCore/wtf/ |
| SentinelLinkedList.h | 35 // Node* next();
74 return m_headSentinel.next();
86 Node* next = m_headSentinel.next(); local
89 node->setNext(next);
92 next->setPrev(node);
98 Node* next = node->next(); local
100 prev->setNext(next);
101 next->setPrev(prev)
[all...] |
| /external/webkit/Source/WebCore/loader/cache/ |
| CachedResourceClientWalker.cpp | 41 CachedResourceClient* CachedResourceClientWalker::next() function in class:WebCore::CachedResourceClientWalker
45 CachedResourceClient* next = m_clientVector[m_index++]; local
46 if (m_clientSet.contains(next))
47 return next;
|
| /external/webkit/Source/WebCore/platform/graphics/ |
| FontFamily.cpp | 50 for (ap = a.next(), bp = b.next(); ap != bp; ap = ap->next(), bp = bp->next()) {
|
| /system/core/sh/ |
| alias.h | 40 struct alias *next; member in struct:alias
|
| /cts/tests/tests/text/src/android/text/cts/ |
| TextUtils_SimpleStringSplitterTest.java | 43 simpleStringSplitter.next();
46 simpleStringSplitter.next();
64 assertEquals("hello", iterator.next());
66 assertEquals("world", iterator.next());
74 assertEquals("first", simpleStringSplitter.next());
75 assertEquals(" second", simpleStringSplitter.next());
77 simpleStringSplitter.next();
87 assertEquals(" ", simpleStringSplitter.next());
89 assertEquals("", simpleStringSplitter.next());
92 assertEquals("", simpleStringSplitter.next());
[all...] |
| /frameworks/base/tools/layoutlib/bridge/tests/src/com/android/layoutlib/bridge/android/ |
| BridgeXmlBlockParserTest.java | 46 assertEquals(XmlPullParser.START_DOCUMENT, parser.next());
48 assertEquals(XmlPullParser.START_TAG, parser.next());
51 assertEquals(XmlPullParser.TEXT, parser.next());
53 assertEquals(XmlPullParser.START_TAG, parser.next());
55 assertEquals(XmlPullParser.TEXT, parser.next());
56 assertEquals(XmlPullParser.END_TAG, parser.next());
58 assertEquals(XmlPullParser.TEXT, parser.next());
60 assertEquals(XmlPullParser.START_TAG, parser.next());
62 assertEquals(XmlPullParser.END_TAG, parser.next());
64 assertEquals(XmlPullParser.TEXT, parser.next());
[all...] |
| /external/skia/third_party/glu/libtess/ |
| dict.c | 58 head->next = head;
72 for( node = dict->head.next; node != &dict->head; node = node->next ) {
91 newNode->next = node->next;
92 node->next->prev = newNode;
94 node->next = newNode;
102 node->next->prev = node->prev;
103 node->prev->next = node->next;
[all...] |
| /system/core/libcutils/ |
| dir_hash.c | 119 struct list *next; member in struct:list
153 struct list *next; local
154 for (f = list; f != NULL; f = next) {
155 next = f->next;
168 node->next = list;
174 for (f = list; f != NULL; f = f->next) {
183 struct list *next; local
184 for (f = list; f != NULL; f = f->next) {
185 next = f->next
211 struct list *next; local
237 struct list *next; local
249 struct list *next; local
287 struct list *next; local
305 struct list *next; local
324 struct list *next; local
[all...] |
| /external/webkit/Source/WebCore/platform/ |
| Arena.cpp | 98 pool->first.next = NULL;
144 } while( NULL != (a = a->next) );
151 for ( a = arena_freelist; a != NULL ; p = a, a = a->next ) {
154 arena_freelist = a->next;
156 p->next = a->next;
162 a->next = pool->current->next;
163 pool->current->next = a;
165 if ( 0 == pool->first.next )
[all...] |
| /external/clang/test/CodeGen/ |
| 2002-02-14-EntryNodePreds.c | 11 struct edge_rec *next; member in struct:edge_rec
33 return (int)basel->next;
|
| types.c | 4 struct FileName *next; member in struct:FileName
9 struct ieeeExternal *next; member in struct:ieeeExternal
|
| /external/linux-tools-perf/util/include/linux/ |
| types.h | 14 struct list_head *next, *prev; member in struct:list_head
22 struct hlist_node *next, **pprev; member in struct:hlist_node
|
| /external/oprofile/opjitconv/ |
| conversion.c | 20 struct jitentry * entry, * next; local
22 for (entry = jitentry_list; entry; entry = next) {
25 next = entry->next;
33 struct jitentry_debug_line * entry, * next; local
35 for (entry = jitentry_debug_line_list; entry; entry = next) {
36 next = entry->next;
|
| /external/guava/guava/src/com/google/common/collect/ |
| AbstractIterator.java | 46 * String s = in.next();
71 /** We have computed the next element and haven't returned it yet. */
84 private T next; field in class:AbstractIterator
87 * Returns the next element. <b>Note:</b> the implementation must call {@link
91 * <p>The initial invocation of {@link #hasNext()} or {@link #next()} calls
93 * next} following each successful call to {@code next}. Once the
98 * {@code hasNext} or {@code next} invocation that invoked this method. Any
103 * {@code next}, or {@link #peek()} methods on this instance; if it does, an
106 * @return the next element if there was one. If {@code endOfData} was calle
152 public final T next() { method in class:AbstractIterator
[all...] |
