FM / hana

/usr/include/boost/hana

Name	Size	Mode	Actions
concept/	-	0755	rm
core/	-	0755	rm
detail/	-	0755	rm
experimental/	-	0755	rm
ext/	-	0755	rm
functional/	-	0755	rm
fwd/	-	0755	rm
accessors.hpp	1513	0644	edit dl rm
adapt_adt.hpp	422	0644	edit dl rm
adapt_struct.hpp	437	0644	edit dl rm
adjust.hpp	1698	0644	edit dl rm
adjust_if.hpp	2515	0644	edit dl rm
all.hpp	1327	0644	edit dl rm
all_of.hpp	1570	0644	edit dl rm
and.hpp	1667	0644	edit dl rm
any.hpp	1327	0644	edit dl rm
any_of.hpp	7531	0644	edit dl rm
ap.hpp	2496	0644	edit dl rm
append.hpp	2357	0644	edit dl rm
assert.hpp	16325	0644	edit dl rm
at.hpp	1659	0644	edit dl rm
at_key.hpp	3009	0644	edit dl rm
back.hpp	1534	0644	edit dl rm
basic_tuple.hpp	9455	0644	edit dl rm
bool.hpp	9747	0644	edit dl rm
cartesian_product.hpp	3860	0644	edit dl rm
chain.hpp	1488	0644	edit dl rm
comparing.hpp	1222	0644	edit dl rm
concat.hpp	2712	0644	edit dl rm
concept.hpp	1301	0644	edit dl rm
config.hpp	7152	0644	edit dl rm
contains.hpp	1560	0644	edit dl rm
core.hpp	610	0644	edit dl rm
count.hpp	1496	0644	edit dl rm
count_if.hpp	3137	0644	edit dl rm
cycle.hpp	4275	0644	edit dl rm
define_struct.hpp	442	0644	edit dl rm
difference.hpp	1116	0644	edit dl rm
div.hpp	3804	0644	edit dl rm
drop_back.hpp	2475	0644	edit dl rm
drop_front.hpp	1796	0644	edit dl rm
drop_front_exactly.hpp	3030	0644	edit dl rm
drop_while.hpp	3174	0644	edit dl rm
duplicate.hpp	1392	0644	edit dl rm
empty.hpp	1400	0644	edit dl rm
equal.hpp	8012	0644	edit dl rm
erase_key.hpp	1029	0644	edit dl rm
eval.hpp	1798	0644	edit dl rm
eval_if.hpp	3381	0644	edit dl rm
extend.hpp	1498	0644	edit dl rm
extract.hpp	1248	0644	edit dl rm
fill.hpp	2216	0644	edit dl rm
filter.hpp	4473	0644	edit dl rm
find.hpp	1732	0644	edit dl rm
find_if.hpp	4011	0644	edit dl rm
first.hpp	1242	0644	edit dl rm
flatten.hpp	1769	0644	edit dl rm
fold.hpp	378	0644	edit dl rm
fold_left.hpp	3128	0644	edit dl rm
fold_right.hpp	3147	0644	edit dl rm
for_each.hpp	1863	0644	edit dl rm
front.hpp	1315	0644	edit dl rm
functional.hpp	1186	0644	edit dl rm
fuse.hpp	1309	0644	edit dl rm
greater.hpp	2401	0644	edit dl rm
greater_equal.hpp	2552	0644	edit dl rm
group.hpp	5543	0644	edit dl rm
hash.hpp	3572	0644	edit dl rm
if.hpp	1834	0644	edit dl rm
index_if.hpp	3485	0644	edit dl rm
insert.hpp	1620	0644	edit dl rm
insert_range.hpp	2171	0644	edit dl rm
integral_constant.hpp	389	0644	edit dl rm
intersection.hpp	1100	0644	edit dl rm
intersperse.hpp	2586	0644	edit dl rm
is_disjoint.hpp	2040	0644	edit dl rm
is_empty.hpp	1244	0644	edit dl rm
is_subset.hpp	2919	0644	edit dl rm
keys.hpp	1307	0644	edit dl rm
lazy.hpp	7947	0644	edit dl rm
length.hpp	1554	0644	edit dl rm
less.hpp	5322	0644	edit dl rm
less_equal.hpp	2485	0644	edit dl rm
lexicographical_compare.hpp	4344	0644	edit dl rm
lift.hpp	1500	0644	edit dl rm
map.hpp	22593	0644	edit dl rm
max.hpp	1759	0644	edit dl rm
maximum.hpp	3348	0644	edit dl rm
members.hpp	1970	0644	edit dl rm
min.hpp	1759	0644	edit dl rm
minimum.hpp	3353	0644	edit dl rm
minus.hpp	4005	0644	edit dl rm
mod.hpp	3804	0644	edit dl rm
monadic_compose.hpp	1583	0644	edit dl rm
monadic_fold_left.hpp	4862	0644	edit dl rm
monadic_fold_right.hpp	4882	0644	edit dl rm
mult.hpp	3747	0644	edit dl rm
negate.hpp	1857	0644	edit dl rm
none.hpp	1340	0644	edit dl rm
none_of.hpp	1532	0644	edit dl rm
not.hpp	2217	0644	edit dl rm
not_equal.hpp	1982	0644	edit dl rm
one.hpp	2432	0644	edit dl rm
optional.hpp	15422	0644	edit dl rm
or.hpp	1860	0644	edit dl rm
ordering.hpp	1231	0644	edit dl rm
pair.hpp	8048	0644	edit dl rm
partition.hpp	4199	0644	edit dl rm
permutations.hpp	2599	0644	edit dl rm
plus.hpp	3759	0644	edit dl rm
power.hpp	1954	0644	edit dl rm
prefix.hpp	1597	0644	edit dl rm
prepend.hpp	2372	0644	edit dl rm
product.hpp	1701	0644	edit dl rm
range.hpp	9910	0644	edit dl rm
remove.hpp	1695	0644	edit dl rm
remove_at.hpp	2989	0644	edit dl rm
remove_if.hpp	1644	0644	edit dl rm
remove_range.hpp	3885	0644	edit dl rm
repeat.hpp	1793	0644	edit dl rm
replace.hpp	1797	0644	edit dl rm
replace_if.hpp	1764	0644	edit dl rm
replicate.hpp	2282	0644	edit dl rm
reverse.hpp	1802	0644	edit dl rm
reverse_fold.hpp	1144	0644	edit dl rm
scan_left.hpp	5060	0644	edit dl rm
scan_right.hpp	5138	0644	edit dl rm
second.hpp	1253	0644	edit dl rm
set.hpp	11854	0644	edit dl rm
size.hpp	375	0644	edit dl rm
slice.hpp	3407	0644	edit dl rm
sort.hpp	8855	0644	edit dl rm
span.hpp	2629	0644	edit dl rm
string.hpp	12310	0644	edit dl rm
suffix.hpp	1583	0644	edit dl rm
sum.hpp	1661	0644	edit dl rm
symmetric_difference.hpp	1394	0644	edit dl rm
take_back.hpp	2519	0644	edit dl rm
take_front.hpp	2471	0644	edit dl rm
take_while.hpp	1776	0644	edit dl rm
tap.hpp	1616	0644	edit dl rm
then.hpp	1688	0644	edit dl rm
traits.hpp	10172	0644	edit dl rm
transform.hpp	2411	0644	edit dl rm
tuple.hpp	11651	0644	edit dl rm
type.hpp	10082	0644	edit dl rm
unfold_left.hpp	2204	0644	edit dl rm
unfold_right.hpp	2224	0644	edit dl rm
union.hpp	1030	0644	edit dl rm
unique.hpp	2361	0644	edit dl rm
unpack.hpp	5175	0644	edit dl rm
value.hpp	1561	0644	edit dl rm
version.hpp	2032	0644	edit dl rm
while.hpp	4441	0644	edit dl rm
zero.hpp	2454	0644	edit dl rm
zip.hpp	1462	0644	edit dl rm
zip_shortest.hpp	1604	0644	edit dl rm
zip_shortest_with.hpp	2116	0644	edit dl rm
zip_with.hpp	2292	0644	edit dl rm

