| /external/libcxx/test/std/containers/sequences/list/list.ops/ |
| reverse.pass.cpp | 10 // <list>
14 #include <list>
24 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
26 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0])));
32 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
34 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
|
| sort.pass.cpp | 10 // <list>
14 #include <list>
24 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
26 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0])));
32 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
34 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
|
| sort_comp.pass.cpp | 10 // <list>
14 #include <list>
25 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
27 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0])));
33 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
35 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
|
| unique_pred.pass.cpp | 10 // <list>
14 #include <list>
29 std::list<int> c(a1, a1+sizeof(a1)/sizeof(a1[0]));
31 assert(c == std::list<int>(a2, a2+4));
37 std::list<int, min_allocator<int>> c(a1, a1+sizeof(a1)/sizeof(a1[0]));
39 assert((c == std::list<int, min_allocator<int>>(a2, a2+4)));
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue102/ |
| DataBean.java | 18 import java.util.List;
23 private List<String> list; field in class:DataBean
34 public List<String> getList() {
35 return list;
38 public void setList(List<String> list) {
39 this.list = list;
|
| /libcore/luni/src/main/java/libcore/io/ |
| EventLogger.java | 47 public void report (int code, Object... list);
55 public void report (int code, Object... list) {
58 for (Object o : list) {
66 public static void writeEvent(int code, Object... list) {
67 getReporter().report(code, list);
|
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.cons/ |
| assign_initializer_list.pass.cpp | 10 // <list>
14 #include <list>
23 std::list<int> d;
26 std::list<int>::iterator i = d.begin();
34 std::list<int, min_allocator<int>> d;
37 std::list<int, min_allocator<int>>::iterator i = d.begin();
|
| default_noexcept.pass.cpp | 10 // <list>
12 // list()
17 #include <list>
34 typedef std::list<MoveOnly> C;
38 typedef std::list<MoveOnly, test_allocator<MoveOnly>> C;
42 typedef std::list<MoveOnly, other_allocator<MoveOnly>> C;
46 typedef std::list<MoveOnly, some_alloc<MoveOnly>> C;
|
| initializer_list.pass.cpp | 10 // <list>
12 // list(initializer_list<value_type> il);
14 #include <list>
23 std::list<int> d = {3, 4, 5, 6};
25 std::list<int>::iterator i = d.begin();
33 std::list<int, min_allocator<int>> d = {3, 4, 5, 6};
35 std::list<int, min_allocator<int>>::iterator i = d.begin();
|
| move_assign_noexcept.pass.cpp | 10 // <list>
12 // list& operator=(list&& c)
19 #include <list>
36 typedef std::list<MoveOnly> C;
40 typedef std::list<MoveOnly, test_allocator<MoveOnly>> C;
44 typedef std::list<MoveOnly, other_allocator<MoveOnly>> C;
48 typedef std::list<MoveOnly, some_alloc<MoveOnly>> C;
|
| move_noexcept.pass.cpp | 10 // <list>
12 // list(list&&)
17 #include <list>
34 typedef std::list<MoveOnly> C;
38 typedef std::list<MoveOnly, test_allocator<MoveOnly>> C;
42 typedef std::list<MoveOnly, other_allocator<MoveOnly>> C;
46 typedef std::list<MoveOnly, some_alloc<MoveOnly>> C;
|
| op_equal_initializer_list.pass.cpp | 10 // <list>
12 // list& operator=(initializer_list<value_type> il);
14 #include <list>
22 std::list<int> d;
25 std::list<int>::iterator i = d.begin();
33 std::list<int, min_allocator<int>> d;
36 std::list<int, min_allocator<int>>::iterator i = d.begin();
|
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/ |
| erase_iter_db1.pass.cpp | 10 // <list>
18 #include <list>
29 std::list<int> l1(a1, a1+3);
30 std::list<int>::const_iterator i = l1.end();
37 std::list<int, min_allocator<int>> l1(a1, a1+3);
38 std::list<int, min_allocator<int>>::const_iterator i = l1.end();
|
| erase_iter_iter_db4.pass.cpp | 10 // <list>
18 #include <list>
29 std::list<int> l1(a1, a1+3);
30 std::list<int>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin());
36 std::list<int, min_allocator<int>> l1(a1, a1+3);
37 std::list<int, min_allocator<int>>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin());
|
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.ops/ |
| remove_if.pass.cpp | 10 // <list>
14 #include <list>
30 std::list<int> c(a1, a1+4);
32 assert(c == std::list<int>(a2, a2+2));
38 std::list<int, min_allocator<int>> c(a1, a1+4);
40 assert((c == std::list<int, min_allocator<int>>(a2, a2+2)));
|
| reverse.pass.cpp | 10 // <list>
14 #include <list>
24 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
26 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0])));
32 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
34 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
|
| sort.pass.cpp | 10 // <list>
14 #include <list>
24 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
26 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0])));
32 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
34 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
|
| sort_comp.pass.cpp | 10 // <list>
14 #include <list>
25 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
27 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0])));
33 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
35 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
|
| unique_pred.pass.cpp | 10 // <list>
14 #include <list>
29 std::list<int> c(a1, a1+sizeof(a1)/sizeof(a1[0]));
31 assert(c == std::list<int>(a2, a2+4));
37 std::list<int, min_allocator<int>> c(a1, a1+sizeof(a1)/sizeof(a1[0]));
39 assert((c == std::list<int, min_allocator<int>>(a2, a2+4)));
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/list.cons/ |
| assign_initializer_list.pass.cpp | 10 // <list>
14 #include <list>
23 std::list<int> d;
26 std::list<int>::iterator i = d.begin();
34 std::list<int, min_allocator<int>> d;
37 std::list<int, min_allocator<int>>::iterator i = d.begin();
|
| default_noexcept.pass.cpp | 10 // <list>
12 // list()
17 #include <list>
34 typedef std::list<MoveOnly> C;
38 typedef std::list<MoveOnly, test_allocator<MoveOnly>> C;
42 typedef std::list<MoveOnly, other_allocator<MoveOnly>> C;
46 typedef std::list<MoveOnly, some_alloc<MoveOnly>> C;
|
| initializer_list.pass.cpp | 10 // <list>
12 // list(initializer_list<value_type> il);
14 #include <list>
23 std::list<int> d = {3, 4, 5, 6};
25 std::list<int>::iterator i = d.begin();
33 std::list<int, min_allocator<int>> d = {3, 4, 5, 6};
35 std::list<int, min_allocator<int>>::iterator i = d.begin();
|
| move_assign_noexcept.pass.cpp | 10 // <list>
12 // list& operator=(list&& c)
19 #include <list>
36 typedef std::list<MoveOnly> C;
40 typedef std::list<MoveOnly, test_allocator<MoveOnly>> C;
44 typedef std::list<MoveOnly, other_allocator<MoveOnly>> C;
48 typedef std::list<MoveOnly, some_alloc<MoveOnly>> C;
|
| move_noexcept.pass.cpp | 10 // <list>
12 // list(list&&)
17 #include <list>
34 typedef std::list<MoveOnly> C;
38 typedef std::list<MoveOnly, test_allocator<MoveOnly>> C;
42 typedef std::list<MoveOnly, other_allocator<MoveOnly>> C;
46 typedef std::list<MoveOnly, some_alloc<MoveOnly>> C;
|
| op_equal_initializer_list.pass.cpp | 10 // <list>
12 // list& operator=(initializer_list<value_type> il);
14 #include <list>
22 std::list<int> d;
25 std::list<int>::iterator i = d.begin();
33 std::list<int, min_allocator<int>> d;
36 std::list<int, min_allocator<int>>::iterator i = d.begin();
|
