mirror/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout.git synced 2024-11-14 10:39:05 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions
Sprout/libs/algorithm/test/clamp_range_copy.cpp

229 lines
6 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)
=============================================================================*/
add algorithm clamp, clamp_range_copy, clamp_range
2012-10-13 12:06:32 +00:00
#ifndef SPROUT_LIBS_ALGORITHM_TEST_CLAMP_RANGE_COPY_CPP
#define SPROUT_LIBS_ALGORITHM_TEST_CLAMP_RANGE_COPY_CPP
#include <sprout/algorithm/clamp_range_copy.hpp>
#include <sprout/array.hpp>
#include <sprout/sub_array.hpp>
#include <sprout/container.hpp>
#include <testspr/tools.hpp>
namespace testspr {
static void algorithm_clamp_range_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>{{}};
add algorithm clamp, clamp_range_copy, clamp_range
2012-10-13 12:06:32 +00:00
// [2 .. 8) <20>͈̔͂<CD88><CD82>N<EFBFBD><4E><EFBFBD><EFBFBD><EFBFBD>v (4 <= x <= 7)
{
SPROUT_STATIC_CONSTEXPR auto clamped = sprout::clamp_range_copy(
sprout::begin(arr1) + 2,
sprout::begin(arr1) + 8,
arr2,
4,
7
);
TESTSPR_BOTH_ASSERT(testspr::equal(
clamped,
array<int, 10>{{4, 4, 5, 6, 7, 7, 0, 0, 0, 0}}
));
}
{
SPROUT_STATIC_CONSTEXPR auto clamped = sprout::fit::clamp_range_copy(
sprout::begin(arr1) + 2,
sprout::begin(arr1) + 8,
arr2,
4,
7
);
TESTSPR_BOTH_ASSERT(testspr::equal(
clamped,
array<int, 6>{{4, 4, 5, 6, 7, 7}}
));
}
// [2 .. 8) <20>͈̔͂<CD88><CD82>N<EFBFBD><4E><EFBFBD><EFBFBD><EFBFBD>v (4 <= x <= 7)
// <20>o<EFBFBD>͔͈͂<CD88><CD82>I<EFBFBD>[<5B>o<EFBFBD>[<5B><><EFBFBD><EFBFBD><EFBFBD>ꍇ
{
SPROUT_STATIC_CONSTEXPR auto clamped = sprout::clamp_range_copy(
sprout::begin(arr1) + 2,
sprout::begin(arr1) + 8,
arr3,
4,
7
);
TESTSPR_BOTH_ASSERT(testspr::equal(
clamped,
array<int, 4>{{4, 4, 5, 6}}
));
}
{
SPROUT_STATIC_CONSTEXPR auto clamped = sprout::fit::clamp_range_copy(
sprout::begin(arr1) + 2,
sprout::begin(arr1) + 8,
arr3,
4,
7
);
TESTSPR_BOTH_ASSERT(testspr::equal(
clamped,
array<int, 4>{{4, 4, 5, 6}}
));
}
// [2 .. 8) <20>͈̔͂<CD88><CD82>N<EFBFBD><4E><EFBFBD><EFBFBD><EFBFBD>v (4 <= x <= 7)
// <20>o<EFBFBD>͔͈͂̐؂<CC90><D882>o<EFBFBD><6F>
{
SPROUT_STATIC_CONSTEXPR auto clamped = sprout::clamp_range_copy(
sprout::begin(arr1) + 2,
sprout::begin(arr1) + 8,
sprout::sub(arr2, 2, 8),
4,
7
);
TESTSPR_BOTH_ASSERT(testspr::equal(
clamped,
array<int, 6>{{4, 4, 5, 6, 7, 7}}
));
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(clamped),
array<int, 10>{{0, 0, 4, 4, 5, 6, 7, 7, 0, 0}}
));
}
{
SPROUT_STATIC_CONSTEXPR auto clamped = sprout::fit::clamp_range_copy(
sprout::begin(arr1) + 2,
sprout::begin(arr1) + 8,
sprout::sub(arr2, 2, 8),
4,
7
);
TESTSPR_BOTH_ASSERT(testspr::equal(
clamped,
array<int, 6>{{4, 4, 5, 6, 7, 7}}
));
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(clamped),
array<int, 10>{{0, 0, 4, 4, 5, 6, 7, 7, 0, 0}}
));
}
}
{
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>{{}};
add algorithm clamp, clamp_range_copy, clamp_range
2012-10-13 12:06:32 +00:00
// [2 .. 8) <20>͈̔͂<CD88><CD82>N<EFBFBD><4E><EFBFBD><EFBFBD><EFBFBD>v (4 <= x <= 7)
{
SPROUT_STATIC_CONSTEXPR auto clamped = sprout::clamp_range_copy(
sprout::begin(arr1) + 2,
sprout::begin(arr1) + 8,
arr2,
4,
7,
testspr::less<int>()
);
TESTSPR_BOTH_ASSERT(testspr::equal(
clamped,
array<int, 10>{{4, 4, 5, 6, 7, 7, 0, 0, 0, 0}}
));
}
{
SPROUT_STATIC_CONSTEXPR auto clamped = sprout::fit::clamp_range_copy(
sprout::begin(arr1) + 2,
sprout::begin(arr1) + 8,
arr2,
4,
7,
testspr::less<int>()
);
TESTSPR_BOTH_ASSERT(testspr::equal(
clamped,
array<int, 6>{{4, 4, 5, 6, 7, 7}}
));
}
// [2 .. 8) <20>͈̔͂<CD88><CD82>N<EFBFBD><4E><EFBFBD><EFBFBD><EFBFBD>v (4 <= x <= 7)
// <20>o<EFBFBD>͔͈͂<CD88><CD82>I<EFBFBD>[<5B>o<EFBFBD>[<5B><><EFBFBD><EFBFBD><EFBFBD>ꍇ
{
SPROUT_STATIC_CONSTEXPR auto clamped = sprout::clamp_range_copy(
sprout::begin(arr1) + 2,
sprout::begin(arr1) + 8,
arr3,
4,
7,
testspr::less<int>()
);
TESTSPR_BOTH_ASSERT(testspr::equal(
clamped,
array<int, 4>{{4, 4, 5, 6}}
));
}
{
SPROUT_STATIC_CONSTEXPR auto clamped = sprout::fit::clamp_range_copy(
sprout::begin(arr1) + 2,
sprout::begin(arr1) + 8,
arr3,
4,
7,
testspr::less<int>()
);
TESTSPR_BOTH_ASSERT(testspr::equal(
clamped,
array<int, 4>{{4, 4, 5, 6}}
));
}
// [2 .. 8) <20>͈̔͂<CD88><CD82>N<EFBFBD><4E><EFBFBD><EFBFBD><EFBFBD>v (4 <= x <= 7)
// <20>o<EFBFBD>͔͈͂̐؂<CC90><D882>o<EFBFBD><6F>
{
SPROUT_STATIC_CONSTEXPR auto clamped = sprout::clamp_range_copy(
sprout::begin(arr1) + 2,
sprout::begin(arr1) + 8,
sprout::sub(arr2, 2, 8),
4,
7,
testspr::less<int>()
);
TESTSPR_BOTH_ASSERT(testspr::equal(
clamped,
array<int, 6>{{4, 4, 5, 6, 7, 7}}
));
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(clamped),
array<int, 10>{{0, 0, 4, 4, 5, 6, 7, 7, 0, 0}}
));
}
{
SPROUT_STATIC_CONSTEXPR auto clamped = sprout::fit::clamp_range_copy(
sprout::begin(arr1) + 2,
sprout::begin(arr1) + 8,
sprout::sub(arr2, 2, 8),
4,
7,
testspr::less<int>()
);
TESTSPR_BOTH_ASSERT(testspr::equal(
clamped,
array<int, 6>{{4, 4, 5, 6, 7, 7}}
));
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(clamped),
array<int, 10>{{0, 0, 4, 4, 5, 6, 7, 7, 0, 0}}
));
}
}
}
} // namespace testspr
#ifndef TESTSPR_CPP_INCLUDE
# define TESTSPR_TEST_FUNCTION testspr::algorithm_clamp_range_copy_test
# include <testspr/include_main.hpp>
#endif
#endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_CLAMP_RANGE_COPY_CPP
Reference in a new issue Copy permalink