Edit: /usr/include/boost/hana/less.hpp (5322B)

/*!
@file
Defines `boost::hana::less`.

@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)
 */

#ifndef BOOST_HANA_LESS_HPP
#define BOOST_HANA_LESS_HPP

#include <boost/hana/fwd/less.hpp>

#include <boost/hana/and.hpp>
#include <boost/hana/bool.hpp>
#include <boost/hana/concept/constant.hpp>
#include <boost/hana/concept/orderable.hpp>
#include <boost/hana/concept/product.hpp>
#include <boost/hana/concept/sequence.hpp>
#include <boost/hana/config.hpp>
#include <boost/hana/core/common.hpp>
#include <boost/hana/core/to.hpp>
#include <boost/hana/core/dispatch.hpp>
#include <boost/hana/detail/concepts.hpp>
#include <boost/hana/detail/has_common_embedding.hpp>
#include <boost/hana/detail/nested_than.hpp> // required by fwd decl
#include <boost/hana/equal.hpp>
#include <boost/hana/first.hpp>
#include <boost/hana/if.hpp>
#include <boost/hana/less_equal.hpp>
#include <boost/hana/lexicographical_compare.hpp>
#include <boost/hana/or.hpp>
#include <boost/hana/second.hpp>
#include <boost/hana/value.hpp>

