mirror/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout.git synced 2025-07-12 14:54:10 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

fix for constexpr disabled

Browse source 
add sprout::adaptors::sized
This commit is contained in:
bolero-MURAKAMI 2012-06-16 00:08:42 +09:00
parent 2b8a8662af
commit bcd7674cc0
84 changed files with 1758 additions and 1365 deletions
Download patch file Download diff file Expand all files Collapse all files

24
libs/algorithm/test/bogo_sort.cpp
View file

@ -21,7 +21,7 @@ namespace testspr {
arr1,
sprout::random::default_random_engine(SPROUT_UNIQUE_SEED)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 5>{{1, 2, 3, 4, 5}}
));
@ -31,7 +31,7 @@ namespace testspr {
arr1,
sprout::random::default_random_engine(SPROUT_UNIQUE_SEED)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 5>{{1, 2, 3, 4, 5}}
));
@ -43,11 +43,11 @@ namespace testspr {
sprout::sub(arr1, 1, 4),
sprout::random::default_random_engine(SPROUT_UNIQUE_SEED)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 3>{{1, 2, 4}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(sorted),
array<int, 5>{{5, 1, 2, 4, 3}}
));
@ -57,11 +57,11 @@ namespace testspr {
sprout::sub(arr1, 1, 4),
sprout::random::default_random_engine(SPROUT_UNIQUE_SEED)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 3>{{1, 2, 4}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(sorted),
array<int, 5>{{5, 1, 2, 4, 3}}
));
@ -77,7 +77,7 @@ namespace testspr {
sprout::random::default_random_engine(SPROUT_UNIQUE_SEED),
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 5>{{1, 2, 3, 4, 5}}
));
@ -88,7 +88,7 @@ namespace testspr {
sprout::random::default_random_engine(SPROUT_UNIQUE_SEED),
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 5>{{1, 2, 3, 4, 5}}
));
@ -101,11 +101,11 @@ namespace testspr {
sprout::random::default_random_engine(SPROUT_UNIQUE_SEED),
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 3>{{1, 2, 4}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(sorted),
array<int, 5>{{5, 1, 2, 4, 3}}
));
@ -116,11 +116,11 @@ namespace testspr {
sprout::random::default_random_engine(SPROUT_UNIQUE_SEED),
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 3>{{1, 2, 4}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(sorted),
array<int, 5>{{5, 1, 2, 4, 3}}
));

40
libs/algorithm/test/bogo_sort_result.cpp
View file

@ -22,7 +22,7 @@ namespace testspr {
arr1,
g
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get<0>(sorted),
array<int, 5>{{1, 2, 3, 4, 5}}
));
@ -30,14 +30,14 @@ namespace testspr {
sprout::get<0>(sorted),
sprout::get<1>(sorted)
);
TESTSPR_DOUBLE_ASSERT(sprout::get<1>(sorted) == sprout::get<1>(sorted2));
TESTSPR_BOTH_ASSERT(sprout::get<1>(sorted) == sprout::get<1>(sorted2));
}
{
SPROUT_STATIC_CONSTEXPR auto sorted = sprout::fit::bogo_sort_result(
arr1,
g
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get<0>(sorted),
array<int, 5>{{1, 2, 3, 4, 5}}
));
@ -45,7 +45,7 @@ namespace testspr {
sprout::get<0>(sorted),
sprout::get<1>(sorted)
);
TESTSPR_DOUBLE_ASSERT(sprout::get<1>(sorted) == sprout::get<1>(sorted2));
TESTSPR_BOTH_ASSERT(sprout::get<1>(sorted) == sprout::get<1>(sorted2));
}
// ソート
// 範囲の切り出し
@ -54,11 +54,11 @@ namespace testspr {
sprout::sub(arr1, 1, 4),
g
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get<0>(sorted),
array<int, 3>{{1, 2, 4}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(sprout::get<0>(sorted)),
array<int, 5>{{5, 1, 2, 4, 3}}
));
@ -66,18 +66,18 @@ namespace testspr {
sprout::get<0>(sorted),
sprout::get<1>(sorted)
);
TESTSPR_DOUBLE_ASSERT(sprout::get<1>(sorted) == sprout::get<1>(sorted2));
TESTSPR_BOTH_ASSERT(sprout::get<1>(sorted) == sprout::get<1>(sorted2));
}
{
SPROUT_STATIC_CONSTEXPR auto sorted = sprout::fit::bogo_sort_result(
sprout::sub(arr1, 1, 4),
g
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get<0>(sorted),
array<int, 3>{{1, 2, 4}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(sprout::get<0>(sorted)),
array<int, 5>{{5, 1, 2, 4, 3}}
));
@ -85,7 +85,7 @@ namespace testspr {
sprout::get<0>(sorted),
sprout::get<1>(sorted)
);
TESTSPR_DOUBLE_ASSERT(sprout::get<1>(sorted) == sprout::get<1>(sorted2));
TESTSPR_BOTH_ASSERT(sprout::get<1>(sorted) == sprout::get<1>(sorted2));
}
}
{
@ -99,7 +99,7 @@ namespace testspr {
g,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get<0>(sorted),
array<int, 5>{{1, 2, 3, 4, 5}}
));
@ -107,7 +107,7 @@ namespace testspr {
sprout::get<0>(sorted),
sprout::get<1>(sorted)
);
TESTSPR_DOUBLE_ASSERT(sprout::get<1>(sorted) == sprout::get<1>(sorted2));
TESTSPR_BOTH_ASSERT(sprout::get<1>(sorted) == sprout::get<1>(sorted2));
}
{
SPROUT_STATIC_CONSTEXPR auto sorted = sprout::fit::bogo_sort_result(
@ -115,7 +115,7 @@ namespace testspr {
g,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get<0>(sorted),
array<int, 5>{{1, 2, 3, 4, 5}}
));
@ -123,7 +123,7 @@ namespace testspr {
sprout::get<0>(sorted),
sprout::get<1>(sorted)
);
TESTSPR_DOUBLE_ASSERT(sprout::get<1>(sorted) == sprout::get<1>(sorted2));
TESTSPR_BOTH_ASSERT(sprout::get<1>(sorted) == sprout::get<1>(sorted2));
}
// ソート
// 範囲の切り出し
@ -133,11 +133,11 @@ namespace testspr {
g,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get<0>(sorted),
array<int, 3>{{1, 2, 4}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(sprout::get<0>(sorted)),
array<int, 5>{{5, 1, 2, 4, 3}}
));
@ -145,7 +145,7 @@ namespace testspr {
sprout::get<0>(sorted),
sprout::get<1>(sorted)
);
TESTSPR_DOUBLE_ASSERT(sprout::get<1>(sorted) == sprout::get<1>(sorted2));
TESTSPR_BOTH_ASSERT(sprout::get<1>(sorted) == sprout::get<1>(sorted2));
}
{
SPROUT_STATIC_CONSTEXPR auto sorted = sprout::fit::bogo_sort_result(
@ -153,11 +153,11 @@ namespace testspr {
g,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get<0>(sorted),
array<int, 3>{{1, 2, 4}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(sprout::get<0>(sorted)),
array<int, 5>{{5, 1, 2, 4, 3}}
));
@ -165,7 +165,7 @@ namespace testspr {
sprout::get<0>(sorted),
sprout::get<1>(sorted)
);
TESTSPR_DOUBLE_ASSERT(sprout::get<1>(sorted) == sprout::get<1>(sorted2));
TESTSPR_BOTH_ASSERT(sprout::get<1>(sorted) == sprout::get<1>(sorted2));
}
}
}

16
libs/algorithm/test/copy.cpp
View file

@ -22,7 +22,7 @@ namespace testspr {
sprout::begin(arr1) + 8,
arr2
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 10>{{3, 4, 5, 6, 7, 8, 0, 0, 0, 0}}
));
@ -33,7 +33,7 @@ namespace testspr {
sprout::begin(arr1) + 8,
arr2
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 6>{{3, 4, 5, 6, 7, 8}}
));
@ -46,7 +46,7 @@ namespace testspr {
sprout::begin(arr1) + 8,
arr3
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 4>{{3, 4, 5, 6}}
));
@ -57,7 +57,7 @@ namespace testspr {
sprout::begin(arr1) + 8,
arr3
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 4>{{3, 4, 5, 6}}
));
@ -70,11 +70,11 @@ namespace testspr {
sprout::begin(arr1) + 8,
sprout::sub(arr2, 2, 8)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 6>{{3, 4, 5, 6, 7, 8}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(copied),
array<int, 10>{{0, 0, 3, 4, 5, 6, 7, 8, 0, 0}}
));
@ -85,11 +85,11 @@ namespace testspr {
sprout::begin(arr1) + 8,
sprout::sub(arr2, 2, 8)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 6>{{3, 4, 5, 6, 7, 8}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(copied),
array<int, 10>{{0, 0, 3, 4, 5, 6, 7, 8, 0, 0}}
));

16
libs/algorithm/test/copy_backward.cpp
View file

@ -22,7 +22,7 @@ namespace testspr {
sprout::begin(arr1) + 8,
arr2
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 10>{{0, 0, 0, 0, 3, 4, 5, 6, 7, 8}}
));
@ -33,7 +33,7 @@ namespace testspr {
sprout::begin(arr1) + 8,
arr2
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 6>{{3, 4, 5, 6, 7, 8}}
));
@ -46,7 +46,7 @@ namespace testspr {
sprout::begin(arr1) + 8,
arr3
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 4>{{5, 6, 7, 8}}
));
@ -57,7 +57,7 @@ namespace testspr {
sprout::begin(arr1) + 8,
arr3
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 4>{{5, 6, 7, 8}}
));
@ -70,11 +70,11 @@ namespace testspr {
sprout::begin(arr1) + 8,
sprout::sub(arr2, 2, 8)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 6>{{3, 4, 5, 6, 7, 8}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(copied),
array<int, 10>{{0, 0, 3, 4, 5, 6, 7, 8, 0, 0}}
));
@ -85,11 +85,11 @@ namespace testspr {
sprout::begin(arr1) + 8,
sprout::sub(arr2, 2, 8)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 6>{{3, 4, 5, 6, 7, 8}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(copied),
array<int, 10>{{0, 0, 3, 4, 5, 6, 7, 8, 0, 0}}
));

16
libs/algorithm/test/copy_if.cpp
View file

