summaryrefslogtreecommitdiffstats
path: root/src/boost/libs/hana/test/issues/github_31.cpp
blob: ddbdefcdd3541735a3a9a0a04cc6ea1269e98fb9 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
// Copyright Louis Dionne 2013-2017
// 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/any_of.hpp>
#include <boost/hana/assert.hpp>
#include <boost/hana/bool.hpp>
#include <boost/hana/equal.hpp>
#include <boost/hana/find_if.hpp>
#include <boost/hana/fwd/at.hpp>
#include <boost/hana/fwd/drop_front.hpp>
#include <boost/hana/fwd/is_empty.hpp>
#include <boost/hana/integral_constant.hpp>
#include <boost/hana/optional.hpp>
namespace hana = boost::hana;


// A simple infinite Iterable.
template <int i>
struct counter { };

namespace boost { namespace hana {
    template <int i>
    struct at_impl<counter<i>> {
        template <typename N>
        static constexpr auto apply(counter<i>, N const&) {
            return hana::int_c<i + N::value>;
        }
    };

    template <int i>
    struct drop_front_impl<counter<i>> {
        template <typename N>
        static constexpr auto apply(counter<i>, N) { return counter<i + N::value>{}; }
    };

    template <int i>
    struct is_empty_impl<counter<i>> {
        static constexpr auto apply(counter<i>) { return hana::false_c; }
    };
}}


int main() {
    // find_if and any_of should short-circuit and stop even though the
    // Iterable is infinite.
    BOOST_HANA_CONSTANT_CHECK(hana::any_of(counter<1>{}, hana::equal.to(hana::int_c<4>)));

    BOOST_HANA_CONSTANT_CHECK(hana::equal(
        hana::find_if(counter<1>{}, hana::equal.to(hana::int_c<4>)),
        hana::just(hana::int_c<4>)
    ));
}