BOOST_HANA_NAMESPACE_BEGIN
    //! @cond
    template <typename X, typename Y>
    constexpr auto less_t::operator()(X&& x, Y&& y) const {
        using T = typename hana::tag_of<X>::type;
        using U = typename hana::tag_of<Y>::type;
        using Less = BOOST_HANA_DISPATCH_IF(decltype(less_impl<T, U>{}),
            hana::Orderable<T>::value &&
            hana::Orderable<U>::value &&
            !is_default<less_impl<T, U>>::value
        );

#ifndef BOOST_HANA_CONFIG_DISABLE_CONCEPT_CHECKS
        static_assert(hana::Orderable<T>::value,
        "hana::less(x, y) requires 'x' to be Orderable");

static_assert(hana::Orderable<U>::value,
        "hana::less(x, y) requires 'y' to be Orderable");

static_assert(!is_default<less_impl<T, U>>::value,
        "hana::less(x, y) requires 'x' and 'y' to be embeddable "
        "in a common Orderable");
    #endif

return Less::apply(static_cast<X&&>(x), static_cast<Y&&>(y));
    }
    //! @endcond

template <typename T, typename U, bool condition>
    struct less_impl<T, U, when<condition>> : default_ {
        template <typename ...Args>
        static constexpr auto apply(Args&& ...) = delete;
    };

// Cross-type overload
    template <typename T, typename U>
    struct less_impl<T, U, when<
        detail::has_nontrivial_common_embedding<Orderable, T, U>::value &&
        !detail::LessThanComparable<T, U>::value
    >> {
        using C = typename hana::common<T, U>::type;
        template <typename X, typename Y>
        static constexpr decltype(auto) apply(X&& x, Y&& y) {
            return hana::less(hana::to<C>(static_cast<X&&>(x)),
                              hana::to<C>(static_cast<Y&&>(y)));
        }
    };

//////////////////////////////////////////////////////////////////////////
    // Model for LessThanComparable data types
    //////////////////////////////////////////////////////////////////////////
    template <typename T, typename U>
    struct less_impl<T, U, when<detail::LessThanComparable<T, U>::value>> {
        template <typename X, typename Y>
        static constexpr decltype(auto) apply(X&& x, Y&& y)
        { return static_cast<X&&>(x) < static_cast<Y&&>(y); }
    };

//////////////////////////////////////////////////////////////////////////
    // Model for Constants wrapping an Orderable
    //////////////////////////////////////////////////////////////////////////
    template <typename C>
    struct less_impl<C, C, when<
        hana::Constant<C>::value &&
        Orderable<typename C::value_type>::value
    >> {
        template <typename X, typename Y>
        static constexpr auto apply(X const&, Y const&) {
            constexpr auto is_less = hana::less(hana::value<X>(), hana::value<Y>());
            constexpr bool truth_value = hana::if_(is_less, true, false);
            return hana::bool_c<truth_value>;
        }
    };

