// Copyright Louis Dionne 2013-2016
// 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.hpp>

#include <boost/hana/assert.hpp>
#include <boost/hana/concept/orderable.hpp>
#include <boost/hana/tuple.hpp>

#include <laws/base.hpp>
#include <laws/comparable.hpp>
#include <laws/orderable.hpp>

#include <string>
#include <type_traits>
using namespace std::literals;
using namespace boost::hana;


// Minimal LessThanComparable types
struct ord1 { int value; };
struct ord2 {
    int value;
    constexpr operator ord1() const { return {value}; }
};

template <typename T, typename U, typename = std::enable_if_t<
    (std::is_same<T, ord1>{} || std::is_same<T, ord2>{}) &&
    (std::is_same<U, ord1>{} || std::is_same<U, ord2>{})
>>
constexpr bool operator<(T a, U b)
{ return a.value < b.value; }

namespace boost { namespace hana {
    template <typename T, typename U>
    struct equal_impl<T, U, when<
        (std::is_same<T, ord1>{} || std::is_same<T, ord2>{}) &&
        (std::is_same<U, ord1>{} || std::is_same<U, ord2>{})
    >> {
        static constexpr bool apply(T a, U b)
        { return a.value == b.value; }
    };
}}

int main() {
    // laws
    test::TestOrderable<int>{make<tuple_tag>(0,1,2,3,4,5)};
    test::TestOrderable<unsigned int>{make<tuple_tag>(0u,1u,2u,3u,4u,5u)};
    test::TestOrderable<long>{make<tuple_tag>(0l,1l,2l,3l,4l,5l)};
    test::TestOrderable<unsigned long>{make<tuple_tag>(0ul,1ul,2ul,3ul,4ul,5ul)};
    test::TestOrderable<ord1>{make<tuple_tag>(ord1{0}, ord1{1}, ord1{2}, ord1{3}, ord1{4})};

    // Orderable => Comparable
    test::TestComparable<ord1>{make<tuple_tag>(ord1{0}, ord1{1}, ord1{2}, ord1{3}, ord1{4})};

    // less
    {
        BOOST_HANA_CONSTEXPR_CHECK(less(5, 6));
        BOOST_HANA_CONSTEXPR_CHECK(not_(less(6, 6)));
        BOOST_HANA_CONSTEXPR_CHECK(not_(less(7, 6)));

        // Provided model for LessThanComparable types
        BOOST_HANA_CONSTEXPR_CHECK(less(ord1{0}, ord1{1}));
        BOOST_HANA_CONSTEXPR_CHECK(not_(less(ord1{0}, ord1{0})));
        BOOST_HANA_CONSTEXPR_CHECK(not_(less(ord1{1}, ord1{0})));

        BOOST_HANA_CONSTEXPR_CHECK(less(ord1{0}, ord2{1}));
        BOOST_HANA_CONSTEXPR_CHECK(not_(less(ord1{0}, ord2{0})));
        BOOST_HANA_CONSTEXPR_CHECK(not_(less(ord1{1}, ord2{0})));

        BOOST_HANA_CONSTEXPR_CHECK(less(ord2{0}, ord1{1}));
        BOOST_HANA_CONSTEXPR_CHECK(not_(less(ord2{0}, ord1{0})));
        BOOST_HANA_CONSTEXPR_CHECK(not_(less(ord2{1}, ord1{0})));

        BOOST_HANA_RUNTIME_CHECK(less("ab", "abc"s));
        BOOST_HANA_RUNTIME_CHECK(less("abc"s, "abcde"));
    }

    // greater
    {
        BOOST_HANA_CONSTEXPR_CHECK(not_(greater(5, 6)));
        BOOST_HANA_CONSTEXPR_CHECK(not_(greater(6, 6)));
        BOOST_HANA_CONSTEXPR_CHECK(greater(7, 6));

        BOOST_HANA_RUNTIME_CHECK(greater("abcd", "ab"s));
        BOOST_HANA_RUNTIME_CHECK(greater("abc"s, "abb"));
    }

    // less_equal
    {
        BOOST_HANA_CONSTEXPR_CHECK(less_equal(5, 6));
        BOOST_HANA_CONSTEXPR_CHECK(less_equal(6, 6));
        BOOST_HANA_CONSTEXPR_CHECK(not_(less_equal(7, 6)));

        BOOST_HANA_RUNTIME_CHECK(less_equal("ab", "abcd"s));
        BOOST_HANA_RUNTIME_CHECK(less_equal("abc"s, "abc"));
    }

    // greater_equal
    {
        BOOST_HANA_CONSTEXPR_CHECK(not_(greater_equal(5, 6)));
        BOOST_HANA_CONSTEXPR_CHECK(greater_equal(6, 6));
        BOOST_HANA_CONSTEXPR_CHECK(greater_equal(7, 6));

        BOOST_HANA_RUNTIME_CHECK(greater_equal("abcd", "ab"s));
        BOOST_HANA_RUNTIME_CHECK(greater_equal("abc"s, "abc"));
    }

    // min
    {
        BOOST_HANA_CONSTEXPR_CHECK(equal(min(5, 6), 5));
        BOOST_HANA_CONSTEXPR_CHECK(equal(min(6, 5), 5));
    }

    // max
    {
        BOOST_HANA_CONSTEXPR_CHECK(equal(max(5, 6), 6));
        BOOST_HANA_CONSTEXPR_CHECK(equal(max(6, 5), 6));
    }
}