/
usr
/
include
/
boost
/
geometry
/
algorithms
/
detail
/
overlay
/
/usr/include/boost/geometry/algorithms/detail/overlay
mkdir
upload
Name
Size
Mode
Actions
add_rings.hpp
5964
0644
edit
dl
rm
append_no_duplicates.hpp
2101
0644
edit
dl
rm
append_no_dups_or_spikes.hpp
7434
0644
edit
dl
rm
assign_parents.hpp
14577
0644
edit
dl
rm
backtrack_check_si.hpp
6371
0644
edit
dl
rm
check_enrich.hpp
5361
0644
edit
dl
rm
clip_linestring.hpp
8718
0644
edit
dl
rm
cluster_exits.hpp
7817
0644
edit
dl
rm
cluster_info.hpp
1010
0644
edit
dl
rm
convert_ring.hpp
3113
0644
edit
dl
rm
copy_segments.hpp
11481
0644
edit
dl
rm
copy_segment_point.hpp
11107
0644
edit
dl
rm
debug_turn_info.hpp
1947
0644
edit
dl
rm
do_reverse.hpp
1246
0644
edit
dl
rm
enrichment_info.hpp
2343
0644
edit
dl
rm
enrich_intersection_points.hpp
19008
0644
edit
dl
rm
follow.hpp
16907
0644
edit
dl
rm
follow_linear_linear.hpp
15711
0644
edit
dl
rm
get_distance_measure.hpp
5092
0644
edit
dl
rm
get_intersection_points.hpp
4265
0644
edit
dl
rm
get_relative_order.hpp
3260
0644
edit
dl
rm
get_ring.hpp
3700
0644
edit
dl
rm
get_turns.hpp
42078
0644
edit
dl
rm
get_turn_info.hpp
45746
0644
edit
dl
rm
get_turn_info_for_endpoint.hpp
25337
0644
edit
dl
rm
get_turn_info_helpers.hpp
19708
0644
edit
dl
rm
get_turn_info_la.hpp
34941
0644
edit
dl
rm
get_turn_info_ll.hpp
28380
0644
edit
dl
rm
handle_colocations.hpp
28604
0644
edit
dl
rm
handle_self_turns.hpp
9962
0644
edit
dl
rm
inconsistent_turns_exception.hpp
1043
0644
edit
dl
rm
intersection_box_box.hpp
2623
0644
edit
dl
rm
intersection_insert.hpp
47296
0644
edit
dl
rm
is_self_turn.hpp
1611
0644
edit
dl
rm
less_by_segment_ratio.hpp
6161
0644
edit
dl
rm
linear_linear.hpp
9562
0644
edit
dl
rm
needs_self_turns.hpp
1911
0644
edit
dl
rm
overlay.hpp
15706
0644
edit
dl
rm
overlay_type.hpp
1746
0644
edit
dl
rm
pointlike_areal.hpp
9593
0644
edit
dl
rm
pointlike_linear.hpp
11547
0644
edit
dl
rm
pointlike_pointlike.hpp
11878
0644
edit
dl
rm
range_in_geometry.hpp
5066
0644
edit
dl
rm
ring_properties.hpp
2135
0644
edit
dl
rm
segment_as_subrange.hpp
1488
0644
edit
dl
rm
segment_identifier.hpp
3555
0644
edit
dl
rm
select_rings.hpp
12362
0644
edit
dl
rm
self_turn_points.hpp
10814
0644
edit
dl
rm
sort_by_side.hpp
22216
0644
edit
dl
rm
stream_info.hpp
2383
0644
edit
dl
rm
traversal.hpp
34432
0644
edit
dl
rm
traversal_info.hpp
1469
0644
edit
dl
rm
traversal_ring_creator.hpp
15319
0644
edit
dl
rm
traversal_switch_detector.hpp
22642
0644
edit
dl
rm
traverse.hpp
3256
0644
edit
dl
rm
turn_info.hpp
4468
0644
edit
dl
rm
visit_info.hpp
2350
0644
edit
dl
rm
Edit:
/usr/include/boost/geometry/algorithms/detail/overlay/backtrack_check_si.hpp
(6371B)
// Boost.Geometry (aka GGL, Generic Geometry Library) // Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands. // This file was modified by Oracle on 2017. // Modifications copyright (c) 2017, 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_OVERLAY_BACKTRACK_CHECK_SI_HPP #define BOOST_GEOMETRY_ALGORITHMS_DETAIL_OVERLAY_BACKTRACK_CHECK_SI_HPP #include <cstddef> #include <string> #include <boost/range.hpp> #include <boost/geometry/core/access.hpp> #include <boost/geometry/algorithms/detail/overlay/turn_info.hpp> #include <boost/geometry/algorithms/detail/has_self_intersections.hpp> #if defined(BOOST_GEOMETRY_DEBUG_INTERSECTION) || defined(BOOST_GEOMETRY_OVERLAY_REPORT_WKT) # include <boost/geometry/algorithms/detail/overlay/debug_turn_info.hpp> # include <boost/geometry/io/wkt/wkt.hpp> #endif namespace boost { namespace geometry { #ifndef DOXYGEN_NO_DETAIL namespace detail { namespace overlay { template <typename Turns> inline void clear_visit_info(Turns& turns) { typedef typename boost::range_value<Turns>::type tp_type; for (typename boost::range_iterator<Turns>::type it = boost::begin(turns); it != boost::end(turns); ++it) { for (typename boost::range_iterator < typename tp_type::container_type >::type op_it = boost::begin(it->operations); op_it != boost::end(it->operations); ++op_it) { op_it->visited.clear(); } } } struct backtrack_state { bool m_good; inline backtrack_state() : m_good(true) {} inline void reset() { m_good = true; } inline bool good() const { return m_good; } }; enum traverse_error_type { traverse_error_none, traverse_error_no_next_ip_at_start, traverse_error_no_next_ip, traverse_error_dead_end_at_start, traverse_error_dead_end, traverse_error_visit_again, traverse_error_endless_loop }; inline std::string traverse_error_string(traverse_error_type error) { switch (error) { case traverse_error_none : return ""; case traverse_error_no_next_ip_at_start : return "No next IP at start"; case traverse_error_no_next_ip : return "No next IP"; case traverse_error_dead_end_at_start : return "Dead end at start"; case traverse_error_dead_end : return "Dead end"; case traverse_error_visit_again : return "Visit again"; case traverse_error_endless_loop : return "Endless loop"; default : return ""; } return ""; } template < typename Geometry1, typename Geometry2 > class backtrack_check_self_intersections { struct state : public backtrack_state { bool m_checked; inline state() : m_checked(true) {} }; public : typedef state state_type; template < typename Operation, typename Rings, typename Ring, typename Turns, typename Strategy, typename RobustPolicy, typename Visitor > static inline void apply(std::size_t size_at_start, Rings& rings, Ring& ring, Turns& turns, typename boost::range_value<Turns>::type const& turn, Operation& operation, traverse_error_type traverse_error, Geometry1 const& geometry1, Geometry2 const& geometry2, Strategy const& strategy, RobustPolicy const& robust_policy, state_type& state, Visitor& visitor) { visitor.visit_traverse_reject(turns, turn, operation, traverse_error); state.m_good = false; // Check self-intersections and throw exception if appropriate if (! state.m_checked) { state.m_checked = true; has_self_intersections(geometry1, strategy, robust_policy); has_self_intersections(geometry2, strategy, robust_policy); } // Make bad output clean rings.resize(size_at_start); geometry::traits::clear<typename boost::range_value<Rings>::type>::apply(ring); // Reject this as a starting point operation.visited.set_rejected(); // And clear all visit info clear_visit_info(turns); } }; #ifdef BOOST_GEOMETRY_OVERLAY_REPORT_WKT template < typename Geometry1, typename Geometry2 > class backtrack_debug { public : typedef backtrack_state state_type; template <typename Operation, typename Rings, typename Turns> static inline void apply(std::size_t size_at_start, Rings& rings, typename boost::range_value<Rings>::type& ring, Turns& turns, Operation& operation, std::string const& reason, Geometry1 const& geometry1, Geometry2 const& geometry2, state_type& state ) { std::cout << " REJECT " << reason << std::endl; state.m_good = false; rings.resize(size_at_start); ring.clear(); operation.visited.set_rejected(); clear_visit_info(turns); int c = 0; for (int i = 0; i < turns.size(); i++) { for (int j = 0; j < 2; j++) { if (turns[i].operations[j].visited.rejected()) { c++; } } } std::cout << "BACKTRACK (" << reason << " )" << " " << c << " of " << turns.size() << " rejected" << std::endl; std::cout << geometry::wkt(geometry1) << std::endl << geometry::wkt(geometry2) << std::endl; } }; #endif // BOOST_GEOMETRY_OVERLAY_REPORT_WKT }} // namespace detail::overlay #endif // DOXYGEN_NO_DETAIL }} // namespace boost::geometry #endif // BOOST_GEOMETRY_ALGORITHMS_DETAIL_OVERLAY_BACKTRACK_CHECK_SI_HPP
Save
cmd:
run