| /third_party/boost/boost/geometry/algorithms/detail/overlay/ |
| D | enrich_intersection_points.hpp | 58 discarded_indexed_turn(Turns const& turns) in discarded_indexed_turn()
59 : m_turns(turns) in discarded_indexed_turn()
86 Turns const& turns, in enrich_sort() argument
102 >(turns, geometry1, geometry2, robust_policy, strategy)); in enrich_sort()
107 inline void enrich_assign(Operations& operations, Turns& turns, in enrich_assign() argument
126 turn_type& turn = turns[it->turn_index]; in enrich_assign()
142 && turn.cluster_id == turns[next->turn_index].cluster_id in enrich_assign()
143 && op.seg_id == turns[next->turn_index].operations[next->operation_index].seg_id) in enrich_assign()
148 turn_type const& next_turn = turns[next->turn_index]; in enrich_assign()
179 op_type const& op = turns[it->turn_index] in enrich_assign()
[all …]
|
| D | linear_linear.hpp | 153 static inline void compute_turns(Turns& turns, in compute_turns() argument
159 turns.clear(); in compute_turns()
163 geometry::detail::relate::turns::get_turns in compute_turns()
173 >::apply(turns, linear1, linear2, interrupt_policy, strategy, robust_policy); in compute_turns()
188 sort_and_follow_turns(Turns& turns, in sort_and_follow_turns() argument
195 turns::filter_continue_turns in sort_and_follow_turns()
199 >::apply(turns); in sort_and_follow_turns()
202 std::sort(boost::begin(turns), boost::end(turns), in sort_and_follow_turns()
203 detail::turns::less_seg_fraction_other_op<>()); in sort_and_follow_turns()
206 turns::remove_duplicate_turns in sort_and_follow_turns()
[all …]
|
| D | handle_colocations.hpp | 89 inline less_by_fraction_and_type(Turns const& turns) in less_by_fraction_and_type()
90 : m_turns(turns) in less_by_fraction_and_type()
225 inline void handle_colocation_cluster(Turns& turns, in handle_colocation_cluster() argument
241 turn_type& ref_turn = turns[ref_toi.turn_index]; in handle_colocation_cluster()
246 turn_type& turn = turns[toi.turn_index]; in handle_colocation_cluster()
291 inline void assign_cluster_to_turns(Turns& turns, in assign_cluster_to_turns() argument
300 for (typename boost::range_iterator<Turns>::type it = turns.begin(); in assign_cluster_to_turns()
301 it != turns.end(); ++it, ++turn_index) in assign_cluster_to_turns()
335 inline void remove_clusters(Turns& turns, Clusters& clusters) in remove_clusters() argument
350 turns[turn_index].cluster_id = -1; in remove_clusters()
[all …]
|
| D | backtrack_check_si.hpp | 37 inline void clear_visit_info(Turns& turns) in clear_visit_info() argument
42 it = boost::begin(turns); in clear_visit_info()
43 it != boost::end(turns); in clear_visit_info()
124 Turns& turns, in apply() argument
135 visitor.visit_traverse_reject(turns, turn, operation, traverse_error); in apply()
155 clear_visit_info(turns); in apply()
173 Turns& turns, Operation& operation, in apply() argument
187 clear_visit_info(turns); in apply()
190 for (int i = 0; i < turns.size(); i++) in apply()
194 if (turns[i].operations[j].visited.rejected()) in apply()
[all …]
|
| D | overlay.hpp | 105 inline void get_ring_turn_info(TurnInfoMap& turn_info_map, Turns const& turns, Clusters const& clus… in get_ring_turn_info() argument
119 it = boost::begin(turns); in get_ring_turn_info()
120 it != boost::end(turns); in get_ring_turn_info()
170 check_colocation(has_blocked, turn.cluster_id, turns, clusters); in get_ring_turn_info()
301 turn_container_type turns; in apply() local
311 >(geometry1, geometry2, strategy, robust_policy, turns, policy); in apply()
313 visitor.visit_turns(1, turns); in apply()
316 if (! turns.empty() || OverlayType == overlay_dissolve) in apply()
323 strategy, robust_policy, turns, policy, 0); in apply()
328 strategy, robust_policy, turns, policy, 1); in apply()
[all …]
|
| D | handle_self_turns.hpp | 153 void apply(Turns& turns, Clusters const& /*clusters*/, in apply()
160 it = boost::begin(turns); in apply()
161 it != boost::end(turns); in apply()
186 const Turns& turns, Clusters const& clusters) in is_self_cluster()
199 if (! is_self_turn<OverlayType>(turns[*it])) in is_self_cluster()
211 void discard_clusters(Turns& turns, Clusters const& clusters, in discard_clusters()
223 && is_self_cluster(cluster_id, turns, clusters)) in discard_clusters()
227 if (! check_within<OverlayType>::apply(turns[index], in discard_clusters()
236 turns[*sit].discarded = true; in discard_clusters()
248 void apply(Turns& turns, Clusters const& clusters, in apply()
[all …]
|
| D | traverse.hpp | 43 static void reset_visits(Turns& turns) in reset_visits() argument
46 it = boost::begin(turns); in reset_visits()
47 it != boost::end(turns); in reset_visits()
73 Turns& turns, Rings& rings, in apply() argument
84 > switch_detector(geometry1, geometry2, turns, clusters, in apply()
88 reset_visits(turns); in apply()
98 > trav(geometry1, geometry2, turns, turn_info_map, clusters, in apply()
|
| D | self_turn_points.hpp | 86 Turns& turns, in self_section_visitor()
93 , m_turns(turns) in self_section_visitor()
138 Turns& turns, in apply()
166 …> visitor(geometry, intersection_strategy, robust_policy, turns, interrupt_policy, source_index, s… in apply()
305 Turns& turns, in self_turns() argument
320 >::apply(geometry, strategy, robust_policy, turns, interrupt_policy, in self_turns()
354 Turns& turns, in self_turns() argument
370 >(geometry, strategy, robust_policy, turns, interrupt_policy, in self_turns()
|
| D | get_turns.hpp | 294 Turns& turns, in apply() argument
426 std::size_t const size_before = boost::size(turns); in apply()
430 std::back_inserter(turns)); in apply()
435 std::make_pair(range::pos(turns, size_before), in apply()
436 boost::end(turns)))) in apply()
506 Turns& turns, in section_visitor()
512 , m_turns(turns) in section_visitor()
559 Turns& turns, in apply() argument
598 turns, interrupt_policy); in apply()
720 Turns& turns, in apply()
[all …]
|
| /third_party/boost/libs/geometry/test/algorithms/set_operations/ |
| D | check_turn_less.hpp | 21 inline void verify_less_for_turns(Turns turns, Less const& less) in verify_less_for_turns() argument
25 if (boost::size(turns) < 2) in verify_less_for_turns()
30 iterator_type last = --boost::end(turns); in verify_less_for_turns()
31 for (iterator_type it1 = boost::begin(turns); it1 != last; ++it1) in verify_less_for_turns()
35 for (; it2 != boost::end(turns); ++it2) in verify_less_for_turns()
83 typedef bg::detail::relate::turns::get_turns in apply()
100 turns_container turns; in apply() local
104 get_turns_type::apply(turns, geometry1, geometry2, in apply()
109 typedef bg::detail::turns::less_seg_fraction_other_op<> turn_less_type; in apply()
111 verify_less_for_turns(turns, turn_less_type()); in apply()
|
| D | test_get_turns_ll_invariance.hpp | 32 namespace bg_turns = bg_detail::turns;
70 static inline void compute_turns(Turns& turns, in compute_turns() argument
74 turns.clear(); in compute_turns()
75 bg_detail::relate::turns::get_turns in compute_turns()
85 >::apply(turns, linear1, linear2); in compute_turns()
100 typedef typename bg_detail::relate::turns::get_turns in apply()
117 turns_container turns; in apply() local
|
| /third_party/boost/boost/geometry/algorithms/detail/relate/ |
| D | areal_areal.hpp | 226 typedef typename turns::get_turns in apply()
230 std::vector<turn_type> turns; in apply() local
234 …turns::get_turns<Geometry1, Geometry2>::apply(turns, geometry1, geometry2, interrupt_policy, inter… in apply()
255 … for_each_disjoint_geometry_if<0, Geometry1>::apply(turns.begin(), turns.end(), geometry1, pred1); in apply()
261 … for_each_disjoint_geometry_if<1, Geometry2>::apply(turns.begin(), turns.end(), geometry2, pred2); in apply()
265 if ( turns.empty() ) in apply()
275 typedef turns::less<0, turns::less_op_areal_areal<0>, cs_tag> less; in apply()
276 std::sort(turns.begin(), turns.end(), less()); in apply()
285 analyse_each_turn(result, analyser, turns.begin(), turns.end(), in apply()
302 analyse_uncertain_rings<0>::apply(rings_analyser, turns.begin(), turns.end()); in apply()
[all …]
|
| D | linear_linear.hpp | 138 typedef typename turns::get_turns in apply()
142 std::vector<turn_type> turns; in apply() local
146 turns::get_turns in apply()
150 … detail::get_turns::get_turn_info_type<Geometry1, Geometry2, turns::assign_policy<true> > in apply()
151 >::apply(turns, geometry1, geometry2, interrupt_policy, intersection_strategy); in apply()
163 … for_each_disjoint_geometry_if<0, Geometry1>::apply(turns.begin(), turns.end(), geometry1, pred1); in apply()
174 … for_each_disjoint_geometry_if<1, Geometry2>::apply(turns.begin(), turns.end(), geometry2, pred2); in apply()
178 if ( turns.empty() ) in apply()
191 typedef turns::less<0, turns::less_op_linear_linear<0>, cs_tag> less; in apply()
192 std::sort(turns.begin(), turns.end(), less()); in apply()
[all …]
|
| D | linear_areal.hpp | 224 : turns::get_turns<Geom1, Geom2>::template turn_info_type<Strategy>::type
236 typename turns::get_turns<Geom1, Geom2>::template turn_info_type<Strategy>::type
255 std::vector<turn_type> turns; in apply() local
259 …turns::get_turns<Geometry1, Geometry2>::apply(turns, geometry1, geometry2, interrupt_policy, inter… in apply()
287 … for_each_disjoint_geometry_if<0, Geometry1>::apply(turns.begin(), turns.end(), geometry1, pred1); in apply()
292 … for_each_disjoint_geometry_if<1, Geometry2>::apply(turns.begin(), turns.end(), geometry2, pred2); in apply()
296 if ( turns.empty() ) in apply()
306 sort_dispatch<cs_tag>(turns.begin(), turns.end(), is_multi<Geometry2>()); in apply()
310 turns.begin(), turns.end(), in apply()
336 std::sort(turns.begin(), turns.end(), less_ring()); in apply()
[all …]
|
| D | turns.hpp | 35 namespace detail { namespace relate { namespace turns { namespace
89 static inline void apply(Turns & turns, in apply()
100 apply(turns, geometry1, geometry2, interrupt_policy, intersection_strategy); in apply()
104 static inline void apply(Turns & turns, in apply()
116 apply(turns, geometry1, geometry2, interrupt_policy, intersection_strategy, robust_policy); in apply()
120 static inline void apply(Turns & turns, in apply()
148 turns, interrupt_policy); in apply()
196 static turns::op_to_int<0,2,3,1,4,0> op_to_int_xuic; in operator ()()
197 static turns::op_to_int<0,3,2,1,4,0> op_to_int_xiuc; in operator ()()
|
| /third_party/boost/libs/geometry/test/algorithms/overlay/ |
| D | overlay.cpp | 57 void print(char const* header, Turns const& turns, int turn_index) in print()
60 stream(turns, turns[turn_index], turns[turn_index].operations[0], header, style); in print()
64 void print(char const* header, Turns const& turns, int turn_index, int op_index) in print()
67 stream(turns, turns[turn_index], turns[turn_index].operations[op_index], header, style); in print()
71 void visit_turns(int phase, Turns const& turns) in visit_turns()
75 BOOST_FOREACH(turn_type const& turn, turns) in visit_turns()
100 std::string stream_turn_index(Turns const& turns, Turn const& turn, Operation const& op) in stream_turn_index()
111 for (typename Turns::const_iterator it = turns.begin(); in stream_turn_index()
112 it != turns.end(); ++it, ++index) in stream_turn_index()
128 void visit_clusters(Clusters const& clusters, Turns const& turns) in visit_clusters()
[all …]
|
| D | test_get_turns.hpp | 107 turns_printer(Turns const& t) : turns(t) {} in turns_printer()
111 std::vector<std::string> vec(tp.turns.size()); in operator <<()
112 std::transform(tp.turns.begin(), tp.turns.end(), vec.begin(), to_string()); in operator <<()
143 Turns const& turns; member
149 turns_printer(expected_pusher const& t) : turns(t) {} in turns_printer()
153 std::vector<std::string> vec(tp.turns.size()); in operator <<()
154 std::copy(tp.turns.begin(), tp.turns.end(), vec.begin()); in operator <<()
160 expected_pusher const& turns; member
218 std::vector<turn_info> turns = detected; in check_geometry_range() local
224 it = std::find_if(turns.begin(), turns.end(), equal_turn(*sit)); in check_geometry_range()
[all …]
|
| D | self_intersection_points.cpp | 65 std::vector<turn_info> turns; in test_self_intersection_points() local
74 >(geometry, strategy, rescale_policy, turns, policy); in test_self_intersection_points()
80 BOOST_FOREACH(turn_info const& turn, turns) in test_self_intersection_points()
85 std::size_t n = boost::size(turns); in test_self_intersection_points()
138 BOOST_FOREACH(turn_info const& turn, turns) in test_self_intersection_points()
|
| /third_party/boost/boost/geometry/algorithms/detail/turns/ |
| D | remove_duplicate_turns.hpp | 20 namespace detail { namespace turns namespace
47 static inline void apply(Turns& turns) in apply() argument
49 turns.erase( std::unique(turns.begin(), turns.end(), in apply()
51 turns.end() in apply()
|
| D | filter_continue_turns.hpp | 20 namespace detail { namespace turns namespace
62 static inline void apply(Turns& turns) in apply() argument
64 turns.erase( std::remove_if(turns.begin(), turns.end(), in apply()
66 turns.end() in apply()
|
| D | print_turns.hpp | 27 namespace detail { namespace turns namespace
89 Turns const& turns) in print_turns() argument
94 std::for_each(boost::begin(turns), boost::end(turns), turn_printer(std::cout)); in print_turns()
|
| /third_party/boost/libs/geometry/test/ |
| D | to_svg.hpp | 32 inline void turns_to_svg(Turns const& turns, Mapper & mapper, bool /*enrich*/ = false) in turns_to_svg() argument
45 BOOST_FOREACH(turn_info const& turn, turns) in turns_to_svg()
295 Turns turns; in to_svg() local
303 >::apply(g, bg::detail::no_rescale_policy(), turns, interrupt_policy); in to_svg()
305 turns_to_svg<G>(turns, mapper); in to_svg()
329 typedef typename bg::detail::relate::turns::get_turns<G1, G2>::turn_info turn_info; in to_svg()
339 Turns turns; in to_svg() local
347 >(g1, g2, bg::detail::no_rescale_policy(), turns, interrupt_policy); in to_svg()
356 bg::detail::relate::turns::get_turns in to_svg()
359 >::apply(turns, g1, g2); in to_svg()
[all …]
|
| /third_party/boost/boost/geometry/algorithms/detail/is_valid/ |
| D | has_valid_self_turns.hpp | 76 Turns& turns, in apply() argument
94 turns, in apply()
100 BOOST_GEOMETRY_ASSERT(! boost::empty(turns)); in apply()
101 return visitor.template apply<failure_self_intersections>(turns); in apply()
113 std::vector<turn_type> turns; in apply() local
114 return apply(geometry, turns, visitor, strategy); in apply()
|
| D | multipolygon.hpp | 322 std::deque<typename has_valid_turns::turn_type> turns; in apply() local
324 ! has_valid_turns::apply(multipolygon, turns, visitor, strategy); in apply()
325 debug_print_turns(turns.begin(), turns.end()); in apply()
339 turns.begin(), in apply()
340 turns.end(), in apply()
353 turns.begin(), in apply()
354 turns.end(), in apply()
366 turns.begin(), in apply()
367 turns.end(), in apply()
|
| D | polygon.hpp | 484 std::deque<typename has_valid_turns::turn_type> turns; in apply() local
486 = ! has_valid_turns::apply(polygon, turns, visitor, strategy); in apply()
487 debug_print_turns(turns.begin(), turns.end()); in apply()
498 turns.begin(), turns.end(), in apply()
509 turns.begin(), in apply()
510 turns.end(), in apply()
|