| /external/Reactive-Extensions/RxCpp/Rx/v2/test/operators/ |
| D | take.cpp | 11 on.next(150, 1),
12 on.next(210, 2),
13 on.next(220, 3),
14 on.next(230, 4),
15 on.next(240, 5),
32 on.next(210, 2),
33 on.next(220, 3),
59 on.next(70, 6),
60 on.next(150, 4),
61 on.next(210, 9),
[all …]
|
| D | take_while.cpp | 22 on.next(150, 1),
23 on.next(210, 2),
24 on.next(220, 3),
25 on.next(230, 4),
26 on.next(240, 5),
42 on.next(210, 2),
43 on.next(220, 3),
69 on.next(70, 6),
70 on.next(150, 4),
71 on.next(210, 9),
[all …]
|
| D | skip.cpp | 11 on.next(70, 6),
12 on.next(150, 4),
13 on.next(210, 9),
14 on.next(230, 13),
15 on.next(270, 7),
16 on.next(280, 1),
17 on.next(300, -1),
18 on.next(310, 3),
19 on.next(340, 8),
20 on.next(370, 11),
[all …]
|
| D | skip_while.cpp | 22 on.next(150, 1),
23 on.next(210, 2),
24 on.next(220, 3),
25 on.next(230, 4),
26 on.next(240, 5),
42 on.next(230, 4),
43 on.next(240, 5),
69 on.next(70, 6),
70 on.next(150, 4),
71 on.next(210, 9),
[all …]
|
| D | window.cpp | 17 on.next(100, 1),
18 on.next(210, 2),
19 on.next(240, 3),
20 on.next(280, 4),
21 on.next(320, 5),
22 on.next(350, 6),
23 on.next(380, 7),
24 on.next(420, 8),
25 on.next(470, 9),
42 on.next(210, 2),
[all …]
|
| D | replay.cpp | 11 on.next(110, 0),
12 on.next(220, 1),
13 on.next(280, 2),
14 on.next(290, 3),
15 on.next(340, 4),
16 on.next(360, 5),
17 on.next(370, 6),
18 on.next(390, 7),
19 on.next(410, 8),
20 on.next(430, 9),
[all …]
|
| D | merge_delay_error.cpp | 16 on.next(10, 101),
17 on.next(20, 102),
18 on.next(110, 103),
19 on.next(120, 104),
20 on.next(210, 105),
21 on.next(220, 106),
26 on.next(10, 201),
27 on.next(20, 202),
28 on.next(30, 203),
29 on.next(40, 204),
[all …]
|
| D | flat_map.cpp | 244 i_on.next(100, 4),
245 i_on.next(200, 2),
246 i_on.next(300, 3),
247 i_on.next(400, 1),
252 s_on.next(50, "foo"),
253 s_on.next(100, "bar"),
254 s_on.next(150, "baz"),
255 s_on.next(200, "qux"),
276 s_on.next(350, "foo"),
277 s_on.next(400, "bar"),
[all …]
|
| D | window_toggle.cpp | 15 on.next(90, 1),
16 on.next(180, 2),
17 on.next(250, 3),
18 on.next(260, 4),
19 on.next(310, 5),
20 on.next(340, 6),
21 on.next(410, 7),
22 on.next(420, 8),
23 on.next(470, 9),
24 on.next(550, 10),
[all …]
|
| /external/clang/test/Analysis/ |
| D | traversal-algorithm.mm | 54 // DFS-next:33 ForStmt
55 // DFS-next:37 ObjCForCollectionStmt
56 // DFS-next:44 CXXForRangeStmt
57 // DFS-next:44 CXXForRangeStmt
58 // DFS-next:44 CXXForRangeStmt
59 // DFS-next:44 CXXForRangeStmt
60 // DFS-next:--END PATH--
61 // DFS-next:37 ObjCForCollectionStmt
62 // DFS-next:37 ObjCForCollectionStmt
63 // DFS-next:44 CXXForRangeStmt
[all …]
|
| /external/ImageMagick/MagickCore/ |
| D | linked-list.c | 65 *next; member
77 *next; member
115 *next; in AppendValueToLinkedList() local
121 next=(ElementInfo *) AcquireMagickMemory(sizeof(*next)); in AppendValueToLinkedList()
122 if (next == (ElementInfo *) NULL) in AppendValueToLinkedList()
124 next->value=(void *) value; in AppendValueToLinkedList()
125 next->next=(ElementInfo *) NULL; in AppendValueToLinkedList()
127 if (list_info->next == (ElementInfo *) NULL) in AppendValueToLinkedList()
128 list_info->next=next; in AppendValueToLinkedList()
130 list_info->head=next; in AppendValueToLinkedList()
[all …]
|
| /external/libcxx/test/std/containers/associative/multimap/multimap.modifiers/ |
| D | erase_iter.pass.cpp | 49 I i = m.erase(next(m.cbegin(), 3)); in main()
51 assert(i == next(m.begin(), 3)); in main()
54 assert(next(m.begin())->first == 1); in main()
55 assert(next(m.begin())->second == 1.5); in main()
56 assert(next(m.begin(), 2)->first == 1); in main()
57 assert(next(m.begin(), 2)->second == 2); in main()
58 assert(next(m.begin(), 3)->first == 2); in main()
59 assert(next(m.begin(), 3)->second == 1.5); in main()
60 assert(next(m.begin(), 4)->first == 2); in main()
61 assert(next(m.begin(), 4)->second == 2); in main()
[all …]
|
| /external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.modifiers/ |
| D | erase_after_many.pass.cpp | 27 C::iterator i = c.erase_after(next(c.cbefore_begin(), 4), next(c.cbefore_begin(), 4)); in main()
28 assert(i == next(c.cbefore_begin(), 4)); in main()
30 assert(*next(c.begin(), 0) == 0); in main()
31 assert(*next(c.begin(), 1) == 1); in main()
32 assert(*next(c.begin(), 2) == 2); in main()
33 assert(*next(c.begin(), 3) == 3); in main()
34 assert(*next(c.begin(), 4) == 4); in main()
35 assert(*next(c.begin(), 5) == 5); in main()
36 assert(*next(c.begin(), 6) == 6); in main()
37 assert(*next(c.begin(), 7) == 7); in main()
[all …]
|
| /external/libcxx/test/std/containers/associative/set/ |
| D | equal_range.pass.cpp | 44 assert(r.first == next(m.begin(), 0)); in main()
45 assert(r.second == next(m.begin(), 1)); in main()
47 assert(r.first == next(m.begin(), 1)); in main()
48 assert(r.second == next(m.begin(), 2)); in main()
50 assert(r.first == next(m.begin(), 2)); in main()
51 assert(r.second == next(m.begin(), 3)); in main()
53 assert(r.first == next(m.begin(), 3)); in main()
54 assert(r.second == next(m.begin(), 4)); in main()
56 assert(r.first == next(m.begin(), 4)); in main()
57 assert(r.second == next(m.begin(), 5)); in main()
[all …]
|
| D | erase_iter_iter.pass.cpp | 40 I i = m.erase(next(m.cbegin(), 5), next(m.cbegin(), 5)); in main()
42 assert(i == next(m.begin(), 5)); in main()
43 assert(*next(m.begin(), 0) == 1); in main()
44 assert(*next(m.begin(), 1) == 2); in main()
45 assert(*next(m.begin(), 2) == 3); in main()
46 assert(*next(m.begin(), 3) == 4); in main()
47 assert(*next(m.begin(), 4) == 5); in main()
48 assert(*next(m.begin(), 5) == 6); in main()
49 assert(*next(m.begin(), 6) == 7); in main()
50 assert(*next(m.begin(), 7) == 8); in main()
[all …]
|
| D | erase_iter.pass.cpp | 48 I i = m.erase(next(m.cbegin(), 3)); in main()
50 assert(i == next(m.begin(), 3)); in main()
51 assert(*next(m.begin(), 0) == 1); in main()
52 assert(*next(m.begin(), 1) == 2); in main()
53 assert(*next(m.begin(), 2) == 3); in main()
54 assert(*next(m.begin(), 3) == 5); in main()
55 assert(*next(m.begin(), 4) == 6); in main()
56 assert(*next(m.begin(), 5) == 7); in main()
57 assert(*next(m.begin(), 6) == 8); in main()
59 i = m.erase(next(m.cbegin(), 0)); in main()
[all …]
|
| /external/selinux/libsepol/cil/test/unit/ |
| D | test_cil_resolve_ast.c | 145 int rc = cil_resolve_roleallow(test_db->ast->root->cl_head->next->next, args); in test_cil_resolve_roleallow()
165 int rc = cil_resolve_roleallow(test_db->ast->root->cl_head->next, args); in test_cil_resolve_roleallow_srcdecl_neg()
184 int rc = cil_resolve_roleallow(test_db->ast->root->cl_head->next, args); in test_cil_resolve_roleallow_tgtdecl_neg()
204 int rc = cil_resolve_classmapping(test_db->ast->root->cl_head->next->next, args); in test_cil_resolve_classmapping_anon()
228 int rc2 = cil_resolve_call1(test_db->ast->root->cl_head->next->next->next, args); in test_cil_resolve_classmapping_anon_inmacro()
232 int rc3 = cil_resolve_call2(test_db->ast->root->cl_head->next->next->next, args); in test_cil_resolve_classmapping_anon_inmacro()
235 args->callstack = test_db->ast->root->cl_head->next->next->next; in test_cil_resolve_classmapping_anon_inmacro()
237 int rc = cil_resolve_classmapping(test_db->ast->root->cl_head->next->next->next->cl_head, args); in test_cil_resolve_classmapping_anon_inmacro()
263 int rc2 = cil_resolve_call1(test_db->ast->root->cl_head->next->next->next, args); in test_cil_resolve_classmapping_anon_inmacro_neg()
267 int rc3 = cil_resolve_call2(test_db->ast->root->cl_head->next->next->next, args); in test_cil_resolve_classmapping_anon_inmacro_neg()
[all …]
|
| /external/libcxx/test/std/containers/associative/map/map.ops/ |
| D | equal_range.pass.cpp | 45 assert(r.first == next(m.begin(), 0)); in main()
46 assert(r.second == next(m.begin(), 1)); in main()
48 assert(r.first == next(m.begin(), 1)); in main()
49 assert(r.second == next(m.begin(), 2)); in main()
51 assert(r.first == next(m.begin(), 2)); in main()
52 assert(r.second == next(m.begin(), 3)); in main()
54 assert(r.first == next(m.begin(), 3)); in main()
55 assert(r.second == next(m.begin(), 4)); in main()
57 assert(r.first == next(m.begin(), 4)); in main()
58 assert(r.second == next(m.begin(), 5)); in main()
[all …]
|
| /external/libcxx/test/std/containers/associative/multiset/ |
| D | erase_iter_iter.pass.cpp | 40 I i = m.erase(next(m.cbegin(), 5), next(m.cbegin(), 5)); in main()
42 assert(i == next(m.begin(), 5)); in main()
43 assert(*next(m.begin(), 0) == 1); in main()
44 assert(*next(m.begin(), 1) == 2); in main()
45 assert(*next(m.begin(), 2) == 3); in main()
46 assert(*next(m.begin(), 3) == 4); in main()
47 assert(*next(m.begin(), 4) == 5); in main()
48 assert(*next(m.begin(), 5) == 6); in main()
49 assert(*next(m.begin(), 6) == 7); in main()
50 assert(*next(m.begin(), 7) == 8); in main()
[all …]
|
| D | erase_iter.pass.cpp | 48 I i = m.erase(next(m.cbegin(), 3)); in main()
50 assert(i == next(m.begin(), 3)); in main()
51 assert(*next(m.begin(), 0) == 1); in main()
52 assert(*next(m.begin(), 1) == 2); in main()
53 assert(*next(m.begin(), 2) == 3); in main()
54 assert(*next(m.begin(), 3) == 5); in main()
55 assert(*next(m.begin(), 4) == 6); in main()
56 assert(*next(m.begin(), 5) == 7); in main()
57 assert(*next(m.begin(), 6) == 8); in main()
59 i = m.erase(next(m.cbegin(), 0)); in main()
[all …]
|
| /external/libnfnetlink/include/ |
| D | linux_list.h | 58 struct list_head *next, *prev; member
67 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
78 struct list_head *next) in __list_add() argument
80 next->prev = new; in __list_add()
81 new->next = next; in __list_add()
83 prev->next = new; in __list_add()
96 __list_add(new, head, head->next); in list_add()
119 struct list_head * prev, struct list_head * next) in __list_add_rcu() argument
121 new->next = next; in __list_add_rcu()
124 next->prev = new; in __list_add_rcu()
[all …]
|
| /external/iptables/libiptc/ |
| D | linux_list.h | 54 struct list_head *next, *prev; member
63 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
74 struct list_head *next) in __list_add() argument
76 next->prev = new; in __list_add()
77 new->next = next; in __list_add()
79 prev->next = new; in __list_add()
92 __list_add(new, head, head->next); in list_add()
115 struct list_head * prev, struct list_head * next) in __list_add_rcu() argument
117 new->next = next; in __list_add_rcu()
120 next->prev = new; in __list_add_rcu()
[all …]
|
| /external/libnetfilter_conntrack/include/internal/ |
| D | linux_list.h | 59 struct list_head *next, *prev; member
68 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
79 struct list_head *next) in __list_add() argument
81 next->prev = new; in __list_add()
82 new->next = next; in __list_add()
84 prev->next = new; in __list_add()
97 __list_add(new, head, head->next); in list_add()
120 struct list_head * prev, struct list_head * next) in __list_add_rcu() argument
122 new->next = next; in __list_add_rcu()
125 next->prev = new; in __list_add_rcu()
[all …]
|
| /external/libcxx/test/std/containers/associative/map/map.modifiers/ |
| D | erase_iter.pass.cpp | 48 I i = m.erase(next(m.cbegin(), 3)); in main()
50 assert(i == next(m.begin(), 3)); in main()
53 assert(next(m.begin())->first == 2); in main()
54 assert(next(m.begin())->second == 2.5); in main()
55 assert(next(m.begin(), 2)->first == 3); in main()
56 assert(next(m.begin(), 2)->second == 3.5); in main()
57 assert(next(m.begin(), 3)->first == 5); in main()
58 assert(next(m.begin(), 3)->second == 5.5); in main()
59 assert(next(m.begin(), 4)->first == 6); in main()
60 assert(next(m.begin(), 4)->second == 6.5); in main()
[all …]
|
| D | erase_key.pass.cpp | 45 assert(next(m.begin())->first == 2); in main()
46 assert(next(m.begin())->second == 2.5); in main()
47 assert(next(m.begin(), 2)->first == 3); in main()
48 assert(next(m.begin(), 2)->second == 3.5); in main()
49 assert(next(m.begin(), 3)->first == 4); in main()
50 assert(next(m.begin(), 3)->second == 4.5); in main()
51 assert(next(m.begin(), 4)->first == 5); in main()
52 assert(next(m.begin(), 4)->second == 5.5); in main()
53 assert(next(m.begin(), 5)->first == 6); in main()
54 assert(next(m.begin(), 5)->second == 6.5); in main()
[all …]
|