// Boost.Geometry (aka GGL, Generic Geometry Library) // Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands. // This file was modified by Oracle on 2014, 2017. // Modifications copyright (c) 2014-2017, Oracle and/or its affiliates. // Contributed and/or modified by Adam Wulkiewicz, on behalf of Oracle // 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_INTERSECTION_INTERFACE_HPP #define BOOST_GEOMETRY_ALGORITHMS_DETAIL_INTERSECTION_INTERFACE_HPP #include #include #include #include #include #include #include namespace boost { namespace geometry { #ifndef DOXYGEN_NO_DISPATCH namespace dispatch { // By default, all is forwarded to the intersection_insert-dispatcher template < typename Geometry1, typename Geometry2, typename Tag1 = typename geometry::tag::type, typename Tag2 = typename geometry::tag::type, bool Reverse = reverse_dispatch::type::value > struct intersection { template static inline bool apply(Geometry1 const& geometry1, Geometry2 const& geometry2, RobustPolicy const& robust_policy, GeometryOut& geometry_out, Strategy const& strategy) { typedef typename boost::range_value::type OneOut; intersection_insert < Geometry1, Geometry2, OneOut, overlay_intersection >::apply(geometry1, geometry2, robust_policy, range::back_inserter(geometry_out), strategy); return true; } }; // If reversal is needed, perform it template < typename Geometry1, typename Geometry2, typename Tag1, typename Tag2 > struct intersection < Geometry1, Geometry2, Tag1, Tag2, true > : intersection { template static inline bool apply( Geometry1 const& g1, Geometry2 const& g2, RobustPolicy const& robust_policy, GeometryOut& out, Strategy const& strategy) { return intersection < Geometry2, Geometry1, Tag2, Tag1, false >::apply(g2, g1, robust_policy, out, strategy); } }; } // namespace dispatch #endif // DOXYGEN_NO_DISPATCH namespace resolve_strategy { struct intersection { template < typename Geometry1, typename Geometry2, typename RobustPolicy, typename GeometryOut, typename Strategy > static inline bool apply(Geometry1 const& geometry1, Geometry2 const& geometry2, RobustPolicy const& robust_policy, GeometryOut & geometry_out, Strategy const& strategy) { return dispatch::intersection < Geometry1, Geometry2 >::apply(geometry1, geometry2, robust_policy, geometry_out, strategy); } template < typename Geometry1, typename Geometry2, typename RobustPolicy, typename GeometryOut > static inline bool apply(Geometry1 const& geometry1, Geometry2 const& geometry2, RobustPolicy const& robust_policy, GeometryOut & geometry_out, default_strategy) { typedef typename strategy::relate::services::default_strategy < Geometry1, Geometry2 >::type strategy_type; return dispatch::intersection < Geometry1, Geometry2 >::apply(geometry1, geometry2, robust_policy, geometry_out, strategy_type()); } }; } // resolve_strategy namespace resolve_variant { template struct intersection { template static inline bool apply(Geometry1 const& geometry1, Geometry2 const& geometry2, GeometryOut& geometry_out, Strategy const& strategy) { concepts::check(); concepts::check(); typedef typename geometry::rescale_overlay_policy_type < Geometry1, Geometry2 >::type rescale_policy_type; rescale_policy_type robust_policy = geometry::get_rescale_policy(geometry1, geometry2); return resolve_strategy::intersection::apply(geometry1, geometry2, robust_policy, geometry_out, strategy); } }; template struct intersection, Geometry2> { template struct visitor: static_visitor { Geometry2 const& m_geometry2; GeometryOut& m_geometry_out; Strategy const& m_strategy; visitor(Geometry2 const& geometry2, GeometryOut& geometry_out, Strategy const& strategy) : m_geometry2(geometry2) , m_geometry_out(geometry_out) , m_strategy(strategy) {} template bool operator()(Geometry1 const& geometry1) const { return intersection < Geometry1, Geometry2 >::apply(geometry1, m_geometry2, m_geometry_out, m_strategy); } }; template static inline bool apply(variant const& geometry1, Geometry2 const& geometry2, GeometryOut& geometry_out, Strategy const& strategy) { return boost::apply_visitor(visitor(geometry2, geometry_out, strategy), geometry1); } }; template struct intersection > { template struct visitor: static_visitor { Geometry1 const& m_geometry1; GeometryOut& m_geometry_out; Strategy const& m_strategy; visitor(Geometry1 const& geometry1, GeometryOut& geometry_out, Strategy const& strategy) : m_geometry1(geometry1) , m_geometry_out(geometry_out) , m_strategy(strategy) {} template bool operator()(Geometry2 const& geometry2) const { return intersection < Geometry1, Geometry2 >::apply(m_geometry1, geometry2, m_geometry_out, m_strategy); } }; template static inline bool apply(Geometry1 const& geometry1, variant const& geometry2, GeometryOut& geometry_out, Strategy const& strategy) { return boost::apply_visitor(visitor(geometry1, geometry_out, strategy), geometry2); } }; template struct intersection, variant > { template struct visitor: static_visitor { GeometryOut& m_geometry_out; Strategy const& m_strategy; visitor(GeometryOut& geometry_out, Strategy const& strategy) : m_geometry_out(geometry_out) , m_strategy(strategy) {} template bool operator()(Geometry1 const& geometry1, Geometry2 const& geometry2) const { return intersection < Geometry1, Geometry2 >::apply(geometry1, geometry2, m_geometry_out, m_strategy); } }; template static inline bool apply(variant const& geometry1, variant const& geometry2, GeometryOut& geometry_out, Strategy const& strategy) { return boost::apply_visitor(visitor(geometry_out, strategy), geometry1, geometry2); } }; } // namespace resolve_variant /*! \brief \brief_calc2{intersection} \ingroup intersection \details \details_calc2{intersection, spatial set theoretic intersection}. \tparam Geometry1 \tparam_geometry \tparam Geometry2 \tparam_geometry \tparam GeometryOut Collection of geometries (e.g. std::vector, std::deque, boost::geometry::multi*) of which the value_type fulfills a \p_l_or_c concept, or it is the output geometry (e.g. for a box) \tparam Strategy \tparam_strategy{Intersection} \param geometry1 \param_geometry \param geometry2 \param_geometry \param geometry_out The output geometry, either a multi_point, multi_polygon, multi_linestring, or a box (for intersection of two boxes) \param strategy \param_strategy{intersection} \qbk{distinguish,with strategy} \qbk{[include reference/algorithms/intersection.qbk]} */ template < typename Geometry1, typename Geometry2, typename GeometryOut, typename Strategy > inline bool intersection(Geometry1 const& geometry1, Geometry2 const& geometry2, GeometryOut& geometry_out, Strategy const& strategy) { return resolve_variant::intersection < Geometry1, Geometry2 >::apply(geometry1, geometry2, geometry_out, strategy); } /*! \brief \brief_calc2{intersection} \ingroup intersection \details \details_calc2{intersection, spatial set theoretic intersection}. \tparam Geometry1 \tparam_geometry \tparam Geometry2 \tparam_geometry \tparam GeometryOut Collection of geometries (e.g. std::vector, std::deque, boost::geometry::multi*) of which the value_type fulfills a \p_l_or_c concept, or it is the output geometry (e.g. for a box) \param geometry1 \param_geometry \param geometry2 \param_geometry \param geometry_out The output geometry, either a multi_point, multi_polygon, multi_linestring, or a box (for intersection of two boxes) \qbk{[include reference/algorithms/intersection.qbk]} */ template < typename Geometry1, typename Geometry2, typename GeometryOut > inline bool intersection(Geometry1 const& geometry1, Geometry2 const& geometry2, GeometryOut& geometry_out) { return resolve_variant::intersection < Geometry1, Geometry2 >::apply(geometry1, geometry2, geometry_out, default_strategy()); } }} // namespace boost::geometry #endif // BOOST_GEOMETRY_ALGORITHMS_DETAIL_INTERSECTION_INTERFACE_HPP