@ -23,7 +23,7 @@ namespace testspr {
arr2,
testspr::is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 10>{{1, 3, 5, 7, 9, 0, 0, 0, 0, 0}}
));
@ -35,7 +35,7 @@ namespace testspr {
arr2,
testspr::is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 5>{{1, 3, 5, 7, 9}}
));
@ -49,7 +49,7 @@ namespace testspr {
arr3,
testspr::is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 4>{{1, 3, 5, 7}}
));
@ -61,7 +61,7 @@ namespace testspr {
arr3,
testspr::is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 4>{{1, 3, 5, 7}}
));
@ -75,11 +75,11 @@ namespace testspr {
sprout::sub(arr2, 2, 8),
testspr::is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 6>{{1, 3, 5, 7, 9, 0}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(copied),
array<int, 10>{{0, 0, 1, 3, 5, 7, 9, 0, 0, 0}}
));
@ -91,11 +91,11 @@ namespace testspr {
sprout::sub(arr2, 2, 8),
testspr::is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 5>{{1, 3, 5, 7, 9}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(copied),
array<int, 10>{{0, 0, 1, 3, 5, 7, 9, 0, 0, 0}}
));

16
libs/algorithm/test/copy_n.cpp
View file

@ -21,7 +21,7 @@ namespace testspr {
6,
arr2
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 10>{{3, 4, 5, 6, 7, 8, 0, 0, 0, 0}}
));
@ -32,7 +32,7 @@ namespace testspr {
6,
arr2
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 6>{{3, 4, 5, 6, 7, 8}}
));
@ -46,7 +46,7 @@ namespace testspr {
6,
arr3
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 4>{{3, 4, 5, 6}}
));
@ -57,7 +57,7 @@ namespace testspr {
6,
arr3
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 4>{{3, 4, 5, 6}}
));
@ -70,11 +70,11 @@ namespace testspr {
6,
sprout::sub(arr2, 2, 8)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 6>{{3, 4, 5, 6, 7, 8}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(copied),
array<int, 10>{{0, 0, 3, 4, 5, 6, 7, 8, 0, 0}}
));
@ -85,11 +85,11 @@ namespace testspr {
6,
sprout::sub(arr2, 2, 8)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 6>{{3, 4, 5, 6, 7, 8}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(copied),
array<int, 10>{{0, 0, 3, 4, 5, 6, 7, 8, 0, 0}}
));

12
libs/algorithm/test/fill.cpp
View file

@ -19,7 +19,7 @@ namespace testspr {
arr1,
-1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
filled,
array<int, 10>{{-1, -1, -1, -1, -1, -1, -1, -1, -1, -1}}
));
@ -29,7 +29,7 @@ namespace testspr {
arr1,
-1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
filled,
array<int, 10>{{-1, -1, -1, -1, -1, -1, -1, -1, -1, -1}}
));
@ -41,11 +41,11 @@ namespace testspr {
sprout::sub(arr1, 2, 8),
-1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
filled,
array<int, 6>{{-1, -1, -1, -1, -1, -1}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(filled),
array<int, 10>{{1, 2, -1, -1, -1, -1, -1, -1, 9, 10}}
));
@ -55,11 +55,11 @@ namespace testspr {
sprout::sub(arr1, 2, 8),
-1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
filled,
array<int, 6>{{-1, -1, -1, -1, -1, -1}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(filled),
array<int, 10>{{1, 2, -1, -1, -1, -1, -1, -1, 9, 10}}
));

12
libs/algorithm/test/fill_n.cpp
View file

@ -20,7 +20,7 @@ namespace testspr {
4,
-1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
filled,
array<int, 10>{{-1, -1, -1, -1, 5, 6, 7, 8, 9, 10}}
));
@ -31,7 +31,7 @@ namespace testspr {
4,
-1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
filled,
array<int, 4>{{-1, -1, -1, -1}}
));
@ -44,11 +44,11 @@ namespace testspr {
4,
-1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
filled,
array<int, 6>{{-1, -1, -1, -1, 7, 8}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(filled),
array<int, 10>{{1, 2, -1, -1, -1, -1, 7, 8, 9, 10}}
));
@ -59,11 +59,11 @@ namespace testspr {
4,
-1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
filled,
array<int, 4>{{-1, -1, -1, -1}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(filled),
array<int, 10>{{1, 2, -1, -1, -1, -1, 7, 8, 9, 10}}
));

12
libs/algorithm/test/generate.cpp
View file

@ -20,7 +20,7 @@ namespace testspr {
testspr::x2<int>(),
2
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
generated,
array<int, 10>{{2, 4, 8, 16, 32, 64, 128, 256, 512, 1024}}
));
@ -31,7 +31,7 @@ namespace testspr {
testspr::x2<int>(),
2
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
generated,
array<int, 10>{{2, 4, 8, 16, 32, 64, 128, 256, 512, 1024}}
));
@ -44,11 +44,11 @@ namespace testspr {
testspr::x2<int>(),
2
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
generated,
array<int, 6>{{2, 4, 8, 16, 32, 64}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(generated),
array<int, 10>{{1, 2, 2, 4, 8, 16, 32, 64, 9, 10}}
));
@ -59,11 +59,11 @@ namespace testspr {
testspr::x2<int>(),
2
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
generated,
array<int, 6>{{2, 4, 8, 16, 32, 64}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(generated),
array<int, 10>{{1, 2, 2, 4, 8, 16, 32, 64, 9, 10}}
));

12
libs/algorithm/test/generate_n.cpp
View file

@ -21,7 +21,7 @@ namespace testspr {
testspr::x2<int>(),
1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
generated,
array<int, 10>{{1, 2, 4, 8, 5, 6, 7, 8, 9, 10}}
));
@ -33,7 +33,7 @@ namespace testspr {
testspr::x2<int>(),
1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
generated,
array<int, 4>{{1, 2, 4, 8}}
));
@ -47,11 +47,11 @@ namespace testspr {
testspr::x2<int>(),
1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
generated,
array<int, 6>{{1, 2, 4, 8, 7, 8}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(generated),
array<int, 10>{{1, 2, 1, 2, 4, 8, 7, 8, 9, 10}}
));
@ -63,11 +63,11 @@ namespace testspr {
testspr::x2<int>(),
1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
generated,
array<int, 4>{{1, 2, 4, 8}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(generated),
array<int, 10>{{1, 2, 1, 2, 4, 8, 7, 8, 9, 10}}
));

24
libs/algorithm/test/inplace_merge.cpp
View file

@ -19,7 +19,7 @@ namespace testspr {
arr1,
sprout::begin(arr1) + 5
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}}
));
@ -29,7 +29,7 @@ namespace testspr {
arr1,
sprout::begin(arr1) + 5
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}}
));
@ -41,11 +41,11 @@ namespace testspr {
sprout::sub(arr1, 2, 8),
sprout::begin(arr1) + 5
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 6>{{2, 4, 5, 6, 7, 9}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(merged),
array<int, 10>{{1, 3, 2, 4, 5, 6, 7, 9, 8, 10}}
));
@ -55,11 +55,11 @@ namespace testspr {
sprout::sub(arr1, 2, 8),
sprout::begin(arr1) + 5
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 6>{{2, 4, 5, 6, 7, 9}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(merged),
array<int, 10>{{1, 3, 2, 4, 5, 6, 7, 9, 8, 10}}
));
@ -75,7 +75,7 @@ namespace testspr {
sprout::begin(arr1) + 5,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}}
));
@ -86,7 +86,7 @@ namespace testspr {
sprout::begin(arr1) + 5,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}}
));
@ -99,11 +99,11 @@ namespace testspr {
sprout::begin(arr1) + 5,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 6>{{2, 4, 5, 6, 7, 9}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(merged),
array<int, 10>{{1, 3, 2, 4, 5, 6, 7, 9, 8, 10}}
));
@ -114,11 +114,11 @@ namespace testspr {
sprout::begin(arr1) + 5,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 6>{{2, 4, 5, 6, 7, 9}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(merged),
array<int, 10>{{1, 3, 2, 4, 5, 6, 7, 9, 8, 10}}
));

24
libs/algorithm/test/make_heap.cpp
View file

@ -18,7 +18,7 @@ namespace testspr {
SPROUT_STATIC_CONSTEXPR auto heap = sprout::make_heap(
arr1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
heap,
array<int, 10>{{10, 9, 8, 6, 7, 2, 5, 3, 4, 1}}
));
@ -27,7 +27,7 @@ namespace testspr {
SPROUT_STATIC_CONSTEXPR auto heap = sprout::fit::make_heap(
arr1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
heap,
array<int, 10>{{10, 9, 8, 6, 7, 2, 5, 3, 4, 1}}
));
@ -38,11 +38,11 @@ namespace testspr {
SPROUT_STATIC_CONSTEXPR auto heap = sprout::make_heap(
sprout::sub(arr1, 2, 10)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
heap,
array<int, 8>{{9, 6, 8, 2, 5, 3, 4, 1}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(heap),
array<int, 10>{{10, 7, 9, 6, 8, 2, 5, 3, 4, 1}}
));
@ -51,11 +51,11 @@ namespace testspr {
SPROUT_STATIC_CONSTEXPR auto heap = sprout::fit::make_heap(
sprout::sub(arr1, 2, 10)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
heap,
array<int, 8>{{9, 6, 8, 2, 5, 3, 4, 1}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(heap),
array<int, 10>{{10, 7, 9, 6, 8, 2, 5, 3, 4, 1}}
));
@ -70,7 +70,7 @@ namespace testspr {
arr1,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
heap,
array<int, 10>{{10, 9, 8, 6, 7, 2, 5, 3, 4, 1}}
));
@ -80,7 +80,7 @@ namespace testspr {
arr1,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
heap,
array<int, 10>{{10, 9, 8, 6, 7, 2, 5, 3, 4, 1}}
));
@ -92,11 +92,11 @@ namespace testspr {
sprout::sub(arr1, 2, 10),
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
heap,
array<int, 8>{{9, 6, 8, 2, 5, 3, 4, 1}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(heap),
array<int, 10>{{10, 7, 9, 6, 8, 2, 5, 3, 4, 1}}
));
@ -106,11 +106,11 @@ namespace testspr {
sprout::sub(arr1, 2, 10),
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
heap,
array<int, 8>{{9, 6, 8, 2, 5, 3, 4, 1}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(heap),
array<int, 10>{{10, 7, 9, 6, 8, 2, 5, 3, 4, 1}}
));

24
libs/algorithm/test/make_partial_heap.cpp
View file

