[rocm-libraries] ROCm/rocm-libraries#4355 (commit e7f6909)

[CK TILE] Refactor sequence_reverse_inclusive_scan

## Proposed changes

Refactor ck tile `sequence_reverse_inclusive_scan` from recursive to
for-loop.

Tracking issue: #4229

This pull request introduces a new lightweight array type,
`static_array`, and refactors the sequence utilities to use it for
improved constexpr support and simplicity. The changes also include
updates to the build system to add container-related tests.

**Core Library Improvements:**

* Added a new header `static_array.hpp` that defines the `static_array`
type, a constexpr-friendly array with basic accessors and no custom
constructors.
* Updated includes in `core.hpp` and `sequence.hpp` to import
`static_array`.
[[1]](diffhunk://#diff-14b406eccf59794051a16c0c9c1a7e11234324bfdd107a5bbe0f173cd25bcddcR44)
[[2]](diffhunk://#diff-5042e5b47bb2ba78bbab2d284338cf0503bc8fb76a7d631cc2684ad6ca832a76R7)

**Refactoring to Use `static_array`:**

* Refactored sequence utilities in `sequence.hpp` to use `static_array`
instead of the previously forward-declared `array` type, including in
histogram and array generation logic.
[[1]](diffhunk://#diff-5042e5b47bb2ba78bbab2d284338cf0503bc8fb76a7d631cc2684ad6ca832a76L1108-R1133)
[[2]](diffhunk://#diff-5042e5b47bb2ba78bbab2d284338cf0503bc8fb76a7d631cc2684ad6ca832a76L1130-R1146)
* Rewrote the implementation of `sequence_reverse_inclusive_scan` to use
`static_array` for intermediate storage, improving constexpr evaluation
and clarity.

**Build System and Testing:**

* Added a new test subdirectory for container tests and a GoogleTest
executable for `unit_sequence.cpp` to the CMake build configuration.
[[1]](diffhunk://#diff-5d35ff7555d3f0b438d45cde06b661eb1332cdbec66287ac7ec3c478d688aae5R5)
[[2]](diffhunk://#diff-1f54f0d2b431b7fc74f7b4ffb66e80c381c904c3383b1d27987467e3482d6d7aR1-R7)

Co-authored-by: Illia Silin <98187287+illsilin@users.noreply.github.com>
This commit is contained in:
Cong Ma
2026-02-24 15:52:33 +00:00
committed by assistant-librarian[bot]
parent fc3180120e
commit 3af1a0aafc
6 changed files with 772 additions and 18 deletions

View File

@@ -2,3 +2,4 @@
# SPDX-License-Identifier: MIT
add_subdirectory(arch)
add_subdirectory(container)

View File

@@ -0,0 +1,7 @@
# Copyright (c) Advanced Micro Devices, Inc., or its affiliates.
# SPDX-License-Identifier: MIT
add_gtest_executable(ck_tile_unit_sequence unit_sequence.cpp)
if(result EQUAL 0)
target_link_libraries(ck_tile_unit_sequence PRIVATE utility)
endif()

View File

@@ -0,0 +1,677 @@
// Copyright (c) Advanced Micro Devices, Inc., or its affiliates.
// SPDX-License-Identifier: MIT
#include <gtest/gtest.h>
#include "ck_tile/core/container/sequence.hpp"
using namespace ck_tile;
// Test basic Sequence construction and properties
TEST(Sequence, BasicConstruction)
{
using Seq = sequence<1, 2, 3, 4, 5>;
EXPECT_EQ(Seq::size(), 5);
}
TEST(Sequence, EmptySequence)
{
using Seq = sequence<>;
EXPECT_EQ(Seq::size(), 0);
}
// Test at() method
TEST(Sequence, AtRuntime)
{
using Seq = sequence<10, 20, 30, 40>;
EXPECT_EQ(Seq::at(0), 10);
EXPECT_EQ(Seq::at(1), 20);
EXPECT_EQ(Seq::at(2), 30);
EXPECT_EQ(Seq::at(3), 40);
}
TEST(Sequence, AtCompileTime)
{
using Seq = sequence<10, 20, 30, 40>;
EXPECT_EQ(Seq::at(number<0>{}), 10);
EXPECT_EQ(Seq::at(number<1>{}), 20);
EXPECT_EQ(Seq::at(number<2>{}), 30);
EXPECT_EQ(Seq::at(number<3>{}), 40);
}
TEST(Sequence, OperatorBracket)
{
constexpr auto seq = sequence<5, 10, 15>{};
EXPECT_EQ(seq[number<0>{}], 5);
EXPECT_EQ(seq[number<1>{}], 10);
EXPECT_EQ(seq[number<2>{}], 15);
}
// Test Front() and Back()
TEST(Sequence, FrontBack)
{
using Seq = sequence<100, 200, 300>;
EXPECT_EQ(Seq::front(), 100);
EXPECT_EQ(Seq::back(), 300);
}
TEST(Sequence, FrontBackSingleElement)
{
using Seq = sequence<42>;
EXPECT_EQ(Seq::front(), 42);
EXPECT_EQ(Seq::back(), 42);
}
// Test PushFront and PushBack
TEST(Sequence, PushFront)
{
using Seq = sequence<2, 3, 4>;
using Result = decltype(Seq::push_front(sequence<1>{}));
using Expected = sequence<1, 2, 3, 4>;
EXPECT_TRUE((std::is_same_v<Result, Expected>));
}
TEST(Sequence, PushFrontnumbers)
{
using Seq = sequence<3, 4>;
using Result = decltype(Seq::push_front(number<1>{}, number<2>{}));
using Expected = sequence<1, 2, 3, 4>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
TEST(Sequence, PushBack)
{
using Seq = sequence<1, 2, 3>;
using Result = decltype(Seq::push_back(sequence<4, 5>{}));
using Expected = sequence<1, 2, 3, 4, 5>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
TEST(Sequence, PushBacknumbers)
{
using Seq = sequence<1, 2>;
using Result = decltype(Seq::push_back(number<3>{}, number<4>{}));
using Expected = sequence<1, 2, 3, 4>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
// Test PopFront and PopBack
TEST(Sequence, PopFront)
{
using Seq = sequence<1, 2, 3, 4>;
using Result = decltype(Seq::pop_front());
using Expected = sequence<2, 3, 4>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
TEST(Sequence, PopBack)
{
using Seq = sequence<1, 2, 3, 4>;
using Result = decltype(Seq::pop_back());
using Expected = sequence<1, 2, 3>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
// Test Extract
TEST(Sequence, ExtractBynumbers)
{
using Seq = sequence<10, 20, 30, 40, 50>;
using Result = decltype(Seq::extract(number<0>{}, number<2>{}, number<4>{}));
using Expected = sequence<10, 30, 50>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
TEST(Sequence, ExtractBySequence)
{
using Seq = sequence<10, 20, 30, 40, 50>;
using Result = decltype(Seq::extract(sequence<1, 3>{}));
using Expected = sequence<20, 40>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
// Test Modify
TEST(Sequence, Modify)
{
using Seq = sequence<1, 2, 3, 4>;
using Result = decltype(Seq::modify(number<2>{}, number<99>{}));
using Expected = sequence<1, 2, 99, 4>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
// Test Transform
TEST(Sequence, Transform)
{
using Seq = sequence<1, 2, 3, 4>;
auto double_it = [](auto x) { return 2 * x; };
using Result = decltype(Seq::transform(double_it));
using Expected = sequence<2, 4, 6, 8>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
// Test Reverse
TEST(Sequence, Reverse)
{
using Seq = sequence<1, 2, 3, 4, 5>;
using Result = decltype(Seq::reverse());
using Expected = sequence<5, 4, 3, 2, 1>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
TEST(Sequence, ReverseSingleElement)
{
using Seq = sequence<42>;
using Result = decltype(Seq::reverse());
using Expected = sequence<42>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
// Test ReorderGivenNew2Old
TEST(Sequence, ReorderGivenNew2Old)
{
using Seq = sequence<10, 20, 30, 40>;
using Result = decltype(Seq::reorder_new_to_old(sequence<3, 1, 2, 0>{}));
using Expected = sequence<40, 20, 30, 10>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
// Test ReorderGivenOld2New
TEST(Sequence, ReorderGivenOld2New)
{
using Seq = sequence<10, 20, 30, 40>;
using Result = decltype(Seq::reorder_old_to_new(sequence<3, 1, 2, 0>{}));
using Expected = sequence<40, 20, 30, 10>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
// Test arithmetic_sequence_gen
TEST(SequenceGen, ArithmeticSequence)
{
using Result = typename arithmetic_sequence_gen<0, 5, 1>::type;
using Expected = sequence<0, 1, 2, 3, 4>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
TEST(SequenceGen, ArithmeticSequenceWithIncrement)
{
using Result = typename arithmetic_sequence_gen<0, 10, 2>::type;
using Expected = sequence<0, 2, 4, 6, 8>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
TEST(SequenceGen, ArithmeticSequenceNegativeIncrement)
{
using Result = typename arithmetic_sequence_gen<10, 5, -1>::type;
using Expected = sequence<10, 9, 8, 7, 6>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
TEST(SequenceGen, ArithmeticSequenceEmpty)
{
using Result = typename arithmetic_sequence_gen<5, 5, 1>::type;
using Expected = sequence<>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
// Test uniform_sequence_gen
TEST(SequenceGen, UniformSequence)
{
using Result = typename uniform_sequence_gen<5, 42>::type;
using Expected = sequence<42, 42, 42, 42, 42>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
TEST(SequenceGen, UniformSequenceZeroSize)
{
using Result = typename uniform_sequence_gen<0, 42>::type;
using Expected = sequence<>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
// Test make_index_sequence
TEST(SequenceGen, MakeIndexSequence)
{
using Result = make_index_sequence<5>;
using Expected = sequence<0, 1, 2, 3, 4>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
TEST(SequenceGen, MakeIndexSequenceZero)
{
using Result = make_index_sequence<0>;
using Expected = sequence<>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
// Test sequence_merge
TEST(SequenceMerge, MergeTwoSequences)
{
using Seq1 = sequence<1, 2, 3>;
using Seq2 = sequence<4, 5, 6>;
using Result = typename sequence_merge<Seq1, Seq2>::type;
using Expected = sequence<1, 2, 3, 4, 5, 6>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
TEST(SequenceMerge, MergeMultipleSequences)
{
using Seq1 = sequence<1, 2>;
using Seq2 = sequence<3, 4>;
using Seq3 = sequence<5, 6>;
using Result = typename sequence_merge<Seq1, Seq2, Seq3>::type;
using Expected = sequence<1, 2, 3, 4, 5, 6>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
TEST(SequenceMerge, MergeSingleSequence)
{
using Seq = sequence<1, 2, 3>;
using Result = typename sequence_merge<Seq>::type;
using Expected = sequence<1, 2, 3>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
// Test sequence_split
TEST(SequenceSplit, SplitInMiddle)
{
using Seq = sequence<1, 2, 3, 4, 5, 6>;
using Split = sequence_split<Seq, 3>;
using ExpectedLeft = sequence<1, 2, 3>;
using ExpectedRight = sequence<4, 5, 6>;
EXPECT_TRUE((std::is_same<typename Split::left_type, ExpectedLeft>::value));
EXPECT_TRUE((std::is_same<typename Split::right_type, ExpectedRight>::value));
}
TEST(SequenceSplit, SplitAtBeginning)
{
using Seq = sequence<1, 2, 3, 4>;
using Split = sequence_split<Seq, 0>;
using ExpectedLeft = sequence<>;
using ExpectedRight = sequence<1, 2, 3, 4>;
EXPECT_TRUE((std::is_same<typename Split::left_type, ExpectedLeft>::value));
EXPECT_TRUE((std::is_same<typename Split::right_type, ExpectedRight>::value));
}
TEST(SequenceSplit, SplitAtEnd)
{
using Seq = sequence<1, 2, 3, 4>;
using Split = sequence_split<Seq, 4>;
using ExpectedLeft = sequence<1, 2, 3, 4>;
using ExpectedRight = sequence<>;
EXPECT_TRUE((std::is_same<typename Split::left_type, ExpectedLeft>::value));
EXPECT_TRUE((std::is_same<typename Split::right_type, ExpectedRight>::value));
}
// Test sequence_sort
TEST(SequenceSort, SortAscending)
{
using Seq = sequence<5, 2, 8, 1, 9>;
using Result = typename sequence_sort<Seq, less<index_t>>::type;
using Expected = sequence<1, 2, 5, 8, 9>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
// TEST(SequenceSort, SortDescending)
// {
// // Create a greater-than comparator
// struct greater
// {
// __host__ constexpr bool operator()(index_t x, index_t y) const { return x > y; }
// };
// using Seq = sequence<5, 2, 8, 1, 9>;
// using Result = typename sequence_sort<Seq, greater>::type;
// using Expected = sequence<9, 8, 5, 2, 1>;
// static_assert((std::is_same<Result, Expected>::value));
// EXPECT_TRUE((std::is_same<Result, Expected>::value));
// }
TEST(SequenceSort, SortAlreadySorted)
{
using Seq = sequence<1, 2, 3, 4, 5>;
using Result = typename sequence_sort<Seq, less<index_t>>::type;
using Expected = sequence<1, 2, 3, 4, 5>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
TEST(SequenceSort, SortWithDuplicates)
{
using Seq = sequence<3, 1, 4, 1, 5, 9, 2, 6, 5>;
using Result = typename sequence_sort<Seq, less<index_t>>::type;
using Expected = sequence<1, 1, 2, 3, 4, 5, 5, 6, 9>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
TEST(SequenceSort, SortEmptySequence)
{
using Seq = sequence<>;
using Result = typename sequence_sort<Seq, less<index_t>>::type;
using Expected = sequence<>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
TEST(SequenceSort, SortSingleElement)
{
using Seq = sequence<42>;
using Result = typename sequence_sort<Seq, less<index_t>>::type;
using Expected = sequence<42>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
// Test sequence_unique_sort
TEST(SequenceUniqueSort, UniqueSort)
{
using Seq = sequence<3, 1, 4, 1, 5, 9, 2, 6, 5>;
using Result = typename sequence_unique_sort<Seq, less<index_t>, equal<index_t>>::type;
using Expected = sequence<1, 2, 3, 4, 5, 6, 9>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
TEST(SequenceUniqueSort, UniqueSortNoDuplicates)
{
using Seq = sequence<5, 2, 8, 1, 9>;
using Result = typename sequence_unique_sort<Seq, less<index_t>, equal<index_t>>::type;
using Expected = sequence<1, 2, 5, 8, 9>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
TEST(SequenceUniqueSort, UniqueSortAllSame)
{
using Seq = sequence<5, 5, 5, 5>;
using Result = typename sequence_unique_sort<Seq, less<index_t>, equal<index_t>>::type;
using Expected = sequence<5>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
// Test is_valid_sequence_map
TEST(SequenceMap, ValidMap)
{
using Map = sequence<0, 1, 2, 3>;
EXPECT_TRUE((is_valid_sequence_map<Map>::value));
}
TEST(SequenceMap, ValidMapPermuted)
{
using Map = sequence<2, 0, 3, 1>;
EXPECT_TRUE((is_valid_sequence_map<Map>::value));
}
TEST(SequenceMap, InvalidMapDuplicate)
{
using Map = sequence<0, 1, 1, 3>;
EXPECT_FALSE((is_valid_sequence_map<Map>::value));
}
TEST(SequenceMap, InvalidMapMissing)
{
using Map = sequence<0, 1, 3, 4>;
EXPECT_FALSE((is_valid_sequence_map<Map>::value));
}
// Test sequence_map_inverse
// Note: sequence_map_inverse inverts a mapping where Map[i] = j means old position i maps to new
// position j The inverse gives us new position i came from old position inverse[i]
TEST(SequenceMapInverse, InverseMap)
{
// Map = <2, 0, 3, 1> means: old[0]->new[2], old[1]->new[0], old[2]->new[3], old[3]->new[1]
// Inverse should be: new[0]<-old[1], new[1]<-old[3], new[2]<-old[0], new[3]<-old[2]
using Map = sequence<2, 0, 3, 1>;
using Result = typename sequence_map_inverse<Map>::type;
// Verify by checking that Map[Result[i]] == i for all i
EXPECT_EQ((Map::at(number<Result::at(number<0>{})>{}) == 0), true);
EXPECT_EQ((Map::at(number<Result::at(number<1>{})>{}) == 1), true);
EXPECT_EQ((Map::at(number<Result::at(number<2>{})>{}) == 2), true);
EXPECT_EQ((Map::at(number<Result::at(number<3>{})>{}) == 3), true);
}
TEST(SequenceMapInverse, InverseIdentityMap)
{
using Map = sequence<0, 1, 2, 3>;
using Result = typename sequence_map_inverse<Map>::type;
// Verify by checking that Map[Result[i]] == i for all i (same as the other test)
EXPECT_EQ((Map::at(number<Result::at(number<0>{})>{}) == 0), true);
EXPECT_EQ((Map::at(number<Result::at(number<1>{})>{}) == 1), true);
EXPECT_EQ((Map::at(number<Result::at(number<2>{})>{}) == 2), true);
EXPECT_EQ((Map::at(number<Result::at(number<3>{})>{}) == 3), true);
}
// Test sequence operators
TEST(SequenceOperators, Equality)
{
constexpr auto seq1 = sequence<1, 2, 3>{};
constexpr auto seq2 = sequence<1, 2, 3>{};
constexpr auto seq3 = sequence<1, 2, 4>{};
EXPECT_TRUE(seq1 == seq2);
EXPECT_FALSE(seq1 == seq3);
}
TEST(SequenceOperators, Addition)
{
using Seq1 = sequence<1, 2, 3>;
using Seq2 = sequence<4, 5, 6>;
using Result = decltype(Seq1{} + Seq2{});
using Expected = sequence<5, 7, 9>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
TEST(SequenceOperators, Subtraction)
{
using Seq1 = sequence<10, 20, 30>;
using Seq2 = sequence<1, 2, 3>;
using Result = decltype(Seq1{} - Seq2{});
using Expected = sequence<9, 18, 27>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
TEST(SequenceOperators, Multiplication)
{
using Seq1 = sequence<2, 3, 4>;
using Seq2 = sequence<5, 6, 7>;
using Result = decltype(Seq1{} * Seq2{});
using Expected = sequence<10, 18, 28>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
TEST(SequenceOperators, Division)
{
using Seq1 = sequence<10, 20, 30>;
using Seq2 = sequence<2, 4, 5>;
using Result = decltype(Seq1{} / Seq2{});
using Expected = sequence<5, 5, 6>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
TEST(SequenceOperators, Modulo)
{
using Seq1 = sequence<10, 20, 30>;
using Seq2 = sequence<3, 7, 8>;
using Result = decltype(Seq1{} % Seq2{});
using Expected = sequence<1, 6, 6>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
TEST(SequenceOperators, AdditionWithnumber)
{
using Seq = sequence<1, 2, 3>;
using Result = decltype(Seq{} + number<10>{});
using Expected = sequence<11, 12, 13>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
TEST(SequenceOperators, SubtractionWithnumber)
{
using Seq = sequence<10, 20, 30>;
using Result = decltype(Seq{} - number<5>{});
using Expected = sequence<5, 15, 25>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
TEST(SequenceOperators, MultiplicationWithnumber)
{
using Seq = sequence<2, 3, 4>;
using Result = decltype(Seq{} * number<3>{});
using Expected = sequence<6, 9, 12>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
TEST(SequenceOperators, DivisionWithnumber)
{
using Seq = sequence<10, 20, 30>;
using Result = decltype(Seq{} / number<5>{});
using Expected = sequence<2, 4, 6>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
TEST(SequenceOperators, numberAddition)
{
using Seq = sequence<1, 2, 3>;
using Result = decltype(number<10>{} + Seq{});
using Expected = sequence<11, 12, 13>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
TEST(SequenceOperators, numberMultiplication)
{
using Seq = sequence<2, 3, 4>;
using Result = decltype(number<3>{} * Seq{});
using Expected = sequence<6, 9, 12>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
// Test helper functions
TEST(SequenceHelpers, MergeSequences)
{
using Seq1 = sequence<1, 2>;
using Seq2 = sequence<3, 4>;
using Seq3 = sequence<5, 6>;
using Result = decltype(merge_sequences(Seq1{}, Seq2{}, Seq3{}));
using Expected = sequence<1, 2, 3, 4, 5, 6>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
TEST(SequenceHelpers, TransformSequencesSingle)
{
auto double_it = [](auto x) { return 2 * x; };
using Seq = sequence<1, 2, 3>;
using Result = decltype(transform_sequences(double_it, Seq{}));
using Expected = sequence<2, 4, 6>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
TEST(SequenceHelpers, TransformSequencesTwo)
{
auto add = [](auto x, auto y) { return x + y; };
using Seq1 = sequence<1, 2, 3>;
using Seq2 = sequence<4, 5, 6>;
using Result = decltype(transform_sequences(add, Seq1{}, Seq2{}));
using Expected = sequence<5, 7, 9>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
TEST(SequenceHelpers, TransformSequencesThree)
{
auto add3 = [](auto x, auto y, auto z) { return x + y + z; };
using Seq1 = sequence<1, 2, 3>;
using Seq2 = sequence<4, 5, 6>;
using Seq3 = sequence<7, 8, 9>;
using Result = decltype(transform_sequences(add3, Seq1{}, Seq2{}, Seq3{}));
using Expected = sequence<12, 15, 18>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
TEST(SequenceHelpers, ReduceOnSequence)
{
auto add = [](auto x, auto y) { return x + y; };
constexpr auto seq = sequence<1, 2, 3, 4, 5>{};
constexpr auto result = reduce_on_sequence(seq, add, number<0>{});
EXPECT_EQ(result, 15);
}
TEST(SequenceHelpers, SequenceAnyOf)
{
auto is_even = [](auto x) { return x % 2 == 0; };
constexpr auto seq1 = sequence<1, 3, 5, 7>{};
constexpr auto seq2 = sequence<1, 3, 4, 7>{};
EXPECT_FALSE(sequence_any_of(seq1, is_even));
EXPECT_TRUE(sequence_any_of(seq2, is_even));
}
TEST(SequenceHelpers, SequenceAllOf)
{
auto is_positive = [](auto x) { return x > 0; };
constexpr auto seq1 = sequence<1, 2, 3, 4>{};
constexpr auto seq2 = sequence<1, -2, 3, 4>{};
EXPECT_TRUE(sequence_all_of(seq1, is_positive));
EXPECT_FALSE(sequence_all_of(seq2, is_positive));
}
// Test scan operations
TEST(SequenceScan, ReverseInclusiveScan)
{
using Seq = sequence<1, 2, 3, 4>;
using Result = decltype(reverse_inclusive_scan_sequence(Seq{}, plus<index_t>{}, number<0>{}));
using Expected = sequence<10, 9, 7, 4>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
TEST(SequenceScan, ReverseExclusiveScan)
{
using Seq = sequence<1, 2, 3, 4>;
using Result = decltype(reverse_exclusive_scan_sequence(Seq{}, plus<index_t>{}, number<0>{}));
using Expected = sequence<9, 7, 4, 0>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
TEST(SequenceScan, InclusiveScan)
{
using Seq = sequence<1, 2, 3, 4>;
using Result = decltype(inclusive_scan_sequence(Seq{}, plus<index_t>{}, number<0>{}));
using Expected = sequence<1, 3, 6, 10>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
// Test pick and modify operations
TEST(SequencePickModify, PickElementsByIds)
{
using Seq = sequence<10, 20, 30, 40, 50>;
using Ids = sequence<0, 2, 4>;
using Result = decltype(pick_sequence_elements_by_ids(Seq{}, Ids{}));
using Expected = sequence<10, 30, 50>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
TEST(SequencePickModify, PickElementsByMask)
{
using Seq = sequence<10, 20, 30, 40, 50>;
using Mask = sequence<1, 0, 1, 0, 1>;
using Result = decltype(pick_sequence_elements_by_mask(Seq{}, Mask{}));
using Expected = sequence<10, 30, 50>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
TEST(SequencePickModify, ModifyElementsByIds)
{
using Seq = sequence<10, 20, 30, 40, 50>;
using Values = sequence<99, 88>;
using Ids = sequence<1, 3>;
using Result = decltype(modify_sequence_elements_by_ids(Seq{}, Values{}, Ids{}));
using Expected = sequence<10, 99, 30, 88, 50>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
// Test sequence_reduce
TEST(SequenceReduce, ReduceTwoSequences)
{
using Seq1 = sequence<1, 2, 3>;
using Seq2 = sequence<4, 5, 6>;
using Result = typename sequence_reduce<plus<index_t>, Seq1, Seq2>::type;
using Expected = sequence<5, 7, 9>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}
TEST(SequenceReduce, ReduceMultipleSequences)
{
using Seq1 = sequence<1, 2>;
using Seq2 = sequence<3, 4>;
using Seq3 = sequence<5, 6>;
using Result = typename sequence_reduce<plus<index_t>, Seq1, Seq2, Seq3>::type;
using Expected = sequence<9, 12>;
EXPECT_TRUE((std::is_same<Result, Expected>::value));
}