FM / detail

/usr/include/boost/units/detail

Name	Size	Mode	Actions
absolute_impl.hpp	3055	0644	edit dl rm
cmath_impl.hpp	3757	0644	edit dl rm
conversion_impl.hpp	15443	0644	edit dl rm
dimensionless_unit.hpp	2221	0644	edit dl rm
dimension_impl.hpp	8683	0644	edit dl rm
dimension_list.hpp	2654	0644	edit dl rm
dim_impl.hpp	1744	0644	edit dl rm
heterogeneous_conversion.hpp	8071	0644	edit dl rm
linear_algebra.hpp	32647	0644	edit dl rm
one.hpp	2149	0644	edit dl rm
ordinal.hpp	1017	0644	edit dl rm
prevent_redefinition.hpp	1369	0644	edit dl rm
push_front_if.hpp	882	0644	edit dl rm
push_front_or_add.hpp	1948	0644	edit dl rm
sort.hpp	2640	0644	edit dl rm
static_rational_power.hpp	4922	0644	edit dl rm
unscale.hpp	5446	0644	edit dl rm
utility.hpp	1264	0644	edit dl rm

Edit: /usr/include/boost/units/detail/sort.hpp (2640B)

#ifndef BOOST_UNITS_DETAIL_SORT_HPP
#define BOOST_UNITS_DETAIL_SORT_HPP

#include <boost/mpl/size.hpp>
#include <boost/mpl/begin.hpp>
#include <boost/mpl/next.hpp>
#include <boost/mpl/deref.hpp>
#include <boost/mpl/push_front.hpp>
#include <boost/mpl/less.hpp>

#include <boost/units/dimensionless_type.hpp>
#include <boost/units/detail/dimension_list.hpp>

namespace boost {

namespace units {

namespace detail {

template<int N>
struct insertion_sort_insert;

template<bool is_greater>
struct insertion_sort_comparison_impl;

// have to recursively add the element to the next sequence.
template<>
struct insertion_sort_comparison_impl<true> {
    template<class Begin, int N, class T>
    struct apply {
        typedef list<
            typename Begin::item,
            typename insertion_sort_insert<N - 1>::template apply<
                typename Begin::next,
                T
            >::type
        > type;
    };
};

// prepend the current element
template<>
struct insertion_sort_comparison_impl<false> {
    template<class Begin, int N, class T>
    struct apply {
        typedef list<T, Begin> type;
    };
};

template<int N>
struct insertion_sort_insert {
    template<class Begin, class T>
    struct apply {
        typedef typename insertion_sort_comparison_impl<mpl::less<typename Begin::item, T>::value>::template apply<
            Begin,
            N,
            T
        >::type type;
    };
};

template<>
struct insertion_sort_insert<0> {
    template<class Begin, class T>
    struct apply {
        typedef list<T, dimensionless_type> type;
    };
};

template<int N>
struct insertion_sort_impl {
    template<class Begin>
    struct apply {
        typedef typename insertion_sort_impl<N - 1>::template apply<typename Begin::next>::type next;
        typedef typename insertion_sort_insert<(next::size::value)>::template apply<next, typename Begin::item>::type type;
    };
};

template<>
struct insertion_sort_impl<0> {
    template<class Begin>
    struct apply {
        typedef dimensionless_type type;
    };
};

template<class T>
struct insertion_sort
{
    typedef typename insertion_sort_impl<T::size::value>::template apply<T>::type type;
};

} // namespace detail

} // namespace units

} // namespace boost

#endif

// Boost.Units - A C++ library for zero-overhead dimensional analysis and // unit/quantity manipulation and conversion // // Copyright (C) 2003-2008 Matthias Christian Schabel // Copyright (C) 2008 Steven Watanabe // // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) #ifndef BOOST_UNITS_DETAIL_SORT_HPP #define BOOST_UNITS_DETAIL_SORT_HPP #include #include #include #include #include #include #include #include namespace boost { namespace units { namespace detail { template struct insertion_sort_insert; template struct insertion_sort_comparison_impl; // have to recursively add the element to the next sequence. template<> struct insertion_sort_comparison_impl { template struct apply { typedef list< typename Begin::item, typename insertion_sort_insert::template apply< typename Begin::next, T >::type > type; }; }; // prepend the current element template<> struct insertion_sort_comparison_impl { template struct apply { typedef list type; }; }; template struct insertion_sort_insert { template struct apply { typedef typename insertion_sort_comparison_impl::value>::template apply< Begin, N, T >::type type; }; }; template<> struct insertion_sort_insert<0> { template struct apply { typedef list type; }; }; template struct insertion_sort_impl { template struct apply { typedef typename insertion_sort_impl::template apply::type next; typedef typename insertion_sort_insert<(next::size::value)>::template apply::type type; }; }; template<> struct insertion_sort_impl<0> { template struct apply { typedef dimensionless_type type; }; }; template struct insertion_sort { typedef typename insertion_sort_impl::template apply::type type; }; } // namespace detail } // namespace units } // namespace boost #endif