@ -19,7 +19,7 @@ namespace testspr {
arr1,
sprout::begin(arr1) + 5
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
heap,
array<int, 10>{{5, 4, 1, 3, 2, 10, 9, 8, 7, 6}}
));
@ -29,7 +29,7 @@ namespace testspr {
arr1,
sprout::begin(arr1) + 5
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
heap,
array<int, 5>{{5, 4, 1, 3, 2}}
));
@ -41,11 +41,11 @@ namespace testspr {
sprout::sub(arr1, 2, 10),
sprout::begin(arr1) + 5
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
heap,
array<int, 8>{{3, 1, 2, 9, 8, 6, 5, 4}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(heap),
array<int, 10>{{10, 7, 3, 1, 2, 9, 8, 6, 5, 4}}
));
@ -55,11 +55,11 @@ namespace testspr {
sprout::sub(arr1, 2, 10),
sprout::begin(arr1) + 5
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
heap,
array<int, 3>{{3, 1, 2}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(heap),
array<int, 10>{{10, 7, 3, 1, 2, 9, 8, 6, 5, 4}}
));
@ -75,7 +75,7 @@ namespace testspr {
sprout::begin(arr1) + 5,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
heap,
array<int, 10>{{5, 4, 1, 3, 2, 10, 9, 8, 7, 6}}
));
@ -86,7 +86,7 @@ namespace testspr {
sprout::begin(arr1) + 5,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
heap,
array<int, 5>{{5, 4, 1, 3, 2}}
));
@ -99,11 +99,11 @@ namespace testspr {
sprout::begin(arr1) + 5,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
heap,
array<int, 8>{{3, 1, 2, 9, 8, 6, 5, 4}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(heap),
array<int, 10>{{10, 7, 3, 1, 2, 9, 8, 6, 5, 4}}
));
@ -114,11 +114,11 @@ namespace testspr {
sprout::begin(arr1) + 5,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
heap,
array<int, 3>{{3, 1, 2}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(heap),
array<int, 10>{{10, 7, 3, 1, 2, 9, 8, 6, 5, 4}}
));

32
libs/algorithm/test/merge.cpp
View file

@ -25,7 +25,7 @@ namespace testspr {
sprout::end(arr1_2),
arr2
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 10>{{2, 3, 4, 5, 6, 7, 8, 9, 0, 0}}
));
@ -38,7 +38,7 @@ namespace testspr {
sprout::end(arr1_2),
arr2
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 8>{{2, 3, 4, 5, 6, 7, 8, 9}}
));
@ -53,7 +53,7 @@ namespace testspr {
sprout::end(arr1_2),
arr3
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 4>{{2, 3, 4, 5}}
));
@ -66,7 +66,7 @@ namespace testspr {
sprout::end(arr1_2),
arr3
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 4>{{2, 3, 4, 5}}
));
@ -81,11 +81,11 @@ namespace testspr {
sprout::end(arr1_2),
sprout::sub(arr2, 2, 8)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 6>{{2, 3, 4, 5, 6, 7}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(merged),
array<int, 10>{{0, 0, 2, 3, 4, 5, 6, 7, 0, 0}}
));
@ -98,11 +98,11 @@ namespace testspr {
sprout::end(arr1_2),
sprout::sub(arr2, 2, 8)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 6>{{2, 3, 4, 5, 6, 7}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(merged),
array<int, 10>{{0, 0, 2, 3, 4, 5, 6, 7, 0, 0}}
));
@ -124,7 +124,7 @@ namespace testspr {
arr2,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 10>{{2, 3, 4, 5, 6, 7, 8, 9, 0, 0}}
));
@ -138,7 +138,7 @@ namespace testspr {
arr2,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 8>{{2, 3, 4, 5, 6, 7, 8, 9}}
));
@ -154,7 +154,7 @@ namespace testspr {
arr3,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 4>{{2, 3, 4, 5}}
));
@ -168,7 +168,7 @@ namespace testspr {
arr3,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 4>{{2, 3, 4, 5}}
));
@ -184,11 +184,11 @@ namespace testspr {
sprout::sub(arr2, 2, 8),
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 6>{{2, 3, 4, 5, 6, 7}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(merged),
array<int, 10>{{0, 0, 2, 3, 4, 5, 6, 7, 0, 0}}
));
@ -202,11 +202,11 @@ namespace testspr {
sprout::sub(arr2, 2, 8),
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 6>{{2, 3, 4, 5, 6, 7}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(merged),
array<int, 10>{{0, 0, 2, 3, 4, 5, 6, 7, 0, 0}}
));

24
libs/algorithm/test/nth_element.cpp
View file

@ -19,7 +19,7 @@ namespace testspr {
arr1,
sprout::begin(arr1) + 4
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
nth,
array<int, 10>{{2, 4, 1, 3, 5, 10, 9, 8, 7, 6}}
));
@ -29,7 +29,7 @@ namespace testspr {
arr1,
sprout::begin(arr1) + 4
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
nth,
array<int, 5>{{2, 4, 1, 3, 5}}
));
@ -41,11 +41,11 @@ namespace testspr {
sprout::sub(arr1, 2, 8),
sprout::begin(arr1) + 4
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
nth,
array<int, 6>{{2, 3, 5, 9, 8, 6}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(nth),
array<int, 10>{{10, 7, 2, 3, 5, 9, 8, 6, 4, 1}}
));
@ -55,11 +55,11 @@ namespace testspr {
sprout::sub(arr1, 2, 8),
sprout::begin(arr1) + 4
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
nth,
array<int, 3>{{2, 3, 5}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(nth),
array<int, 10>{{10, 7, 2, 3, 5, 9, 8, 6, 4, 1}}
));
@ -75,7 +75,7 @@ namespace testspr {
sprout::begin(arr1) + 4,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
nth,
array<int, 10>{{2, 4, 1, 3, 5, 10, 9, 8, 7, 6}}
));
@ -86,7 +86,7 @@ namespace testspr {
sprout::begin(arr1) + 4,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
nth,
array<int, 5>{{2, 4, 1, 3, 5}}
));
@ -99,11 +99,11 @@ namespace testspr {
sprout::begin(arr1) + 4,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
nth,
array<int, 6>{{2, 3, 5, 9, 8, 6}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(nth),
array<int, 10>{{10, 7, 2, 3, 5, 9, 8, 6, 4, 1}}
));
@ -114,11 +114,11 @@ namespace testspr {
sprout::begin(arr1) + 4,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
nth,
array<int, 3>{{2, 3, 5}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(nth),
array<int, 10>{{10, 7, 2, 3, 5, 9, 8, 6, 4, 1}}
));

24
libs/algorithm/test/partial_sort.cpp
View file

@ -19,7 +19,7 @@ namespace testspr {
arr1,
sprout::begin(arr1) + 5
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 10>{{1, 2, 3, 4, 5, 9, 8, 7, 10, 6}}
));
@ -29,7 +29,7 @@ namespace testspr {
arr1,
sprout::begin(arr1) + 5
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 5>{{1, 2, 3, 4, 5}}
));
@ -41,11 +41,11 @@ namespace testspr {
sprout::sub(arr1, 2, 8),
sprout::begin(arr1) + 5
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 6>{{2, 3, 4, 9, 8, 7}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(sorted),
array<int, 10>{{5, 1, 2, 3, 4, 9, 8, 7, 10, 6}}
));
@ -55,11 +55,11 @@ namespace testspr {
sprout::sub(arr1, 2, 8),
sprout::begin(arr1) + 5
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 3>{{2, 3, 4}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(sorted),
array<int, 10>{{5, 1, 2, 3, 4, 9, 8, 7, 10, 6}}
));
@ -75,7 +75,7 @@ namespace testspr {
sprout::begin(arr1) + 5,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 10>{{1, 2, 3, 4, 5, 9, 8, 7, 10, 6}}
));
@ -86,7 +86,7 @@ namespace testspr {
sprout::begin(arr1) + 5,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 5>{{1, 2, 3, 4, 5}}
));
@ -99,11 +99,11 @@ namespace testspr {
sprout::begin(arr1) + 5,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 6>{{2, 3, 4, 9, 8, 7}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(sorted),
array<int, 10>{{5, 1, 2, 3, 4, 9, 8, 7, 10, 6}}
));
@ -114,11 +114,11 @@ namespace testspr {
sprout::begin(arr1) + 5,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 3>{{2, 3, 4}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(sorted),
array<int, 10>{{5, 1, 2, 3, 4, 9, 8, 7, 10, 6}}
));

12
libs/algorithm/test/partition.cpp
View file

@ -19,7 +19,7 @@ namespace testspr {
arr1,
testspr::is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
partitioned,
array<int, 10>{{9, 7, 5, 3, 1, 2, 4, 6, 8, 10}}
));
@ -29,7 +29,7 @@ namespace testspr {
arr1,
testspr::is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
partitioned,
array<int, 5>{{9, 7, 5, 3, 1}}
));
@ -41,11 +41,11 @@ namespace testspr {
sprout::sub(arr1, 2, 8),
testspr::is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
partitioned,
array<int, 6>{{7, 5, 3, 4, 6, 8}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(partitioned),
array<int, 10>{{1, 2, 7, 5, 3, 4, 6, 8, 9, 10}}
));
@ -55,11 +55,11 @@ namespace testspr {
sprout::sub(arr1, 2, 8),
testspr::is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
partitioned,
array<int, 3>{{7, 5, 3}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(partitioned),
array<int, 10>{{1, 2, 7, 5, 3, 4, 6, 8, 9, 10}}
));

16
libs/algorithm/test/partition_copy.cpp
View file

@ -23,7 +23,7 @@ namespace testspr {
arr2,
is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
partitioned,
array<int, 10>{{7, 5, 3, 4, 6, 8, 0, 0, 0, 0}}
));
@ -35,7 +35,7 @@ namespace testspr {
arr2,
is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
partitioned,
array<int, 3>{{7, 5, 3}}
));
@ -49,7 +49,7 @@ namespace testspr {
arr3,
is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
partitioned,
array<int, 4>{{5, 3, 4, 6}}
));
@ -61,7 +61,7 @@ namespace testspr {
arr3,
is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
partitioned,
array<int, 2>{{5, 3}}
));
@ -75,11 +75,11 @@ namespace testspr {
sprout::sub(arr2, 2, 8),
is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
partitioned,
array<int, 6>{{7, 5, 3, 4, 6, 8}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(partitioned),
array<int, 10>{{0, 0, 7, 5, 3, 4, 6, 8, 0, 0}}
));
@ -91,11 +91,11 @@ namespace testspr {
sprout::sub(arr2, 2, 8),
is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
partitioned,
array<int, 3>{{7, 5, 3}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(partitioned),
array<int, 10>{{0, 0, 7, 5, 3, 4, 6, 8, 0, 0}}
));

