/usr/include/boost/geometry/algorithms
NameSizeModeActions
detail/-0755rm
dispatch/-0755rm
append.hpp114930644editdlrm
area.hpp106570644editdlrm
assign.hpp107090644editdlrm
buffer.hpp86560644editdlrm
centroid.hpp196200644editdlrm
clear.hpp51560644editdlrm
comparable_distance.hpp11070644editdlrm
convert.hpp173270644editdlrm
convex_hull.hpp115890644editdlrm
correct.hpp99560644editdlrm
correct_closure.hpp58620644editdlrm
covered_by.hpp10770644editdlrm
crosses.hpp84780644editdlrm
densify.hpp124720644editdlrm
difference.hpp165910644editdlrm
discrete_frechet_distance.hpp78440644editdlrm
discrete_hausdorff_distance.hpp112810644editdlrm
disjoint.hpp11910644editdlrm
distance.hpp11100644editdlrm
envelope.hpp10210644editdlrm
equals.hpp11960644editdlrm
expand.hpp10730644editdlrm
for_each.hpp98310644editdlrm
intersection.hpp8060644editdlrm
intersects.hpp11450644editdlrm
is_convex.hpp65080644editdlrm
is_empty.hpp48530644editdlrm
is_simple.hpp5750644editdlrm
is_valid.hpp5700644editdlrm
length.hpp93410644editdlrm
line_interpolate.hpp130540644editdlrm
make.hpp51700644editdlrm
not_implemented.hpp38390644editdlrm
num_geometries.hpp35860644editdlrm
num_interior_rings.hpp37560644editdlrm
num_points.hpp55650644editdlrm
num_segments.hpp47750644editdlrm
overlaps.hpp10670644editdlrm
perimeter.hpp72120644editdlrm
point_on_surface.hpp132810644editdlrm
relate.hpp6420644editdlrm
relation.hpp6520644editdlrm
remove_spikes.hpp97530644editdlrm
reverse.hpp43860644editdlrm
simplify.hpp226960644editdlrm
sym_difference.hpp231690644editdlrm
touches.hpp11270644editdlrm
transform.hpp141050644editdlrm
union.hpp213830644editdlrm
unique.hpp46820644editdlrm
validity_failure_type.hpp36840644editdlrm
within.hpp10570644editdlrm
Edit: /usr/include/boost/geometry/algorithms/crosses.hpp (8478B)
// 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. // Copyright (c) 2014 Samuel Debionne, Grenoble, France. // 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 // 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_CROSSES_HPP #define BOOST_GEOMETRY_ALGORITHMS_CROSSES_HPP #include #include #include #include #include #include #include #include #include namespace boost { namespace geometry { #ifndef DOXYGEN_NO_DISPATCH namespace dispatch { template < typename Geometry1, typename Geometry2, typename Tag1 = typename tag::type, typename Tag2 = typename tag::type > struct crosses : detail::relate::relate_impl < detail::de9im::static_mask_crosses_type, Geometry1, Geometry2 > {}; } // namespace dispatch #endif // DOXYGEN_NO_DISPATCH namespace resolve_strategy { struct crosses { template static inline bool apply(Geometry1 const& geometry1, Geometry2 const& geometry2, Strategy const& strategy) { concepts::check(); concepts::check(); return dispatch::crosses::apply(geometry1, geometry2, strategy); } template static inline bool apply(Geometry1 const& geometry1, Geometry2 const& geometry2, default_strategy) { typedef typename strategy::relate::services::default_strategy < Geometry1, Geometry2 >::type strategy_type; return apply(geometry1, geometry2, strategy_type()); } }; } // namespace resolve_strategy namespace resolve_variant { template struct crosses { template static inline bool apply(Geometry1 const& geometry1, Geometry2 const& geometry2, Strategy const& strategy) { return resolve_strategy::crosses::apply(geometry1, geometry2, strategy); } }; template struct crosses, Geometry2> { template struct visitor: static_visitor { Geometry2 const& m_geometry2; Strategy const& m_strategy; visitor(Geometry2 const& geometry2, Strategy const& strategy) : m_geometry2(geometry2) , m_strategy(strategy) {} template result_type operator()(Geometry1 const& geometry1) const { return crosses < Geometry1, Geometry2 >::apply(geometry1, m_geometry2, m_strategy); } }; template static inline bool apply(variant const& geometry1, Geometry2 const& geometry2, Strategy const& strategy) { return boost::apply_visitor(visitor(geometry2, strategy), geometry1); } }; template struct crosses > { template struct visitor: static_visitor { Geometry1 const& m_geometry1; Strategy const& m_strategy; visitor(Geometry1 const& geometry1, Strategy const& strategy) : m_geometry1(geometry1) , m_strategy(strategy) {} template result_type operator()(Geometry2 const& geometry2) const { return crosses < Geometry1, Geometry2 >::apply(m_geometry1, geometry2, m_strategy); } }; template static inline bool apply(Geometry1 const& geometry1, variant const& geometry2, Strategy const& strategy) { return boost::apply_visitor(visitor(geometry1, strategy), geometry2); } }; template struct crosses, variant > { template struct visitor: static_visitor { Strategy const& m_strategy; visitor(Strategy const& strategy) : m_strategy(strategy) {} template result_type operator()(Geometry1 const& geometry1, Geometry2 const& geometry2) const { return crosses < Geometry1, Geometry2 >::apply(geometry1, geometry2, m_strategy); } }; template static inline bool apply(variant const& geometry1, variant const& geometry2, Strategy const& strategy) { return boost::apply_visitor(visitor(strategy), geometry1, geometry2); } }; } // namespace resolve_variant /*! \brief \brief_check2{crosses} \ingroup crosses \tparam Geometry1 \tparam_geometry \tparam Geometry2 \tparam_geometry \tparam Strategy \tparam_strategy{Crosses} \param geometry1 \param_geometry \param geometry2 \param_geometry \param strategy \param_strategy{crosses} \return \return_check2{crosses} \qbk{distinguish,with strategy} \qbk{[include reference/algorithms/crosses.qbk]} */ template inline bool crosses(Geometry1 const& geometry1, Geometry2 const& geometry2, Strategy const& strategy) { return resolve_variant::crosses < Geometry1, Geometry2 >::apply(geometry1, geometry2, strategy); } /*! \brief \brief_check2{crosses} \ingroup crosses \tparam Geometry1 \tparam_geometry \tparam Geometry2 \tparam_geometry \param geometry1 \param_geometry \param geometry2 \param_geometry \return \return_check2{crosses} \qbk{[include reference/algorithms/crosses.qbk]} \qbk{ [heading Examples] [crosses] [crosses_output] } */ template inline bool crosses(Geometry1 const& geometry1, Geometry2 const& geometry2) { return resolve_variant::crosses < Geometry1, Geometry2 >::apply(geometry1, geometry2, default_strategy()); } }} // namespace boost::geometry #endif // BOOST_GEOMETRY_ALGORITHMS_CROSSES_HPP