| 98 | |
| 99 | template <typename PointType> |
| 100 | BoxPointType KD_TREE<PointType>::tree_range() |
| 101 | { |
| 102 | BoxPointType range; |
| 103 | if (Rebuild_Ptr == nullptr || *Rebuild_Ptr != Root_Node) |
| 104 | { |
| 105 | if (Root_Node != nullptr) |
| 106 | { |
| 107 | range.vertex_min[0] = Root_Node->node_range_x[0]; |
| 108 | range.vertex_min[1] = Root_Node->node_range_y[0]; |
| 109 | range.vertex_min[2] = Root_Node->node_range_z[0]; |
| 110 | range.vertex_max[0] = Root_Node->node_range_x[1]; |
| 111 | range.vertex_max[1] = Root_Node->node_range_y[1]; |
| 112 | range.vertex_max[2] = Root_Node->node_range_z[1]; |
| 113 | } |
| 114 | else |
| 115 | { |
| 116 | memset(&range, 0, sizeof(range)); |
| 117 | } |
| 118 | } |
| 119 | else |
| 120 | { |
| 121 | if (!pthread_mutex_trylock(&working_flag_mutex)) |
| 122 | { |
| 123 | range.vertex_min[0] = Root_Node->node_range_x[0]; |
| 124 | range.vertex_min[1] = Root_Node->node_range_y[0]; |
| 125 | range.vertex_min[2] = Root_Node->node_range_z[0]; |
| 126 | range.vertex_max[0] = Root_Node->node_range_x[1]; |
| 127 | range.vertex_max[1] = Root_Node->node_range_y[1]; |
| 128 | range.vertex_max[2] = Root_Node->node_range_z[1]; |
| 129 | pthread_mutex_unlock(&working_flag_mutex); |
| 130 | } |
| 131 | else |
| 132 | { |
| 133 | memset(&range, 0, sizeof(range)); |
| 134 | } |
| 135 | } |
| 136 | return range; |
| 137 | } |
| 138 | |
| 139 | template <typename PointType> |
| 140 | int KD_TREE<PointType>::validnum() |
nothing calls this directly
no outgoing calls
no test coverage detected