12
libs/algorithm/test/pop_heap.cpp
View file

@ -18,7 +18,7 @@ namespace testspr {
SPROUT_STATIC_CONSTEXPR auto heap = sprout::pop_heap(
arr1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
heap,
array<int, 10>{{9, 8, 5, 6, 7, 4, 3, 1, 2, 10}}
));
@ -27,7 +27,7 @@ namespace testspr {
SPROUT_STATIC_CONSTEXPR auto heap = sprout::fit::pop_heap(
arr1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
heap,
array<int, 9>{{9, 8, 5, 6, 7, 4, 3, 1, 2}}
));
@ -38,11 +38,11 @@ namespace testspr {
SPROUT_STATIC_CONSTEXPR auto heap = sprout::pop_heap(
sprout::sub(arr1, 2, 10)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
heap,
array<int, 8>{{7, 6, 4, 5, 3, 1, 2, 9}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(heap),
array<int, 10>{{10, 8, 7, 6, 4, 5, 3, 1, 2, 9}}
));
@ -51,11 +51,11 @@ namespace testspr {
SPROUT_STATIC_CONSTEXPR auto heap = sprout::fit::pop_heap(
sprout::sub(arr1, 2, 10)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
heap,
array<int, 7>{{7, 6, 4, 5, 3, 1, 2}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(heap),
array<int, 10>{{10, 8, 7, 6, 4, 5, 3, 1, 2, 9}}
));

24
libs/algorithm/test/push_heap.cpp
View file

@ -18,7 +18,7 @@ namespace testspr {
SPROUT_STATIC_CONSTEXPR auto heap = sprout::push_heap(
arr1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
heap,
array<int, 10>{{10, 8, 9, 6, 7, 5, 3, 1, 2, 4}}
));
@ -27,7 +27,7 @@ namespace testspr {
SPROUT_STATIC_CONSTEXPR auto heap = sprout::fit::push_heap(
arr1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
heap,
array<int, 10>{{10, 8, 9, 6, 7, 5, 3, 1, 2, 4}}
));
@ -38,11 +38,11 @@ namespace testspr {
SPROUT_STATIC_CONSTEXPR auto heap = sprout::push_heap(
sprout::sub(arr1, 2, 10)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
heap,
array<int, 8>{{9, 7, 4, 6, 3, 1, 2, 5}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(heap),
array<int, 10>{{10, 8, 9, 7, 4, 6, 3, 1, 2, 5}}
));
@ -51,11 +51,11 @@ namespace testspr {
SPROUT_STATIC_CONSTEXPR auto heap = sprout::fit::push_heap(
sprout::sub(arr1, 2, 10)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
heap,
array<int, 8>{{9, 7, 4, 6, 3, 1, 2, 5}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(heap),
array<int, 10>{{10, 8, 9, 7, 4, 6, 3, 1, 2, 5}}
));
@ -70,7 +70,7 @@ namespace testspr {
arr1,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
heap,
array<int, 10>{{10, 8, 9, 6, 7, 5, 3, 1, 2, 4}}
));
@ -80,7 +80,7 @@ namespace testspr {
arr1,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
heap,
array<int, 10>{{10, 8, 9, 6, 7, 5, 3, 1, 2, 4}}
));
@ -92,11 +92,11 @@ namespace testspr {
sprout::sub(arr1, 2, 10),
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
heap,
array<int, 8>{{9, 7, 4, 6, 3, 1, 2, 5}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(heap),
array<int, 10>{{10, 8, 9, 7, 4, 6, 3, 1, 2, 5}}
));
@ -106,11 +106,11 @@ namespace testspr {
sprout::sub(arr1, 2, 10),
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
heap,
array<int, 8>{{9, 7, 4, 6, 3, 1, 2, 5}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(heap),
array<int, 10>{{10, 8, 9, 7, 4, 6, 3, 1, 2, 5}}
));

12
libs/algorithm/test/remove.cpp
View file

@ -19,7 +19,7 @@ namespace testspr {
arr1,
0
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
removed,
array<int, 10>{{1, 3, 5, 7, 9, 0, 7, 0, 9, 0}}
));
@ -29,7 +29,7 @@ namespace testspr {
arr1,
0
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
removed,
array<int, 5>{{1, 3, 5, 7, 9}}
));
@ -41,11 +41,11 @@ namespace testspr {
sprout::sub(arr1, 2, 8),
0
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
removed,
array<int, 6>{{3, 5, 7, 0, 7, 0}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(removed),
array<int, 10>{{1, 0, 3, 5, 7, 0, 7, 0, 9, 0}}
));
@ -55,11 +55,11 @@ namespace testspr {
sprout::sub(arr1, 2, 8),
0
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
removed,
array<int, 3>{{3, 5, 7}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(removed),
array<int, 10>{{1, 0, 3, 5, 7, 0, 7, 0, 9, 0}}
));

16
libs/algorithm/test/remove_copy.cpp
View file

@ -23,7 +23,7 @@ namespace testspr {
arr2,
0
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
removed,
array<int, 10>{{3, 5, 7, 0, 0, 0, 0, 0, 0, 0}}
));
@ -35,7 +35,7 @@ namespace testspr {
arr2,
0
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
removed,
array<int, 3>{{3, 5, 7}}
));
@ -49,7 +49,7 @@ namespace testspr {
arr3,
0
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
removed,
array<int, 2>{{3, 5}}
));
@ -61,7 +61,7 @@ namespace testspr {
arr3,
0
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
removed,
array<int, 2>{{3, 5}}
));
@ -75,11 +75,11 @@ namespace testspr {
sprout::sub(arr2, 2, 8),
0
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
removed,
array<int, 6>{{3, 5, 7, 0, 0, 0}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(removed),
array<int, 10>{{0, 0, 3, 5, 7, 0, 0, 0, 0, 0}}
));
@ -91,11 +91,11 @@ namespace testspr {
sprout::sub(arr2, 2, 8),
0
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
removed,
array<int, 3>{{3, 5, 7}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(removed),
array<int, 10>{{0, 0, 3, 5, 7, 0, 0, 0, 0, 0}}
));

16
libs/algorithm/test/remove_copy_if.cpp
View file

@ -23,7 +23,7 @@ namespace testspr {
arr2,
is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
removed,
array<int, 10>{{0, 0, 0, 0, 0, 0, 0, 0, 0, 0}}
));
@ -35,7 +35,7 @@ namespace testspr {
arr2,
is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
removed,
array<int, 3>{{0, 0, 0}}
));
@ -49,7 +49,7 @@ namespace testspr {
arr3,
is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
removed,
array<int, 2>{{0, 0}}
));
@ -61,7 +61,7 @@ namespace testspr {
arr3,
is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
removed,
array<int, 2>{{0, 0}}
));
@ -75,11 +75,11 @@ namespace testspr {
sprout::sub(arr2, 2, 8),
is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
removed,
array<int, 6>{{0, 0, 0, 0, 0, 0}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(removed),
array<int, 10>{{0, 0, 0, 0, 0, 0, 0, 0, 0, 0}}
));
@ -91,11 +91,11 @@ namespace testspr {
sprout::sub(arr2, 2, 8),
is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
removed,
array<int, 3>{{0, 0, 0}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(removed),
array<int, 10>{{0, 0, 0, 0, 0, 0, 0, 0, 0, 0}}
));

12
libs/algorithm/test/remove_if.cpp
View file

@ -19,7 +19,7 @@ namespace testspr {
arr1,
testspr::is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
removed,
array<int, 10>{{0, 0, 0, 0, 0, 0, 7, 0, 9, 0}}
));
@ -29,7 +29,7 @@ namespace testspr {
arr1,
testspr::is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
removed,
array<int, 5>{{0, 0, 0, 0, 0}}
));
@ -41,11 +41,11 @@ namespace testspr {
sprout::sub(arr1, 2, 8),
testspr::is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
removed,
array<int, 6>{{0, 0, 0, 0, 7, 0}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(removed),
array<int, 10>{{1, 0, 0, 0, 0, 0, 7, 0, 9, 0}}
));
@ -55,11 +55,11 @@ namespace testspr {
sprout::sub(arr1, 2, 8),
testspr::is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
removed,
array<int, 3>{{0, 0, 0}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(removed),
array<int, 10>{{1, 0, 0, 0, 0, 0, 7, 0, 9, 0}}
));

12
libs/algorithm/test/replace.cpp
View file

@ -20,7 +20,7 @@ namespace testspr {
0,
-1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
replaced,
array<int, 10>{{1, -1, 3, -1, 5, -1, 7, -1, 9, -1}}
));
@ -31,7 +31,7 @@ namespace testspr {
0,
-1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
replaced,
array<int, 10>{{1, -1, 3, -1, 5, -1, 7, -1, 9, -1}}
));
@ -44,11 +44,11 @@ namespace testspr {
0,
-1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
replaced,
array<int, 6>{{3, -1, 5, -1, 7, -1}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(replaced),
array<int, 10>{{1, 0, 3, -1, 5, -1, 7, -1, 9, 0}}
));
@ -59,11 +59,11 @@ namespace testspr {
0,
-1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
replaced,
array<int, 6>{{3, -1, 5, -1, 7, -1}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(replaced),
array<int, 10>{{1, 0, 3, -1, 5, -1, 7, -1, 9, 0}}
));

16
libs/algorithm/test/replace_copy.cpp
View file

@ -24,7 +24,7 @@ namespace testspr {
0,
-1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
replaced,
array<int, 10>{{3, -1, 5, -1, 7, -1, 0, 0, 0, 0}}
));
@ -37,7 +37,7 @@ namespace testspr {
0,
-1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
replaced,
array<int, 6>{{3, -1, 5, -1, 7, -1}}
));
@ -52,7 +52,7 @@ namespace testspr {
0,
-1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
replaced,
array<int, 4>{{3, -1, 5, -1}}
));
@ -65,7 +65,7 @@ namespace testspr {
0,
-1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
replaced,
array<int, 4>{{3, -1, 5, -1}}
));
@ -80,11 +80,11 @@ namespace testspr {
0,
-1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
replaced,
array<int, 6>{{3, -1, 5, -1, 7, -1}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(replaced),
array<int, 10>{{0, 0, 3, -1, 5, -1, 7, -1, 0, 0}}
));
@ -97,11 +97,11 @@ namespace testspr {
0,
-1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
replaced,
array<int, 6>{{3, -1, 5, -1, 7, -1}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(replaced),
array<int, 10>{{0, 0, 3, -1, 5, -1, 7, -1, 0, 0}}
));

