| /external/libcxx/test/std/language.support/support.initlist/support.initlist.cons/ |
| default.pass.cpp | 25 std::initializer_list<A> il; local
26 assert(il.size() == 0);
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/language.support/support.initlist/support.initlist.cons/ |
| default.pass.cpp | 25 std::initializer_list<A> il; local
26 assert(il.size() == 0);
|
| /external/libcxx/test/std/iterators/iterator.container/ |
| data.pass.cpp | 16 // template <class E> constexpr const E* data(initializer_list<E> il) noexcept; // C++17
69 std::initializer_list<int> il = { 4 }; local
73 test_container ( il );
77 test_const_container ( il );
|
| empty.pass.cpp | 15 // template <class E> constexpr bool empty(initializer_list<E> il) noexcept; // C++17
69 std::initializer_list<int> il = { 4 }; local
74 test_container ( il );
79 test_const_container ( il );
|
| size.pass.cpp | 72 std::initializer_list<int> il = { 4 }; local
76 test_container ( il );
81 test_const_container ( il );
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/iterators/iterator.container/ |
| data.pass.cpp | 14 // template <class E> constexpr const E* data(initializer_list<E> il) noexcept; // C++17
62 std::initializer_list<int> il = { 4 }; local
66 test_container ( il );
70 test_const_container ( il );
|
| empty.pass.cpp | 13 // template <class E> constexpr bool empty(initializer_list<E> il) noexcept; // C++17
63 std::initializer_list<int> il = { 4 }; local
68 test_container ( il );
73 test_const_container ( il );
|
| size.pass.cpp | 62 std::initializer_list<int> il = { 4 }; local
67 test_container ( il );
72 test_const_container ( il );
|
| /external/clang/test/PCH/ |
| implicitly-deleted.cpp | 5 move_only il; member in struct:sb
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.min.max/ |
| max_element.pass.cpp | 64 constexpr int il[] = { 2, 4, 6, 8, 7, 5, 3, 1 }; variable
70 constexpr auto p = std::max_element(il,il+8);
|
| min_element.pass.cpp | 64 constexpr int il[] = { 2, 4, 6, 8, 7, 5, 3, 1 }; variable
70 constexpr auto p = std::min_element(il, il+8);
|
| minmax_element.pass.cpp | 81 constexpr int il[] = { 2, 4, 6, 8, 7, 5, 3, 1 }; variable
87 constexpr auto p = std::minmax_element(il, il+8);
|
| max_element_comp.pass.cpp | 83 constexpr int il[] = { 2, 4, 6, 8, 7, 5, 3, 1 }; variable
90 constexpr auto p = std::max_element(il, il+8, less());
|
| min_element_comp.pass.cpp | 83 constexpr int il[] = { 2, 4, 6, 8, 7, 5, 3, 1 }; variable
90 constexpr auto p = std::min_element(il, il+8, less());
|
| minmax_element_comp.pass.cpp | 87 constexpr int il[] = { 2, 4, 6, 8, 7, 5, 3, 1 }; variable
94 constexpr auto p = std::minmax_element(il, il+8, less());
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.min.max/ |
| max_element.pass.cpp | 64 constexpr int il[] = { 2, 4, 6, 8, 7, 5, 3, 1 }; variable
70 constexpr auto p = std::max_element(il,il+8);
|
| min_element.pass.cpp | 64 constexpr int il[] = { 2, 4, 6, 8, 7, 5, 3, 1 }; variable
70 constexpr auto p = std::min_element(il, il+8);
|
| minmax_element.pass.cpp | 81 constexpr int il[] = { 2, 4, 6, 8, 7, 5, 3, 1 }; variable
87 constexpr auto p = std::minmax_element(il, il+8);
|
| max_element_comp.pass.cpp | 83 constexpr int il[] = { 2, 4, 6, 8, 7, 5, 3, 1 }; variable
90 constexpr auto p = std::max_element(il, il+8, less());
|
| min_element_comp.pass.cpp | 83 constexpr int il[] = { 2, 4, 6, 8, 7, 5, 3, 1 }; variable
90 constexpr auto p = std::min_element(il, il+8, less());
|
| minmax_element_comp.pass.cpp | 87 constexpr int il[] = { 2, 4, 6, 8, 7, 5, 3, 1 }; variable
94 constexpr auto p = std::minmax_element(il, il+8, less());
|
| /external/libcxx/test/std/iterators/iterator.range/ |
| begin-end.pass.cpp | 19 // template <class E> constexpr reverse_iterator<const E*> rbegin(initializer_list<E> il);
20 // template <class E> constexpr reverse_iterator<const E*> rend (initializer_list<E> il);
143 std::initializer_list<int> il = { 4 }; local
148 test_container ( il, 4 );
153 test_const_container ( il, 4 );
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/iterators/iterator.range/ |
| begin-end.pass.cpp | 19 // template <class E> constexpr reverse_iterator<const E*> rbegin(initializer_list<E> il);
20 // template <class E> constexpr reverse_iterator<const E*> rend (initializer_list<E> il);
143 std::initializer_list<int> il = { 4 }; local
148 test_container ( il, 4 );
153 test_const_container ( il, 4 );
|
| /external/annotation-tools/asmx/test/perf/org/objectweb/asm/ |
| BCELPerfTest.java | 83 InstructionList il = mg.getInstructionList(); local
84 if (il != null) {
85 InstructionHandle ih = il.getStart();
119 InstructionList il = new InstructionList(); local
120 il.append(new ALOAD(0));
121 il.append(new ALOAD(0));
122 il.append(new GETFIELD(cp.addFieldref(name, "_counter", "I")));
123 il.append(new ICONST(1));
124 il.append(new IADD());
125 il.append(new PUTFIELD(cp.addFieldref(name, "_counter", "I")))
[all...] |
| /external/libcxx/test/std/containers/ |
| set_allocator_requirement_test_templates.h | 94 std::initializer_list<ValueTp> il = { ValueTp(1), ValueTp(2) }; local
96 c.insert(il);
100 c.insert(il);
322 std::initializer_list<ValueTp> il = { ValueTp(1), ValueTp(2) }; local
324 c.insert(il);
|
