Files
project_6/cccl_upstream/test/stdpar/tests/adjacent_difference.cpp
muh-bot 2a7ca101d7 feat(cccl): integrate missing CCCL directories — python/, ci/, .agent/, docs/, test/
Sparse-checkout from NVIDIA/cccl main branch to complete cccl_upstream:

Added:
- python/cuda_cccl/ (226 files) — Python bindings for device-level algorithms
  Critical for muh toolchain: cuda.compute.reduce_into, scan, radix_sort, etc.
  Includes 204 .py files with full test coverage for all 27 algorithms
- ci/ (163 files) — Build/test infrastructure
  build_cub.sh, test_cub.sh, build_and_test_targets.sh, matrix.yaml
  Directly maps to our [INFRA-CI] and [INFRA-BUILD] items
- .agent/skills/ (7 files) — NVIDIA's own agent skills for CCCL
  cccl-style/SKILL.md, cccl-test/SKILL.md, sass-diff/SKILL.md
- docs/ (491 files) — Official CCCL documentation
  CI references, CMake guides, Python compute docs, libcudacxx PTX docs
- test/ (12 files) — Top-level integration tests (cuda_smoke, stdpar)
- Root configs: .clang-format, .clang-tidy, CONTRIBUTING.md, pyproject.toml
- CLAUDE.md symlink → AGENTS.md (NVIDIA's standard)

cccl_upstream now mirrors full NVIDIA/cccl structure:
  Before: 42M (cub + thrust + libcudacxx + cudax + c + examples + benchmarks)
  After:  53M (+python +ci +docs +.agent +test +configs)

This completes the CCCL base needed for:
- [muh-bench] items: ci/util/build_and_test_targets.sh for targeted builds
- [CCCL-verify] items: python/cuda_cccl/tests/ as reference implementations
- [CCCL-test] items: ci/test_cub.sh, ci/test_thrust.sh
- Agent workflow: .agent/skills/ for consistent style and test patterns
2026-08-07 02:34:33 +00:00

53 lines
975 B
C++

#include <algorithm>
#include <cstddef>
#include <execution>
#include <numeric>
#include <vector>
int main()
{
constexpr std::size_t N = 1 << 16;
auto all_one = [](const int val) {
return val == 1;
};
std::vector<int> in(N);
std::vector<int> out(N);
std::iota(in.begin(), in.end(), 0);
// Default op (difference)
std::adjacent_difference(std::execution::par, in.begin(), in.end(), out.begin());
if (out[0] != in[0])
{
return 1;
}
if (!std::all_of(out.begin() + 1, out.end(), all_one))
{
return 1;
}
// Custom binary op: sum of neighbors: out[0] = in[0]
std::fill(out.begin(), out.end(), 0);
std::adjacent_difference(std::execution::par, in.begin(), in.end(), out.begin(), [](int x, int y) {
return x + y;
});
if (out[0] != in[0])
{
return 1;
}
for (std::size_t i = 1; i < N; ++i)
{
const int expected = in[i] + in[i - 1];
if (out[i] != expected)
{
return 1;
}
}
return 0;
}