16
libs/algorithm/test/replace_copy_if.cpp
View file

@ -24,7 +24,7 @@ namespace testspr {
is_odd<int>(),
-1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
replaced,
array<int, 10>{{-1, 0, -1, 0, -1, 0, 0, 0, 0, 0}}
));
@ -37,7 +37,7 @@ namespace testspr {
is_odd<int>(),
-1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
replaced,
array<int, 6>{{-1, 0, -1, 0, -1, 0}}
));
@ -52,7 +52,7 @@ namespace testspr {
is_odd<int>(),
-1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
replaced,
array<int, 4>{{-1, 0, -1, 0}}
));
@ -65,7 +65,7 @@ namespace testspr {
is_odd<int>(),
-1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
replaced,
array<int, 4>{{-1, 0, -1, 0}}
));
@ -80,11 +80,11 @@ namespace testspr {
is_odd<int>(),
-1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
replaced,
array<int, 6>{{-1, 0, -1, 0, -1, 0}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(replaced),
array<int, 10>{{0, 0, -1, 0, -1, 0, -1, 0, 0, 0}}
));
@ -97,11 +97,11 @@ namespace testspr {
is_odd<int>(),
-1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
replaced,
array<int, 6>{{-1, 0, -1, 0, -1, 0}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(replaced),
array<int, 10>{{0, 0, -1, 0, -1, 0, -1, 0, 0, 0}}
));

12
libs/algorithm/test/replace_if.cpp
View file

@ -20,7 +20,7 @@ namespace testspr {
is_odd<int>(),
-1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
replaced,
array<int, 10>{{-1, 0, -1, 0, -1, 0, -1, 0, -1, 0}}
));
@ -31,7 +31,7 @@ namespace testspr {
is_odd<int>(),
-1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
replaced,
array<int, 10>{{-1, 0, -1, 0, -1, 0, -1, 0, -1, 0}}
));
@ -44,11 +44,11 @@ namespace testspr {
is_odd<int>(),
-1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
replaced,
array<int, 6>{{-1, 0, -1, 0, -1, 0}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(replaced),
array<int, 10>{{1, 0, -1, 0, -1, 0, -1, 0, 9, 0}}
));
@ -59,11 +59,11 @@ namespace testspr {
is_odd<int>(),
-1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
replaced,
array<int, 6>{{-1, 0, -1, 0, -1, 0}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(replaced),
array<int, 10>{{1, 0, -1, 0, -1, 0, -1, 0, 9, 0}}
));

12
libs/algorithm/test/reverse.cpp
View file

@ -18,7 +18,7 @@ namespace testspr {
SPROUT_STATIC_CONSTEXPR auto reversed = sprout::reverse(
arr1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
reversed,
array<int, 10>{{10, 9, 8, 7, 6, 5, 4, 3, 2, 1}}
));
@ -27,7 +27,7 @@ namespace testspr {
SPROUT_STATIC_CONSTEXPR auto reversed = sprout::fit::reverse(
arr1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
reversed,
array<int, 10>{{10, 9, 8, 7, 6, 5, 4, 3, 2, 1}}
));
@ -38,11 +38,11 @@ namespace testspr {
SPROUT_STATIC_CONSTEXPR auto reversed = sprout::reverse(
sprout::sub(arr1, 2, 8)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
reversed,
array<int, 6>{{8, 7, 6, 5, 4, 3}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(reversed),
array<int, 10>{{1, 2, 8, 7, 6, 5, 4, 3, 9, 10}}
));
@ -51,11 +51,11 @@ namespace testspr {
SPROUT_STATIC_CONSTEXPR auto reversed = sprout::fit::reverse(
sprout::sub(arr1, 2, 8)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
reversed,
array<int, 6>{{8, 7, 6, 5, 4, 3}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(reversed),
array<int, 10>{{1, 2, 8, 7, 6, 5, 4, 3, 9, 10}}
));

16
libs/algorithm/test/reverse_copy.cpp
View file

@ -22,7 +22,7 @@ namespace testspr {
sprout::begin(arr1) + 8,
arr2
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
reversed,
array<int, 10>{{8, 7, 6, 5, 4, 3, 0, 0, 0, 0}}
));
@ -33,7 +33,7 @@ namespace testspr {
sprout::begin(arr1) + 8,
arr2
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
reversed,
array<int, 6>{{8, 7, 6, 5, 4, 3}}
));
@ -46,7 +46,7 @@ namespace testspr {
sprout::begin(arr1) + 8,
arr3
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
reversed,
array<int, 4>{{8, 7, 6, 5}}
));
@ -57,7 +57,7 @@ namespace testspr {
sprout::begin(arr1) + 8,
arr3
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
reversed,
array<int, 4>{{8, 7, 6, 5}}
));
@ -70,11 +70,11 @@ namespace testspr {
sprout::begin(arr1) + 8,
sprout::sub(arr2, 2, 8)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
reversed,
array<int, 6>{{8, 7, 6, 5, 4, 3}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(reversed),
array<int, 10>{{0, 0, 8, 7, 6, 5, 4, 3, 0, 0}}
));
@ -85,11 +85,11 @@ namespace testspr {
sprout::begin(arr1) + 8,
sprout::sub(arr2, 2, 8)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
reversed,
array<int, 6>{{8, 7, 6, 5, 4, 3}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(reversed),
array<int, 10>{{0, 0, 8, 7, 6, 5, 4, 3, 0, 0}}
));

12
libs/algorithm/test/rotate.cpp
View file

@ -19,7 +19,7 @@ namespace testspr {
arr1,
sprout::begin(arr1) + 5
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
rotated,
array<int, 10>{{6, 7, 8, 9, 10, 1, 2, 3, 4, 5}}
));
@ -29,7 +29,7 @@ namespace testspr {
arr1,
sprout::begin(arr1) + 5
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
rotated,
array<int, 10>{{6, 7, 8, 9, 10, 1, 2, 3, 4, 5}}
));
@ -41,11 +41,11 @@ namespace testspr {
sprout::sub(arr1, 2, 8),
sprout::begin(arr1) + 5
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
rotated,
array<int, 6>{{6, 7, 8, 3, 4, 5}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(rotated),
array<int, 10>{{1, 2, 6, 7, 8, 3, 4, 5, 9, 10}}
));
@ -55,11 +55,11 @@ namespace testspr {
sprout::sub(arr1, 2, 8),
sprout::begin(arr1) + 5
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
rotated,
array<int, 6>{{6, 7, 8, 3, 4, 5}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(rotated),
array<int, 10>{{1, 2, 6, 7, 8, 3, 4, 5, 9, 10}}
));

16
libs/algorithm/test/rotate_copy.cpp
View file

@ -23,7 +23,7 @@ namespace testspr {
sprout::begin(arr1) + 8,
arr2
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
rotated,
array<int, 10>{{6, 7, 8, 3, 4, 5, 0, 0, 0, 0}}
));
@ -35,7 +35,7 @@ namespace testspr {
sprout::begin(arr1) + 8,
arr2
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
rotated,
array<int, 6>{{6, 7, 8, 3, 4, 5}}
));
@ -49,7 +49,7 @@ namespace testspr {
sprout::begin(arr1) + 8,
arr3
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
rotated,
array<int, 4>{{6, 7, 8, 3}}
));
@ -61,7 +61,7 @@ namespace testspr {
sprout::begin(arr1) + 8,
arr3
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
rotated,
array<int, 4>{{6, 7, 8, 3}}
));
@ -75,11 +75,11 @@ namespace testspr {
sprout::begin(arr1) + 8,
sprout::sub(arr2, 2, 8)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
rotated,
array<int, 6>{{6, 7, 8, 3, 4, 5}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(rotated),
array<int, 10>{{0, 0, 6, 7, 8, 3, 4, 5, 0, 0}}
));
@ -91,11 +91,11 @@ namespace testspr {
sprout::begin(arr1) + 8,
sprout::sub(arr2, 2, 8)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
rotated,
array<int, 6>{{6, 7, 8, 3, 4, 5}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(rotated),
array<int, 10>{{0, 0, 6, 7, 8, 3, 4, 5, 0, 0}}
));

32
libs/algorithm/test/set_difference.cpp
View file

@ -25,7 +25,7 @@ namespace testspr {
sprout::end(arr1_2),
arr2
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 10>{{5, 15, 25, 0, 0, 0, 0, 0, 0, 0}}
));
@ -38,7 +38,7 @@ namespace testspr {
sprout::end(arr1_2),
arr2
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 3>{{5, 15, 25}}
));
@ -53,7 +53,7 @@ namespace testspr {
sprout::end(arr1_2),
arr3
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 2>{{5, 15}}
));
@ -66,7 +66,7 @@ namespace testspr {
sprout::end(arr1_2),
arr3
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 2>{{5, 15}}
));
@ -81,11 +81,11 @@ namespace testspr {
sprout::end(arr1_2),
sprout::sub(arr2, 2, 8)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 6>{{5, 15, 25, 0, 0, 0}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(merged),
array<int, 10>{{0, 0, 5, 15, 25, 0, 0, 0, 0, 0}}
));
@ -98,11 +98,11 @@ namespace testspr {
sprout::end(arr1_2),
sprout::sub(arr2, 2, 8)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 3>{{5, 15, 25}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(merged),
array<int, 10>{{0, 0, 5, 15, 25, 0, 0, 0, 0, 0}}
));
@ -124,7 +124,7 @@ namespace testspr {
arr2,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 10>{{5, 15, 25, 0, 0, 0, 0, 0, 0, 0}}
));
@ -138,7 +138,7 @@ namespace testspr {
arr2,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 3>{{5, 15, 25}}
));
@ -154,7 +154,7 @@ namespace testspr {
arr3,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 2>{{5, 15}}
));
@ -168,7 +168,7 @@ namespace testspr {
arr3,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 2>{{5, 15}}
));
@ -184,11 +184,11 @@ namespace testspr {
sprout::sub(arr2, 2, 8),
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 6>{{5, 15, 25, 0, 0, 0}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(merged),
array<int, 10>{{0, 0, 5, 15, 25, 0, 0, 0, 0, 0}}
));
@ -202,11 +202,11 @@ namespace testspr {
sprout::sub(arr2, 2, 8),
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 3>{{5, 15, 25}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(merged),
array<int, 10>{{0, 0, 5, 15, 25, 0, 0, 0, 0, 0}}
));

