King_DuckZ/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout synced 2024-11-12 21:09:01 +00:00
Code Issues Releases Wiki Activity
Sprout/libs/algorithm/test/copy.cpp

357 lines
10 KiB
C++
Raw Normal View History

add copyright
2013-08-08 09:54:33 +00:00
/*=============================================================================
fix copyright year
2014-01-08 07:48:12 +00:00
Copyright (c) 2011-2014 Bolero MURAKAMI
add copyright
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)
=============================================================================*/
move textspr/sprout/* -> libs/<libname>/test/* fix binomial_distribution
2012-05-19 09:46:38 +00:00
#ifndef SPROUT_LIBS_ALGORITHM_TEST_COPY_CPP
#define SPROUT_LIBS_ALGORITHM_TEST_COPY_CPP
testspr テスト追加
2011-12-23 11:59:33 +00:00
#include <sprout/algorithm/copy.hpp>
#include <sprout/array.hpp>
#include <sprout/sub_array.hpp>
[desuructive changes] container traits new interface [破壊的変更]
2012-03-31 07:24:13 +00:00
#include <sprout/container.hpp>
testspr テスト追加
2011-12-23 11:59:33 +00:00
#include <testspr/tools.hpp>
namespace testspr {
static void algorithm_copy_test() {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}};
fix warning (for -Wextra)
2013-07-22 13:00:09 +00:00
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{{}};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{{}};
testspr テスト追加
2011-12-23 11:59:33 +00:00
fix.
2014-07-02 13:16:29 +00:00
// copy in range [2 .. 8)
testspr テスト追加
2011-12-23 11:59:33 +00:00
{
SPROUT_STATIC_CONSTEXPR auto copied = sprout::copy(
sprout::begin(arr1) + 2,
sprout::begin(arr1) + 8,
arr2
);
fix for constexpr disabled add sprout::adaptors::sized
2012-06-15 15:08:42 +00:00
TESTSPR_BOTH_ASSERT(testspr::equal(
testspr テスト追加
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(
sprout::begin(arr1) + 2,
sprout::begin(arr1) + 8,
arr2
);
fix for constexpr disabled add sprout::adaptors::sized
2012-06-15 15:08:42 +00:00
TESTSPR_BOTH_ASSERT(testspr::equal(
testspr テスト追加
2011-12-23 11:59:33 +00:00
copied,
array<int, 6>{{3, 4, 5, 6, 7, 8}}
));
}
fix.
2014-07-02 13:16:29 +00:00
// copy in range [2 .. 8)
// overrun from output range
testspr テスト追加
2011-12-23 11:59:33 +00:00
{
SPROUT_STATIC_CONSTEXPR auto copied = sprout::copy(
sprout::begin(arr1) + 2,
sprout::begin(arr1) + 8,
arr3
);
fix for constexpr disabled add sprout::adaptors::sized
2012-06-15 15:08:42 +00:00
TESTSPR_BOTH_ASSERT(testspr::equal(
testspr テスト追加
2011-12-23 11:59:33 +00:00
copied,
array<int, 4>{{3, 4, 5, 6}}
));
}
{
SPROUT_STATIC_CONSTEXPR auto copied = sprout::fit::copy(
sprout::begin(arr1) + 2,
sprout::begin(arr1) + 8,
arr3
);
fix for constexpr disabled add sprout::adaptors::sized
2012-06-15 15:08:42 +00:00
TESTSPR_BOTH_ASSERT(testspr::equal(
testspr テスト追加
2011-12-23 11:59:33 +00:00
copied,
array<int, 4>{{3, 4, 5, 6}}
));
}
fix.
2014-07-02 13:16:29 +00:00
// copy in range [2 .. 8)
// to sub range
testspr テスト追加
2011-12-23 11:59:33 +00:00
{
SPROUT_STATIC_CONSTEXPR auto copied = sprout::copy(
sprout::begin(arr1) + 2,
sprout::begin(arr1) + 8,
sprout::sub(arr2, 2, 8)
);
fix for constexpr disabled add sprout::adaptors::sized
2012-06-15 15:08:42 +00:00
TESTSPR_BOTH_ASSERT(testspr::equal(
testspr テスト追加
2011-12-23 11:59:33 +00:00
copied,
array<int, 6>{{3, 4, 5, 6, 7, 8}}
));
fix for constexpr disabled add sprout::adaptors::sized
2012-06-15 15:08:42 +00:00
TESTSPR_BOTH_ASSERT(testspr::equal(
[desuructive changes] container traits new interface [破壊的変更]
2012-03-31 07:24:13 +00:00
sprout::get_internal(copied),
testspr テスト追加
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(
sprout::begin(arr1) + 2,
sprout::begin(arr1) + 8,
sprout::sub(arr2, 2, 8)
);
fix for constexpr disabled add sprout::adaptors::sized
2012-06-15 15:08:42 +00:00
TESTSPR_BOTH_ASSERT(testspr::equal(
testspr テスト追加
2011-12-23 11:59:33 +00:00
copied,
array<int, 6>{{3, 4, 5, 6, 7, 8}}
));
fix for constexpr disabled add sprout::adaptors::sized
2012-06-15 15:08:42 +00:00
TESTSPR_BOTH_ASSERT(testspr::equal(
[desuructive changes] container traits new interface [破壊的変更]
2012-03-31 07:24:13 +00:00
sprout::get_internal(copied),
testspr テスト追加
2011-12-23 11:59:33 +00:00
array<int, 10>{{0, 0, 3, 4, 5, 6, 7, 8, 0, 0}}
));
}
fix algorithm: copy for InputIterator
2013-08-12 16:55:26 +00:00
fix.
2014-07-02 13:16:29 +00:00
// copy in range [2 .. 8)
fix algorithm: copy for InputIterator
2013-08-12 16:55:26 +00:00
{
SPROUT_STATIC_CONSTEXPR auto copied = sprout::copy(
testspr::reduct_input(sprout::begin(arr1) + 2),
testspr::reduct_input(sprout::begin(arr1) + 8),
arr2
);
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 10>{{3, 4, 5, 6, 7, 8, 0, 0, 0, 0}}
));
}
fix version check macro
2014-01-20 02:23:03 +00:00
// !!! BUG: sprout::fit::copy implementation requires ForwardIterator
fix algorithm: copy for InputIterator
2013-08-12 16:55:26 +00:00
// {
// SPROUT_STATIC_CONSTEXPR auto copied = sprout::fit::copy(
// testspr::reduct_input(sprout::begin(arr1) + 2),
// testspr::reduct_input(sprout::begin(arr1) + 8),
// arr2
// );
// TESTSPR_BOTH_ASSERT(testspr::equal(
// copied,
// array<int, 6>{{3, 4, 5, 6, 7, 8}}
// ));
// }
fix.
2014-07-02 13:16:29 +00:00
// copy in range [2 .. 8)
// overrun from output range
fix algorithm: copy for InputIterator
2013-08-12 16:55:26 +00:00
{
SPROUT_STATIC_CONSTEXPR auto copied = sprout::copy(
testspr::reduct_input(sprout::begin(arr1) + 2),
testspr::reduct_input(sprout::begin(arr1) + 8),
arr3
);
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 4>{{3, 4, 5, 6}}
));
}
fix version check macro
2014-01-20 02:23:03 +00:00
// !!! BUG: sprout::fit::copy implementation requires ForwardIterator
fix algorithm: copy for InputIterator
2013-08-12 16:55:26 +00:00
// {
// SPROUT_STATIC_CONSTEXPR auto copied = sprout::fit::copy(
// testspr::reduct_input(sprout::begin(arr1) + 2),
// testspr::reduct_input(sprout::begin(arr1) + 8),
// arr3
// );
// TESTSPR_BOTH_ASSERT(testspr::equal(
// copied,
// array<int, 4>{{3, 4, 5, 6}}
// ));
// }
fix.
2014-07-02 13:16:29 +00:00
// copy in range [2 .. 8)
// to sub range
fix algorithm: copy for InputIterator
2013-08-12 16:55:26 +00:00
{
SPROUT_STATIC_CONSTEXPR auto copied = sprout::copy(
testspr::reduct_input(sprout::begin(arr1) + 2),
testspr::reduct_input(sprout::begin(arr1) + 8),
sprout::sub(arr2, 2, 8)
);
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 6>{{3, 4, 5, 6, 7, 8}}
));
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(copied),
array<int, 10>{{0, 0, 3, 4, 5, 6, 7, 8, 0, 0}}
));
}
fix version check macro
2014-01-20 02:23:03 +00:00
// !!! BUG: sprout::fit::copy implementation requires ForwardIterator
fix algorithm: copy for InputIterator
2013-08-12 16:55:26 +00:00
// {
// SPROUT_STATIC_CONSTEXPR auto copied = sprout::fit::copy(
// testspr::reduct_input(sprout::begin(arr1) + 2),
// testspr::reduct_input(sprout::begin(arr1) + 8),
// sprout::sub(arr2, 2, 8)
// );
// TESTSPR_BOTH_ASSERT(testspr::equal(
// copied,
// array<int, 6>{{3, 4, 5, 6, 7, 8}}
// ));
// TESTSPR_BOTH_ASSERT(testspr::equal(
// sprout::get_internal(copied),
// array<int, 10>{{0, 0, 3, 4, 5, 6, 7, 8, 0, 0}}
// ));
// }
fix.
2014-07-02 13:16:29 +00:00
// copy in range [2 .. 8)
fix algorithm: copy for InputIterator
2013-08-12 16:55:26 +00:00
{
SPROUT_STATIC_CONSTEXPR auto copied = sprout::copy(
testspr::reduct_forward(sprout::begin(arr1) + 2),
testspr::reduct_forward(sprout::begin(arr1) + 8),
arr2
);
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 10>{{3, 4, 5, 6, 7, 8, 0, 0, 0, 0}}
));
}
{
SPROUT_STATIC_CONSTEXPR auto copied = sprout::fit::copy(
testspr::reduct_forward(sprout::begin(arr1) + 2),
testspr::reduct_forward(sprout::begin(arr1) + 8),
arr2
);
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 6>{{3, 4, 5, 6, 7, 8}}
));
}
fix.
2014-07-02 13:16:29 +00:00
// copy in range [2 .. 8)
// overrun from output range
fix algorithm: copy for InputIterator
2013-08-12 16:55:26 +00:00
{
SPROUT_STATIC_CONSTEXPR auto copied = sprout::copy(
testspr::reduct_forward(sprout::begin(arr1) + 2),
testspr::reduct_forward(sprout::begin(arr1) + 8),
arr3
);
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 4>{{3, 4, 5, 6}}
));
}
{
SPROUT_STATIC_CONSTEXPR auto copied = sprout::fit::copy(
testspr::reduct_forward(sprout::begin(arr1) + 2),
testspr::reduct_forward(sprout::begin(arr1) + 8),
arr3
);
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 4>{{3, 4, 5, 6}}
));
}
fix.
2014-07-02 13:16:29 +00:00
// copy in range [2 .. 8)
// to sub range
fix algorithm: copy for InputIterator
2013-08-12 16:55:26 +00:00
{
SPROUT_STATIC_CONSTEXPR auto copied = sprout::copy(
testspr::reduct_forward(sprout::begin(arr1) + 2),
testspr::reduct_forward(sprout::begin(arr1) + 8),
sprout::sub(arr2, 2, 8)
);
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 6>{{3, 4, 5, 6, 7, 8}}
));
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(copied),
array<int, 10>{{0, 0, 3, 4, 5, 6, 7, 8, 0, 0}}
));
}
{
SPROUT_STATIC_CONSTEXPR auto copied = sprout::fit::copy(
testspr::reduct_forward(sprout::begin(arr1) + 2),
testspr::reduct_forward(sprout::begin(arr1) + 8),
sprout::sub(arr2, 2, 8)
);
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 6>{{3, 4, 5, 6, 7, 8}}
));
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(copied),
array<int, 10>{{0, 0, 3, 4, 5, 6, 7, 8, 0, 0}}
));
}
fix.
2014-07-02 13:16:29 +00:00
// copy in range [2 .. 8)
fix algorithm: copy for InputIterator
2013-08-12 16:55:26 +00:00
{
SPROUT_STATIC_CONSTEXPR auto copied = sprout::copy(
testspr::reduct_random_access(sprout::begin(arr1) + 2),
testspr::reduct_random_access(sprout::begin(arr1) + 8),
arr2
);
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 10>{{3, 4, 5, 6, 7, 8, 0, 0, 0, 0}}
));
}
{
SPROUT_STATIC_CONSTEXPR auto copied = sprout::fit::copy(
testspr::reduct_random_access(sprout::begin(arr1) + 2),
testspr::reduct_random_access(sprout::begin(arr1) + 8),
arr2
);
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 6>{{3, 4, 5, 6, 7, 8}}
));
}
fix.
2014-07-02 13:16:29 +00:00
// copy in range [2 .. 8)
// overrun from output range
fix algorithm: copy for InputIterator
2013-08-12 16:55:26 +00:00
{
SPROUT_STATIC_CONSTEXPR auto copied = sprout::copy(
testspr::reduct_random_access(sprout::begin(arr1) + 2),
testspr::reduct_random_access(sprout::begin(arr1) + 8),
arr3
);
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 4>{{3, 4, 5, 6}}
));
}
{
SPROUT_STATIC_CONSTEXPR auto copied = sprout::fit::copy(
testspr::reduct_random_access(sprout::begin(arr1) + 2),
testspr::reduct_random_access(sprout::begin(arr1) + 8),
arr3
);
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 4>{{3, 4, 5, 6}}
));
}
fix.
2014-07-02 13:16:29 +00:00
// copy in range [2 .. 8)
// to sub range
fix algorithm: copy for InputIterator
2013-08-12 16:55:26 +00:00
{
SPROUT_STATIC_CONSTEXPR auto copied = sprout::copy(
testspr::reduct_random_access(sprout::begin(arr1) + 2),
testspr::reduct_random_access(sprout::begin(arr1) + 8),
sprout::sub(arr2, 2, 8)
);
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 6>{{3, 4, 5, 6, 7, 8}}
));
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(copied),
array<int, 10>{{0, 0, 3, 4, 5, 6, 7, 8, 0, 0}}
));
}
{
SPROUT_STATIC_CONSTEXPR auto copied = sprout::fit::copy(
testspr::reduct_random_access(sprout::begin(arr1) + 2),
testspr::reduct_random_access(sprout::begin(arr1) + 8),
sprout::sub(arr2, 2, 8)
);
TESTSPR_BOTH_ASSERT(testspr::equal(
copied,
array<int, 6>{{3, 4, 5, 6, 7, 8}}
));
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(copied),
array<int, 10>{{0, 0, 3, 4, 5, 6, 7, 8, 0, 0}}
));
}
testspr テスト追加
2011-12-23 11:59:33 +00:00
}
}
} // namespace testspr
move textspr/sprout/* -> libs/<libname>/test/* fix binomial_distribution
2012-05-19 09:46:38 +00:00
#ifndef TESTSPR_CPP_INCLUDE
# define TESTSPR_TEST_FUNCTION testspr::algorithm_copy_test
# include <testspr/include_main.hpp>
#endif
#endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_COPY_CPP
Reference in a new issue Copy permalink