| /external/boringssl/src/ssl/pqueue/ |
| pqueue.c | 80 item->next = NULL;
118 for (curr = pq->items; curr; curr = curr->next) {
133 item = item->next;
148 *item = (*item)->next;
154 pitem *curr, *next; local
161 for (curr = NULL, next = pq->items; next != NULL;
162 curr = next, next = next->next)
[all...] |
| /external/curl/lib/ |
| slist.c | 42 while(item->next) {
43 item = item->next;
68 new_item->next = NULL;
76 last->next = new_item;
121 inlist = inlist->next;
129 struct curl_slist *next; local
137 next = item->next;
140 item = next;
141 } while(next);
[all...] |
| llist.c | 80 list->head->next = NULL;
85 ne->next = e?e->next:list->head;
91 else if(e->next) {
92 e->next->prev = ne;
98 e->next = ne;
117 list->head = e->next;
122 e->next->prev = NULL;
125 e->prev->next = e->next;
[all...] |
| /libcore/ojluni/src/main/java/sun/misc/ |
| Cleaner.java | 75 next = null, field in class:Cleaner
80 cl.next = first;
90 if (cl.next == cl)
95 if (cl.next != null)
96 first = cl.next;
100 if (cl.next != null)
101 cl.next.prev = cl.prev;
103 cl.prev.next = cl.next;
106 cl.next = cl
[all...] |
| CompoundEnumeration.java | 43 private boolean next() { method in class:CompoundEnumeration
54 return next();
58 if (!next()) {
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/aux_/preprocessed/gcc/ |
| advance_forward.hpp | 31 typedef typename next<iter0>::type iter1;
42 typedef typename next<iter0>::type iter1;
43 typedef typename next<iter1>::type iter2;
54 typedef typename next<iter0>::type iter1;
55 typedef typename next<iter1>::type iter2;
56 typedef typename next<iter2>::type iter3;
67 typedef typename next<iter0>::type iter1;
68 typedef typename next<iter1>::type iter2;
69 typedef typename next<iter2>::type iter3;
70 typedef typename next<iter3>::type iter4
[all...] |
| /external/libcxx/test/std/containers/associative/map/map.ops/ |
| upper_bound.pass.cpp | 43 assert(r == next(m.begin(), 1));
45 assert(r == next(m.begin(), 2));
47 assert(r == next(m.begin(), 3));
49 assert(r == next(m.begin(), 4));
51 assert(r == next(m.begin(), 5));
53 assert(r == next(m.begin(), 6));
55 assert(r == next(m.begin(), 7));
57 assert(r == next(m.begin(), 8));
59 assert(r == next(m.begin(), 0));
61 assert(r == next(m.begin(), 1))
[all...] |
| /external/libcxx/test/std/containers/associative/set/ |
| upper_bound.pass.cpp | 43 assert(r == next(m.begin(), 1));
45 assert(r == next(m.begin(), 2));
47 assert(r == next(m.begin(), 3));
49 assert(r == next(m.begin(), 4));
51 assert(r == next(m.begin(), 5));
53 assert(r == next(m.begin(), 6));
55 assert(r == next(m.begin(), 7));
57 assert(r == next(m.begin(), 8));
59 assert(r == next(m.begin(), 0));
61 assert(r == next(m.begin(), 1))
[all...] |
| lower_bound.pass.cpp | 45 assert(r == next(m.begin()));
47 assert(r == next(m.begin(), 2));
49 assert(r == next(m.begin(), 3));
51 assert(r == next(m.begin(), 4));
53 assert(r == next(m.begin(), 5));
55 assert(r == next(m.begin(), 6));
57 assert(r == next(m.begin(), 7));
59 assert(r == next(m.begin(), 0));
61 assert(r == next(m.begin(), 1));
63 assert(r == next(m.begin(), 2))
[all...] |
| find.pass.cpp | 45 assert(r == next(m.begin()));
47 assert(r == next(m.begin(), 2));
49 assert(r == next(m.begin(), 3));
51 assert(r == next(m.begin(), 4));
53 assert(r == next(m.begin(), 5));
55 assert(r == next(m.begin(), 6));
57 assert(r == next(m.begin(), 7));
59 assert(r == next(m.begin(), 8));
78 assert(r == next(m.begin()));
80 assert(r == next(m.begin(), 2))
[all...] |
| /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...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.ops/ |
| upper_bound.pass.cpp | 43 assert(r == next(m.begin(), 1));
45 assert(r == next(m.begin(), 2));
47 assert(r == next(m.begin(), 3));
49 assert(r == next(m.begin(), 4));
51 assert(r == next(m.begin(), 5));
53 assert(r == next(m.begin(), 6));
55 assert(r == next(m.begin(), 7));
57 assert(r == next(m.begin(), 8));
59 assert(r == next(m.begin(), 0));
61 assert(r == next(m.begin(), 1))
[all...] |
| lower_bound.pass.cpp | 45 assert(r == next(m.begin()));
47 assert(r == next(m.begin(), 2));
49 assert(r == next(m.begin(), 3));
51 assert(r == next(m.begin(), 4));
53 assert(r == next(m.begin(), 5));
55 assert(r == next(m.begin(), 6));
57 assert(r == next(m.begin(), 7));
59 assert(r == next(m.begin(), 0));
61 assert(r == next(m.begin(), 1));
63 assert(r == next(m.begin(), 2))
[all...] |
| find.pass.cpp | 45 assert(r == next(m.begin()));
47 assert(r == next(m.begin(), 2));
49 assert(r == next(m.begin(), 3));
51 assert(r == next(m.begin(), 4));
53 assert(r == next(m.begin(), 5));
55 assert(r == next(m.begin(), 6));
57 assert(r == next(m.begin(), 7));
59 assert(r == next(m.begin(), 8));
78 assert(r == next(m.begin()));
80 assert(r == next(m.begin(), 2))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/ |
| upper_bound.pass.cpp | 43 assert(r == next(m.begin(), 1));
45 assert(r == next(m.begin(), 2));
47 assert(r == next(m.begin(), 3));
49 assert(r == next(m.begin(), 4));
51 assert(r == next(m.begin(), 5));
53 assert(r == next(m.begin(), 6));
55 assert(r == next(m.begin(), 7));
57 assert(r == next(m.begin(), 8));
59 assert(r == next(m.begin(), 0));
61 assert(r == next(m.begin(), 1))
[all...] |
| lower_bound.pass.cpp | 45 assert(r == next(m.begin()));
47 assert(r == next(m.begin(), 2));
49 assert(r == next(m.begin(), 3));
51 assert(r == next(m.begin(), 4));
53 assert(r == next(m.begin(), 5));
55 assert(r == next(m.begin(), 6));
57 assert(r == next(m.begin(), 7));
59 assert(r == next(m.begin(), 0));
61 assert(r == next(m.begin(), 1));
63 assert(r == next(m.begin(), 2))
[all...] |
| find.pass.cpp | 45 assert(r == next(m.begin()));
47 assert(r == next(m.begin(), 2));
49 assert(r == next(m.begin(), 3));
51 assert(r == next(m.begin(), 4));
53 assert(r == next(m.begin(), 5));
55 assert(r == next(m.begin(), 6));
57 assert(r == next(m.begin(), 7));
59 assert(r == next(m.begin(), 8));
78 assert(r == next(m.begin()));
80 assert(r == next(m.begin(), 2))
[all...] |
| /external/libcxx/test/std/containers/associative/multimap/multimap.cons/ |
| iter_iter.pass.cpp | 42 assert(*next(m.begin()) == V(1, 1.5));
43 assert(*next(m.begin(), 2) == V(1, 2));
44 assert(*next(m.begin(), 3) == V(2, 1));
45 assert(*next(m.begin(), 4) == V(2, 1.5));
46 assert(*next(m.begin(), 5) == V(2, 2));
47 assert(*next(m.begin(), 6) == V(3, 1));
48 assert(*next(m.begin(), 7) == V(3, 1.5));
49 assert(*next(m.begin(), 8) == V(3, 2));
70 assert(*next(m.begin()) == V(1, 1.5));
71 assert(*next(m.begin(), 2) == V(1, 2))
[all...] |
| /external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/common/ |
| BufferUtils.java | 92 int next = new_first; local
93 while (next != first) {
95 ray[first] = ray[next];
96 ray[next] = temp;
98 next++;
99 if (next == last) {
100 next = new_first;
102 new_first = next;
109 int next = new_first; local
110 while (next != first)
126 int next = new_first; local
[all...] |
| /external/libgdx/gdx/src/com/badlogic/gdx/utils/ |
| AtomicQueue.java | 40 private int next (int idx) {
method in class:AtomicQueue
47 int next = next(write);
local
48 if (next == read) return false;
50 writeIndex.set(next);
59 readIndex.set(next(read));
method
|
| /external/mockito/src/org/mockito/internal/configuration/injection/filter/ |
| NameBasedCandidateFilter.java | 15 private final MockCandidateFilter next;
field in class:NameBasedCandidateFilter
18 public NameBasedCandidateFilter(MockCandidateFilter next) {
19 this.next = next;
30 return next.filterCandidate(mockNameMatches, field, fieldInstance);
32 return next.filterCandidate(mocks, field, fieldInstance);
|
| /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;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/multimap.cons/ |
| iter_iter.pass.cpp | 42 assert(*next(m.begin()) == V(1, 1.5));
43 assert(*next(m.begin(), 2) == V(1, 2));
44 assert(*next(m.begin(), 3) == V(2, 1));
45 assert(*next(m.begin(), 4) == V(2, 1.5));
46 assert(*next(m.begin(), 5) == V(2, 2));
47 assert(*next(m.begin(), 6) == V(3, 1));
48 assert(*next(m.begin(), 7) == V(3, 1.5));
49 assert(*next(m.begin(), 8) == V(3, 2));
70 assert(*next(m.begin()) == V(1, 1.5));
71 assert(*next(m.begin(), 2) == V(1, 2))
[all...] |
| /external/libcxx/test/std/containers/associative/multiset/ |
| find.pass.cpp | 45 assert(r == next(m.begin()));
47 assert(r == next(m.begin(), 2));
49 assert(r == next(m.begin(), 3));
51 assert(r == next(m.begin(), 4));
53 assert(r == next(m.begin(), 5));
55 assert(r == next(m.begin(), 6));
57 assert(r == next(m.begin(), 7));
59 assert(r == next(m.begin(), 8));
78 assert(r == next(m.begin()));
80 assert(r == next(m.begin(), 2))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/ |
| find.pass.cpp | 45 assert(r == next(m.begin()));
47 assert(r == next(m.begin(), 2));
49 assert(r == next(m.begin(), 3));
51 assert(r == next(m.begin(), 4));
53 assert(r == next(m.begin(), 5));
55 assert(r == next(m.begin(), 6));
57 assert(r == next(m.begin(), 7));
59 assert(r == next(m.begin(), 8));
78 assert(r == next(m.begin()));
80 assert(r == next(m.begin(), 2))
[all...] |