32
libs/algorithm/test/set_intersection.cpp
View file

@ -25,7 +25,7 @@ namespace testspr {
sprout::end(arr1_2),
arr2
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 10>{{20, 30, 40, 0, 0, 0, 0, 0, 0, 0}}
));
@ -38,7 +38,7 @@ namespace testspr {
sprout::end(arr1_2),
arr2
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 3>{{20, 30, 40}}
));
@ -53,7 +53,7 @@ namespace testspr {
sprout::end(arr1_2),
arr3
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 2>{{20, 30}}
));
@ -66,7 +66,7 @@ namespace testspr {
sprout::end(arr1_2),
arr3
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 2>{{20, 30}}
));
@ -81,11 +81,11 @@ namespace testspr {
sprout::end(arr1_2),
sprout::sub(arr2, 2, 8)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 6>{{20, 30, 40, 0, 0, 0}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(merged),
array<int, 10>{{0, 0, 20, 30, 40, 0, 0, 0, 0, 0}}
));
@ -98,11 +98,11 @@ namespace testspr {
sprout::end(arr1_2),
sprout::sub(arr2, 2, 8)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 3>{{20, 30, 40}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(merged),
array<int, 10>{{0, 0, 20, 30, 40, 0, 0, 0, 0, 0}}
));
@ -124,7 +124,7 @@ namespace testspr {
arr2,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 10>{{20, 30, 40, 0, 0, 0, 0, 0, 0, 0}}
));
@ -138,7 +138,7 @@ namespace testspr {
arr2,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 3>{{20, 30, 40}}
));
@ -154,7 +154,7 @@ namespace testspr {
arr3,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 2>{{20, 30}}
));
@ -168,7 +168,7 @@ namespace testspr {
arr3,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 2>{{20, 30}}
));
@ -184,11 +184,11 @@ namespace testspr {
sprout::sub(arr2, 2, 8),
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 6>{{20, 30, 40, 0, 0, 0}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(merged),
array<int, 10>{{0, 0, 20, 30, 40, 0, 0, 0, 0, 0}}
));
@ -202,11 +202,11 @@ namespace testspr {
sprout::sub(arr2, 2, 8),
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 3>{{20, 30, 40}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(merged),
array<int, 10>{{0, 0, 20, 30, 40, 0, 0, 0, 0, 0}}
));

32
libs/algorithm/test/set_symmetric_difference.cpp
View file

@ -25,7 +25,7 @@ namespace testspr {
sprout::end(arr1_2),
arr2
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 10>{{5, 15, 25, 30, 40, 50, 0, 0, 0, 0}}
));
@ -38,7 +38,7 @@ namespace testspr {
sprout::end(arr1_2),
arr2
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 6>{{5, 15, 25, 30, 40, 50}}
));
@ -53,7 +53,7 @@ namespace testspr {
sprout::end(arr1_2),
arr3
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 4>{{5, 15, 25, 30}}
));
@ -66,7 +66,7 @@ namespace testspr {
sprout::end(arr1_2),
arr3
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 4>{{5, 15, 25, 30}}
));
@ -81,11 +81,11 @@ namespace testspr {
sprout::end(arr1_2),
sprout::sub(arr2, 2, 8)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 6>{{5, 15, 25, 30, 40, 50}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(merged),
array<int, 10>{{0, 0, 5, 15, 25, 30, 40, 50, 0, 0}}
));
@ -98,11 +98,11 @@ namespace testspr {
sprout::end(arr1_2),
sprout::sub(arr2, 2, 8)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 6>{{5, 15, 25, 30, 40, 50}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(merged),
array<int, 10>{{0, 0, 5, 15, 25, 30, 40, 50, 0, 0}}
));
@ -124,7 +124,7 @@ namespace testspr {
arr2,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 10>{{5, 15, 25, 30, 40, 50, 0, 0, 0, 0}}
));
@ -138,7 +138,7 @@ namespace testspr {
arr2,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 6>{{5, 15, 25, 30, 40, 50}}
));
@ -154,7 +154,7 @@ namespace testspr {
arr3,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 4>{{5, 15, 25, 30}}
));
@ -168,7 +168,7 @@ namespace testspr {
arr3,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 4>{{5, 15, 25, 30}}
));
@ -184,11 +184,11 @@ namespace testspr {
sprout::sub(arr2, 2, 8),
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 6>{{5, 15, 25, 30, 40, 50}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(merged),
array<int, 10>{{0, 0, 5, 15, 25, 30, 40, 50, 0, 0}}
));
@ -202,11 +202,11 @@ namespace testspr {
sprout::sub(arr2, 2, 8),
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 6>{{5, 15, 25, 30, 40, 50}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(merged),
array<int, 10>{{0, 0, 5, 15, 25, 30, 40, 50, 0, 0}}
));

32
libs/algorithm/test/set_union.cpp
View file

@ -25,7 +25,7 @@ namespace testspr {
sprout::end(arr1_2),
arr2
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 10>{{5, 10, 15, 20, 25, 30, 40, 50, 0, 0}}
));
@ -38,7 +38,7 @@ namespace testspr {
sprout::end(arr1_2),
arr2
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 8>{{5, 10, 15, 20, 25, 30, 40, 50}}
));
@ -53,7 +53,7 @@ namespace testspr {
sprout::end(arr1_2),
arr3
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 4>{{5, 10, 15, 20}}
));
@ -66,7 +66,7 @@ namespace testspr {
sprout::end(arr1_2),
arr3
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 4>{{5, 10, 15, 20}}
));
@ -81,11 +81,11 @@ namespace testspr {
sprout::end(arr1_2),
sprout::sub(arr2, 2, 8)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 6>{{5, 10, 15, 20, 25, 30}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(merged),
array<int, 10>{{0, 0, 5, 10, 15, 20, 25, 30, 0, 0}}
));
@ -98,11 +98,11 @@ namespace testspr {
sprout::end(arr1_2),
sprout::sub(arr2, 2, 8)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 6>{{5, 10, 15, 20, 25, 30}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(merged),
array<int, 10>{{0, 0, 5, 10, 15, 20, 25, 30, 0, 0}}
));
@ -124,7 +124,7 @@ namespace testspr {
arr2,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 10>{{5, 10, 15, 20, 25, 30, 40, 50, 0, 0}}
));
@ -138,7 +138,7 @@ namespace testspr {
arr2,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 8>{{5, 10, 15, 20, 25, 30, 40, 50}}
));
@ -154,7 +154,7 @@ namespace testspr {
arr3,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 4>{{5, 10, 15, 20}}
));
@ -168,7 +168,7 @@ namespace testspr {
arr3,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 4>{{5, 10, 15, 20}}
));
@ -184,11 +184,11 @@ namespace testspr {
sprout::sub(arr2, 2, 8),
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 6>{{5, 10, 15, 20, 25, 30}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(merged),
array<int, 10>{{0, 0, 5, 10, 15, 20, 25, 30, 0, 0}}
));
@ -202,11 +202,11 @@ namespace testspr {
sprout::sub(arr2, 2, 8),
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
merged,
array<int, 6>{{5, 10, 15, 20, 25, 30}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(merged),
array<int, 10>{{0, 0, 5, 10, 15, 20, 25, 30, 0, 0}}
));

12
libs/algorithm/test/shuffle.cpp
View file

