Home
last modified time | relevance | path

Searched refs:sorted_index (Results 1 – 4 of 4) sorted by relevance

/third_party/boost/boost/polygon/detail/
Dvoronoi_predicates.hpp268 if (left_site.sorted_index() == right_site.sorted_index()) { in ss()
406 if (site1.sorted_index() == site2.sorted_index()) { in operator ()()
409 } else if (site1.sorted_index() < site2.sorted_index()) { in operator ()()
426 if (node.left_site().sorted_index() > node.right_site().sorted_index()) { in get_comparison_site()
440 if (node.left_site().sorted_index() == in get_comparison_y()
441 node.right_site().sorted_index()) { in get_comparison_y()
444 if (node.left_site().sorted_index() > node.right_site().sorted_index()) { in get_comparison_y()
502 if (site2.sorted_index() == site3.sorted_index()) { in pss()
520 return (site1.sorted_index() != site2.sorted_index()) && in sss()
521 (site2.sorted_index() != site3.sorted_index()); in sss()
Dvoronoi_structures.hpp165 std::size_t sorted_index() const { in sorted_index() function in boost::polygon::detail::site_event
169 site_event& sorted_index(std::size_t index) { in sorted_index() function in boost::polygon::detail::site_event
/third_party/boost/boost/polygon/
Dvoronoi_diagram.hpp350 std::size_t site_index1 = site1.sorted_index(); in _insert_new_edge()
351 std::size_t site_index2 = site2.sorted_index(); in _insert_new_edge()
416 new_edge1.cell(&cells_[site1.sorted_index()]); in _insert_new_edge()
421 new_edge2.cell(&cells_[site3.sorted_index()]); in _insert_new_edge()
Dvoronoi_builder.hpp181 site_events_[cur].sorted_index(cur); in init_sites_queue()