Sprout/testspr/sprout/algorithm/set_intersection.hpp

220 lines
5.7 KiB
C++
Raw Normal View History

2011-12-23 11:59:33 +00:00
#ifndef TESTSPR_SPROUT_ALGORITHM_SET_INTERSECTION_HPP
#define TESTSPR_SPROUT_ALGORITHM_SET_INTERSECTION_HPP
#include <sprout/algorithm/set_intersection.hpp>
#include <sprout/array.hpp>
#include <sprout/sub_array.hpp>
#include <sprout/fixed_container.hpp>
#include <testspr/tools.hpp>
namespace testspr {
static void algorithm_set_intersection_test() {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 5>{{20, 25, 30, 35, 40}};
SPROUT_STATIC_CONSTEXPR auto arr1_2 = array<int, 5>{{10, 20, 30, 40, 50}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 2>{};
// <20>_<EFBFBD><5F><EFBFBD><EFBFBD>
{
SPROUT_STATIC_CONSTEXPR auto merged = sprout::set_intersection(
sprout::begin(arr1),
sprout::end(arr1),
sprout::begin(arr1_2),
sprout::end(arr1_2),
arr2
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
merged,
array<int, 10>{{20, 30, 40, 0, 0, 0, 0, 0, 0, 0}}
));
}
{
SPROUT_STATIC_CONSTEXPR auto merged = sprout::fit::set_intersection(
sprout::begin(arr1),
sprout::end(arr1),
sprout::begin(arr1_2),
sprout::end(arr1_2),
arr2
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
merged,
array<int, 3>{{20, 30, 40}}
));
}
// <20>_<EFBFBD><5F><EFBFBD><EFBFBD>
// <20>o<EFBFBD>͔͈͂<CD88><CD82>I<EFBFBD>[<5B>o<EFBFBD>[<5B><><EFBFBD><EFBFBD><EFBFBD>
{
SPROUT_STATIC_CONSTEXPR auto merged = sprout::set_intersection(
sprout::begin(arr1),
sprout::end(arr1),
sprout::begin(arr1_2),
sprout::end(arr1_2),
arr3
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
merged,
array<int, 2>{{20, 30}}
));
}
{
SPROUT_STATIC_CONSTEXPR auto merged = sprout::fit::set_intersection(
sprout::begin(arr1),
sprout::end(arr1),
sprout::begin(arr1_2),
sprout::end(arr1_2),
arr3
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
merged,
array<int, 2>{{20, 30}}
));
}
// <20>_<EFBFBD><5F><EFBFBD><EFBFBD>
// <20>o<EFBFBD>͔͈͂̐؂<CC90><D882>o<EFBFBD><6F>
{
SPROUT_STATIC_CONSTEXPR auto merged = sprout::set_intersection(
sprout::begin(arr1),
sprout::end(arr1),
sprout::begin(arr1_2),
sprout::end(arr1_2),
sprout::sub(arr2, 2, 8)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
merged,
array<int, 6>{{20, 30, 40, 0, 0, 0}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
sprout::get_fixed(merged),
array<int, 10>{{0, 0, 20, 30, 40, 0, 0, 0, 0, 0}}
));
}
{
SPROUT_STATIC_CONSTEXPR auto merged = sprout::fit::set_intersection(
sprout::begin(arr1),
sprout::end(arr1),
sprout::begin(arr1_2),
sprout::end(arr1_2),
sprout::sub(arr2, 2, 8)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
merged,
array<int, 3>{{20, 30, 40}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
sprout::get_fixed(merged),
array<int, 10>{{0, 0, 20, 30, 40, 0, 0, 0, 0, 0}}
));
}
}
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 5>{{20, 25, 30, 35, 40}};
SPROUT_STATIC_CONSTEXPR auto arr1_2 = array<int, 5>{{10, 20, 30, 40, 50}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 2>{};
// <20>_<EFBFBD><5F><EFBFBD><EFBFBD>
{
SPROUT_STATIC_CONSTEXPR auto merged = sprout::set_intersection(
sprout::begin(arr1),
sprout::end(arr1),
sprout::begin(arr1_2),
sprout::end(arr1_2),
arr2,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
merged,
array<int, 10>{{20, 30, 40, 0, 0, 0, 0, 0, 0, 0}}
));
}
{
SPROUT_STATIC_CONSTEXPR auto merged = sprout::fit::set_intersection(
sprout::begin(arr1),
sprout::end(arr1),
sprout::begin(arr1_2),
sprout::end(arr1_2),
arr2,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
merged,
array<int, 3>{{20, 30, 40}}
));
}
// <20>_<EFBFBD><5F><EFBFBD><EFBFBD>
// <20>o<EFBFBD>͔͈͂<CD88><CD82>I<EFBFBD>[<5B>o<EFBFBD>[<5B><><EFBFBD><EFBFBD><EFBFBD>
{
SPROUT_STATIC_CONSTEXPR auto merged = sprout::set_intersection(
sprout::begin(arr1),
sprout::end(arr1),
sprout::begin(arr1_2),
sprout::end(arr1_2),
arr3,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
merged,
array<int, 2>{{20, 30}}
));
}
{
SPROUT_STATIC_CONSTEXPR auto merged = sprout::fit::set_intersection(
sprout::begin(arr1),
sprout::end(arr1),
sprout::begin(arr1_2),
sprout::end(arr1_2),
arr3,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
merged,
array<int, 2>{{20, 30}}
));
}
// <20>_<EFBFBD><5F><EFBFBD><EFBFBD>
// <20>o<EFBFBD>͔͈͂̐؂<CC90><D882>o<EFBFBD><6F>
{
SPROUT_STATIC_CONSTEXPR auto merged = sprout::set_intersection(
sprout::begin(arr1),
sprout::end(arr1),
sprout::begin(arr1_2),
sprout::end(arr1_2),
sprout::sub(arr2, 2, 8),
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
merged,
array<int, 6>{{20, 30, 40, 0, 0, 0}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
sprout::get_fixed(merged),
array<int, 10>{{0, 0, 20, 30, 40, 0, 0, 0, 0, 0}}
));
}
{
SPROUT_STATIC_CONSTEXPR auto merged = sprout::fit::set_intersection(
sprout::begin(arr1),
sprout::end(arr1),
sprout::begin(arr1_2),
sprout::end(arr1_2),
sprout::sub(arr2, 2, 8),
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
merged,
array<int, 3>{{20, 30, 40}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
sprout::get_fixed(merged),
array<int, 10>{{0, 0, 20, 30, 40, 0, 0, 0, 0, 0}}
));
}
}
}
} // namespace testspr
#endif // #ifndef TESTSPR_SPROUT_ALGORITHM_SET_INTERSECTION_HPP