/usr/include/boost/geometry/algorithms/detail
NameSizeModeActions
buffer/-0755rm
centroid/-0755rm
closest_feature/-0755rm
comparable_distance/-0755rm
covered_by/-0755rm
disjoint/-0755rm
distance/-0755rm
envelope/-0755rm
equals/-0755rm
expand/-0755rm
intersection/-0755rm
intersects/-0755rm
is_simple/-0755rm
is_valid/-0755rm
make/-0755rm
overlaps/-0755rm
overlay/-0755rm
relate/-0755rm
relation/-0755rm
sections/-0755rm
touches/-0755rm
turns/-0755rm
within/-0755rm
assign_box_corners.hpp33380644editdlrm
assign_indexed_point.hpp26560644editdlrm
assign_values.hpp89570644editdlrm
as_range.hpp26880644editdlrm
azimuth.hpp48020644editdlrm
calculate_null.hpp11440644editdlrm
calculate_point_order.hpp111450644editdlrm
calculate_sum.hpp20470644editdlrm
check_iterator_range.hpp20120644editdlrm
convert_indexed_to_indexed.hpp22960644editdlrm
convert_point_to_point.hpp22590644editdlrm
counting.hpp27460644editdlrm
course.hpp11800644editdlrm
direction_code.hpp92050644editdlrm
expand_by_epsilon.hpp38800644editdlrm
extreme_points.hpp197670644editdlrm
for_each_range.hpp49620644editdlrm
get_max_size.hpp20540644editdlrm
has_self_intersections.hpp53890644editdlrm
interior_iterator.hpp17680644editdlrm
max_interval_gap.hpp84300644editdlrm
multi_modify.hpp18830644editdlrm
multi_modify_with_predicate.hpp14420644editdlrm
multi_sum.hpp14900644editdlrm
normalize.hpp12960644editdlrm
not.hpp20320644editdlrm
num_distinct_consecutive_points.hpp24490644editdlrm
partition.hpp298240644editdlrm
point_is_spike_or_equal.hpp54550644editdlrm
point_on_border.hpp52540644editdlrm
recalculate.hpp69050644editdlrm
ring_identifier.hpp22850644editdlrm
signed_size_type.hpp7700644editdlrm
single_geometry.hpp28400644editdlrm
sub_range.hpp40970644editdlrm
sweep.hpp20860644editdlrm
throw_on_empty_input.hpp20730644editdlrm
tupled_output.hpp192350644editdlrm
Edit: /usr/include/boost/geometry/algorithms/detail/has_self_intersections.hpp (5389B)
// Boost.Geometry (aka GGL, Generic Geometry Library) // Copyright (c) 2011-2012 Barend Gehrels, Amsterdam, the Netherlands. // Copyright (c) 2017 Adam Wulkiewicz, Lodz, Poland. // This file was modified by Oracle on 2017, 2019. // Modifications copyright (c) 2017, 2019 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_HAS_SELF_INTERSECTIONS_HPP #define BOOST_GEOMETRY_ALGORITHMS_DETAIL_HAS_SELF_INTERSECTIONS_HPP #include #include #include #include #include #include #include #include #include #include #include #ifdef BOOST_GEOMETRY_DEBUG_HAS_SELF_INTERSECTIONS # include # include #endif namespace boost { namespace geometry { #if ! defined(BOOST_GEOMETRY_OVERLAY_NO_THROW) /*! \brief Overlay Invalid Input Exception \ingroup overlay \details The overlay_invalid_input_exception is thrown at invalid input */ class overlay_invalid_input_exception : public geometry::exception { public: inline overlay_invalid_input_exception() {} virtual char const* what() const throw() { return "Boost.Geometry Overlay invalid input exception"; } }; #endif #ifndef DOXYGEN_NO_DETAIL namespace detail { namespace overlay { template inline bool has_self_intersections(Geometry const& geometry, Strategy const& strategy, RobustPolicy const& robust_policy, bool throw_on_self_intersection = true) { typedef typename point_type::type point_type; typedef turn_info < point_type, typename segment_ratio_type::type > turn_info; std::deque turns; detail::disjoint::disjoint_interrupt_policy policy; detail::self_get_turn_points::self_turns < false, detail::overlay::assign_null_policy >(geometry, strategy, robust_policy, turns, policy, 0, false); #ifdef BOOST_GEOMETRY_DEBUG_HAS_SELF_INTERSECTIONS bool first = true; #endif for(typename std::deque::const_iterator it = boost::begin(turns); it != boost::end(turns); ++it) { turn_info const& info = *it; bool const both_union_turn = info.operations[0].operation == detail::overlay::operation_union && info.operations[1].operation == detail::overlay::operation_union; bool const both_intersection_turn = info.operations[0].operation == detail::overlay::operation_intersection && info.operations[1].operation == detail::overlay::operation_intersection; bool const valid = (both_union_turn || both_intersection_turn) && (info.method == detail::overlay::method_touch || info.method == detail::overlay::method_touch_interior); if (! valid) { #ifdef BOOST_GEOMETRY_DEBUG_HAS_SELF_INTERSECTIONS if (first) { std::cout << "turn points: " << std::endl; first = false; } std::cout << method_char(info.method); for (int i = 0; i < 2; i++) { std::cout << " " << operation_char(info.operations[i].operation); std::cout << " " << info.operations[i].seg_id; } std::cout << " " << geometry::dsv(info.point) << std::endl; #endif #if ! defined(BOOST_GEOMETRY_OVERLAY_NO_THROW) if (throw_on_self_intersection) { BOOST_THROW_EXCEPTION(overlay_invalid_input_exception()); } #endif return true; } } return false; } // For backward compatibility template inline bool has_self_intersections(Geometry const& geometry, bool throw_on_self_intersection = true) { typedef typename geometry::point_type::type point_type; typedef typename geometry::rescale_policy_type::type rescale_policy_type; typename strategy::intersection::services::default_strategy < typename cs_tag::type >::type strategy; rescale_policy_type robust_policy = geometry::get_rescale_policy(geometry, strategy); return has_self_intersections(geometry, strategy, robust_policy, throw_on_self_intersection); } }} // namespace detail::overlay #endif // DOXYGEN_NO_DETAIL }} // namespace boost::geometry #endif // BOOST_GEOMETRY_ALGORITHMS_DETAIL_HAS_SELF_INTERSECTIONS_HPP