------------------------------------------------------------------------------
| 427 | |
| 428 | //------------------------------------------------------------------------------ |
| 429 | int vtkExtentSplitter::IntersectExtents(const int* extent1, const int* extent2, int* result) |
| 430 | { |
| 431 | if ((extent1[0] > extent2[1]) || (extent1[2] > extent2[3]) || (extent1[4] > extent2[5]) || |
| 432 | (extent1[1] < extent2[0]) || (extent1[3] < extent2[2]) || (extent1[5] < extent2[4])) |
| 433 | { |
| 434 | // No intersection of extents. |
| 435 | return 0; |
| 436 | } |
| 437 | |
| 438 | // Get the intersection of the extents. |
| 439 | result[0] = std::max(extent1[0], extent2[0]); |
| 440 | result[1] = std::min(extent1[1], extent2[1]); |
| 441 | result[2] = std::max(extent1[2], extent2[2]); |
| 442 | result[3] = std::min(extent1[3], extent2[3]); |
| 443 | result[4] = std::max(extent1[4], extent2[4]); |
| 444 | result[5] = std::min(extent1[5], extent2[5]); |
| 445 | |
| 446 | return 1; |
| 447 | } |
| 448 | |
| 449 | //------------------------------------------------------------------------------ |
| 450 | int vtkExtentSplitter::Min(int a, int b) |
no test coverage detected