Home
last modified time | relevance | path

Searched refs:proj (Results 1 – 25 of 49) sorted by relevance

12

/llvm-project-15.0.7/llvm/utils/docker/scripts/llvm_checksum/
H A Dllvm_checksum.py97 for proj in projects:
98 project_root = os.path.join(root_path, proj.relpath)
101 proj.name)
127 project_checksums[proj.name] = hasher.hexdigest()
140 for proj in sorted(checksums.keys()):
141 f.write("{} {}\n".format(checksums[proj], proj))
155 checksum, proj = line.split()
156 checksums[proj] = checksum
186 for proj, checksum in new_checksums.items():
188 if proj not in reference_checksums:
[all …]
/llvm-project-15.0.7/libcxx/test/std/numerics/complex.number/cmplx.over/
H A Dproj.pass.cpp28 static_assert((std::is_same<decltype(std::proj(x)), std::complex<double> >::value), ""); in test()
29 assert(std::proj(x) == proj(std::complex<double>(x, 0))); in test()
36 static_assert((std::is_same<decltype(std::proj(x)), std::complex<T> >::value), ""); in test()
37 assert(std::proj(x) == proj(std::complex<T>(x, 0))); in test()
45 static_assert((std::is_same<decltype(std::proj(x)), std::complex<T> >::value), ""); in test()
46 assert(std::proj(x) == proj(std::complex<T>(x, 0))); in test()
H A DUDT_is_rejected.fail.cpp67 std::proj(ft); // expected-error {{no matching function}} in main()
68 std::proj(dt); // expected-error {{no matching function}} in main()
69 std::proj(ldt); // expected-error {{no matching function}} in main()
70 std::proj(it); // expected-error {{no matching function}} in main()
71 std::proj(uit); // expected-error {{no matching function}} in main()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.equal/
H A Dranges.equal.pass.cpp290 auto proj = [&](int i) { ++projCount; return i; }; in test() local
291 auto ret = std::ranges::equal(a, a + 3, b, b + 4, pred, proj, proj); in test()
302 auto proj = [&](int i) { ++projCount; return i; }; in test() local
303 auto ret = std::ranges::equal(a, b, pred, proj, proj); in test()
317 auto proj = [&](int i) { ++projCount; return i; }; in test() local
318 …ret = std::ranges::equal(a, sentinel_wrapper(a + 3), b, sentinel_wrapper(b + 4), pred, proj, proj); in test()
329 auto proj = [&](int i) { ++projCount; return i; }; in test() local
332 auto ret = std::ranges::equal(range1, range2, pred, proj, proj); in test()
346 auto proj = [&](int i) { ++projCount; return i; }; in test() local
347 auto ret = std::ranges::equal(a, a + 3, b, b + 3, pred, proj, proj); in test()
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/
H A Dranges_unique.pass.cpp37 requires(Iter&& iter, Sent&& sent, Comp&& comp, Proj&& proj) {
39 …forward<Iter>(iter), std::forward<Sent>(sent), std::forward<Comp>(comp), std::forward<Proj>(proj));
56 requires(Range&& range, Comp&& comp, Proj&& proj) {
57 …td::ranges::unique(std::forward<Range>(range), std::forward<Comp>(comp), std::forward<Proj>(proj));
187 const auto proj = &Data::data; in test() local
192 auto result = std::ranges::unique(in.begin(), in.end(), {}, proj); in test()
193 …(std::ranges::equal(in.begin(), result.begin(), expected.begin(), expected.end(), {}, proj, proj)); in test()
200 auto result = std::ranges::unique(in, {}, proj); in test()
201 …(std::ranges::equal(in.begin(), result.begin(), expected.begin(), expected.end(), {}, proj, proj)); in test()
H A Dranges_unique_copy.pass.cpp51 requires(InIter&& in, Sent&& sent, OutIter&& out, Comp&& comp, Proj&& proj) {
57 std::forward<Proj>(proj));
155 requires(Range&& range, OutIter&& out, Comp&& comp, Proj&& proj) {
157 …ard<Range>(range), std::forward<OutIter>(out), std::forward<Comp>(comp), std::forward<Proj>(proj));
382 const auto proj = &Data::data; in test() local
387 auto result = std::ranges::unique_copy(in.begin(), in.end(), out.begin(), {}, proj); in test()
388 assert(std::ranges::equal(out, expected, {}, proj, proj)); in test()
396 auto result = std::ranges::unique_copy(in, out.begin(), {}, proj); in test()
397 assert(std::ranges::equal(out, expected, {}, proj, proj)); in test()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.adjacent.find/
H A Dranges.adjacent_find.pass.cpp112 auto proj = [&](int i) { ++projectionCount; return i; }; in test() local
114 auto ret = std::ranges::adjacent_find(a, a + 5, pred, proj); in test()
123 auto proj = [&](int i) { ++projectionCount; return i; }; in test() local
125 auto ret = std::ranges::adjacent_find(a, pred, proj); in test()
137 auto proj = [&](int i) { ++projectionCount; return i; }; in test() local
139 auto ret = std::ranges::adjacent_find(a, a + 5, pred, proj); in test()
148 auto proj = [&](int i) { ++projectionCount; return i; }; in test() local
150 auto ret = std::ranges::adjacent_find(a, pred, proj); in test()
/llvm-project-15.0.7/libcxx/include/
H A Dalgorithm47 constexpr I min_element(I first, S last, Comp comp = {}, Proj proj = {});
51 constexpr borrowed_iterator_t<R> min_element(R&& r, Comp comp = {}, Proj proj = {});
77 constexpr I find(I first, S last, const T& value, Proj proj = {}); // since C++20
82 find(R&& r, const T& value, Proj proj = {}); // since C++20
86 constexpr I find_if(I first, S last, Pred pred, Proj proj = {}); // since C++20
91 find_if(R&& r, Pred pred, Proj proj = {}); // since C++20
95 constexpr I find_if_not(I first, S last, Pred pred, Proj proj = {}); // since C++20
100 find_if_not(R&& r, Pred pred, Proj proj = {}); // since C++20
104 constexpr const T& min(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20
108 constexpr T min(initializer_list<T> r, Comp comp = {}, Proj proj = {}); // since C++20
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/Coroutines/
H A Dcoro-retcon-frame.ll16 %proj.1 = getelementptr inbounds { i64, i64 }, { i64, i64 }* %tmp, i64 0, i32 0
17 %proj.2 = getelementptr inbounds { i64, i64 }, { i64, i64 }* %tmp, i64 0, i32 1
18 store i64 0, i64* %proj.1, align 8
19 store i64 0, i64* %proj.2, align 8
24 %proj.2.2 = getelementptr inbounds { i64, i64 }, { i64, i64 }* %tmp, i64 0, i32 1
25 call void @init(i64 * %proj.1)
26 call void @init(i64 * %proj.2.2)
H A Dcoro-async-unreachable.ll46 %proj.1 = getelementptr inbounds { i64, i64 }, { i64, i64 }* %tmp, i64 0, i32 0
47 %proj.2 = getelementptr inbounds { i64, i64 }, { i64, i64 }* %tmp, i64 0, i32 1
52 store i64 0, i64* %proj.1, align 8
53 store i64 1, i64* %proj.2, align 8
54 call void @some_may_write(i64* %proj.1)
82 %val = load i64, i64* %proj.1
84 %val.2 = load i64, i64* %proj.2
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/equal.range/
H A Dranges_equal_range.pass.cpp39 requires(Iter&& iter, Sent&& sent, const T& value, Comp&& comp, Proj&& proj) {
45 std::forward<Proj>(proj));
61 requires(R&& r, const T& value, Comp&& comp, Proj&& proj) {
62 std::ranges::equal_range(std::forward<R>(r), value, comp, proj);
204 const auto proj = [](const Data& d) { return d.data; }; in test() local
207 auto result = std::ranges::equal_range(in.begin(), in.end(), value, {}, proj); in test()
215 auto result = std::ranges::equal_range(in, value, {}, proj); in test()
/llvm-project-15.0.7/libcxx/test/support/
H A Dcounting_projection.h26 constexpr counting_projection(Proj proj, int& count) : proj_(std::move(proj)), count_(&count) {} in counting_projection() argument
37 counting_projection(Proj proj, int& count) -> counting_projection<Proj>;
/llvm-project-15.0.7/llvm/utils/release/
H A Dexport.sh131 for proj in $projects; do
132 echo "Creating tarball for $proj ..."
133 pushd $llvm_src_dir/$proj
134 …git archive --prefix=$proj-$release$rc.src/ $tree_id . | xz -T0 >$target_dir/$(template_file $proj)
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.merge/
H A Dranges_inplace_merge.pass.cpp43 requires(Iter&& iter, Middle&& mid, Sent&& sent, Comp&& comp, Proj&& proj) {
49 std::forward<Proj>(proj));
71 requires(Range&& r, Middle&& mid, Comp&& comp, Proj&& proj) {
73 …:forward<Range>(r), std::forward<Middle>(mid), std::forward<Comp>(comp), std::forward<Proj>(proj));
241 const auto proj = &Data::data; in test() local
246 auto result = std::ranges::inplace_merge(in.begin(), in.begin() + 2, in.end(), {}, proj); in test()
254 auto result = std::ranges::inplace_merge(in, in.begin() + 2, {}, proj); in test()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.modifying.operations/alg.replace/
H A Dranges.replace_if.pass.cpp160 auto proj = [&](int i) { ++projectionCount; return i; }; in test() local
162 auto ret = std::ranges::replace_if(a, a + 5, pred, 1, proj); in test()
171 auto proj = [&](int i) { ++projectionCount; return i; }; in test() local
173 auto ret = std::ranges::replace_if(a, pred, 1, proj); in test()
H A Dranges.replace.pass.cpp176 auto proj = [&](int i) { ++projectionCount; return i; }; in test() local
178 auto ret = std::ranges::replace(std::begin(a), std::end(a), 1, 2, proj); in test()
184 auto proj = [&](int i) { ++projectionCount; return i; }; in test() local
186 auto ret = std::ranges::replace(a, 1, 2, proj); in test()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.all_of/
H A Dranges.all_of.pass.cpp95 auto proj = [&](int i) { ++projectionCount; return i; }; in test_iterators() local
97 assert(std::ranges::all_of(It(a.begin()), Sent(It(a.end())), pred, proj)); in test_iterators()
105 auto proj = [&](int i) { ++projectionCount; return i; }; in test_iterators() local
108 assert(std::ranges::all_of(range, pred, proj)); in test_iterators()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.none_of/
H A Dranges.none_of.pass.cpp95 auto proj = [&](int i) { ++projectionCount; return i; }; in test_iterators() local
97 assert(std::ranges::none_of(It(a.begin()), Sent(It(a.end())), pred, proj)); in test_iterators()
105 auto proj = [&](int i) { ++projectionCount; return i; }; in test_iterators() local
108 assert(std::ranges::none_of(range, pred, proj)); in test_iterators()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.any_of/
H A Dranges.any_of.pass.cpp95 auto proj = [&](int i) { ++projectionCount; return i; }; in test_iterators() local
97 assert(!std::ranges::any_of(It(a.begin()), Sent(It(a.end())), pred, proj)); in test_iterators()
105 auto proj = [&](int i) { ++projectionCount; return i; }; in test_iterators() local
108 assert(!std::ranges::any_of(range, pred, proj)); in test_iterators()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/includes/
H A Dranges_includes.pass.cpp273 const auto proj = &Data::data; in test() local
278 … auto result = std::ranges::includes(r1.begin(), r1.end(), r2.begin(), r2.end(), {}, proj, proj); in test()
284 auto result = std::ranges::includes(r1, r2, {}, proj, proj); in test()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/
H A Dranges_remove_copy_if.pass.cpp77 requires(R&& r, O&& out, Pred&& pred, Proj&& proj) {
79 … std::forward<R>(r), std::forward<O>(out), std::forward<Pred>(pred), std::forward<Proj>(proj));
233 const auto proj = &Data::data; in test() local
240 auto result = std::ranges::remove_copy_if(in.begin(), in.end(), out.begin(), pred, proj); in test()
249 auto result = std::ranges::remove_copy_if(in, out.begin(), pred, proj); in test()
H A Dranges.remove.pass.cpp138 auto proj = [&](CompCounter i) { in test() local
145 … auto ret = std::ranges::remove(std::begin(a), std::end(a), CompCounter{&comp_count}, proj); in test()
152 auto proj = [&](CompCounter i) { in test() local
159 auto ret = std::ranges::remove(a, CompCounter{&comp_count}, proj); in test()
H A Dranges_remove_copy.pass.cpp45 requires(Iter&& iter, Sent&& sent, OutIter&& out, Proj&& proj) {
47 …rd<Iter>(iter), std::forward<Sent>(sent), std::forward<OutIter>(out), 0, std::forward<Proj>(proj));
72 requires(Range&& range, OutIter&& out, Proj&& proj) {
74 std::forward<Range>(range), std::forward<OutIter>(out), 0, std::forward<Proj>(proj));
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.min.max/
H A Dranges.max.pass.cpp129 auto proj = [](int i) { return i == 5 ? 100 : i; }; in test_initializer_list() local
130 int ret = std::ranges::max({7, 6, 9, 3, 5, 1, 2, 4}, {}, proj); in test_initializer_list()
197 auto proj = [](int& i) { return i == 5 ? 100 : i; }; in test_range() local
198 int ret = std::ranges::max(a, std::ranges::less{}, proj); in test_range()
H A Dranges.min.pass.cpp128 auto proj = [](int i) { return i == 5 ? -100 : i; }; in test_initializer_list() local
129 int ret = std::ranges::min({7, 6, 9, 3, 5, 1, 2, 4}, std::ranges::less{}, proj); in test_initializer_list()
193 auto proj = [](int& i) { return i == 5 ? -100 : i; }; in test_range() local
194 int ret = std::ranges::min(a, std::ranges::less{}, proj); in test_range()

12