FM / detail

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

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

Name	Size	Mode	Actions
buffer/	-	0755	rm
centroid/	-	0755	rm
closest_feature/	-	0755	rm
comparable_distance/	-	0755	rm
covered_by/	-	0755	rm
disjoint/	-	0755	rm
distance/	-	0755	rm
envelope/	-	0755	rm
equals/	-	0755	rm
expand/	-	0755	rm
intersection/	-	0755	rm
intersects/	-	0755	rm
is_simple/	-	0755	rm
is_valid/	-	0755	rm
make/	-	0755	rm
overlaps/	-	0755	rm
overlay/	-	0755	rm
relate/	-	0755	rm
relation/	-	0755	rm
sections/	-	0755	rm
touches/	-	0755	rm
turns/	-	0755	rm
within/	-	0755	rm
assign_box_corners.hpp	3338	0644	edit dl rm
assign_indexed_point.hpp	2656	0644	edit dl rm
assign_values.hpp	8957	0644	edit dl rm
as_range.hpp	2688	0644	edit dl rm
azimuth.hpp	4802	0644	edit dl rm
calculate_null.hpp	1144	0644	edit dl rm
calculate_point_order.hpp	11145	0644	edit dl rm
calculate_sum.hpp	2047	0644	edit dl rm
check_iterator_range.hpp	2012	0644	edit dl rm
convert_indexed_to_indexed.hpp	2296	0644	edit dl rm
convert_point_to_point.hpp	2259	0644	edit dl rm
counting.hpp	2746	0644	edit dl rm
course.hpp	1180	0644	edit dl rm
direction_code.hpp	9205	0644	edit dl rm
expand_by_epsilon.hpp	3880	0644	edit dl rm
extreme_points.hpp	19767	0644	edit dl rm
for_each_range.hpp	4962	0644	edit dl rm
get_max_size.hpp	2054	0644	edit dl rm
has_self_intersections.hpp	5389	0644	edit dl rm
interior_iterator.hpp	1768	0644	edit dl rm
max_interval_gap.hpp	8430	0644	edit dl rm
multi_modify.hpp	1883	0644	edit dl rm
multi_modify_with_predicate.hpp	1442	0644	edit dl rm
multi_sum.hpp	1490	0644	edit dl rm
normalize.hpp	1296	0644	edit dl rm
not.hpp	2032	0644	edit dl rm
num_distinct_consecutive_points.hpp	2449	0644	edit dl rm
partition.hpp	29824	0644	edit dl rm
point_is_spike_or_equal.hpp	5455	0644	edit dl rm
point_on_border.hpp	5254	0644	edit dl rm
recalculate.hpp	6905	0644	edit dl rm
ring_identifier.hpp	2285	0644	edit dl rm
signed_size_type.hpp	770	0644	edit dl rm
single_geometry.hpp	2840	0644	edit dl rm
sub_range.hpp	4097	0644	edit dl rm
sweep.hpp	2086	0644	edit dl rm
throw_on_empty_input.hpp	2073	0644	edit dl rm
tupled_output.hpp	19235	0644	edit dl rm

Edit: /usr/include/boost/geometry/algorithms/detail/recalculate.hpp (6905B)

// Boost.Geometry (aka GGL, Generic Geometry Library)

// Copyright (c) 2013 Barend Gehrels, Amsterdam, the Netherlands.
// Copyright (c) 2013 Bruno Lalande, Paris, France.
// Copyright (c) 2013 Mateusz Loskot, London, UK.
// Copyright (c) 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_ALGORITHMS_DETAIL_RECALCULATE_HPP
#define BOOST_GEOMETRY_ALGORITHMS_DETAIL_RECALCULATE_HPP

#include <cstddef>

#include <boost/concept/requires.hpp>
#include <boost/concept_check.hpp>
#include <boost/mpl/assert.hpp>
#include <boost/mpl/if.hpp>
#include <boost/numeric/conversion/bounds.hpp>
#include <boost/numeric/conversion/cast.hpp>
#include <boost/range/begin.hpp>
#include <boost/range/end.hpp>
#include <boost/range/iterator.hpp>
#include <boost/range/size.hpp>

#include <boost/geometry/arithmetic/arithmetic.hpp>
#include <boost/geometry/algorithms/append.hpp>
#include <boost/geometry/algorithms/clear.hpp>
#include <boost/geometry/core/access.hpp>
#include <boost/geometry/core/interior_rings.hpp>
#include <boost/geometry/core/exterior_ring.hpp>
#include <boost/geometry/core/tags.hpp>

#include <boost/geometry/geometries/concepts/check.hpp>

