| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/algorithms/detail/overlay/ |
| H A D | enrich_intersection_points.hpp | 70 Turns const& turns, in enrich_sort() argument
87 >(turns, for_operation, geometry1, geometry2, robust_policy, strategy)); in enrich_sort()
92 inline void enrich_assign(Operations& operations, Turns& turns) in enrich_assign() argument
110 turn_type& turn = turns[it->turn_index]; in enrich_assign()
123 && turn.cluster_id == turns[next->turn_index].cluster_id in enrich_assign()
124 && op.seg_id == turns[next->turn_index].operations[next->operation_index].seg_id) in enrich_assign()
129 turn_type const& next_turn = turns[next->turn_index]; in enrich_assign()
155 op_type const& op = turns[it->turn_index] in enrich_assign()
159 << " cl=" << turns[it->turn_index].cluster_id in enrich_assign()
160 << " meth=" << method_char(turns[it->turn_index].method) in enrich_assign()
[all …]
|
| H A D | linear_linear.hpp | 165 static inline void compute_turns(Turns& turns, in compute_turns() argument
171 turns.clear(); in compute_turns()
175 geometry::detail::relate::turns::get_turns in compute_turns()
186 >::apply(turns, linear1, linear2, interrupt_policy, strategy, robust_policy); in compute_turns()
201 sort_and_follow_turns(Turns& turns, in sort_and_follow_turns() argument
208 turns::filter_continue_turns in sort_and_follow_turns()
212 >::apply(turns); in sort_and_follow_turns()
215 std::sort(boost::begin(turns), boost::end(turns), in sort_and_follow_turns()
216 detail::turns::less_seg_fraction_other_op<>()); in sort_and_follow_turns()
219 turns::remove_duplicate_turns in sort_and_follow_turns()
[all …]
|
| H A D | handle_colocations.hpp | 86 inline less_by_fraction_and_type(Turns const& turns) in less_by_fraction_and_type()
87 : m_turns(turns) in less_by_fraction_and_type()
221 inline void handle_colocation_cluster(Turns& turns, in handle_colocation_cluster() argument
237 turn_type& ref_turn = turns[ref_toi.turn_index]; in handle_colocation_cluster()
242 turn_type& turn = turns[toi.turn_index]; in handle_colocation_cluster()
287 inline void assign_cluster_to_turns(Turns& turns, in assign_cluster_to_turns() argument
296 for (typename boost::range_iterator<Turns>::type it = turns.begin(); in assign_cluster_to_turns()
297 it != turns.end(); ++it, ++turn_index) in assign_cluster_to_turns()
331 inline void remove_clusters(Turns& turns, Clusters& clusters) in remove_clusters() argument
346 turns[turn_index].cluster_id = -1; in remove_clusters()
[all …]
|
| H A 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 …]
|
| H A 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()
72 Turns& turns, Rings& rings, in apply() argument
82 > switch_detector(geometry1, geometry2, turns, clusters, in apply()
86 reset_visits(turns); in apply()
96 > trav(geometry1, geometry2, turns, clusters, in apply()
|
| H A D | overlay.hpp | 99 inline void get_ring_turn_info(TurnInfoMap& turn_info_map, Turns const& turns, Clusters const& clus… in get_ring_turn_info() argument
111 it = boost::begin(turns); in get_ring_turn_info()
112 it != boost::end(turns); in get_ring_turn_info()
294 turn_container_type turns; in apply() local
304 >(geometry1, geometry2, strategy, robust_policy, turns, policy); in apply()
306 visitor.visit_turns(1, turns); in apply()
311 strategy, robust_policy, turns, policy, 0); in apply()
313 strategy, robust_policy, turns, policy, 1); in apply()
324 geometry::enrich_intersection_points<Reverse1, Reverse2, OverlayType>(turns, in apply()
329 visitor.visit_turns(2, turns); in apply()
[all …]
|
| H A D | get_turns.hpp | 186 Turns& turns, in apply() argument
292 std::size_t const size_before = boost::size(turns); in apply()
302 std::back_inserter(turns)); in apply()
307 std::make_pair(range::pos(turns, size_before), in apply()
308 boost::end(turns)))) in apply()
409 Turns& turns, in section_visitor()
415 , m_turns(turns) in section_visitor()
460 Turns& turns, in apply() argument
497 turns, interrupt_policy); in apply()
545 Turns& turns, in apply()
[all …]
|
| H A D | self_turn_points.hpp | 85 Turns& turns, in self_section_visitor()
91 , m_turns(turns) in self_section_visitor()
133 Turns& turns, in apply()
158 … > visitor(geometry, intersection_strategy, robust_policy, turns, interrupt_policy, source_index); in apply()
287 Turns& turns, in self_turns() argument
301 >::apply(geometry, strategy, robust_policy, turns, interrupt_policy, source_index); in self_turns()
332 Turns& turns, in self_turns() argument
347 >(geometry, strategy, robust_policy, turns, interrupt_policy, source_index); in self_turns()
|
| H A D | handle_self_turns.hpp | 43 void apply(Turns& turns, in apply()
49 it = boost::begin(turns); in apply()
50 it != boost::end(turns); in apply()
80 void apply(Turns& turns, in apply()
86 it = boost::begin(turns); in apply()
87 it != boost::end(turns); in apply()
|
| H A D | intersection_insert.hpp | 154 std::deque<turn_info> turns; in apply() local
157 robust_policy, turns, strategy); in apply()
160 it = boost::begin(turns); it != boost::end(turns); ++it) in apply()
283 static inline bool no_crossing_turns_or_empty(Turns const& turns) in no_crossing_turns_or_empty()
289 >::apply(boost::begin(turns), boost::end(turns)); in no_crossing_turns_or_empty()
293 static inline int inside_or_outside_turn(Turns const& turns) in inside_or_outside_turn()
296 for (typename Turns::const_iterator it = turns.begin(); in inside_or_outside_turn()
297 it != turns.end(); ++it) in inside_or_outside_turn()
344 std::deque<turn_info> turns; in apply() local
352 >(linestring, areal, strategy, robust_policy, turns, policy); in apply()
[all …]
|
| H A D | aggregate_operations.hpp | 168 inline bool traversable(Turns const& turns) const in traversable()
177 turn_type const& turn = turns[rwd.turn_index]; in traversable()
197 Turns const& turns, in aggregate_operations() argument
208 turn_type const& turn = turns[ranked_point.turn_index]; in aggregate_operations()
|
| H A D | follow.hpp | 414 Turns& turns, in apply() argument
436 std::sort(boost::begin(turns), boost::end(turns), sort_on_segment<turn_type>()); in apply()
444 for (turn_iterator it = boost::begin(turns); it != boost::end(turns); ++it) in apply()
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/algorithms/detail/relate/ |
| H A D | areal_areal.hpp | 226 typedef typename turns::get_turns<Geometry1, Geometry2>::turn_info turn_type; in apply()
227 std::vector<turn_type> turns; in apply() local
231 …turns::get_turns<Geometry1, Geometry2>::apply(turns, geometry1, geometry2, interrupt_policy, inter… in apply()
250 … for_each_disjoint_geometry_if<0, Geometry1>::apply(turns.begin(), turns.end(), geometry1, pred1); in apply()
256 … for_each_disjoint_geometry_if<1, Geometry2>::apply(turns.begin(), turns.end(), geometry2, pred2); in apply()
260 if ( turns.empty() ) in apply()
270 typedef turns::less<0, turns::less_op_areal_areal<0> > less; in apply()
271 std::sort(turns.begin(), turns.end(), less()); in apply()
280 analyse_each_turn(result, analyser, turns.begin(), turns.end()); in apply()
296 analyse_uncertain_rings<0>::apply(rings_analyser, turns.begin(), turns.end()); in apply()
[all …]
|
| H A D | linear_linear.hpp | 133 typedef typename turns::get_turns<Geometry1, Geometry2>::turn_info turn_type; in apply()
134 std::vector<turn_type> turns; in apply() local
138 turns::get_turns in apply()
142 … detail::get_turns::get_turn_info_type<Geometry1, Geometry2, turns::assign_policy<true> > in apply()
143 >::apply(turns, geometry1, geometry2, interrupt_policy, intersection_strategy); in apply()
150 … for_each_disjoint_geometry_if<0, Geometry1>::apply(turns.begin(), turns.end(), geometry1, pred1); in apply()
156 … for_each_disjoint_geometry_if<1, Geometry2>::apply(turns.begin(), turns.end(), geometry2, pred2); in apply()
160 if ( turns.empty() ) in apply()
173 typedef turns::less<0, turns::less_op_linear_linear<0> > less; in apply()
174 std::sort(turns.begin(), turns.end(), less()); in apply()
[all …]
|
| H A D | linear_areal.hpp | 224 : turns::get_turns<Geom1, Geom2>::turn_info
236 typename turns::get_turns<Geom1, Geom2>::turn_info
255 std::vector<turn_type> turns; in apply() local
259 …turns::get_turns<Geometry1, Geometry2>::apply(turns, geometry1, geometry2, interrupt_policy, inter… in apply()
275 … for_each_disjoint_geometry_if<0, Geometry1>::apply(turns.begin(), turns.end(), geometry1, pred1); in apply()
280 … for_each_disjoint_geometry_if<1, Geometry2>::apply(turns.begin(), turns.end(), geometry2, pred2); in apply()
284 if ( turns.empty() ) in apply()
294 sort_dispatch(turns.begin(), turns.end(), is_multi<Geometry2>()); in apply()
298 turns.begin(), turns.end(), in apply()
324 std::sort(turns.begin(), turns.end(), less_ring()); in apply()
[all …]
|
| H A D | turns.hpp | 32 namespace detail { namespace relate { namespace turns { namespace
72 static inline void apply(Turns & turns, in apply()
83 apply(turns, geometry1, geometry2, interrupt_policy, intersection_strategy); in apply()
87 static inline void apply(Turns & turns, in apply()
98 apply(turns, geometry1, geometry2, interrupt_policy, intersection_strategy, robust_policy); in apply()
102 static inline void apply(Turns & turns, in apply()
130 turns, interrupt_policy); in apply()
178 static turns::op_to_int<0,2,3,1,4,0> op_to_int_xuic; in operator ()()
179 static turns::op_to_int<0,3,2,1,4,0> op_to_int_xiuc; in operator ()()
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/algorithms/detail/turns/ |
| H A 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()
|
| H A 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()
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/algorithms/detail/is_valid/ |
| H A D | has_valid_self_turns.hpp | 75 Turns& turns, in apply() argument
92 turns, in apply()
97 BOOST_GEOMETRY_ASSERT(! boost::empty(turns)); in apply()
98 return visitor.template apply<failure_self_intersections>(turns); in apply()
110 std::vector<turn_type> turns; in apply() local
111 return apply(geometry, turns, visitor, strategy); in apply()
|
| H A D | multipolygon.hpp | 319 std::deque<typename has_valid_turns::turn_type> turns; in apply() local
321 ! has_valid_turns::apply(multipolygon, turns, visitor, strategy); in apply()
322 debug_print_turns(turns.begin(), turns.end()); in apply()
336 turns.begin(), in apply()
337 turns.end(), in apply()
350 turns.begin(), in apply()
351 turns.end(), in apply()
363 turns.begin(), in apply()
364 turns.end(), in apply()
|
| H A D | polygon.hpp | 471 std::deque<typename has_valid_turns::turn_type> turns; in apply() local
473 = ! has_valid_turns::apply(polygon, turns, visitor, strategy); in apply()
474 debug_print_turns(turns.begin(), turns.end()); in apply()
485 turns.begin(), turns.end(), in apply()
496 turns.begin(), in apply()
497 turns.end(), in apply()
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/algorithms/detail/ |
| H A D | has_self_intersections.hpp | 81 std::deque<turn_info> turns; in has_self_intersections() local
84 …urns<false, detail::overlay::assign_null_policy>(geometry, strategy, robust_policy, turns, policy); in has_self_intersections()
89 for(typename std::deque<turn_info>::const_iterator it = boost::begin(turns); in has_self_intersections()
90 it != boost::end(turns); ++it) in has_self_intersections()
|
| /OK3568_Linux_fs/kernel/arch/arm64/boot/dts/rockchip/ |
| H A D | rk3399-gru.dtsi | 52 /* EC turns on w/ lpddr_pwr_en; always on for AP */
91 /* EC turns on w/ pp5000_en; always on for AP */
109 /* EC turns on w/ ap_core_en; always on for AP */
138 /* EC turns on w/ ap_core_en; always on for AP */
167 /* EC turns on w/ ap_core_en; always on for AP */
187 /* EC turns on w/ pp900_ddrpll_en */
191 /* EC turns on w/ pp900_pll_en */
195 /* EC turns on w/ pp900_pmu_en */
199 /* EC turns on w/ pp1800_s0_en_l */
203 /* EC turns on w/ pp1800_avdd_en_l */
[all …]
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/algorithms/detail/is_simple/ |
| H A D | linear.hpp | 207 std::deque<turn_info> turns; in has_self_intersections() local
226 turns, in has_self_intersections()
229 detail::is_valid::debug_print_turns(turns.begin(), turns.end()); in has_self_intersections()
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/algorithms/detail/intersects/ |
| H A D | implementation.hpp | 64 std::deque<turn_info> turns; in apply() local
78 >::apply(geometry, strategy, robust_policy, turns, policy, 0); in apply()
|