| /external/junit/src/main/java/org/junit/internal/runners/statements/ |
| ExpectException.java | 7 private final Statement next; field in class:ExpectException
10 public ExpectException(Statement next, Class<? extends Throwable> expected) {
11 this.next = next;
19 next.evaluate();
|
| RunAfters.java | 11 private final Statement next; field in class:RunAfters
17 public RunAfters(Statement next, List<FrameworkMethod> afters, Object target) {
18 this.next = next;
27 next.evaluate();
|
| /external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.modifiers/ |
| emplace_after.pass.cpp | 36 assert(i == next(c.begin()));
38 assert(*next(c.begin()) == Emplaceable(1, 2.5));
41 i = c.emplace_after(next(c.cbegin()), 2, 3.5);
42 assert(i == next(c.begin(), 2));
44 assert(*next(c.begin()) == Emplaceable(1, 2.5));
45 assert(*next(c.begin(), 2) == Emplaceable(2, 3.5));
49 assert(i == next(c.begin()));
51 assert(*next(c.begin(), 1) == Emplaceable(3, 4.5));
52 assert(*next(c.begin(), 2) == Emplaceable(1, 2.5));
53 assert(*next(c.begin(), 3) == Emplaceable(2, 3.5))
[all...] |
| insert_after_const.pass.cpp | 33 assert(i == next(c.begin()));
35 assert(*next(c.begin()) == 1);
38 i = c.insert_after(next(c.cbegin()), 2);
39 assert(i == next(c.begin(), 2));
41 assert(*next(c.begin()) == 1);
42 assert(*next(c.begin(), 2) == 2);
46 assert(i == next(c.begin()));
48 assert(*next(c.begin(), 1) == 3);
49 assert(*next(c.begin(), 2) == 1);
50 assert(*next(c.begin(), 3) == 2)
[all...] |
| insert_after_rv.pass.cpp | 36 assert(i == next(c.begin()));
38 assert(*next(c.begin()) == 1);
41 i = c.insert_after(next(c.cbegin()), 2);
42 assert(i == next(c.begin(), 2));
44 assert(*next(c.begin()) == 1);
45 assert(*next(c.begin(), 2) == 2);
49 assert(i == next(c.begin()));
51 assert(*next(c.begin(), 1) == 3);
52 assert(*next(c.begin(), 2) == 1);
53 assert(*next(c.begin(), 3) == 2)
[all...] |
| /external/mockito/src/main/java/org/mockito/internal/configuration/injection/filter/ |
| TypeBasedCandidateFilter.java | 14 private final MockCandidateFilter next; field in class:TypeBasedCandidateFilter
16 public TypeBasedCandidateFilter(MockCandidateFilter next) {
17 this.next = next;
31 return next.filterCandidate(mockTypeMatches, candidateFieldToBeInjected, allRemainingCandidateFields, injectee);
|
| /external/smali/smalidea/src/main/java/org/jf/smalidea/util/ |
| PsiUtil.java | 62 PsiElement next = element.getNextSibling(); local
63 if (next == null) {
64 next = element.getParent();
65 if (next == null) {
69 element = next;
|
| /external/syslinux/core/thread/ |
| timeout.c | 24 for (tp = curr->list.next; tp != &curr->list; tp = tp->next) {
30 block->list.next->prev = block->list.prev;
31 block->list.prev->next = block->list.next;
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/forwardlist/forwardlist.modifiers/ |
| emplace_after.pass.cpp | 36 assert(i == next(c.begin()));
38 assert(*next(c.begin()) == Emplaceable(1, 2.5));
41 i = c.emplace_after(next(c.cbegin()), 2, 3.5);
42 assert(i == next(c.begin(), 2));
44 assert(*next(c.begin()) == Emplaceable(1, 2.5));
45 assert(*next(c.begin(), 2) == Emplaceable(2, 3.5));
49 assert(i == next(c.begin()));
51 assert(*next(c.begin(), 1) == Emplaceable(3, 4.5));
52 assert(*next(c.begin(), 2) == Emplaceable(1, 2.5));
53 assert(*next(c.begin(), 3) == Emplaceable(2, 3.5))
[all...] |
| insert_after_const.pass.cpp | 33 assert(i == next(c.begin()));
35 assert(*next(c.begin()) == 1);
38 i = c.insert_after(next(c.cbegin()), 2);
39 assert(i == next(c.begin(), 2));
41 assert(*next(c.begin()) == 1);
42 assert(*next(c.begin(), 2) == 2);
46 assert(i == next(c.begin()));
48 assert(*next(c.begin(), 1) == 3);
49 assert(*next(c.begin(), 2) == 1);
50 assert(*next(c.begin(), 3) == 2)
[all...] |
| insert_after_rv.pass.cpp | 36 assert(i == next(c.begin()));
38 assert(*next(c.begin()) == 1);
41 i = c.insert_after(next(c.cbegin()), 2);
42 assert(i == next(c.begin(), 2));
44 assert(*next(c.begin()) == 1);
45 assert(*next(c.begin(), 2) == 2);
49 assert(i == next(c.begin()));
51 assert(*next(c.begin(), 1) == 3);
52 assert(*next(c.begin(), 2) == 1);
53 assert(*next(c.begin(), 3) == 2)
[all...] |
| /toolchain/binutils/binutils-2.27/binutils/ |
| bfdtest1.c | 35 bfd *last, *next; local
52 last = next)
54 next = bfd_openr_next_archived_file (archive, last);
60 last = next)
62 next = bfd_openr_next_archived_file (archive, last);
|
| /external/mesa3d/src/glx/ |
| glxconfig.c | 12 * The above copyright notice and this permission notice (including the next
228 struct glx_config **next; local
231 next = &base;
233 *next = malloc(size);
234 if (*next == NULL) {
240 (void) memset(*next, 0, size);
241 (*next)->visualID = GLX_DONT_CARE;
242 (*next)->visualType = GLX_DONT_CARE;
243 (*next)->visualRating = GLX_NONE;
244 (*next)->transparentPixel = GLX_NONE
270 struct glx_config *const next = configs->next; local
[all...] |
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/testdata/ |
| i22558.go | 14 next *thing
20 if t.next != nil {
26 t.next = u
40 t := &thing{name: "t", self: nil, next: nil, stuff: make([]big, 1)}
41 u := thing{name: "u", self: t, next: t, stuff: make([]big, 1)}
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/testdata/ |
| i22558.go | 14 next *thing
20 if t.next != nil {
26 t.next = u
40 t := &thing{name: "t", self: nil, next: nil, stuff: make([]big, 1)}
41 u := thing{name: "u", self: t, next: t, stuff: make([]big, 1)}
|
| /external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.spec/ |
| member_swap.pass.cpp | 33 assert(*next(c1.begin(), 0) == 10);
34 assert(*next(c1.begin(), 1) == 11);
35 assert(*next(c1.begin(), 2) == 12);
39 assert(*next(c2.begin(), 0) == 0);
40 assert(*next(c2.begin(), 1) == 1);
41 assert(*next(c2.begin(), 2) == 2);
42 assert(*next(c2.begin(), 3) == 3);
43 assert(*next(c2.begin(), 4) == 4);
44 assert(*next(c2.begin(), 5) == 5);
60 assert(*next(c2.begin(), 0) == 0)
[all...] |
| non_member_swap.pass.cpp | 34 assert(*next(c1.begin(), 0) == 10);
35 assert(*next(c1.begin(), 1) == 11);
36 assert(*next(c1.begin(), 2) == 12);
40 assert(*next(c2.begin(), 0) == 0);
41 assert(*next(c2.begin(), 1) == 1);
42 assert(*next(c2.begin(), 2) == 2);
43 assert(*next(c2.begin(), 3) == 3);
44 assert(*next(c2.begin(), 4) == 4);
45 assert(*next(c2.begin(), 5) == 5);
61 assert(*next(c2.begin(), 0) == 0)
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/forwardlist/forwardlist.spec/ |
| member_swap.pass.cpp | 33 assert(*next(c1.begin(), 0) == 10);
34 assert(*next(c1.begin(), 1) == 11);
35 assert(*next(c1.begin(), 2) == 12);
39 assert(*next(c2.begin(), 0) == 0);
40 assert(*next(c2.begin(), 1) == 1);
41 assert(*next(c2.begin(), 2) == 2);
42 assert(*next(c2.begin(), 3) == 3);
43 assert(*next(c2.begin(), 4) == 4);
44 assert(*next(c2.begin(), 5) == 5);
60 assert(*next(c2.begin(), 0) == 0)
[all...] |
| non_member_swap.pass.cpp | 34 assert(*next(c1.begin(), 0) == 10);
35 assert(*next(c1.begin(), 1) == 11);
36 assert(*next(c1.begin(), 2) == 12);
40 assert(*next(c2.begin(), 0) == 0);
41 assert(*next(c2.begin(), 1) == 1);
42 assert(*next(c2.begin(), 2) == 2);
43 assert(*next(c2.begin(), 3) == 3);
44 assert(*next(c2.begin(), 4) == 4);
45 assert(*next(c2.begin(), 5) == 5);
61 assert(*next(c2.begin(), 0) == 0)
[all...] |
| /bionic/libc/upstream-netbsd/lib/libc/include/isc/ |
| list.h | 28 #define LINK(type) struct { type *prev, *next; }
32 (elt)->link.next = (type *)(-1); \
37 (void *)((elt)->link.next) != (void *)(-1))
51 (elt)->link.next = (list).head; \
59 (list).tail->link.next = (elt); \
63 (elt)->link.next = NULL; \
70 if ((elt)->link.next != NULL) \
71 (elt)->link.next->link.prev = (elt)->link.prev; \
77 (elt)->link.prev->link.next = (elt)->link.next; \
[all...] |
| /external/e2fsprogs/e2fsck/ |
| region.c | 26 struct region_el *next; member in struct:region_el
50 struct region_el *r, *next; local
52 for (r = region->allocated; r; r = next) {
53 next = r->next;
62 struct region_el *r, *new_region, *prev, *next; local
78 for (r = region->allocated, prev=NULL; r; prev = r, r = r->next) {
88 if ((next = r->next)) {
89 if (end > next->start
[all...] |
| /toolchain/binutils/binutils-2.27/libiberty/ |
| objalloc.c | 60 /* Next chunk. */
61 struct objalloc_chunk *next; member in struct:objalloc_chunk
103 chunk->next = NULL;
148 chunk->next = (struct objalloc_chunk *) o->chunks;
162 chunk->next = (struct objalloc_chunk *) o->chunks;
184 struct objalloc_chunk *next; local
186 next = l->next;
188 l = next;
206 for (p = (struct objalloc_chunk *) o->chunks; p != NULL; p = p->next)
241 struct objalloc_chunk *next; local
283 struct objalloc_chunk *next; local
[all...] |
| /external/expat/tests/ |
| memcheck.c | 44 struct allocation_entry * next; member in struct:allocation_entry
72 entry->next = NULL;
80 alloc_tail->next = entry;
92 for (entry = alloc_head; entry != NULL; entry = entry->next) {
115 entry->prev->next = entry->next;
117 alloc_head = entry->next;
118 if (entry->next != NULL)
119 entry->next->prev = entry->prev;
121 alloc_tail = entry->next;
[all...] |
| /system/core/libsparse/ |
| backed_block.c | 46 struct backed_block *next; member in struct:backed_block
62 return bb->next;
135 struct backed_block *next = bb->next; local
137 bb = next;
155 for (end = start; end && end->next; end = end->next)
166 from->data_blocks = end->next;
168 for (bb = from->data_blocks; bb; bb = bb->next) {
169 if (bb->next == start)
[all...] |
| /system/sepolicy/tools/fc_sort/ |
| fc_sort.c | 35 * next points to the next node in the linked list.
45 struct file_context_node *next; member in struct:file_context_node
66 * next points to the next bucket in the linked list.
70 struct file_context_bucket *next; member in struct:file_context_bucket
160 while (a_current->next && b_current) {
161 jumpto = a_current->next;
164 * and the next a node.*/
165 while (b_current && a_current->next &
310 struct file_context_node *next; local
[all...] |
