Sprout/libs/algorithm/test/copy_n.cpp

114 lines
3 KiB
C++
Raw Normal View History

2013-08-08 09:54:33 +00:00
/*=============================================================================
2016-02-25 09:48:28 +00:00
Copyright (c) 2011-2016 Bolero MURAKAMI
2013-08-08 09:54:33 +00:00
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_COPY_N_CPP
#define SPROUT_LIBS_ALGORITHM_TEST_COPY_N_CPP
2011-12-23 11:59:33 +00:00
#include <sprout/algorithm/copy_n.hpp>
#include <sprout/array.hpp>
#include <sprout/container.hpp>
2011-12-23 11:59:33 +00:00
#include <testspr/tools.hpp>
namespace testspr {
static void algorithm_copy_n_test() {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}};
2013-07-22 13:00:09 +00:00
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{{}};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{{}};
2011-12-23 11:59:33 +00:00
2014-07-02 13:16:29 +00:00
// copy 6 elements
2011-12-23 11:59:33 +00:00
{
SPROUT_STATIC_CONSTEXPR auto copied = sprout::copy_n(
sprout::begin(arr1) + 2,
6,
arr2
);
TESTSPR_BOTH_ASSERT(testspr::equal(
2011-12-23 11:59:33 +00:00
copied,
array<int, 10>{{3, 4, 5, 6, 7, 8, 0, 0, 0, 0}}
));
}
{
SPROUT_STATIC_CONSTEXPR auto copied = sprout::fit::copy_n(
sprout::begin(arr1) + 2,
6,
arr2
);
TESTSPR_BOTH_ASSERT(testspr::equal(
2011-12-23 11:59:33 +00:00
copied,
array<int, 6>{{3, 4, 5, 6, 7, 8}}
));
}
2014-07-02 13:16:29 +00:00
// copy 6 elements
// overrun from output range
2011-12-23 11:59:33 +00:00
{
SPROUT_STATIC_CONSTEXPR auto copied = sprout::copy_n(
sprout::begin(arr1) + 2,
6,
arr3
);
TESTSPR_BOTH_ASSERT(testspr::equal(
2011-12-23 11:59:33 +00:00
copied,
array<int, 4>{{3, 4, 5, 6}}
));
}
{
SPROUT_STATIC_CONSTEXPR auto copied = sprout::fit::copy_n(
sprout::begin(arr1) + 2,
6,
arr3
);
TESTSPR_BOTH_ASSERT(testspr::equal(
2011-12-23 11:59:33 +00:00
copied,
array<int, 4>{{3, 4, 5, 6}}
));
}
2014-07-02 13:16:29 +00:00
// copy 6 elements
// to sub range
2011-12-23 11:59:33 +00:00
{
SPROUT_STATIC_CONSTEXPR auto copied = sprout::copy_n(
sprout::begin(arr1) + 2,
6,
sprout::sub(arr2, 2, 8)
);
TESTSPR_BOTH_ASSERT(testspr::equal(
2011-12-23 11:59:33 +00:00
copied,
array<int, 6>{{3, 4, 5, 6, 7, 8}}
));
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(copied),
2011-12-23 11:59:33 +00:00
array<int, 10>{{0, 0, 3, 4, 5, 6, 7, 8, 0, 0}}
));
}
{
SPROUT_STATIC_CONSTEXPR auto copied = sprout::fit::copy_n(
sprout::begin(arr1) + 2,
6,
sprout::sub(arr2, 2, 8)
);
TESTSPR_BOTH_ASSERT(testspr::equal(
2011-12-23 11:59:33 +00:00
copied,
array<int, 6>{{3, 4, 5, 6, 7, 8}}
));
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(copied),
2011-12-23 11:59:33 +00:00
array<int, 10>{{0, 0, 3, 4, 5, 6, 7, 8, 0, 0}}
));
}
}
}
} // namespace testspr
#ifndef TESTSPR_CPP_INCLUDE
# define TESTSPR_TEST_FUNCTION testspr::algorithm_copy_n_test
# include <testspr/include_main.hpp>
#endif
#endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_COPY_N_CPP