namespace boost { namespace geometry
{

#ifndef DOXYGEN_NO_DETAIL
namespace detail { namespace recalculate
{

template <std::size_t Dimension>
struct recalculate_point
{
    template <typename Point1, typename Point2, typename Strategy>
    static inline void apply(Point1& point1, Point2 const& point2, Strategy const& strategy)
    {
        std::size_t const dim = Dimension - 1;
        geometry::set<dim>(point1, strategy.template apply<dim>(geometry::get<dim>(point2)));
        recalculate_point<dim>::apply(point1, point2, strategy);
    }
};

template <>
struct recalculate_point<0>
{
    template <typename Point1, typename Point2, typename Strategy>
    static inline void apply(Point1&, Point2 const&, Strategy const&)
    {
    }
};

template <std::size_t Dimension>
struct recalculate_indexed
{
    template <typename Geometry1, typename Geometry2, typename Strategy>
    static inline void apply(Geometry1& geometry1, Geometry2 const& geometry2, Strategy const& strategy)
    {
        // Do it for both indices in one dimension
        static std::size_t const dim = Dimension - 1;
        geometry::set<0, dim>(geometry1, strategy.template apply<dim>(geometry::get<0, dim>(geometry2)));
        geometry::set<1, dim>(geometry1, strategy.template apply<dim>(geometry::get<1, dim>(geometry2)));
        recalculate_indexed<dim>::apply(geometry1, geometry2, strategy);
    }
};

template <>
struct recalculate_indexed<0>
{

template <typename Geometry1, typename Geometry2, typename Strategy>
    static inline void apply(Geometry1& , Geometry2 const& , Strategy const& )
    {
    }
};

struct range_to_range
{
    template
    <
        typename Range1,
        typename Range2,
        typename Strategy
    >
    static inline void apply(Range1& destination, Range2 const& source,
            Strategy const& strategy)
    {
        typedef typename geometry::point_type<Range2>::type point_type;
        typedef recalculate_point<geometry::dimension<point_type>::value> per_point;
        geometry::clear(destination);

for (typename boost::range_iterator<Range2 const>::type it
                = boost::begin(source);
            it != boost::end(source);
            ++it)
        {
            point_type p;
            per_point::apply(p, *it, strategy);
            geometry::append(destination, p);
        }
    }
};

struct polygon_to_polygon
{
private:
    template
    <
        typename IteratorIn,
        typename IteratorOut,
        typename Strategy
    >
    static inline void iterate(IteratorIn begin, IteratorIn end,
                    IteratorOut it_out,
                    Strategy const& strategy)
    {
        for (IteratorIn it_in = begin; it_in != end;  ++it_in, ++it_out)
        {
            range_to_range::apply(*it_out, *it_in, strategy);
        }
    }

template
    <
        typename InteriorRingsOut,
        typename InteriorRingsIn,
        typename Strategy
    >
    static inline void apply_interior_rings(
                    InteriorRingsOut& interior_rings_out,
                    InteriorRingsIn const& interior_rings_in,
                    Strategy const& strategy)
    {
        traits::resize<InteriorRingsOut>::apply(interior_rings_out,
            boost::size(interior_rings_in));

iterate(
            boost::begin(interior_rings_in), boost::end(interior_rings_in),
            boost::begin(interior_rings_out),
            strategy);
    }

public:
    template
    <
        typename Polygon1,
        typename Polygon2,
        typename Strategy
    >
    static inline void apply(Polygon1& destination, Polygon2 const& source,
            Strategy const& strategy)
    {
        range_to_range::apply(geometry::exterior_ring(destination),
            geometry::exterior_ring(source), strategy);

apply_interior_rings(geometry::interior_rings(destination),
            geometry::interior_rings(source), strategy);
    }
};

}} // namespace detail::recalculate
#endif // DOXYGEN_NO_DETAIL

#ifndef DOXYGEN_NO_DISPATCH
namespace dispatch
{

template
<
    typename Geometry1,
    typename Geometry2,
    typename Tag1 = typename geometry::tag<Geometry1>::type,
    typename Tag2 = typename geometry::tag<Geometry2>::type
>
struct recalculate : not_implemented<Tag1, Tag2>
{};

template <typename Point1, typename Point2>
struct recalculate<Point1, Point2, point_tag, point_tag>
    : detail::recalculate::recalculate_point<geometry::dimension<Point1>::value>
{};

template <typename Box1, typename Box2>
struct recalculate<Box1, Box2, box_tag, box_tag>
    : detail::recalculate::recalculate_indexed<geometry::dimension<Box1>::value>
{};

template <typename Segment1, typename Segment2>
struct recalculate<Segment1, Segment2, segment_tag, segment_tag>
    : detail::recalculate::recalculate_indexed<geometry::dimension<Segment1>::value>
{};

template <typename Polygon1, typename Polygon2>
struct recalculate<Polygon1, Polygon2, polygon_tag, polygon_tag>
    : detail::recalculate::polygon_to_polygon
{};

} // namespace dispatch
#endif // DOXYGEN_NO_DISPATCH

template <typename Geometry1, typename Geometry2, typename Strategy>
inline void recalculate(Geometry1& geometry1, Geometry2 const& geometry2, Strategy const& strategy)
{
    concepts::check<Geometry1>();
    concepts::check<Geometry2 const>();

// static assert dimensions (/types) are the same

dispatch::recalculate<Geometry1, Geometry2>::apply(geometry1, geometry2, strategy);
}

}} // namespace boost::geometry

