mirror of
https://github.com/bolero-MURAKAMI/Sprout.git
synced 2024-11-14 10:39:05 +00:00
134 lines
3.6 KiB
C++
134 lines
3.6 KiB
C++
/*=============================================================================
|
|
Copyright (c) 2011-2016 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_UNIQUE_CPP
|
|
#define SPROUT_LIBS_ALGORITHM_TEST_UNIQUE_CPP
|
|
|
|
#include <sprout/algorithm/unique.hpp>
|
|
#include <sprout/array.hpp>
|
|
#include <sprout/sub_array.hpp>
|
|
#include <sprout/container.hpp>
|
|
#include <testspr/tools.hpp>
|
|
|
|
namespace testspr {
|
|
static void algorithm_unique_test() {
|
|
using namespace sprout;
|
|
{
|
|
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 1, 3, 3, 5, 5, 7, 7, 9, 9}};
|
|
|
|
// "...Unique".
|
|
{
|
|
SPROUT_STATIC_CONSTEXPR auto uniqued = sprout::unique(
|
|
arr1
|
|
);
|
|
TESTSPR_BOTH_ASSERT(testspr::equal(
|
|
uniqued,
|
|
array<int, 10>{{1, 3, 5, 7, 9, 5, 7, 7, 9, 9}}
|
|
));
|
|
}
|
|
{
|
|
SPROUT_STATIC_CONSTEXPR auto uniqued = sprout::fit::unique(
|
|
arr1
|
|
);
|
|
TESTSPR_BOTH_ASSERT(testspr::equal(
|
|
uniqued,
|
|
array<int, 5>{{1, 3, 5, 7, 9}}
|
|
));
|
|
}
|
|
// "...Unique".
|
|
// from sub range
|
|
{
|
|
SPROUT_STATIC_CONSTEXPR auto uniqued = sprout::unique(
|
|
sprout::sub(arr1, 2, 8)
|
|
);
|
|
TESTSPR_BOTH_ASSERT(testspr::equal(
|
|
uniqued,
|
|
array<int, 6>{{3, 5, 7, 5, 7, 7}}
|
|
));
|
|
TESTSPR_BOTH_ASSERT(testspr::equal(
|
|
sprout::get_internal(uniqued),
|
|
array<int, 10>{{1, 1, 3, 5, 7, 5, 7, 7, 9, 9}}
|
|
));
|
|
}
|
|
{
|
|
SPROUT_STATIC_CONSTEXPR auto uniqued = sprout::fit::unique(
|
|
sprout::sub(arr1, 2, 8)
|
|
);
|
|
TESTSPR_BOTH_ASSERT(testspr::equal(
|
|
uniqued,
|
|
array<int, 3>{{3, 5, 7}}
|
|
));
|
|
TESTSPR_BOTH_ASSERT(testspr::equal(
|
|
sprout::get_internal(uniqued),
|
|
array<int, 10>{{1, 1, 3, 5, 7, 5, 7, 7, 9, 9}}
|
|
));
|
|
}
|
|
}
|
|
{
|
|
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 1, 3, 3, 5, 5, 7, 7, 9, 9}};
|
|
|
|
// "...Unique".
|
|
{
|
|
SPROUT_STATIC_CONSTEXPR auto uniqued = sprout::unique(
|
|
arr1,
|
|
testspr::equal_to<int>()
|
|
);
|
|
TESTSPR_BOTH_ASSERT(testspr::equal(
|
|
uniqued,
|
|
array<int, 10>{{1, 3, 5, 7, 9, 5, 7, 7, 9, 9}}
|
|
));
|
|
}
|
|
{
|
|
SPROUT_STATIC_CONSTEXPR auto uniqued = sprout::fit::unique(
|
|
arr1,
|
|
testspr::equal_to<int>()
|
|
);
|
|
TESTSPR_BOTH_ASSERT(testspr::equal(
|
|
uniqued,
|
|
array<int, 5>{{1, 3, 5, 7, 9}}
|
|
));
|
|
}
|
|
// "...Unique".
|
|
// from sub range
|
|
{
|
|
SPROUT_STATIC_CONSTEXPR auto uniqued = sprout::unique(
|
|
sprout::sub(arr1, 2, 8),
|
|
testspr::equal_to<int>()
|
|
);
|
|
TESTSPR_BOTH_ASSERT(testspr::equal(
|
|
uniqued,
|
|
array<int, 6>{{3, 5, 7, 5, 7, 7}}
|
|
));
|
|
TESTSPR_BOTH_ASSERT(testspr::equal(
|
|
sprout::get_internal(uniqued),
|
|
array<int, 10>{{1, 1, 3, 5, 7, 5, 7, 7, 9, 9}}
|
|
));
|
|
}
|
|
{
|
|
SPROUT_STATIC_CONSTEXPR auto uniqued = sprout::fit::unique(
|
|
sprout::sub(arr1, 2, 8),
|
|
testspr::equal_to<int>()
|
|
);
|
|
TESTSPR_BOTH_ASSERT(testspr::equal(
|
|
uniqued,
|
|
array<int, 3>{{3, 5, 7}}
|
|
));
|
|
TESTSPR_BOTH_ASSERT(testspr::equal(
|
|
sprout::get_internal(uniqued),
|
|
array<int, 10>{{1, 1, 3, 5, 7, 5, 7, 7, 9, 9}}
|
|
));
|
|
}
|
|
}
|
|
}
|
|
} // namespace testspr
|
|
|
|
#ifndef TESTSPR_CPP_INCLUDE
|
|
# define TESTSPR_TEST_FUNCTION testspr::algorithm_unique_test
|
|
# include <testspr/include_main.hpp>
|
|
#endif
|
|
|
|
#endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_UNIQUE_CPP
|