//////////////////////////////////////////////////////////////////////////
    // Model for Products
    //////////////////////////////////////////////////////////////////////////
    template <typename T, typename U>
    struct less_impl<T, U, when<hana::Product<T>::value && hana::Product<U>::value>> {
        template <typename X, typename Y>
        static constexpr decltype(auto) apply(X const& x, Y const& y) {
            return hana::or_(
                hana::less(hana::first(x), hana::first(y)),
                hana::and_(
                    hana::less_equal(hana::first(x), hana::first(y)),
                    hana::less(hana::second(x), hana::second(y))
                )
            );
        }
    };

//////////////////////////////////////////////////////////////////////////
    // Model for Sequences
    //////////////////////////////////////////////////////////////////////////
    template <typename T, typename U>
    struct less_impl<T, U, when<
        hana::Sequence<T>::value && hana::Sequence<U>::value
    >> {
        template <typename Xs, typename Ys>
        static constexpr auto apply(Xs const& xs, Ys const& ys)
        { return hana::lexicographical_compare(xs, ys); }
    };
BOOST_HANA_NAMESPACE_END

#endif // !BOOST_HANA_LESS_HPP

/*! @file Defines `boost::hana::less`. @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) */ #ifndef BOOST_HANA_LESS_HPP #define BOOST_HANA_LESS_HPP #include #include #include #include #include #include #include #include #include #include #include #include #include #include // required by fwd decl #include #include #include #include #include #include #include #include BOOST_HANA_NAMESPACE_BEGIN //! @cond template constexpr auto less_t::operator()(X&& x, Y&& y) const { using T = typename hana::tag_of::type; using U = typename hana::tag_of::type; using Less = BOOST_HANA_DISPATCH_IF(decltype(less_impl{}), hana::Orderable::value && hana::Orderable::value && !is_default>::value ); #ifndef BOOST_HANA_CONFIG_DISABLE_CONCEPT_CHECKS static_assert(hana::Orderable::value, "hana::less(x, y) requires 'x' to be Orderable"); static_assert(hana::Orderable::value, "hana::less(x, y) requires 'y' to be Orderable"); static_assert(!is_default>::value, "hana::less(x, y) requires 'x' and 'y' to be embeddable " "in a common Orderable"); #endif return Less::apply(static_cast(x), static_cast(y)); } //! @endcond template struct less_impl> : default_ { template static constexpr auto apply(Args&& ...) = delete; }; // Cross-type overload template struct less_impl::value && !detail::LessThanComparable::value >> { using C = typename hana::common::type; template static constexpr decltype(auto) apply(X&& x, Y&& y) { return hana::less(hana::to(static_cast(x)), hana::to(static_cast(y))); } }; ////////////////////////////////////////////////////////////////////////// // Model for LessThanComparable data types ////////////////////////////////////////////////////////////////////////// template struct less_impl::value>> { template static constexpr decltype(auto) apply(X&& x, Y&& y) { return static_cast(x) < static_cast(y); } }; ////////////////////////////////////////////////////////////////////////// // Model for Constants wrapping an Orderable ////////////////////////////////////////////////////////////////////////// template struct less_impl::value && Orderable::value >> { template static constexpr auto apply(X const&, Y const&) { constexpr auto is_less = hana::less(hana::value(), hana::value()); constexpr bool truth_value = hana::if_(is_less, true, false); return hana::bool_c; } }; ////////////////////////////////////////////////////////////////////////// // Model for Products ////////////////////////////////////////////////////////////////////////// template struct less_impl::value && hana::Product::value>> { template static constexpr decltype(auto) apply(X const& x, Y const& y) { return hana::or_( hana::less(hana::first(x), hana::first(y)), hana::and_( hana::less_equal(hana::first(x), hana::first(y)), hana::less(hana::second(x), hana::second(y)) ) ); } }; ////////////////////////////////////////////////////////////////////////// // Model for Sequences ////////////////////////////////////////////////////////////////////////// template struct less_impl::value && hana::Sequence::value >> { template static constexpr auto apply(Xs const& xs, Ys const& ys) { return hana::lexicographical_compare(xs, ys); } }; BOOST_HANA_NAMESPACE_END #endif // !BOOST_HANA_LESS_HPP