/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() 131 std::array in1{0, 1, 5, 6, 9, 10}; in testImpl() local 138 std::array in1{2, 6, 8, 12, 15, 16}; in testImpl() local 146 std::array in1{2, 6, 8, 12, 15, 16}; in testImpl() local 154 std::array in1{0, 1, 2}; in testImpl() local 162 std::array in1{8, 9, 10, 12, 13}; in testImpl() local 170 std::array in1{0, 1, 1}; in testImpl() local 178 std::array in1{8, 9, 10, 12, 12, 12}; in testImpl() local 186 std::array in1{8, 9, 10, 12, 13}; in testImpl() local 194 std::array<int, 0> in1{}; in testImpl() local [all …]
|
/llvm-project/clang/test/CodeGen/ |
H A D | mult-alt-generic.c | 43 register int in1 = 1; in single_lt() local 54 register int in1 = 1; in single_gt() local 65 register int in1 = 1; in single_r() local 113 register int in1 = 1; in single_g() local 126 register int in1 = 1; in single_X() local 176 register int in1 = 1; in multi_lt() local 187 register int in1 = 1; in multi_gt() local 198 register int in1 = 1; in multi_r() local 246 register int in1 = 1; in multi_g() local 259 register int in1 = 1; in multi_X() local
|
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/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() 147 std::array in1{0, 1, 5, 6, 9, 10}; in testImpl() local 154 std::array in1{2, 6, 8, 12, 15, 16}; in testImpl() local 162 std::array in1{2, 6, 8, 12, 15, 16}; in testImpl() local 170 std::array in1{0, 1, 2}; in testImpl() local 178 std::array in1{8, 8, 10, 12, 13}; in testImpl() local 186 std::array in1{0, 1, 1}; in testImpl() local 194 std::array in1{7, 7, 9, 12}; in testImpl() local 202 std::array in1{7, 7, 9, 12}; in testImpl() local 210 std::array<int, 0> in1{}; 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() 146 std::array in1{0, 1, 5, 6, 9, 10}; in testImpl() local 154 std::array in1{2, 6, 8, 12, 15, 16}; in testImpl() local 162 std::array in1{2, 6, 8, 12, 15, 16}; in testImpl() local 170 std::array in1{0, 1, 2}; in testImpl() local 178 std::array in1{8, 8, 10, 12, 13}; in testImpl() local 186 std::array in1{0, 1, 1}; in testImpl() local 194 std::array in1{7, 7, 9, 12}; in testImpl() local 202 std::array in1{7, 7, 9, 12}; in testImpl() local 210 std::array<int, 0> in1{}; 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 140 std::array in1{0, 1, 5, 6, 9, 10}; testImpl() local 148 std::array in1{2, 6, 8, 12, 15, 16}; testImpl() local 156 std::array in1{2, 6, 8, 12, 15, 16}; testImpl() local 164 std::array in1{0, 1, 2}; testImpl() local 172 std::array in1{8, 8, 10, 12, 13}; testImpl() local 180 std::array in1{0, 1, 1}; testImpl() local 188 std::array in1{7, 7, 9, 12}; testImpl() local 196 std::array in1{7, 7, 9, 12}; testImpl() local 204 std::array<int, 0> in1{}; testImpl() local 212 std::array in1{3, 4, 5}; testImpl() local 220 std::array<int, 0> in1{}; 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() 144 std::array in1{0, 1, 5, 6, 9, 10}; in testImpl() local 152 std::array in1{2, 6, 8, 12, 15, 16}; in testImpl() local 160 std::array in1{2, 6, 8, 12, 15, 16}; in testImpl() local 168 std::array in1{0, 1, 2}; in testImpl() local 176 std::array in1{8, 8, 10, 12, 13}; in testImpl() local 184 std::array in1{0, 1, 1}; in testImpl() local 192 std::array<int, 0> in1{}; in testImpl() local 200 std::array in1{3, 4, 5}; in testImpl() local 208 std::array<int, 0> in1{}; in testImpl() 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() 144 std::array in1{0, 1, 5, 6, 9, 10}; in testImpl() local 152 std::array in1{2, 6, 8, 12}; in testImpl() local 160 std::array in1{0, 1, 2}; in testImpl() local 168 std::array in1{8, 8, 10, 12}; in testImpl() local 176 std::array in1{0, 1, 1}; in testImpl() local 184 std::array<int, 0> in1{}; in testImpl() local 192 std::array in1{3, 4, 5}; in testImpl() local 200 std::array<int, 0> in1{}; in testImpl() local
|
/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 | 32 _LIBCPP_NO_UNIQUE_ADDRESS _InIter1 in1; member
|
H A D | in_in_out_result.h | 32 _LIBCPP_NO_UNIQUE_ADDRESS _InIter1 in1; member
|
/llvm-project/pstl/test/std/algorithms/alg.sorting/alg.lex.comparison/ |
H A D | lexicographical_compare.pass.cpp | 51 Sequence<T1> in1(max_n, [](std::size_t k) { return T1(k); }); in test() local 99 std::string in1 = ""; in test_string() 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
|
H A D | ranges_robust_against_differing_projections.pass.cpp | 27 constexpr void test(Func&& func, Input1& in1, Input2& in2, Args&& ...args) { in test()
|
H A D | ranges_robust_against_omitting_invoke.pass.cpp | 47 // (in1, in2, ...) in test() argument
|
/llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.is_permutation/ |
H A D | ranges.is_permutation.pass.cpp | 156 std::array in1 = {A{2}, A{3}, A{1}}; in test() local 180 std::array in1 = {A{1}, A{2}, A{3}}; // [2, 4, 6] after applying `x2`. in test() local
|
/llvm-project/pstl/test/std/algorithms/alg.sorting/ |
H A D | is_sorted.pass.cpp | 70 Sequence<T> in1(9, [](size_t) -> T { return T(0); }); in test_is_sorted_by_type() local
|
/llvm-project/pstl/test/std/algorithms/alg.nonmodifying/ |
H A D | find_first_of.pass.cpp | 61 Sequence<T> in1(max_n1, [](std::size_t) { return T(1); }); in test() local
|
/llvm-project/pstl/test/std/algorithms/alg.sorting/alg.set.operations/ |
H A D | includes.pass.cpp | 81 Sequence<T1> in1(n, [](std::size_t k) { return rand() % (2 * k + 1); }); in test_includes() local
|
/llvm-project/pstl/test/std/algorithms/alg.merge/ |
H A D | merge.pass.cpp | 72 Sequence<T> in1(max_size, generator1); 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 | 80 Sequence<In1> in1(n, [](size_t k) { return k % 5 != 1 ? 3 * k - 7 : 0; }); in test() local
|
/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
|