FM / detail

/usr/include/boost/hana/detail

Name	Size	Mode	Actions
operators/	-	0755	rm
variadic/	-	0755	rm
algorithm.hpp	5973	0644	edit dl rm
any_of.hpp	1380	0644	edit dl rm
array.hpp	3374	0644	edit dl rm
canonical_constant.hpp	2700	0644	edit dl rm
concepts.hpp	3019	0644	edit dl rm
create.hpp	935	0644	edit dl rm
decay.hpp	1715	0644	edit dl rm
dispatch_if.hpp	2082	0644	edit dl rm
ebo.hpp	3874	0644	edit dl rm
fast_and.hpp	600	0644	edit dl rm
first_unsatisfied_index.hpp	1731	0644	edit dl rm
hash_table.hpp	5487	0644	edit dl rm
has_common_embedding.hpp	2473	0644	edit dl rm
has_duplicates.hpp	2337	0644	edit dl rm
index_if.hpp	1610	0644	edit dl rm
integral_constant.hpp	10052	0644	edit dl rm
intrinsics.hpp	1984	0644	edit dl rm
nested_by.hpp	1255	0644	edit dl rm
nested_by_fwd.hpp	1990	0644	edit dl rm
nested_than.hpp	854	0644	edit dl rm
nested_than_fwd.hpp	1624	0644	edit dl rm
nested_to.hpp	788	0644	edit dl rm
nested_to_fwd.hpp	1627	0644	edit dl rm
preprocessor.hpp	1435	0644	edit dl rm
std_common_type.hpp	1085	0644	edit dl rm
struct_macros.hpp	798577	0644	edit dl rm
type_at.hpp	1594	0644	edit dl rm
type_foldl1.hpp	3916	0644	edit dl rm
type_foldr1.hpp	3903	0644	edit dl rm
unpack_flatten.hpp	2416	0644	edit dl rm
void_t.hpp	518	0644	edit dl rm
wrong.hpp	861	0644	edit dl rm

Edit: /usr/include/boost/hana/detail/decay.hpp (1715B)

/*!
@file
Defines a replacement for `std::decay`, which is sometimes too slow at
compile-time.

@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_DETAIL_DECAY_HPP
#define BOOST_HANA_DETAIL_DECAY_HPP

#include <boost/hana/config.hpp>

#include <type_traits>

BOOST_HANA_NAMESPACE_BEGIN namespace detail {
    //! @ingroup group-details
    //! Equivalent to `std::decay`, except faster.
    //!
    //! `std::decay` in libc++ is implemented in a suboptimal way. Since
    //! this is used literally everywhere by the `make<...>` functions, it
    //! is very important to keep this as efficient as possible.
    //!
    //! @note
    //! `std::decay` is still being used in some places in the library.
    //! Indeed, this is a peephole optimization and it would not be wise
    //! to clutter the code with our own implementation of `std::decay`,
    //! except when this actually makes a difference in compile-times.
    template <typename T, typename U = typename std::remove_reference<T>::type>
    struct decay {
        using type = typename std::remove_cv<U>::type;
    };

template <typename T, typename U>
    struct decay<T, U[]> { using type = U*; };
    template <typename T, typename U, std::size_t N>
    struct decay<T, U[N]> { using type = U*; };

template <typename T, typename R, typename ...A>
    struct decay<T, R(A...)> { using type = R(*)(A...); };
    template <typename T, typename R, typename ...A>
    struct decay<T, R(A..., ...)> { using type = R(*)(A..., ...); };
} BOOST_HANA_NAMESPACE_END

#endif // !BOOST_HANA_DETAIL_DECAY_HPP

cmd: