// Boost.Geometry (aka GGL, Generic Geometry Library) // Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands. // Copyright (c) 2008-2012 Bruno Lalande, Paris, France. // Copyright (c) 2009-2012 Mateusz Loskot, London, UK. // Parts of Boost.Geometry are redesigned from Geodan's Geographic Library // (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands. // 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_FOR_EACH_HPP #define BOOST_GEOMETRY_ALGORITHMS_FOR_EACH_HPP #include #include #include #include #include #include #include #include #include #include #include namespace boost { namespace geometry { #ifndef DOXYGEN_NO_DETAIL namespace detail { namespace for_each { struct fe_point_per_point { template static inline void apply(Point& point, Functor& f) { f(point); } }; struct fe_point_per_segment { template static inline void apply(Point& , Functor& f) { // TODO: if non-const, we should extract the points from the segment // and call the functor on those two points } }; struct fe_range_per_point { template static inline void apply(Range& range, Functor& f) { // The previous implementation called the std library: // return (std::for_each(boost::begin(range), boost::end(range), f)); // But that is not accepted for capturing lambda's. // It needs to do it like that to return the state of Functor f (f is passed by value in std::for_each). // So we now loop manually. for (typename boost::range_iterator::type it = boost::begin(range); it != boost::end(range); ++it) { f(*it); } } }; struct fe_range_per_segment { template static inline void apply(Range& range, Functor& f) { typedef typename add_const_if_c < is_const::value, typename point_type::type >::type point_type; BOOST_AUTO_TPL(it, boost::begin(range)); BOOST_AUTO_TPL(previous, it++); while(it != boost::end(range)) { model::referring_segment s(*previous, *it); f(s); previous = it++; } } }; struct fe_polygon_per_point { template static inline void apply(Polygon& poly, Functor& f) { fe_range_per_point::apply(exterior_ring(poly), f); typename interior_return_type::type rings = interior_rings(poly); for (BOOST_AUTO_TPL(it, boost::begin(rings)); it != boost::end(rings); ++it) { fe_range_per_point::apply(*it, f); } } }; struct fe_polygon_per_segment { template static inline void apply(Polygon& poly, Functor& f) { fe_range_per_segment::apply(exterior_ring(poly), f); typename interior_return_type::type rings = interior_rings(poly); for (BOOST_AUTO_TPL(it, boost::begin(rings)); it != boost::end(rings); ++it) { fe_range_per_segment::apply(*it, f); } } }; }} // namespace detail::for_each #endif // DOXYGEN_NO_DETAIL #ifndef DOXYGEN_NO_DISPATCH namespace dispatch { template < typename Geometry, typename Tag = typename tag_cast::type, multi_tag>::type > struct for_each_point: not_implemented {}; template struct for_each_point : detail::for_each::fe_point_per_point {}; template struct for_each_point : detail::for_each::fe_range_per_point {}; template struct for_each_point : detail::for_each::fe_range_per_point {}; template struct for_each_point : detail::for_each::fe_polygon_per_point {}; template < typename Geometry, typename Tag = typename tag_cast::type, multi_tag>::type > struct for_each_segment: not_implemented {}; template struct for_each_segment : detail::for_each::fe_point_per_segment {}; template struct for_each_segment : detail::for_each::fe_range_per_segment {}; template struct for_each_segment : detail::for_each::fe_range_per_segment {}; template struct for_each_segment : detail::for_each::fe_polygon_per_segment {}; } // namespace dispatch #endif // DOXYGEN_NO_DISPATCH /*! \brief \brf_for_each{point} \details \det_for_each{point} \ingroup for_each \param geometry \param_geometry \param f \par_for_each_f{point} \tparam Geometry \tparam_geometry \tparam Functor \tparam_functor \qbk{[include reference/algorithms/for_each_point.qbk]} \qbk{[heading Example]} \qbk{[for_each_point] [for_each_point_output]} \qbk{[for_each_point_const] [for_each_point_const_output]} */ template inline Functor for_each_point(Geometry& geometry, Functor f) { concept::check(); dispatch::for_each_point::apply(geometry, f); return f; } /*! \brief \brf_for_each{segment} \details \det_for_each{segment} \ingroup for_each \param geometry \param_geometry \param f \par_for_each_f{segment} \tparam Geometry \tparam_geometry \tparam Functor \tparam_functor \qbk{[include reference/algorithms/for_each_segment.qbk]} \qbk{[heading Example]} \qbk{[for_each_segment_const] [for_each_segment_const_output]} */ template inline Functor for_each_segment(Geometry& geometry, Functor f) { concept::check(); dispatch::for_each_segment::apply(geometry, f); return f; } }} // namespace boost::geometry #endif // BOOST_GEOMETRY_ALGORITHMS_FOR_EACH_HPP