FM / algorithms

/usr/include/boost/geometry/index/detail/algorithms/

/usr/include/boost/geometry/index/detail/algorithms

Name	Size	Mode	Actions
bounds.hpp	6457	0644	edit dl rm
comparable_distance_centroid.hpp	2795	0644	edit dl rm
comparable_distance_far.hpp	2395	0644	edit dl rm
comparable_distance_near.hpp	2655	0644	edit dl rm
content.hpp	2380	0644	edit dl rm
diff_abs.hpp	1146	0644	edit dl rm
intersection_content.hpp	2912	0644	edit dl rm
is_valid.hpp	2176	0644	edit dl rm
margin.hpp	5261	0644	edit dl rm
minmaxdist.hpp	4103	0644	edit dl rm
nth_element.hpp	1749	0644	edit dl rm
path_intersection.hpp	4609	0644	edit dl rm
segment_intersection.hpp	5304	0644	edit dl rm
smallest_for_indexable.hpp	2442	0644	edit dl rm
sum_for_indexable.hpp	2237	0644	edit dl rm
union_content.hpp	1103	0644	edit dl rm

Edit: /usr/include/boost/geometry/index/detail/algorithms/smallest_for_indexable.hpp (2442B)

#ifndef BOOST_GEOMETRY_INDEX_DETAIL_ALGORITHMS_SMALLEST_FOR_INDEXABLE_HPP
#define BOOST_GEOMETRY_INDEX_DETAIL_ALGORITHMS_SMALLEST_FOR_INDEXABLE_HPP

namespace boost { namespace geometry { namespace index { namespace detail {

template <
    typename Geometry,
    typename Indexable,
    typename IndexableTag,
    typename AlgoTag,
    size_t DimensionIndex>
struct smallest_for_indexable_dimension
{
    BOOST_MPL_ASSERT_MSG(
        (false),
        NOT_IMPLEMENTED_FOR_THIS_INDEXABLE_TAG_TYPE,
        (smallest_for_indexable_dimension));
};

template <
    typename Geometry,
    typename Indexable,
    typename IndexableTag,
    typename AlgoTag,
    size_t N>
struct smallest_for_indexable
{
    typedef typename smallest_for_indexable_dimension<
        Geometry, Indexable, IndexableTag, AlgoTag, N - 1
    >::result_type result_type;

template <typename Data>
    inline static result_type apply(Geometry const& g, Indexable const& i, Data const& data)
    {
        result_type r1 = smallest_for_indexable<
            Geometry, Indexable, IndexableTag, AlgoTag, N - 1
        >::apply(g, i, data);

result_type r2 = smallest_for_indexable_dimension<
            Geometry, Indexable, IndexableTag, AlgoTag, N - 1
        >::apply(g, i, data);

return r1 < r2 ? r1 : r2;
    }
};

template <
    typename Geometry,
    typename Indexable,
    typename IndexableTag,
    typename AlgoTag>
struct smallest_for_indexable<Geometry, Indexable, IndexableTag, AlgoTag, 1>
{
    typedef typename smallest_for_indexable_dimension<
        Geometry, Indexable, IndexableTag, AlgoTag, 0
    >::result_type result_type;

template <typename Data>
    inline static result_type apply(Geometry const& g, Indexable const& i, Data const& data)
    {
        return
            smallest_for_indexable_dimension<
                Geometry, Indexable, IndexableTag, AlgoTag, 0
            >::apply(g, i, data);
    }
};

}}}} // namespace boost::geometry::index::detail

#endif // BOOST_GEOMETRY_INDEX_DETAIL_ALGORITHMS_SMALLEST_FOR_INDEXABLE_HPP

// Boost.Geometry Index // // Get smallest value calculated for indexable's dimensions, used in R-tree k nearest neighbors query // // Copyright (c) 2011-2013 Adam Wulkiewicz, Lodz, Poland. // // Use, modification and distribution is subject to 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_GEOMETRY_INDEX_DETAIL_ALGORITHMS_SMALLEST_FOR_INDEXABLE_HPP #define BOOST_GEOMETRY_INDEX_DETAIL_ALGORITHMS_SMALLEST_FOR_INDEXABLE_HPP namespace boost { namespace geometry { namespace index { namespace detail { template < typename Geometry, typename Indexable, typename IndexableTag, typename AlgoTag, size_t DimensionIndex> struct smallest_for_indexable_dimension { BOOST_MPL_ASSERT_MSG( (false), NOT_IMPLEMENTED_FOR_THIS_INDEXABLE_TAG_TYPE, (smallest_for_indexable_dimension)); }; template < typename Geometry, typename Indexable, typename IndexableTag, typename AlgoTag, size_t N> struct smallest_for_indexable { typedef typename smallest_for_indexable_dimension< Geometry, Indexable, IndexableTag, AlgoTag, N - 1 >::result_type result_type; template inline static result_type apply(Geometry const& g, Indexable const& i, Data const& data) { result_type r1 = smallest_for_indexable< Geometry, Indexable, IndexableTag, AlgoTag, N - 1 >::apply(g, i, data); result_type r2 = smallest_for_indexable_dimension< Geometry, Indexable, IndexableTag, AlgoTag, N - 1 >::apply(g, i, data); return r1 < r2 ? r1 : r2; } }; template < typename Geometry, typename Indexable, typename IndexableTag, typename AlgoTag> struct smallest_for_indexable { typedef typename smallest_for_indexable_dimension< Geometry, Indexable, IndexableTag, AlgoTag, 0 >::result_type result_type; template inline static result_type apply(Geometry const& g, Indexable const& i, Data const& data) { return smallest_for_indexable_dimension< Geometry, Indexable, IndexableTag, AlgoTag, 0 >::apply(g, i, data); } }; }}}} // namespace boost::geometry::index::detail #endif // BOOST_GEOMETRY_INDEX_DETAIL_ALGORITHMS_SMALLEST_FOR_INDEXABLE_HPP