@ -21,7 +21,7 @@ namespace testspr {
arr1,
sprout::random::default_random_engine(SPROUT_UNIQUE_SEED)
);
TESTSPR_DOUBLE_ASSERT(testspr::is_permutation(
TESTSPR_BOTH_ASSERT(testspr::is_permutation(
shuffled,
arr1
));
@ -31,7 +31,7 @@ namespace testspr {
arr1,
sprout::random::default_random_engine(SPROUT_UNIQUE_SEED)
);
TESTSPR_DOUBLE_ASSERT(testspr::is_permutation(
TESTSPR_BOTH_ASSERT(testspr::is_permutation(
shuffled,
arr1
));
@ -43,11 +43,11 @@ namespace testspr {
sprout::sub(arr1, 2, 8),
sprout::random::default_random_engine(SPROUT_UNIQUE_SEED)
);
TESTSPR_DOUBLE_ASSERT(testspr::is_permutation(
TESTSPR_BOTH_ASSERT(testspr::is_permutation(
shuffled,
sprout::sub(arr1, 2, 8)
));
TESTSPR_DOUBLE_ASSERT(testspr::is_permutation(
TESTSPR_BOTH_ASSERT(testspr::is_permutation(
sprout::get_internal(shuffled),
arr1
));
@ -57,11 +57,11 @@ namespace testspr {
sprout::sub(arr1, 2, 8),
sprout::random::default_random_engine(SPROUT_UNIQUE_SEED)
);
TESTSPR_DOUBLE_ASSERT(testspr::is_permutation(
TESTSPR_BOTH_ASSERT(testspr::is_permutation(
shuffled,
sprout::sub(arr1, 2, 8)
));
TESTSPR_DOUBLE_ASSERT(testspr::is_permutation(
TESTSPR_BOTH_ASSERT(testspr::is_permutation(
sprout::get_internal(shuffled),
arr1
));

20
libs/algorithm/test/shuffle_result.cpp
View file

@ -22,7 +22,7 @@ namespace testspr {
arr1,
g
);
TESTSPR_DOUBLE_ASSERT(testspr::is_permutation(
TESTSPR_BOTH_ASSERT(testspr::is_permutation(
sprout::get<0>(shuffled),
arr1
));
@ -30,14 +30,14 @@ namespace testspr {
sprout::get<0>(shuffled),
g
);
TESTSPR_DOUBLE_ASSERT(sprout::get<1>(shuffled) == sprout::get<1>(shuffled2));
TESTSPR_BOTH_ASSERT(sprout::get<1>(shuffled) == sprout::get<1>(shuffled2));
}
{
SPROUT_STATIC_CONSTEXPR auto shuffled = sprout::fit::shuffle_result(
arr1,
g
);
TESTSPR_DOUBLE_ASSERT(testspr::is_permutation(
TESTSPR_BOTH_ASSERT(testspr::is_permutation(
sprout::get<0>(shuffled),
arr1
));
@ -45,7 +45,7 @@ namespace testspr {
sprout::get<0>(shuffled),
g
);
TESTSPR_DOUBLE_ASSERT(sprout::get<1>(shuffled) == sprout::get<1>(shuffled2));
TESTSPR_BOTH_ASSERT(sprout::get<1>(shuffled) == sprout::get<1>(shuffled2));
}
// シャッフル
// 範囲の切り出し
@ -54,11 +54,11 @@ namespace testspr {
sprout::sub(arr1, 2, 8),
g
);
TESTSPR_DOUBLE_ASSERT(testspr::is_permutation(
TESTSPR_BOTH_ASSERT(testspr::is_permutation(
sprout::get<0>(shuffled),
sprout::sub(arr1, 2, 8)
));
TESTSPR_DOUBLE_ASSERT(testspr::is_permutation(
TESTSPR_BOTH_ASSERT(testspr::is_permutation(
sprout::get_internal(sprout::get<0>(shuffled)),
arr1
));
@ -66,18 +66,18 @@ namespace testspr {
sprout::get<0>(shuffled),
g
);
TESTSPR_DOUBLE_ASSERT(sprout::get<1>(shuffled) == sprout::get<1>(shuffled2));
TESTSPR_BOTH_ASSERT(sprout::get<1>(shuffled) == sprout::get<1>(shuffled2));
}
{
SPROUT_STATIC_CONSTEXPR auto shuffled = sprout::fit::shuffle_result(
sprout::sub(arr1, 2, 8),
g
);
TESTSPR_DOUBLE_ASSERT(testspr::is_permutation(
TESTSPR_BOTH_ASSERT(testspr::is_permutation(
sprout::get<0>(shuffled),
sprout::sub(arr1, 2, 8)
));
TESTSPR_DOUBLE_ASSERT(testspr::is_permutation(
TESTSPR_BOTH_ASSERT(testspr::is_permutation(
sprout::get_internal(sprout::get<0>(shuffled)),
arr1
));
@ -85,7 +85,7 @@ namespace testspr {
sprout::get<0>(shuffled),
g
);
TESTSPR_DOUBLE_ASSERT(sprout::get<1>(shuffled) == sprout::get<1>(shuffled2));
TESTSPR_BOTH_ASSERT(sprout::get<1>(shuffled) == sprout::get<1>(shuffled2));
}
}
}

24
libs/algorithm/test/sort.cpp
View file

@ -18,7 +18,7 @@ namespace testspr {
SPROUT_STATIC_CONSTEXPR auto sorted = sprout::sort(
arr1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}}
));
@ -27,7 +27,7 @@ namespace testspr {
SPROUT_STATIC_CONSTEXPR auto sorted = sprout::fit::sort(
arr1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}}
));
@ -38,11 +38,11 @@ namespace testspr {
SPROUT_STATIC_CONSTEXPR auto sorted = sprout::sort(
sprout::sub(arr1, 2, 8)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 6>{{2, 3, 4, 7, 8, 9}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(sorted),
array<int, 10>{{5, 1, 2, 3, 4, 7, 8, 9, 10, 6}}
));
@ -51,11 +51,11 @@ namespace testspr {
SPROUT_STATIC_CONSTEXPR auto sorted = sprout::fit::sort(
sprout::sub(arr1, 2, 8)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 6>{{2, 3, 4, 7, 8, 9}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(sorted),
array<int, 10>{{5, 1, 2, 3, 4, 7, 8, 9, 10, 6}}
));
@ -70,7 +70,7 @@ namespace testspr {
arr1,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}}
));
@ -80,7 +80,7 @@ namespace testspr {
arr1,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}}
));
@ -92,11 +92,11 @@ namespace testspr {
sprout::sub(arr1, 2, 8),
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 6>{{2, 3, 4, 7, 8, 9}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(sorted),
array<int, 10>{{5, 1, 2, 3, 4, 7, 8, 9, 10, 6}}
));
@ -106,11 +106,11 @@ namespace testspr {
sprout::sub(arr1, 2, 8),
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 6>{{2, 3, 4, 7, 8, 9}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(sorted),
array<int, 10>{{5, 1, 2, 3, 4, 7, 8, 9, 10, 6}}
));

24
libs/algorithm/test/sort_heap.cpp
View file

@ -18,7 +18,7 @@ namespace testspr {
SPROUT_STATIC_CONSTEXPR auto sorted = sprout::sort_heap(
arr1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}}
));
@ -27,7 +27,7 @@ namespace testspr {
SPROUT_STATIC_CONSTEXPR auto sorted = sprout::fit::sort_heap(
arr1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}}
));
@ -38,11 +38,11 @@ namespace testspr {
SPROUT_STATIC_CONSTEXPR auto sorted = sprout::sort_heap(
sprout::sub(arr1, 2, 8)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 6>{{2, 3, 5, 6, 7, 8}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(sorted),
array<int, 10>{{10, 9, 2, 3, 5, 6, 7, 8, 4, 1}}
));
@ -51,11 +51,11 @@ namespace testspr {
SPROUT_STATIC_CONSTEXPR auto sorted = sprout::fit::sort_heap(
sprout::sub(arr1, 2, 8)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 6>{{2, 3, 5, 6, 7, 8}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(sorted),
array<int, 10>{{10, 9, 2, 3, 5, 6, 7, 8, 4, 1}}
));
@ -70,7 +70,7 @@ namespace testspr {
arr1,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}}
));
@ -80,7 +80,7 @@ namespace testspr {
arr1,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}}
));
@ -92,11 +92,11 @@ namespace testspr {
sprout::sub(arr1, 2, 8),
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 6>{{2, 3, 5, 6, 7, 8}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(sorted),
array<int, 10>{{10, 9, 2, 3, 5, 6, 7, 8, 4, 1}}
));
@ -106,11 +106,11 @@ namespace testspr {
sprout::sub(arr1, 2, 8),
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 6>{{2, 3, 5, 6, 7, 8}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(sorted),
array<int, 10>{{10, 9, 2, 3, 5, 6, 7, 8, 4, 1}}
));

12
libs/algorithm/test/stable_partition.cpp
View file

@ -19,7 +19,7 @@ namespace testspr {
arr1,
testspr::is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
partitioned,
array<int, 10>{{1, 3, 5, 7, 9, 2, 4, 6, 8, 10}}
));
@ -29,7 +29,7 @@ namespace testspr {
arr1,
testspr::is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
partitioned,
array<int, 5>{{1, 3, 5, 7, 9}}
));
@ -41,11 +41,11 @@ namespace testspr {
sprout::sub(arr1, 2, 8),
testspr::is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
partitioned,
array<int, 6>{{3, 5, 7, 4, 6, 8}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(partitioned),
array<int, 10>{{1, 2, 3, 5, 7, 4, 6, 8, 9, 10}}
));
@ -55,11 +55,11 @@ namespace testspr {
sprout::sub(arr1, 2, 8),
testspr::is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
partitioned,
array<int, 3>{{3, 5, 7}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(partitioned),
array<int, 10>{{1, 2, 3, 5, 7, 4, 6, 8, 9, 10}}
));

16
libs/algorithm/test/stable_partition_copy.cpp
View file

@ -23,7 +23,7 @@ namespace testspr {
arr2,
is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
partitioned,
array<int, 10>{{3, 5, 7, 4, 6, 8, 0, 0, 0, 0}}
));
@ -35,7 +35,7 @@ namespace testspr {
arr2,
is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
partitioned,
array<int, 3>{{3, 5, 7}}
));
@ -49,7 +49,7 @@ namespace testspr {
arr3,
is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
partitioned,
array<int, 4>{{3, 5, 7, 4}}
));
@ -61,7 +61,7 @@ namespace testspr {
arr3,
is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
partitioned,
array<int, 3>{{3, 5, 7}}
));
@ -75,11 +75,11 @@ namespace testspr {
sprout::sub(arr2, 2, 8),
is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
partitioned,
array<int, 6>{{3, 5, 7, 4, 6, 8}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(partitioned),
array<int, 10>{{0, 0, 3, 5, 7, 4, 6, 8, 0, 0}}
));
@ -91,11 +91,11 @@ namespace testspr {
sprout::sub(arr2, 2, 8),
is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
partitioned,
array<int, 3>{{3, 5, 7}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(partitioned),
array<int, 10>{{0, 0, 3, 5, 7, 4, 6, 8, 0, 0}}
));

24
libs/algorithm/test/stable_sort.cpp
View file

@ -18,7 +18,7 @@ namespace testspr {
SPROUT_STATIC_CONSTEXPR auto sorted = sprout::stable_sort(
arr1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}}
));
@ -27,7 +27,7 @@ namespace testspr {
SPROUT_STATIC_CONSTEXPR auto sorted = sprout::fit::stable_sort(
arr1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}}
));
@ -38,11 +38,11 @@ namespace testspr {
SPROUT_STATIC_CONSTEXPR auto sorted = sprout::stable_sort(
sprout::sub(arr1, 2, 8)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 6>{{2, 3, 4, 7, 8, 9}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(sorted),
array<int, 10>{{5, 1, 2, 3, 4, 7, 8, 9, 10, 6}}
));
@ -51,11 +51,11 @@ namespace testspr {
SPROUT_STATIC_CONSTEXPR auto sorted = sprout::fit::stable_sort(
sprout::sub(arr1, 2, 8)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 6>{{2, 3, 4, 7, 8, 9}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(sorted),
array<int, 10>{{5, 1, 2, 3, 4, 7, 8, 9, 10, 6}}
));
@ -70,7 +70,7 @@ namespace testspr {
arr1,
testspr::mod_less<int, 5>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 10>{{5, 10, 1, 6, 2, 7, 8, 3, 9, 4}}
));
@ -80,7 +80,7 @@ namespace testspr {
arr1,
testspr::mod_less<int, 5>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 10>{{5, 10, 1, 6, 2, 7, 8, 3, 9, 4}}
));
@ -92,11 +92,11 @@ namespace testspr {
sprout::sub(arr1, 2, 8),
testspr::mod_less<int, 5>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 6>{{2, 7, 8, 3, 9, 4}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(sorted),
array<int, 10>{{5, 1, 2, 7, 8, 3, 9, 4, 10, 6}}
));
@ -106,11 +106,11 @@ namespace testspr {
sprout::sub(arr1, 2, 8),
testspr::mod_less<int, 5>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sorted,
array<int, 6>{{2, 7, 8, 3, 9, 4}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(sorted),
array<int, 10>{{5, 1, 2, 7, 8, 3, 9, 4, 10, 6}}
));

12
libs/algorithm/test/swap_element.cpp
View file

