Home
last modified time | relevance | path

Searched refs:swap_round (Results 1 – 8 of 8) sorted by relevance

/dports/math/vtk9/VTK-9.1.0/ThirdParty/vtkm/vtkvtkm/vtk-m/vtkm/thirdparty/diy/vtkmdiy/include/vtkmdiy/detail/algorithms/
H A Dkdtree.hpp96 bool swap_round(int round) const { return rounds_[round].first; } in swap_round() function
103 else if (swap_round(round) && sub_round(round) < 0) // link round in active()
105 else if (swap_round(round)) in active()
115 else if (swap_round(round) && sub_round(round) < 0) // link round in incoming()
117 else if (swap_round(round)) in incoming()
134 else if (swap_round(round) && sub_round(round) < 0) // link round in outgoing()
136 else if (swap_round(round)) in outgoing()
181 …else if (partners.swap_round(srp.round()) && partners.sub_round(srp.round()) < 0) // link ro… in operator ()()
186 else if (partners.swap_round(srp.round())) in operator ()()
H A Dkdtree-sampling.hpp78 …else if (partners.swap_round(srp.round()) && partners.sub_round(srp.round()) < 0) // link ro… in operator ()()
83 else if (partners.swap_round(srp.round())) in operator ()()
/dports/math/vtk8/VTK-8.2.0/ThirdParty/vtkm/vtk-m/vtkm/thirdparty/diy/vtkmdiy/include/vtkmdiy/detail/algorithms/
H A Dkdtree.hpp96 bool swap_round(int round) const { return rounds_[round].first; } in swap_round() function
103 else if (swap_round(round) && sub_round(round) < 0) // link round in active()
105 else if (swap_round(round)) in active()
115 else if (swap_round(round) && sub_round(round) < 0) // link round in incoming()
117 else if (swap_round(round)) in incoming()
134 else if (swap_round(round) && sub_round(round) < 0) // link round in outgoing()
136 else if (swap_round(round)) in outgoing()
181 …else if (partners.swap_round(srp.round()) && partners.sub_round(srp.round()) < 0) // link ro… in operator ()()
186 else if (partners.swap_round(srp.round())) in operator ()()
H A Dkdtree-sampling.hpp78 …else if (partners.swap_round(srp.round()) && partners.sub_round(srp.round()) < 0) // link ro… in operator ()()
83 else if (partners.swap_round(srp.round())) in operator ()()
/dports/math/vtk8/VTK-8.2.0/ThirdParty/diy2/vtkdiy2/include/vtkdiy2/detail/algorithms/
H A Dkdtree.hpp96 bool swap_round(int round) const { return rounds_[round].first; } in swap_round() function
103 else if (swap_round(round) && sub_round(round) < 0) // link round in active()
105 else if (swap_round(round)) in active()
115 else if (swap_round(round) && sub_round(round) < 0) // link round in incoming()
117 else if (swap_round(round)) in incoming()
134 else if (swap_round(round) && sub_round(round) < 0) // link round in outgoing()
136 else if (swap_round(round)) in outgoing()
181 …else if (partners.swap_round(srp.round()) && partners.sub_round(srp.round()) < 0) // link ro… in operator ()()
186 else if (partners.swap_round(srp.round())) in operator ()()
H A Dkdtree-sampling.hpp78 …else if (partners.swap_round(srp.round()) && partners.sub_round(srp.round()) < 0) // link ro… in operator ()()
83 else if (partners.swap_round(srp.round())) in operator ()()
/dports/math/vtk9/VTK-9.1.0/ThirdParty/diy2/vtkdiy2/include/vtkdiy2/detail/algorithms/
H A Dkdtree.hpp96 bool swap_round(int round) const { return rounds_[round].first; } in swap_round() function
103 else if (swap_round(round) && sub_round(round) < 0) // link round in active()
105 else if (swap_round(round)) in active()
115 else if (swap_round(round) && sub_round(round) < 0) // link round in incoming()
117 else if (swap_round(round)) in incoming()
134 else if (swap_round(round) && sub_round(round) < 0) // link round in outgoing()
136 else if (swap_round(round)) in outgoing()
181 …else if (partners.swap_round(srp.round()) && partners.sub_round(srp.round()) < 0) // link ro… in operator ()()
186 else if (partners.swap_round(srp.round())) in operator ()()
H A Dkdtree-sampling.hpp78 …else if (partners.swap_round(srp.round()) && partners.sub_round(srp.round()) < 0) // link ro… in operator ()()
83 else if (partners.swap_round(srp.round())) in operator ()()