| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/wagyu/0.4.3/include/mapbox/geometry/wagyu/ |
| H A D | process_maxima.hpp | 26 active_bound_list<T>& active_bounds) { in do_maxima() argument
30 while (bnd_next != active_bounds.end() && bnd_next != bndMaxPair) { in do_maxima()
37 subject_fill_type, clip_fill_type, manager, active_bounds); in do_maxima()
45 active_bounds); in do_maxima()
59 active_bound_list<T>& active_bounds, in process_edges_at_top_of_scanbeam() argument
68 for (auto bnd = active_bounds.begin(); bnd != active_bounds.end();) { in process_edges_at_top_of_scanbeam()
79 auto bnd_max_pair = get_maxima_pair(bnd, active_bounds); in process_edges_at_top_of_scanbeam()
80 is_maxima_edge = ((bnd_max_pair == active_bounds.end() || in process_edges_at_top_of_scanbeam()
85 manager, active_bounds); in process_edges_at_top_of_scanbeam()
104 active_bounds.erase(std::remove(active_bounds.begin(), active_bounds.end(), nullptr), in process_edges_at_top_of_scanbeam()
[all …]
|
| H A D | snap_rounding.hpp | 39 active_bound_list<T>& active_bounds, in process_hot_pixel_intersections() argument
41 if (active_bounds.empty()) { in process_hot_pixel_intersections()
44 update_current_x(active_bounds, top_y); in process_hot_pixel_intersections()
45 bubble_sort(active_bounds.begin(), active_bounds.end(), intersection_compare<T>(), in process_hot_pixel_intersections()
52 active_bound_list<T>& active_bounds, in horizontals_at_top_scanbeam() argument
60 while (bnd_next != active_bounds.end() && in horizontals_at_top_scanbeam()
74 if (bnd_curr != active_bounds.begin()) { in horizontals_at_top_scanbeam()
76 while (bnd_curr != active_bounds.begin() && in horizontals_at_top_scanbeam()
85 if (bnd_curr != active_bounds.begin()) { in horizontals_at_top_scanbeam()
97 active_bound_list<T>& active_bounds, in process_hot_pixel_edges_at_top_of_scanbeam() argument
[all …]
|
| H A D | process_horizontal.hpp | 19 active_bound_list<T>& active_bounds, in process_horizontal_left_to_right() argument
28 auto bound_max_pair = active_bounds.end(); in process_horizontal_left_to_right()
30 bound_max_pair = get_maxima_pair<T>(horz_bound, active_bounds); in process_horizontal_left_to_right()
42 while (bnd != active_bounds.end()) { in process_horizontal_left_to_right()
83 (*horz_bound)->current_edge->top, rings, active_bounds); in process_horizontal_left_to_right()
95 cliptype, subject_fill_type, clip_fill_type, rings, active_bounds); in process_horizontal_left_to_right()
128 active_bound_list<T>& active_bounds, in process_horizontal_right_to_left() argument
136 auto bound_max_pair = active_bounds.rend(); in process_horizontal_right_to_left()
139 active_bound_list_rev_itr<T>(get_maxima_pair<T>(horz_bound_fwd, active_bounds)); in process_horizontal_right_to_left()
153 while (bnd != active_bounds.rend()) { in process_horizontal_right_to_left()
[all …]
|
| H A D | intersect_util.hpp | 107 void build_intersect_list(active_bound_list<T>& active_bounds, intersect_list<T>& intersects) { in build_intersect_list() argument
108 bubble_sort(active_bounds.begin(), active_bounds.end(), intersection_compare<T>(), in build_intersect_list()
120 active_bound_list<T>& active_bounds) { in intersect_bounds() argument
198 add_local_maximum_point(b1, b2, pt, rings, active_bounds); in intersect_bounds()
200 add_point(b1, active_bounds, pt, rings); in intersect_bounds()
201 add_point(b2, active_bounds, pt, rings); in intersect_bounds()
207 add_point(b1, active_bounds, pt, rings); in intersect_bounds()
215 add_point(b2, active_bounds, pt, rings); in intersect_bounds()
249 add_local_minimum_point(b1, b2, active_bounds, pt, rings); in intersect_bounds()
254 add_local_minimum_point(b1, b2, active_bounds, pt, rings); in intersect_bounds()
[all …]
|
| H A D | active_bound_list.hpp | 111 insert_bound_into_ABL(bound<T>& left, bound<T>& right, active_bound_list<T>& active_bounds) { in insert_bound_into_ABL() argument
114 std::find_if(active_bounds.begin(), active_bounds.end(), bound_insert_location<T>(left)); in insert_bound_into_ABL()
115 return active_bounds.insert(itr, { &left, &right }); in insert_bound_into_ABL()
163 active_bound_list<T>& active_bounds) { in get_maxima_pair() argument
165 return std::find(active_bounds.begin(), active_bounds.end(), maximum); in get_maxima_pair()
170 active_bound_list<T>& active_bounds, in set_winding_count() argument
175 if (rev_bnd_itr == active_bounds.rend()) { in set_winding_count()
183 while (rev_bnd_itr != active_bounds.rend() && in set_winding_count()
187 if (rev_bnd_itr == active_bounds.rend()) { in set_winding_count()
338 active_bound_list<T>& active_bounds, in insert_lm_left_and_right_bound() argument
[all …]
|
| H A D | vatti.hpp | 27 active_bound_list<T> active_bounds; in execute_vatti() local
45 process_intersections(scanline_y, active_bounds, cliptype, subject_fill_type, in execute_vatti()
53 process_edges_at_top_of_scanbeam(scanline_y, active_bounds, scanbeam, minima_sorted, in execute_vatti()
60 insert_local_minima_into_ABL(scanline_y, minima_sorted, current_lm, active_bounds, manager, in execute_vatti()
|
| H A D | ring_util.hpp | 32 active_bound_list<T> const& active_bounds, in set_hole_state() argument
34 auto bnd_itr = std::find(active_bounds.rbegin(), active_bounds.rend(), &bnd); in set_hole_state()
38 while (bnd_itr != active_bounds.rend()) { in set_hole_state()
310 active_bound_list<T>& active_bounds, in add_first_point() argument
317 set_hole_state(bnd, active_bounds, rings); in add_first_point()
346 active_bound_list<T>& active_bounds, in add_point() argument
350 add_first_point(bnd, active_bounds, pt, rings); in add_point()
359 active_bound_list<T>& active_bounds, in add_local_minimum_point() argument
363 add_point(b1, active_bounds, pt, rings); in add_local_minimum_point()
369 add_point(b2, active_bounds, pt, rings); in add_local_minimum_point()
[all …]
|