Sprout/libs/algorithm/test/unique.cpp

135 lines
3.6 KiB
C++
Raw Normal View History

2013-08-08 09:54:33 +00:00
/*=============================================================================
2014-01-08 07:48:12 +00:00
Copyright (c) 2011-2014 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_UNIQUE_CPP
#define SPROUT_LIBS_ALGORITHM_TEST_UNIQUE_CPP
2011-12-23 11:59:33 +00:00
#include <sprout/algorithm/unique.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_unique_test() {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 1, 3, 3, 5, 5, 7, 7, 9, 9}};
// <20>u<EFBFBD>c<EFBFBD>c<EFBFBD><63><EFBFBD>j<EFBFBD>[<5B>N<EFBFBD>v
{
SPROUT_STATIC_CONSTEXPR auto uniqued = sprout::unique(
arr1
);
TESTSPR_BOTH_ASSERT(testspr::equal(
2011-12-23 11:59:33 +00:00
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(
2011-12-23 11:59:33 +00:00
uniqued,
array<int, 5>{{1, 3, 5, 7, 9}}
));
}
// <20>u<EFBFBD>c<EFBFBD>c<EFBFBD><63><EFBFBD>j<EFBFBD>[<5B>N<EFBFBD>v
// <20>͈͂̐؂<CC90><D882>o<EFBFBD><6F>
{
SPROUT_STATIC_CONSTEXPR auto uniqued = sprout::unique(
sprout::sub(arr1, 2, 8)
);
TESTSPR_BOTH_ASSERT(testspr::equal(
2011-12-23 11:59:33 +00:00
uniqued,
array<int, 6>{{3, 5, 7, 5, 7, 7}}
));
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(uniqued),
2011-12-23 11:59:33 +00:00
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(
2011-12-23 11:59:33 +00:00
uniqued,
array<int, 3>{{3, 5, 7}}
));
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(uniqued),
2011-12-23 11:59:33 +00:00
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}};
// <20>u<EFBFBD>c<EFBFBD>c<EFBFBD><63><EFBFBD>j<EFBFBD>[<5B>N<EFBFBD>v
{
SPROUT_STATIC_CONSTEXPR auto uniqued = sprout::unique(
arr1,
testspr::equal_to<int>()
);
TESTSPR_BOTH_ASSERT(testspr::equal(
2011-12-23 11:59:33 +00:00
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(
2011-12-23 11:59:33 +00:00
uniqued,
array<int, 5>{{1, 3, 5, 7, 9}}
));
}
// <20>u<EFBFBD>c<EFBFBD>c<EFBFBD><63><EFBFBD>j<EFBFBD>[<5B>N<EFBFBD>v
// <20>͈͂̐؂<CC90><D882>o<EFBFBD><6F>
{
SPROUT_STATIC_CONSTEXPR auto uniqued = sprout::unique(
sprout::sub(arr1, 2, 8),
testspr::equal_to<int>()
);
TESTSPR_BOTH_ASSERT(testspr::equal(
2011-12-23 11:59:33 +00:00
uniqued,
array<int, 6>{{3, 5, 7, 5, 7, 7}}
));
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(uniqued),
2011-12-23 11:59:33 +00:00
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(
2011-12-23 11:59:33 +00:00
uniqued,
array<int, 3>{{3, 5, 7}}
));
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(uniqued),
2011-12-23 11:59:33 +00:00
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