// Boost.Geometry (aka GGL, Generic Geometry Library) // Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands. // This file was modified by Oracle on 2017-2020. // Modifications copyright (c) 2017-2020, 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_DIFFERENCE_HPP #define BOOST_GEOMETRY_ALGORITHMS_DIFFERENCE_HPP #include #include #include #include #include #include #include #include #include #include namespace boost { namespace geometry { #ifndef DOXYGEN_NO_DETAIL namespace detail { namespace difference { template < typename Geometry1, typename Geometry2, typename SingleOut, typename OutTag = typename detail::setop_insert_output_tag::type, bool ReturnGeometry1 = (topological_dimension::value > topological_dimension::value) > struct call_intersection_insert { template < typename OutputIterator, typename RobustPolicy, typename Strategy > static inline OutputIterator apply(Geometry1 const& geometry1, Geometry2 const& geometry2, RobustPolicy const& robust_policy, OutputIterator out, Strategy const& strategy) { return geometry::dispatch::intersection_insert < Geometry1, Geometry2, SingleOut, overlay_difference, geometry::detail::overlay::do_reverse::value>::value, geometry::detail::overlay::do_reverse::value, true>::value >::apply(geometry1, geometry2, robust_policy, out, strategy); } }; template < typename Geometry1, typename Geometry2, typename SingleOut > struct call_intersection_insert_tupled_base { typedef typename geometry::detail::single_tag_from_base_tag < typename geometry::tag_cast < typename geometry::tag::type, pointlike_tag, linear_tag, areal_tag >::type >::type single_tag; typedef detail::expect_output < Geometry1, Geometry2, SingleOut, single_tag > expect_check; typedef typename geometry::detail::output_geometry_access < SingleOut, single_tag, single_tag > access; }; template < typename Geometry1, typename Geometry2, typename SingleOut > struct call_intersection_insert < Geometry1, Geometry2, SingleOut, detail::tupled_output_tag, false > : call_intersection_insert_tupled_base { typedef call_intersection_insert_tupled_base base_t; template < typename OutputIterator, typename RobustPolicy, typename Strategy > static inline OutputIterator apply(Geometry1 const& geometry1, Geometry2 const& geometry2, RobustPolicy const& robust_policy, OutputIterator out, Strategy const& strategy) { base_t::access::get(out) = call_intersection_insert < Geometry1, Geometry2, typename base_t::access::type >::apply(geometry1, geometry2, robust_policy, base_t::access::get(out), strategy); return out; } }; template < typename Geometry1, typename Geometry2, typename SingleOut > struct call_intersection_insert < Geometry1, Geometry2, SingleOut, detail::tupled_output_tag, true > : call_intersection_insert_tupled_base { typedef call_intersection_insert_tupled_base base_t; template < typename OutputIterator, typename RobustPolicy, typename Strategy > static inline OutputIterator apply(Geometry1 const& geometry1, Geometry2 const& geometry2, RobustPolicy const& robust_policy, OutputIterator out, Strategy const& strategy) { base_t::access::get(out) = geometry::detail::convert_to_output < Geometry1, typename base_t::access::type >::apply(geometry1, base_t::access::get(out)); return out; } }; /*! \brief_calc2{difference} \brief_strategy \ingroup difference \details \details_calc2{difference_insert, spatial set theoretic difference} \brief_strategy. \details_inserter{difference} \tparam GeometryOut output geometry type, must be specified \tparam Geometry1 \tparam_geometry \tparam Geometry2 \tparam_geometry \tparam OutputIterator output iterator \tparam Strategy \tparam_strategy_overlay \param geometry1 \param_geometry \param geometry2 \param_geometry \param out \param_out{difference} \param strategy \param_strategy{difference} \return \return_out \qbk{distinguish,with strategy} */ template < typename GeometryOut, typename Geometry1, typename Geometry2, typename OutputIterator, typename Strategy > inline OutputIterator difference_insert(Geometry1 const& geometry1, Geometry2 const& geometry2, OutputIterator out, Strategy const& strategy) { concepts::check(); concepts::check(); //concepts::check(); geometry::detail::output_geometry_concept_check::apply(); typedef typename geometry::rescale_overlay_policy_type < Geometry1, Geometry2, typename Strategy::cs_tag >::type rescale_policy_type; rescale_policy_type robust_policy = geometry::get_rescale_policy( geometry1, geometry2, strategy); return geometry::detail::difference::call_intersection_insert < Geometry1, Geometry2, GeometryOut >::apply(geometry1, geometry2, robust_policy, out, strategy); } /*! \brief_calc2{difference} \ingroup difference \details \details_calc2{difference_insert, spatial set theoretic difference}. \details_insert{difference} \tparam GeometryOut output geometry type, must be specified \tparam Geometry1 \tparam_geometry \tparam Geometry2 \tparam_geometry \tparam OutputIterator output iterator \param geometry1 \param_geometry \param geometry2 \param_geometry \param out \param_out{difference} \return \return_out \qbk{[include reference/algorithms/difference_insert.qbk]} */ template < typename GeometryOut, typename Geometry1, typename Geometry2, typename OutputIterator > inline OutputIterator difference_insert(Geometry1 const& geometry1, Geometry2 const& geometry2, OutputIterator out) { typedef typename strategies::relate::services::default_strategy < Geometry1, Geometry2 >::type strategy_type; return difference_insert(geometry1, geometry2, out, strategy_type()); } }} // namespace detail::difference #endif // DOXYGEN_NO_DETAIL namespace resolve_strategy { template < typename Strategy, bool IsUmbrella = strategies::detail::is_umbrella_strategy::value > struct difference { template static inline void apply(Geometry1 const& geometry1, Geometry2 const& geometry2, Collection & output_collection, Strategy const& strategy) { typedef typename geometry::detail::output_geometry_value < Collection >::type single_out; detail::difference::difference_insert( geometry1, geometry2, geometry::detail::output_geometry_back_inserter(output_collection), strategy); } }; template struct difference { template static inline void apply(Geometry1 const& geometry1, Geometry2 const& geometry2, Collection & output_collection, Strategy const& strategy) { using strategies::relate::services::strategy_converter; difference < decltype(strategy_converter::get(strategy)) >::apply(geometry1, geometry2, output_collection, strategy_converter::get(strategy)); } }; template <> struct difference { template static inline void apply(Geometry1 const& geometry1, Geometry2 const& geometry2, Collection & output_collection, default_strategy) { typedef typename strategies::relate::services::default_strategy < Geometry1, Geometry2 >::type strategy_type; difference < strategy_type >::apply(geometry1, geometry2, output_collection, strategy_type()); } }; } // resolve_strategy namespace resolve_variant { template struct difference { template static inline void apply(Geometry1 const& geometry1, Geometry2 const& geometry2, Collection& output_collection, Strategy const& strategy) { resolve_strategy::difference < Strategy >::apply(geometry1, geometry2, output_collection, strategy); } }; template struct difference, Geometry2> { template struct visitor: static_visitor<> { Geometry2 const& m_geometry2; Collection& m_output_collection; Strategy const& m_strategy; visitor(Geometry2 const& geometry2, Collection& output_collection, Strategy const& strategy) : m_geometry2(geometry2) , m_output_collection(output_collection) , m_strategy(strategy) {} template void operator()(Geometry1 const& geometry1) const { difference < Geometry1, Geometry2 >::apply(geometry1, m_geometry2, m_output_collection, m_strategy); } }; template static inline void apply(variant const& geometry1, Geometry2 const& geometry2, Collection& output_collection, Strategy const& strategy) { boost::apply_visitor(visitor(geometry2, output_collection, strategy), geometry1); } }; template struct difference > { template struct visitor: static_visitor<> { Geometry1 const& m_geometry1; Collection& m_output_collection; Strategy const& m_strategy; visitor(Geometry1 const& geometry1, Collection& output_collection, Strategy const& strategy) : m_geometry1(geometry1) , m_output_collection(output_collection) , m_strategy(strategy) {} template void operator()(Geometry2 const& geometry2) const { difference < Geometry1, Geometry2 >::apply(m_geometry1, geometry2, m_output_collection, m_strategy); } }; template static inline void apply(Geometry1 const& geometry1, variant const& geometry2, Collection& output_collection, Strategy const& strategy) { boost::apply_visitor(visitor(geometry1, output_collection, strategy), geometry2); } }; template struct difference, variant > { template struct visitor: static_visitor<> { Collection& m_output_collection; Strategy const& m_strategy; visitor(Collection& output_collection, Strategy const& strategy) : m_output_collection(output_collection) , m_strategy(strategy) {} template void operator()(Geometry1 const& geometry1, Geometry2 const& geometry2) const { difference < Geometry1, Geometry2 >::apply(geometry1, geometry2, m_output_collection, m_strategy); } }; template static inline void apply(variant const& geometry1, variant const& geometry2, Collection& output_collection, Strategy const& strategy) { boost::apply_visitor(visitor(output_collection, strategy), geometry1, geometry2); } }; } // namespace resolve_variant /*! \brief_calc2{difference} \ingroup difference \details \details_calc2{difference, spatial set theoretic difference}. \tparam Geometry1 \tparam_geometry \tparam Geometry2 \tparam_geometry \tparam Collection \tparam_output_collection \tparam Strategy \tparam_strategy{Difference} \param geometry1 \param_geometry \param geometry2 \param_geometry \param output_collection the output collection \param strategy \param_strategy{difference} \qbk{distinguish,with strategy} \qbk{[include reference/algorithms/difference.qbk]} */ template < typename Geometry1, typename Geometry2, typename Collection, typename Strategy > inline void difference(Geometry1 const& geometry1, Geometry2 const& geometry2, Collection& output_collection, Strategy const& strategy) { resolve_variant::difference < Geometry1, Geometry2 >::apply(geometry1, geometry2, output_collection, strategy); } /*! \brief_calc2{difference} \ingroup difference \details \details_calc2{difference, spatial set theoretic difference}. \tparam Geometry1 \tparam_geometry \tparam Geometry2 \tparam_geometry \tparam Collection \tparam_output_collection \param geometry1 \param_geometry \param geometry2 \param_geometry \param output_collection the output collection \qbk{[include reference/algorithms/difference.qbk]} */ template < typename Geometry1, typename Geometry2, typename Collection > inline void difference(Geometry1 const& geometry1, Geometry2 const& geometry2, Collection& output_collection) { resolve_variant::difference < Geometry1, Geometry2 >::apply(geometry1, geometry2, output_collection, default_strategy()); } }} // namespace boost::geometry #endif // BOOST_GEOMETRY_ALGORITHMS_DIFFERENCE_HPP