Sprout/libs/algorithm/test/fill_n.cpp

88 lines
2.3 KiB
C++
Raw Normal View History

2013-08-08 09:54:33 +00:00
/*=============================================================================
Copyright (c) 2011-2013 Bolero MURAKAMI
https://github.com/bolero-MURAKAMI/Sprout
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
=============================================================================*/
#ifndef SPROUT_LIBS_ALGORITHM_TEST_FILL_N_CPP
#define SPROUT_LIBS_ALGORITHM_TEST_FILL_N_CPP
2011-12-23 11:59:33 +00:00
#include <sprout/algorithm/fill_n.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_fill_n_test() {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}};
// <20>[<5B>U (-1)
{
SPROUT_STATIC_CONSTEXPR auto filled = sprout::fill_n(
arr1,
4,
-1
);
TESTSPR_BOTH_ASSERT(testspr::equal(
2011-12-23 11:59:33 +00:00
filled,
array<int, 10>{{-1, -1, -1, -1, 5, 6, 7, 8, 9, 10}}
));
}
{
SPROUT_STATIC_CONSTEXPR auto filled = sprout::fit::fill_n(
arr1,
4,
-1
);
TESTSPR_BOTH_ASSERT(testspr::equal(
2011-12-23 11:59:33 +00:00
filled,
array<int, 4>{{-1, -1, -1, -1}}
));
}
// <20>[<5B>U (-1)
// <20>͈͂̐؂<CC90><D882>o<EFBFBD><6F>
{
SPROUT_STATIC_CONSTEXPR auto filled = sprout::fill_n(
sprout::sub(arr1, 2, 8),
4,
-1
);
TESTSPR_BOTH_ASSERT(testspr::equal(
2011-12-23 11:59:33 +00:00
filled,
array<int, 6>{{-1, -1, -1, -1, 7, 8}}
));
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(filled),
2011-12-23 11:59:33 +00:00
array<int, 10>{{1, 2, -1, -1, -1, -1, 7, 8, 9, 10}}
));
}
{
SPROUT_STATIC_CONSTEXPR auto filled = sprout::fit::fill_n(
sprout::sub(arr1, 2, 8),
4,
-1
);
TESTSPR_BOTH_ASSERT(testspr::equal(
2011-12-23 11:59:33 +00:00
filled,
array<int, 4>{{-1, -1, -1, -1}}
));
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(filled),
2011-12-23 11:59:33 +00:00
array<int, 10>{{1, 2, -1, -1, -1, -1, 7, 8, 9, 10}}
));
}
}
}
} // namespace testspr
#ifndef TESTSPR_CPP_INCLUDE
# define TESTSPR_TEST_FUNCTION testspr::algorithm_fill_n_test
# include <testspr/include_main.hpp>
#endif
#endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_FILL_N_CPP