Chris@16: // Boost.Geometry (aka GGL, Generic Geometry Library) Chris@16: Chris@16: // Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands. Chris@16: Chris@16: // Use, modification and distribution is subject to the Boost Software License, Chris@16: // Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at Chris@16: // http://www.boost.org/LICENSE_1_0.txt) Chris@16: Chris@16: #ifndef BOOST_GEOMETRY_GEOMETRY_POLICIES_RELATE_TUPLED_HPP Chris@16: #define BOOST_GEOMETRY_GEOMETRY_POLICIES_RELATE_TUPLED_HPP Chris@16: Chris@16: Chris@16: #include Chris@16: Chris@16: #include Chris@16: #include Chris@16: #include Chris@16: #include Chris@16: Chris@16: namespace boost { namespace geometry Chris@16: { Chris@16: Chris@16: namespace policies { namespace relate Chris@16: { Chris@16: Chris@16: Chris@16: // "tupled" to return intersection results together. Chris@16: // Now with two, with some meta-programming and derivations it can also be three (or more) Chris@16: template Chris@16: struct segments_tupled Chris@16: { Chris@16: typedef boost::tuple Chris@16: < Chris@16: typename Policy1::return_type, Chris@16: typename Policy2::return_type Chris@16: > return_type; Chris@16: Chris@16: // Take segments of first policy, they should be equal Chris@16: typedef typename Policy1::segment_type1 segment_type1; Chris@16: typedef typename Policy1::segment_type2 segment_type2; Chris@16: Chris@16: typedef typename select_calculation_type Chris@16: < Chris@16: segment_type1, Chris@16: segment_type2, Chris@16: CalculationType Chris@16: >::type coordinate_type; Chris@16: Chris@16: // Get the same type, but at least a double Chris@16: typedef typename select_most_precise::type rtype; Chris@16: Chris@16: template Chris@16: static inline return_type segments_intersect(side_info const& sides, Chris@16: R const& r, Chris@16: coordinate_type const& dx1, coordinate_type const& dy1, Chris@16: coordinate_type const& dx2, coordinate_type const& dy2, Chris@16: segment_type1 const& s1, segment_type2 const& s2) Chris@16: { Chris@16: return boost::make_tuple Chris@16: ( Chris@16: Policy1::segments_intersect(sides, r, Chris@16: dx1, dy1, dx2, dy2, s1, s2), Chris@16: Policy2::segments_intersect(sides, r, Chris@16: dx1, dy1, dx2, dy2, s1, s2) Chris@16: ); Chris@16: } Chris@16: Chris@16: static inline return_type collinear_touch(coordinate_type const& x, Chris@16: coordinate_type const& y, int arrival_a, int arrival_b) Chris@16: { Chris@16: return boost::make_tuple Chris@16: ( Chris@16: Policy1::collinear_touch(x, y, arrival_a, arrival_b), Chris@16: Policy2::collinear_touch(x, y, arrival_a, arrival_b) Chris@16: ); Chris@16: } Chris@16: Chris@16: template Chris@16: static inline return_type collinear_interior_boundary_intersect(S const& segment, Chris@16: bool a_within_b, Chris@16: int arrival_a, int arrival_b, bool opposite) Chris@16: { Chris@16: return boost::make_tuple Chris@16: ( Chris@16: Policy1::collinear_interior_boundary_intersect(segment, a_within_b, arrival_a, arrival_b, opposite), Chris@16: Policy2::collinear_interior_boundary_intersect(segment, a_within_b, arrival_a, arrival_b, opposite) Chris@16: ); Chris@16: } Chris@16: Chris@16: static inline return_type collinear_a_in_b(segment_type1 const& segment, Chris@16: bool opposite) Chris@16: { Chris@16: return boost::make_tuple Chris@16: ( Chris@16: Policy1::collinear_a_in_b(segment, opposite), Chris@16: Policy2::collinear_a_in_b(segment, opposite) Chris@16: ); Chris@16: } Chris@16: static inline return_type collinear_b_in_a(segment_type2 const& segment, Chris@16: bool opposite) Chris@16: { Chris@16: return boost::make_tuple Chris@16: ( Chris@16: Policy1::collinear_b_in_a(segment, opposite), Chris@16: Policy2::collinear_b_in_a(segment, opposite) Chris@16: ); Chris@16: } Chris@16: Chris@16: Chris@16: static inline return_type collinear_overlaps( Chris@16: coordinate_type const& x1, coordinate_type const& y1, Chris@16: coordinate_type const& x2, coordinate_type const& y2, Chris@16: int arrival_a, int arrival_b, bool opposite) Chris@16: { Chris@16: return boost::make_tuple Chris@16: ( Chris@16: Policy1::collinear_overlaps(x1, y1, x2, y2, arrival_a, arrival_b, opposite), Chris@16: Policy2::collinear_overlaps(x1, y1, x2, y2, arrival_a, arrival_b, opposite) Chris@16: ); Chris@16: } Chris@16: Chris@16: static inline return_type segment_equal(segment_type1 const& s, Chris@16: bool opposite) Chris@16: { Chris@16: return boost::make_tuple Chris@16: ( Chris@16: Policy1::segment_equal(s, opposite), Chris@16: Policy2::segment_equal(s, opposite) Chris@16: ); Chris@16: } Chris@16: Chris@16: static inline return_type degenerate(segment_type1 const& segment, Chris@16: bool a_degenerate) Chris@16: { Chris@16: return boost::make_tuple Chris@16: ( Chris@16: Policy1::degenerate(segment, a_degenerate), Chris@16: Policy2::degenerate(segment, a_degenerate) Chris@16: ); Chris@16: } Chris@16: Chris@16: static inline return_type disjoint() Chris@16: { Chris@16: return boost::make_tuple Chris@16: ( Chris@16: Policy1::disjoint(), Chris@16: Policy2::disjoint() Chris@16: ); Chris@16: } Chris@16: Chris@16: static inline return_type error(std::string const& msg) Chris@16: { Chris@16: return boost::make_tuple Chris@16: ( Chris@16: Policy1::error(msg), Chris@16: Policy2::error(msg) Chris@16: ); Chris@16: } Chris@16: Chris@16: static inline return_type collinear_disjoint() Chris@16: { Chris@16: return boost::make_tuple Chris@16: ( Chris@16: Policy1::collinear_disjoint(), Chris@16: Policy2::collinear_disjoint() Chris@16: ); Chris@16: } Chris@16: Chris@16: }; Chris@16: Chris@16: }} // namespace policies::relate Chris@16: Chris@16: }} // namespace boost::geometry Chris@16: Chris@16: #endif // BOOST_GEOMETRY_GEOMETRY_POLICIES_RELATE_TUPLED_HPP