Function test

test/source/algorithm/for_each.cpp:50–108

template <typename Sch, typename F, typename Proj = std::identity>
void test(Sch &&sch, F add_one, Proj proj = {}) {
  //
  int count = 0;

  std::vector<int> v;

  for (auto i = 0; i < 10'000; i++) {
    v.push_back(i);
  }

  check(v, count++);

  {
    // Check grain = 1 case:
    lf::sync_wait(sch, lf::for_each, v, add_one, proj);
    check(v, count++);

    // Check grain > 1 and n % grain == 0 case:

    REQUIRE(v.size() % 100 == 0);
    lf::sync_wait(sch, lf::for_each, v, 100, add_one);
    check(v, count++);

    // Check grain > 1 and n % grain != 0 case:
    REQUIRE(v.size() % 300 != 0);
    lf::sync_wait(sch, lf::for_each, v, 300, add_one);
    check(v, count++);

    // Check grain > size case:
    REQUIRE(v.size() < 20'000);
    lf::sync_wait(sch, lf::for_each, v, 20'000, add_one);
    check(v, count++);
  }

#ifndef _MSC_VER

  {
    // ----------- Now with small inputs ----------- //

    for (int i = 1; i < 4; ++i) {

      std::vector<int> small{0, 0, 0};

      lf::sync_wait(sch, lf::for_each, std::span(small.data(), 3), i, add_one);
      REQUIRE(small == std::vector<int>{1, 1, 1});

      lf::sync_wait(sch, lf::for_each, std::span(small.data(), 2), i, add_one);
      REQUIRE(small == std::vector<int>{2, 2, 1});

      lf::sync_wait(sch, lf::for_each, std::span(small.data(), 1), i, add_one);
      REQUIRE(small == std::vector<int>{3, 2, 1});

      lf::sync_wait(sch, lf::for_each, std::span(small.data(), 0), i, add_one);
      REQUIRE(small == std::vector<int>{3, 2, 1});
    }
  }

#endif