#endif // BOOST_GEOMETRY_ALGORITHMS_DETAIL_RECALCULATE_HPP

// Boost.Geometry (aka GGL, Generic Geometry Library) // Copyright (c) 2013 Barend Gehrels, Amsterdam, the Netherlands. // Copyright (c) 2013 Bruno Lalande, Paris, France. // Copyright (c) 2013 Mateusz Loskot, London, UK. // Copyright (c) 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_ALGORITHMS_DETAIL_RECALCULATE_HPP #define BOOST_GEOMETRY_ALGORITHMS_DETAIL_RECALCULATE_HPP #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include namespace boost { namespace geometry { #ifndef DOXYGEN_NO_DETAIL namespace detail { namespace recalculate { template struct recalculate_point { template static inline void apply(Point1& point1, Point2 const& point2, Strategy const& strategy) { std::size_t const dim = Dimension - 1; geometry::set(point1, strategy.template apply(geometry::get(point2))); recalculate_point::apply(point1, point2, strategy); } }; template <> struct recalculate_point<0> { template static inline void apply(Point1&, Point2 const&, Strategy const&) { } }; template struct recalculate_indexed { template static inline void apply(Geometry1& geometry1, Geometry2 const& geometry2, Strategy const& strategy) { // Do it for both indices in one dimension static std::size_t const dim = Dimension - 1; geometry::set<0, dim>(geometry1, strategy.template apply(geometry::get<0, dim>(geometry2))); geometry::set<1, dim>(geometry1, strategy.template apply(geometry::get<1, dim>(geometry2))); recalculate_indexed::apply(geometry1, geometry2, strategy); } }; template <> struct recalculate_indexed<0> { template static inline void apply(Geometry1& , Geometry2 const& , Strategy const& ) { } }; struct range_to_range { template < typename Range1, typename Range2, typename Strategy > static inline void apply(Range1& destination, Range2 const& source, Strategy const& strategy) { typedef typename geometry::point_type::type point_type; typedef recalculate_point::value> per_point; geometry::clear(destination); for (typename boost::range_iterator::type it = boost::begin(source); it != boost::end(source); ++it) { point_type p; per_point::apply(p, *it, strategy); geometry::append(destination, p); } } }; struct polygon_to_polygon { private: template < typename IteratorIn, typename IteratorOut, typename Strategy > static inline void iterate(IteratorIn begin, IteratorIn end, IteratorOut it_out, Strategy const& strategy) { for (IteratorIn it_in = begin; it_in != end; ++it_in, ++it_out) { range_to_range::apply(*it_out, *it_in, strategy); } } template < typename InteriorRingsOut, typename InteriorRingsIn, typename Strategy > static inline void apply_interior_rings( InteriorRingsOut& interior_rings_out, InteriorRingsIn const& interior_rings_in, Strategy const& strategy) { traits::resize::apply(interior_rings_out, boost::size(interior_rings_in)); iterate( boost::begin(interior_rings_in), boost::end(interior_rings_in), boost::begin(interior_rings_out), strategy); } public: template < typename Polygon1, typename Polygon2, typename Strategy > static inline void apply(Polygon1& destination, Polygon2 const& source, Strategy const& strategy) { range_to_range::apply(geometry::exterior_ring(destination), geometry::exterior_ring(source), strategy); apply_interior_rings(geometry::interior_rings(destination), geometry::interior_rings(source), strategy); } }; }} // namespace detail::recalculate #endif // DOXYGEN_NO_DETAIL #ifndef DOXYGEN_NO_DISPATCH namespace dispatch { template < typename Geometry1, typename Geometry2, typename Tag1 = typename geometry::tag::type, typename Tag2 = typename geometry::tag::type > struct recalculate : not_implemented {}; template struct recalculate : detail::recalculate::recalculate_point::value> {}; template struct recalculate : detail::recalculate::recalculate_indexed::value> {}; template struct recalculate : detail::recalculate::recalculate_indexed::value> {}; template struct recalculate : detail::recalculate::polygon_to_polygon {}; } // namespace dispatch #endif // DOXYGEN_NO_DISPATCH template inline void recalculate(Geometry1& geometry1, Geometry2 const& geometry2, Strategy const& strategy) { concepts::check(); concepts::check(); // static assert dimensions (/types) are the same dispatch::recalculate::apply(geometry1, geometry2, strategy); } }} // namespace boost::geometry #endif // BOOST_GEOMETRY_ALGORITHMS_DETAIL_RECALCULATE_HPP