Sprout/libs/algorithm/test/replace.cpp

81 lines
2 KiB
C++
Raw Normal View History

#ifndef SPROUT_LIBS_ALGORITHM_TEST_REPLACE_CPP
#define SPROUT_LIBS_ALGORITHM_TEST_REPLACE_CPP
2011-12-23 11:59:33 +00:00
#include <sprout/algorithm/replace.hpp>
#include <sprout/array.hpp>
#include <sprout/sub_array.hpp>
#include <sprout/container.hpp>
2011-12-23 11:59:33 +00:00
#include <testspr/tools.hpp>
namespace testspr {
static void algorithm_replace_test() {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 0, 3, 0, 5, 0, 7, 0, 9, 0}};
// <20>u<EFBFBD><75> (0 -> -1)
{
SPROUT_STATIC_CONSTEXPR auto replaced = sprout::replace(
arr1,
0,
-1
);
TESTSPR_BOTH_ASSERT(testspr::equal(
2011-12-23 11:59:33 +00:00
replaced,
array<int, 10>{{1, -1, 3, -1, 5, -1, 7, -1, 9, -1}}
));
}
{
SPROUT_STATIC_CONSTEXPR auto replaced = sprout::fit::replace(
arr1,
0,
-1
);
TESTSPR_BOTH_ASSERT(testspr::equal(
2011-12-23 11:59:33 +00:00
replaced,
array<int, 10>{{1, -1, 3, -1, 5, -1, 7, -1, 9, -1}}
));
}
// <20>u<EFBFBD><75> (0 -> -1)
// <20>͈͂̐؂<CC90><D882>o<EFBFBD><6F>
{
SPROUT_STATIC_CONSTEXPR auto replaced = sprout::replace(
sprout::sub(arr1, 2, 8),
0,
-1
);
TESTSPR_BOTH_ASSERT(testspr::equal(
2011-12-23 11:59:33 +00:00
replaced,
array<int, 6>{{3, -1, 5, -1, 7, -1}}
));
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(replaced),
2011-12-23 11:59:33 +00:00
array<int, 10>{{1, 0, 3, -1, 5, -1, 7, -1, 9, 0}}
));
}
{
SPROUT_STATIC_CONSTEXPR auto replaced = sprout::fit::replace(
sprout::sub(arr1, 2, 8),
0,
-1
);
TESTSPR_BOTH_ASSERT(testspr::equal(
2011-12-23 11:59:33 +00:00
replaced,
array<int, 6>{{3, -1, 5, -1, 7, -1}}
));
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(replaced),
2011-12-23 11:59:33 +00:00
array<int, 10>{{1, 0, 3, -1, 5, -1, 7, -1, 9, 0}}
));
}
}
}
} // namespace testspr
#ifndef TESTSPR_CPP_INCLUDE
# define TESTSPR_TEST_FUNCTION testspr::algorithm_replace_test
# include <testspr/include_main.hpp>
#endif
#endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_REPLACE_CPP