@ -20,7 +20,7 @@ namespace testspr {
sprout::begin(arr1) + 2,
sprout::begin(arr1) + 7
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
swapped,
array<int, 10>{{1, 2, 8, 4, 5, 6, 7, 3, 9, 10}}
));
@ -31,7 +31,7 @@ namespace testspr {
sprout::begin(arr1) + 2,
sprout::begin(arr1) + 7
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
swapped,
array<int, 10>{{1, 2, 8, 4, 5, 6, 7, 3, 9, 10}}
));
@ -44,11 +44,11 @@ namespace testspr {
sprout::begin(arr1) + 2,
sprout::begin(arr1) + 7
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
swapped,
array<int, 6>{{8, 4, 5, 6, 7, 3}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(swapped),
array<int, 10>{{1, 2, 8, 4, 5, 6, 7, 3, 9, 10}}
));
@ -59,11 +59,11 @@ namespace testspr {
sprout::begin(arr1) + 2,
sprout::begin(arr1) + 7
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
swapped,
array<int, 6>{{8, 4, 5, 6, 7, 3}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(swapped),
array<int, 10>{{1, 2, 8, 4, 5, 6, 7, 3, 9, 10}}
));

16
libs/algorithm/test/swap_element_copy.cpp
View file

@ -24,7 +24,7 @@ namespace testspr {
sprout::begin(arr1) + 2,
sprout::begin(arr1) + 7
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
swapped,
array<int, 10>{{8, 4, 5, 6, 7, 3, 0, 0, 0, 0}}
));
@ -37,7 +37,7 @@ namespace testspr {
sprout::begin(arr1) + 2,
sprout::begin(arr1) + 7
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
swapped,
array<int, 6>{{8, 4, 5, 6, 7, 3}}
));
@ -52,7 +52,7 @@ namespace testspr {
sprout::begin(arr1) + 2,
sprout::begin(arr1) + 7
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
swapped,
array<int, 4>{{8, 4, 5, 6}}
));
@ -65,7 +65,7 @@ namespace testspr {
sprout::begin(arr1) + 2,
sprout::begin(arr1) + 7
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
swapped,
array<int, 4>{{8, 4, 5, 6}}
));
@ -80,11 +80,11 @@ namespace testspr {
sprout::begin(arr1) + 2,
sprout::begin(arr1) + 7
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
swapped,
array<int, 6>{{8, 4, 5, 6, 7, 3}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(swapped),
array<int, 10>{{0, 0, 8, 4, 5, 6, 7, 3, 0, 0}}
));
@ -97,11 +97,11 @@ namespace testspr {
sprout::begin(arr1) + 2,
sprout::begin(arr1) + 7
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
swapped,
array<int, 6>{{8, 4, 5, 6, 7, 3}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(swapped),
array<int, 10>{{0, 0, 8, 4, 5, 6, 7, 3, 0, 0}}
));

32
libs/algorithm/test/transform.cpp
View file

@ -23,7 +23,7 @@ namespace testspr {
arr2,
testspr::x2<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
transformed,
array<int, 10>{{6, 8, 10, 12, 14, 16, 0, 0, 0, 0}}
));
@ -35,7 +35,7 @@ namespace testspr {
arr2,
testspr::x2<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
transformed,
array<int, 6>{{6, 8, 10, 12, 14, 16}}
));
@ -49,7 +49,7 @@ namespace testspr {
arr3,
testspr::x2<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
transformed,
array<int, 4>{{6, 8, 10, 12}}
));
@ -61,7 +61,7 @@ namespace testspr {
arr3,
testspr::x2<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
transformed,
array<int, 4>{{6, 8, 10, 12}}
));
@ -75,11 +75,11 @@ namespace testspr {
sprout::sub(arr2, 2, 8),
testspr::x2<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
transformed,
array<int, 6>{{6, 8, 10, 12, 14, 16}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(transformed),
array<int, 10>{{0, 0, 6, 8, 10, 12, 14, 16, 0, 0}}
));
@ -91,11 +91,11 @@ namespace testspr {
sprout::sub(arr2, 2, 8),
testspr::x2<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
transformed,
array<int, 6>{{6, 8, 10, 12, 14, 16}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(transformed),
array<int, 10>{{0, 0, 6, 8, 10, 12, 14, 16, 0, 0}}
));
@ -116,7 +116,7 @@ namespace testspr {
arr2,
testspr::plus<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
transformed,
array<int, 10>{{6, 8, 10, 12, 14, 16, 0, 0, 0, 0}}
));
@ -129,7 +129,7 @@ namespace testspr {
arr2,
testspr::plus<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
transformed,
array<int, 6>{{6, 8, 10, 12, 14, 16}}
));
@ -144,7 +144,7 @@ namespace testspr {
arr3,
testspr::plus<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
transformed,
array<int, 4>{{6, 8, 10, 12}}
));
@ -157,7 +157,7 @@ namespace testspr {
arr3,
testspr::plus<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
transformed,
array<int, 4>{{6, 8, 10, 12}}
));
@ -172,11 +172,11 @@ namespace testspr {
sprout::sub(arr2, 2, 8),
testspr::plus<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
transformed,
array<int, 6>{{6, 8, 10, 12, 14, 16}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(transformed),
array<int, 10>{{0, 0, 6, 8, 10, 12, 14, 16, 0, 0}}
));
@ -189,11 +189,11 @@ namespace testspr {
sprout::sub(arr2, 2, 8),
testspr::plus<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
transformed,
array<int, 6>{{6, 8, 10, 12, 14, 16}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(transformed),
array<int, 10>{{0, 0, 6, 8, 10, 12, 14, 16, 0, 0}}
));

24
libs/algorithm/test/unique.cpp
View file

@ -18,7 +18,7 @@ namespace testspr {
SPROUT_STATIC_CONSTEXPR auto uniqued = sprout::unique(
arr1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
uniqued,
array<int, 10>{{1, 3, 5, 7, 9, 5, 7, 7, 9, 9}}
));
@ -27,7 +27,7 @@ namespace testspr {
SPROUT_STATIC_CONSTEXPR auto uniqued = sprout::fit::unique(
arr1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
uniqued,
array<int, 5>{{1, 3, 5, 7, 9}}
));
@ -38,11 +38,11 @@ namespace testspr {
SPROUT_STATIC_CONSTEXPR auto uniqued = sprout::unique(
sprout::sub(arr1, 2, 8)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
uniqued,
array<int, 6>{{3, 5, 7, 5, 7, 7}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(uniqued),
array<int, 10>{{1, 1, 3, 5, 7, 5, 7, 7, 9, 9}}
));
@ -51,11 +51,11 @@ namespace testspr {
SPROUT_STATIC_CONSTEXPR auto uniqued = sprout::fit::unique(
sprout::sub(arr1, 2, 8)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
uniqued,
array<int, 3>{{3, 5, 7}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(uniqued),
array<int, 10>{{1, 1, 3, 5, 7, 5, 7, 7, 9, 9}}
));
@ -70,7 +70,7 @@ namespace testspr {
arr1,
testspr::equal_to<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
uniqued,
array<int, 10>{{1, 3, 5, 7, 9, 5, 7, 7, 9, 9}}
));
@ -80,7 +80,7 @@ namespace testspr {
arr1,
testspr::equal_to<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
uniqued,
array<int, 5>{{1, 3, 5, 7, 9}}
));
@ -92,11 +92,11 @@ namespace testspr {
sprout::sub(arr1, 2, 8),
testspr::equal_to<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
uniqued,
array<int, 6>{{3, 5, 7, 5, 7, 7}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(uniqued),
array<int, 10>{{1, 1, 3, 5, 7, 5, 7, 7, 9, 9}}
));
@ -106,11 +106,11 @@ namespace testspr {
sprout::sub(arr1, 2, 8),
testspr::equal_to<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
uniqued,
array<int, 3>{{3, 5, 7}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(uniqued),
array<int, 10>{{1, 1, 3, 5, 7, 5, 7, 7, 9, 9}}
));

32
libs/algorithm/test/unique_copy.cpp
View file

@ -22,7 +22,7 @@ namespace testspr {
sprout::begin(arr1) + 8,
arr2
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
uniqued,
array<int, 10>{{3, 5, 7, 0, 0, 0, 0, 0, 0, 0}}
));
@ -33,7 +33,7 @@ namespace testspr {
sprout::begin(arr1) + 8,
arr2
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
uniqued,
array<int, 3>{{3, 5, 7}}
));
@ -46,7 +46,7 @@ namespace testspr {
sprout::begin(arr1) + 8,
arr3
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
uniqued,
array<int, 2>{{3, 5}}
));
@ -57,7 +57,7 @@ namespace testspr {
sprout::begin(arr1) + 8,
arr3
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
uniqued,
array<int, 2>{{3, 5}}
));
@ -70,11 +70,11 @@ namespace testspr {
sprout::begin(arr1) + 8,
sprout::sub(arr2, 2, 8)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
uniqued,
array<int, 6>{{3, 5, 7, 0, 0, 0}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(uniqued),
array<int, 10>{{0, 0, 3, 5, 7, 0, 0, 0, 0, 0}}
));
@ -85,11 +85,11 @@ namespace testspr {
sprout::begin(arr1) + 8,
sprout::sub(arr2, 2, 8)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
uniqued,
array<int, 3>{{3, 5, 7}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(uniqued),
array<int, 10>{{0, 0, 3, 5, 7, 0, 0, 0, 0, 0}}
));
@ -108,7 +108,7 @@ namespace testspr {
arr2,
testspr::equal_to<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
uniqued,
array<int, 10>{{3, 5, 7, 0, 0, 0, 0, 0, 0, 0}}
));
@ -120,7 +120,7 @@ namespace testspr {
arr2,
testspr::equal_to<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
uniqued,
array<int, 3>{{3, 5, 7}}
));
@ -134,7 +134,7 @@ namespace testspr {
arr3,
testspr::equal_to<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
uniqued,
array<int, 2>{{3, 5}}
));
@ -146,7 +146,7 @@ namespace testspr {
arr3,
testspr::equal_to<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
uniqued,
array<int, 2>{{3, 5}}
));
@ -160,11 +160,11 @@ namespace testspr {
sprout::sub(arr2, 2, 8),
testspr::equal_to<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
uniqued,
array<int, 6>{{3, 5, 7, 0, 0, 0}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(uniqued),
array<int, 10>{{0, 0, 3, 5, 7, 0, 0, 0, 0, 0}}
));
@ -176,11 +176,11 @@ namespace testspr {
sprout::sub(arr2, 2, 8),
testspr::equal_to<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
uniqued,
array<int, 3>{{3, 5, 7}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(uniqued),
array<int, 10>{{0, 0, 3, 5, 7, 0, 0, 0, 0, 0}}
));