Home
last modified time | relevance | path

Searched refs:bound2 (Results 1 – 3 of 3) sorted by relevance

/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/wagyu/0.4.3/include/mapbox/geometry/wagyu/
H A Dintersect.hpp21 bound_ptr<T> bound2; member
25 : bound1(std::move(n.bound1)), bound2(std::move(n.bound2)), pt(std::move(n.pt)) { in intersect_node()
30 bound2 = std::move(n.bound2); in operator =()
38 : bound1(bound1_), bound2(bound2_), pt(pt_) { in intersect_node()
54 out << *e.bound2 << std::endl; in operator <<()
H A Dactive_bound_list.hpp88 bound<T> const& bound2; member
90 bound_insert_location(bound<T> const& b) : bound2(b) { in bound_insert_location()
95 if (values_are_equal(bound2.current_x, bound1.current_x)) { in operator ()()
96 if (bound2.current_edge->top.y > bound1.current_edge->top.y) { in operator ()()
97 return static_cast<double>(bound2.current_edge->top.x) < in operator ()()
98 get_current_x(*(bound1.current_edge), bound2.current_edge->top.y); in operator ()()
101 get_current_x(*(bound2.current_edge), bound1.current_edge->top.y); in operator ()()
104 return bound2.current_x < bound1.current_x; in operator ()()
H A Dintersect_util.hpp23 return (node2.bound1->winding_count2 + node2.bound2->winding_count2) > in operator ()()
24 (node1.bound1->winding_count2 + node1.bound2->winding_count2); in operator ()()
280 return (next == inode.bound2) || (next == inode.bound1); in bounds_adjacent()
288 find_first_bound(intersect_node<T> const& inode) : b1(inode.bound1), b2(inode.bound2) { in find_first_bound()
326 intersect_bounds(*(node_itr->bound1), *(node_itr->bound2), pt, cliptype, subject_fill_type, in process_intersect_list()