mirror of
https://github.com/boostorg/hana.git
synced 2026-02-26 16:52:18 +00:00
35 lines
976 B
C++
35 lines
976 B
C++
/*
|
|
@copyright Louis Dionne 2014
|
|
Distributed under the Boost Software License, Version 1.0.
|
|
(See accompanying file LICENSE.md or copy at http://boost.org/LICENSE_1_0.txt)
|
|
*/
|
|
|
|
#include <boost/hana/detail/sandbox/map.hpp>
|
|
|
|
#include <boost/hana/detail/constexpr.hpp>
|
|
#include <boost/hana/functional.hpp>
|
|
#include <boost/hana/integral.hpp>
|
|
#include <boost/hana/list/instance.hpp>
|
|
#include <boost/hana/pair/instance.hpp>
|
|
|
|
#include <cassert>
|
|
using namespace boost::hana;
|
|
|
|
|
|
BOOST_HANA_CONSTEXPR_LAMBDA auto check_fold = [](auto ...pairs) {
|
|
auto values = fmap(second, list(pairs...));
|
|
auto result = lazy_foldr(on(cons, apply), list(), map(pairs...));
|
|
assert(elem(result, permutations(values)));
|
|
};
|
|
|
|
template <int k, int v>
|
|
BOOST_HANA_CONSTEXPR_LAMBDA auto p = pair(int_<k>, int_<v>);
|
|
|
|
int main() {
|
|
check_fold();
|
|
check_fold(p<1, 1>);
|
|
check_fold(p<1, 1>, p<2, 2>);
|
|
check_fold(p<1, 1>, p<2, 2>, p<3, 3>);
|
|
check_fold(p<1, 1>, p<2, 2>, p<3, 3>, p<4, 4>);
|
|
}
|