| 365 | } |
| 366 | |
| 367 | bool mitk::Equal(vtkPolyData &leftHandSide, vtkPolyData &rightHandSide, mitk::ScalarType eps, bool verbose) |
| 368 | { |
| 369 | bool noDifferenceFound = true; |
| 370 | |
| 371 | if (!mitk::Equal(leftHandSide.GetNumberOfCells(), rightHandSide.GetNumberOfCells(), eps, verbose)) |
| 372 | { |
| 373 | if (verbose) |
| 374 | MITK_INFO << "[Equal( vtkPolyData*, vtkPolyData* )] Number of cells not equal"; |
| 375 | noDifferenceFound = false; |
| 376 | } |
| 377 | |
| 378 | if (!mitk::Equal(leftHandSide.GetNumberOfVerts(), rightHandSide.GetNumberOfVerts(), eps, verbose)) |
| 379 | { |
| 380 | if (verbose) |
| 381 | MITK_INFO << "[Equal( vtkPolyData*, vtkPolyData* )] Number of vertices not equal"; |
| 382 | noDifferenceFound = false; |
| 383 | } |
| 384 | |
| 385 | if (!mitk::Equal(leftHandSide.GetNumberOfLines(), rightHandSide.GetNumberOfLines(), eps, verbose)) |
| 386 | { |
| 387 | if (verbose) |
| 388 | MITK_INFO << "[Equal( vtkPolyData*, vtkPolyData* )] Number of lines not equal"; |
| 389 | noDifferenceFound = false; |
| 390 | } |
| 391 | |
| 392 | if (!mitk::Equal(leftHandSide.GetNumberOfPolys(), rightHandSide.GetNumberOfPolys(), eps, verbose)) |
| 393 | { |
| 394 | if (verbose) |
| 395 | MITK_INFO << "[Equal( vtkPolyData*, vtkPolyData* )] Number of polys not equal"; |
| 396 | noDifferenceFound = false; |
| 397 | } |
| 398 | |
| 399 | if (!mitk::Equal(leftHandSide.GetNumberOfStrips(), rightHandSide.GetNumberOfStrips(), eps, verbose)) |
| 400 | { |
| 401 | if (verbose) |
| 402 | MITK_INFO << "[Equal( vtkPolyData*, vtkPolyData* )] Number of strips not equal"; |
| 403 | noDifferenceFound = false; |
| 404 | } |
| 405 | |
| 406 | { |
| 407 | unsigned int numberOfPointsRight = rightHandSide.GetPoints()->GetNumberOfPoints(); |
| 408 | unsigned int numberOfPointsLeft = leftHandSide.GetPoints()->GetNumberOfPoints(); |
| 409 | if (!mitk::Equal(numberOfPointsLeft, numberOfPointsRight, eps, verbose)) |
| 410 | { |
| 411 | if (verbose) |
| 412 | MITK_INFO << "[Equal( vtkPolyData*, vtkPolyData* )] Number of points not equal"; |
| 413 | noDifferenceFound = false; |
| 414 | } |
| 415 | else |
| 416 | { |
| 417 | for (unsigned int i(0); i < numberOfPointsRight; i++) |
| 418 | { |
| 419 | bool pointFound = false; |
| 420 | double pointOne[3]; |
| 421 | rightHandSide.GetPoints()->GetPoint(i, pointOne); |
| 422 | |
| 423 | for (unsigned int j(0); j < numberOfPointsLeft; j++) |
| 424 | { |
nothing calls this directly
no test coverage detected