/external/v8/test/mjsunit/es6/ |
H A D | string-iterator.js | 22 assertIteratorResult('a', false, iterator.next()); 23 assertIteratorResult('b', false, iterator.next()); 24 assertIteratorResult('c', false, iterator.next()); 25 assertIteratorResult(void 0, true, iterator.next()); 26 assertIteratorResult(void 0, true, iterator.next()); 37 assertIteratorResult('a', false, iterator.next()); 38 assertIteratorResult('b', false, iterator.next()); 39 assertIteratorResult('c', false, iterator.next()); 40 assertIteratorResult(pair, false, iterator.next()); 41 assertIteratorResult('d', false, iterator.next()); [all...] |
/external/wpa_supplicant_8/hostapd/src/utils/ |
H A D | list.h | 16 struct dl_list *next; member in struct:dl_list 24 list->next = list; 30 item->next = list->next; 32 list->next->prev = item; 33 list->next = item; 43 item->next->prev = item->prev; 44 item->prev->next = item->next; 45 item->next [all...] |
/external/wpa_supplicant_8/src/utils/ |
H A D | list.h | 16 struct dl_list *next; member in struct:dl_list 24 list->next = list; 30 item->next = list->next; 32 list->next->prev = item; 33 list->next = item; 43 item->next->prev = item->prev; 44 item->prev->next = item->next; 45 item->next [all...] |
/external/wpa_supplicant_8/wpa_supplicant/src/utils/ |
H A D | list.h | 16 struct dl_list *next; member in struct:dl_list 24 list->next = list; 30 item->next = list->next; 32 list->next->prev = item; 33 list->next = item; 43 item->next->prev = item->prev; 44 item->prev->next = item->next; 45 item->next [all...] |
/external/libcxx/test/std/containers/associative/set/ |
H A D | equal_range.pass.cpp | 43 assert(r.first == next(m.begin(), 0)); 44 assert(r.second == next(m.begin(), 1)); 46 assert(r.first == next(m.begin(), 1)); 47 assert(r.second == next(m.begin(), 2)); 49 assert(r.first == next(m.begin(), 2)); 50 assert(r.second == next(m.begin(), 3)); 52 assert(r.first == next(m.begin(), 3)); 53 assert(r.second == next(m.begin(), 4)); 55 assert(r.first == next(m.begin(), 4)); 56 assert(r.second == next( [all...] |
H A D | 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( [all...] |
H A D | 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( [all...] |
H A D | 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( [all...] |
/external/mesa3d/src/gallium/auxiliary/util/ |
H A D | u_double_list.h | 23 * next paragraph) shall be included in all copies or substantial portions 48 struct list_head *next; member in struct:list_head 54 item->next = item; 60 item->next = list->next; 61 list->next->prev = item; 62 list->next = item; 67 item->next = list; 69 list->prev->next = item; 76 to->next [all...] |
/external/libcxx/test/std/containers/associative/multiset/ |
H A D | lower_bound.pass.cpp | 44 assert(r == next(m.begin(), 0)); 46 assert(r == next(m.begin(), 0)); 48 assert(r == next(m.begin(), 3)); 50 assert(r == next(m.begin(), 3)); 52 assert(r == next(m.begin(), 6)); 54 assert(r == next(m.begin(), 6)); 56 assert(r == next(m.begin(), 9)); 74 assert(r == next(m.begin(), 0)); 76 assert(r == next(m.begin(), 0)); 78 assert(r == next( [all...] |
H A D | upper_bound.pass.cpp | 44 assert(r == next(m.begin(), 0)); 46 assert(r == next(m.begin(), 3)); 48 assert(r == next(m.begin(), 3)); 50 assert(r == next(m.begin(), 6)); 52 assert(r == next(m.begin(), 6)); 54 assert(r == next(m.begin(), 9)); 56 assert(r == next(m.begin(), 9)); 74 assert(r == next(m.begin(), 0)); 76 assert(r == next(m.begin(), 3)); 78 assert(r == next( [all...] |
H A D | 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( [all...] |
/external/selinux/libsepol/cil/test/unit/ |
H A D | test_cil_resolve_ast.c | 145 int rc = cil_resolve_roleallow(test_db->ast->root->cl_head->next->next, args); 165 int rc = cil_resolve_roleallow(test_db->ast->root->cl_head->next, args); 184 int rc = cil_resolve_roleallow(test_db->ast->root->cl_head->next, args); 204 int rc = cil_resolve_classmapping(test_db->ast->root->cl_head->next->next, args); 228 int rc2 = cil_resolve_call1(test_db->ast->root->cl_head->next->next->next, args); 232 int rc3 = cil_resolve_call2(test_db->ast->root->cl_head->next [all...] |
/external/libdrm/freedreno/ |
H A D | list.h | 23 * next paragraph) shall be included in all copies or substantial portions 44 struct list_head *next; member in struct:list_head 50 item->next = item; 56 item->next = list->next; 57 list->next->prev = item; 58 list->next = item; 63 item->next = list; 65 list->prev->next = item; 72 to->next [all...] |
/external/libdrm/tests/radeon/ |
H A D | list.h | 23 * next paragraph) shall be included in all copies or substantial portions 44 struct list_head *next; member in struct:list_head 50 item->next = item; 56 item->next = list->next; 57 list->next->prev = item; 58 list->next = item; 63 item->next = list; 65 list->prev->next = item; 72 to->next [all...] |
/external/boringssl/src/ssl/pqueue/ |
H A D | 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 [all...] |
/external/libcxx/test/std/containers/associative/map/map.ops/ |
H A D | 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( [all...] |
H A D | 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( [all...] |
H A D | 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( [all...] |
/external/linux-tools-perf/src/include/linux/ |
H A D | list.h | 14 * sometimes we already know the next/prev entries and we can 26 list->next = list; 34 * the prev/next entries already! 39 struct list_head *next) 41 next->prev = new; 42 new->next = next; 44 prev->next = new; 49 struct list_head *next); 62 __list_add(new, head, head->next); 37 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument 86 __list_del(struct list_head * prev, struct list_head * next) argument 206 struct list_head *next = head->next; local 273 __list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) argument 588 struct hlist_node *next = n->next; local 621 hlist_add_before(struct hlist_node *n, struct hlist_node *next) argument 630 hlist_add_after(struct hlist_node *n, struct hlist_node *next) argument [all...] |
/external/libcxx/test/std/containers/associative/multimap/multimap.cons/ |
H A D | 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( [all...] |
/external/mockito/src/org/mockito/internal/configuration/injection/filter/ |
H A D | NameBasedCandidateFilter.java | 15 private final MockCandidateFilter next;
field in class:NameBasedCandidateFilter 18 public NameBasedCandidateFilter(MockCandidateFilter next) {
argument 19 this.next = next;
30 return next.filterCandidate(mockNameMatches, field, fieldInstance);
32 return next.filterCandidate(mocks, field, fieldInstance);
|
/external/skia/src/views/ |
H A D | 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;
|
/external/v8/test/mjsunit/ |
H A D | d8-performance-now.js | 44 var next = performance.now(); 45 assertTrue(next >= end); 46 end = next;
|
/external/dhcpcd/ |
H A D | control.h | 36 struct fd_list *next; member in struct:fd_list
|