/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/point_is_spike_or_equal.hpp (5455B)
// Boost.Geometry (aka GGL, Generic Geometry Library) // Copyright (c) 2007-2015 Barend Gehrels, Amsterdam, the Netherlands. // Copyright (c) 2008-2015 Bruno Lalande, Paris, France. // Copyright (c) 2009-2015 Mateusz Loskot, London, UK. // Copyright (c) 2013-2015 Adam Wulkiewicz, Lodz, Poland. // This file was modified by Oracle on 2015, 2017, 2019. // Modifications copyright (c) 2015-2019 Oracle and/or its affiliates. // Contributed and/or modified by Menelaos Karavelas, on behalf of Oracle // 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_POINT_IS_EQUAL_OR_SPIKE_HPP #define BOOST_GEOMETRY_ALGORITHMS_DETAIL_POINT_IS_EQUAL_OR_SPIKE_HPP #include #include #include #include #include #include #include namespace boost { namespace geometry { #ifndef DOXYGEN_NO_DETAIL namespace detail { // Checks if a point ("last_point") causes a spike w.r.t. // the specified two other points (segment_a, segment_b) // // x-------x------x // a lp b // // Above, lp generates a spike w.r.t. segment(a,b) // So specify last point first, then (a,b) // The segment's orientation does matter: if lp is to the right of b // no spike is reported template < typename Point1, typename Point2, typename Point3, typename SideStrategy > inline bool point_is_spike_or_equal(Point1 const& last_point, // prev | back Point2 const& segment_a, // next | back - 2 Point3 const& segment_b, // curr | back - 1 | spike's vertex SideStrategy const& strategy) { typedef typename SideStrategy::cs_tag cs_tag; int const side = strategy.apply(segment_a, segment_b, last_point); if (side == 0) { // Last point is collinear w.r.t previous segment. return direction_code(segment_a, segment_b, last_point) < 1; } return false; } template < typename Point1, typename Point2, typename Point3, typename SideStrategy, typename RobustPolicy > inline bool point_is_spike_or_equal(Point1 const& last_point, Point2 const& segment_a, Point3 const& segment_b, SideStrategy const& strategy, RobustPolicy const& robust_policy) { if (point_is_spike_or_equal(last_point, segment_a, segment_b, strategy)) { return true; } if (BOOST_GEOMETRY_CONDITION(! RobustPolicy::enabled)) { return false; } // Try using specified robust policy typedef typename geometry::robust_point_type < Point1, RobustPolicy >::type robust_point_type; robust_point_type last_point_rob, segment_a_rob, segment_b_rob; geometry::recalculate(last_point_rob, last_point, robust_policy); geometry::recalculate(segment_a_rob, segment_a, robust_policy); geometry::recalculate(segment_b_rob, segment_b, robust_policy); return point_is_spike_or_equal ( last_point_rob, segment_a_rob, segment_b_rob, strategy ); } template < typename Point1, typename Point2, typename Point3, typename SideStrategy, typename RobustPolicy > inline bool point_is_collinear(Point1 const& last_point, Point2 const& segment_a, Point3 const& segment_b, SideStrategy const& strategy, RobustPolicy const& robust_policy) { int const side = strategy.apply(segment_a, segment_b, last_point); if (side == 0) { return true; } // This part (or whole method, because it is then trivial) // will be removed after rescaling if (BOOST_GEOMETRY_CONDITION(! RobustPolicy::enabled)) { return false; } // Redo, using specified robust policy typedef typename geometry::robust_point_type < Point1, RobustPolicy >::type robust_point_type; robust_point_type last_point_rob, segment_a_rob, segment_b_rob; geometry::recalculate(last_point_rob, last_point, robust_policy); geometry::recalculate(segment_a_rob, segment_a, robust_policy); geometry::recalculate(segment_b_rob, segment_b, robust_policy); int const side_rob = strategy.apply(segment_a_rob, segment_b_rob, last_point_rob); return side_rob == 0; } //! Version with intuitive order (A, B, C). The original order was //! unclear (C, A, B). It was used in a different way in has_spikes. //! On longer term the C,A,B version can be deprecated template < typename Point1, typename Point2, typename Point3, typename SideStrategy > inline bool is_spike_or_equal(Point1 const& a, Point2 const& b, Point3 const& c, SideStrategy const& strategy) { return point_is_spike_or_equal(c, a, b, strategy); } } // namespace detail #endif }} // namespace boost::geometry #endif // BOOST_GEOMETRY_ALGORITHMS_DETAIL_POINT_IS_EQUAL_OR_SPIKE_HPP