/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/includes/ |
H A D | ranges_includes.pass.cpp | 107 constexpr void testIncludesImpl(std::array<int, N1> in1, std::array<int, N2> in2, bool expected) { in testIncludesImpl() 132 std::array in2{3, 6, 7, 9, 13, 15, 100}; in testImpl() local 139 std::array in2{0, 2, 8}; in testImpl() local 147 std::array in2{0, 2, 8, 15, 17, 19}; in testImpl() local 155 std::array in2{0, 1, 2}; in testImpl() local 163 std::array in2{8, 10}; in testImpl() local 171 std::array in2{0, 1, 1, 2, 5}; in testImpl() local 179 std::array in2{8, 12, 12}; in testImpl() local 187 std::array in2{8, 10, 10}; in testImpl() local 195 std::array in2{3, 4, 5}; in testImpl() local [all …]
|
/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.union/ |
H A D | ranges_set_union.pass.cpp | 104 constexpr void testSetUnionImpl(std::array<int, N1> in1, std::array<int, N2> in2, std::array<int, N… in testSetUnionImpl() 148 std::array in2{3, 6, 7, 9, 13, 15, 100}; in testImpl() local 155 std::array in2{0, 2, 8}; in testImpl() local 163 std::array in2{0, 2, 8, 15, 17, 19}; in testImpl() local 171 std::array in2{0, 1, 2}; in testImpl() local 179 std::array in2{8, 10}; in testImpl() local 187 std::array in2{0, 1, 1, 2, 5}; in testImpl() local 195 std::array in2{1, 5, 5, 8, 10}; in testImpl() local 203 std::array in2{7, 7, 7, 13}; in testImpl() local 211 std::array in2{3, 4, 5}; in testImpl() local [all …]
|
/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/ |
H A D | ranges_set_symmetric_difference.pass.cpp | 102 testSetSymmetricDifferenceImpl(std::array<int, N1> in1, std::array<int, N2> in2, std::array<int, N3… in testSetSymmetricDifferenceImpl() 147 std::array in2{3, 6, 7, 9, 13, 15, 100}; in testImpl() local 155 std::array in2{0, 2, 8}; in testImpl() local 163 std::array in2{0, 2, 8, 15, 17, 19}; in testImpl() local 171 std::array in2{0, 1, 2}; in testImpl() local 179 std::array in2{8, 10}; in testImpl() local 187 std::array in2{0, 1, 1, 2, 5}; in testImpl() local 195 std::array in2{1, 5, 5, 8, 10}; in testImpl() local 203 std::array in2{7, 7, 7, 13}; in testImpl() local 211 std::array in2{3, 4, 5}; in testImpl() local [all …]
|
/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.intersection/ |
H A D | ranges_set_intersection.pass.cpp | 97 testSetIntersectionImpl(std::array<int,N1> in1,std::array<int,N2> in2,std::array<int,N3> expected) testSetIntersectionImpl() argument 141 std::array in2{3, 6, 7, 9, 13, 15, 100}; testImpl() local 149 std::array in2{0, 2, 8}; testImpl() local 157 std::array in2{0, 2, 8, 15, 17, 19}; testImpl() local 165 std::array in2{0, 1, 2}; testImpl() local 173 std::array in2{8, 10}; testImpl() local 181 std::array in2{0, 1, 1, 2, 5}; testImpl() local 189 std::array in2{1, 5, 5, 8, 10}; testImpl() local 197 std::array in2{7, 7, 7, 13}; testImpl() local 205 std::array in2{3, 4, 5}; testImpl() local 213 std::array<int, 0> in2{}; testImpl() local 221 std::array<int, 0> in2{}; testImpl() local [all...] |
/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.difference/ |
H A D | ranges_set_difference.pass.cpp | 103 constexpr void testSetDifferenceImpl(std::array<int, N1> in1, std::array<int, N2> in2, std::array<i… in testSetDifferenceImpl() 145 std::array in2{3, 6, 7, 9, 13, 15, 100}; in testImpl() local 153 std::array in2{0, 2, 8}; in testImpl() local 161 std::array in2{0, 2, 8, 15, 17, 19}; in testImpl() local 169 std::array in2{0, 1, 2}; in testImpl() local 177 std::array in2{8, 10}; in testImpl() local 185 std::array in2{0, 1, 1, 2, 5}; in testImpl() local 193 std::array in2{3, 4, 5}; in testImpl() local 201 std::array<int, 0> in2{}; in testImpl() local 209 std::array<int, 0> in2{}; in testImpl() local
|
/llvm-project/pstl/test/std/algorithms/alg.nonmodifying/ |
H A D | mismatch.pass.cpp | 63 Sequence<T> in2(in); in test_mismatch_by_type() local 85 Sequence<T> in2(100, [](size_t v) -> T { return T(v); }); in test_mismatch_by_type() local 99 Sequence<T> in2({}); in test_mismatch_by_type() local
|
H A D | find_first_of.pass.cpp | 62 Sequence<T> in2(max_n2, [](std::size_t) { return T(0); }); in test() local
|
/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.merge/ |
H A D | ranges_merge.pass.cpp | 102 constexpr void testMergeImpl(std::array<int, N1> in1, std::array<int, N2> in2, const auto& expected… in testMergeImpl() 145 std::array in2{3, 6, 7, 9, 13, 15, 100}; in testImpl() local 153 std::array in2{0, 1, 2}; in testImpl() local 161 std::array in2{0, 1, 2}; in testImpl() local 169 std::array in2{0, 0, 1}; in testImpl() local 177 std::array in2{7, 7}; in testImpl() local 185 std::array in2{3, 4, 5}; in testImpl() local 193 std::array<int, 0> in2{}; in testImpl() local 201 std::array<int, 0> in2{}; in testImpl() local
|
/llvm-project/libcxx/test/std/algorithms/ |
H A D | ranges_robust_against_dangling.pass.cpp | 52 constexpr void dangling_2nd(Func&& func, Input& in1, Input& in2, Args&& ...args) { in dangling_2nd() argument 59 constexpr void dangling_both(Func&& func, Input& in1, Input& in2, Args&& ...args) { in dangling_both() argument 105 std::array in2 = {4, 5, 6}; in test_all() local [all...] |
H A D | ranges_robust_against_differing_projections.pass.cpp | 27 constexpr void test(Func&& func, Input1& in1, Input2& in2, Args&& ...args) { in test() 44 std::array in2 = {A{4}, A{5}, A{6}}; in test_all() local
|
H A D | ranges_robust_against_omitting_invoke.pass.cpp | 47 // (in1, in2, ...) in test() argument 61 std::array in2 = {Bar{Foo{4}}, Bar{Foo{5}}, Bar{Foo{6}}}; test_all() local [all...] |
H A D | ranges_robust_against_proxy_iterators.pass.cpp | 58 ProxyRange in2{input2}; in run_tests() local [all...] |
/llvm-project/polly/lib/External/isl/ |
H A D | isl_multi_product_templ.c | 27 isl_size in1, in2, out1, out2; in MULTI() local
|
/llvm-project/libcxx/include/__algorithm/ |
H A D | in_in_result.h | 33 _LIBCPP_NO_UNIQUE_ADDRESS _InIter2 in2; member
|
H A D | in_in_out_result.h | 33 _LIBCPP_NO_UNIQUE_ADDRESS _InIter2 in2; member
|
/llvm-project/pstl/test/std/algorithms/alg.sorting/alg.lex.comparison/ |
H A D | lexicographical_compare.pass.cpp | 52 Sequence<T2> in2(2 * max_n, [](std::size_t k) { return T2(k); }); in test() local 100 std::string in2 = ""; in test_string() local
|
/llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.is_permutation/ |
H A D | ranges.is_permutation.pass.cpp | 157 std::array in2 = {A{1}, A{2}, A{3}}; in test() local 181 std::array in2 = {A{4}, A{8}, A{12}}; // [2, 4, 6] after applying `div2`. in test() local
|
/llvm-project/pstl/test/std/algorithms/alg.sorting/alg.set.operations/ |
H A D | includes.pass.cpp | 82 Sequence<T2> in2(m, [](std::size_t k) { return rand() % (k + 1); }); in test_includes() local
|
/llvm-project/pstl/test/std/algorithms/alg.merge/ |
H A D | merge.pass.cpp | 73 Sequence<T> in2(max_size / 2, generator2); in test_merge_by_type() local
|
/llvm-project/libcxx/test/std/numerics/numeric.ops/numeric.ops.lcm/ |
H A D | lcm.pass.cpp | 39 constexpr bool test0(int in1, int in2, int out) in test0()
|
/llvm-project/third-party/benchmark/tools/ |
H A D | compare.py | 20 def check_inputs(in1, in2, flags): argument
|
/llvm-project/pstl/test/std/algorithms/alg.modifying.operations/ |
H A D | transform_binary.pass.cpp | 81 Sequence<In2> in2(n, [](size_t k) { return k % 7 != 2 ? 5 * k - 5 : 0; }); in test() local
|
/llvm-project/clang/test/CodeGen/ |
H A D | builtins-hexagon-v66-128B.c | 54 HEXAGON_Vect2048 test28(void *in1, void *in2, void *out) { in test28()
|
H A D | builtins-hexagon-v66.c | 78 HEXAGON_Vect1024 test8(void *in1, void *in2, void *out) { in test8()
|
/llvm-project/libcxx/test/std/numerics/numeric.ops/numeric.ops.gcd/ |
H A D | gcd.pass.cpp | 43 test0(int in1,int in2,int out) test0() argument
|