Mercurial > hg > orthanc-stone
comparison OrthancStone/UnitTestsSources/TestStructureSet.cpp @ 1881:a05529952510
fix build of unit tests in SDL project
author | Sebastien Jodogne <s.jodogne@gmail.com> |
---|---|
date | Wed, 12 Jan 2022 10:01:25 +0100 |
parents | 93c3f9234286 |
children | 90b5e116a5f9 |
comparison
equal
deleted
inserted
replaced
1880:93c3f9234286 | 1881:a05529952510 |
---|---|
124 ╚═════╝ ╚═╝ ╚═╝╚══════╝╚═╝ ╚═════╝ ╚═════╝╚═╝ ╚═╝╚══════╝ ╚═════╝╚═╝ ╚═╝╚══════╝ | 124 ╚═════╝ ╚═╝ ╚═╝╚══════╝╚═╝ ╚═════╝ ╚═════╝╚═╝ ╚═╝╚══════╝ ╚═════╝╚═╝ ╚═╝╚══════╝ |
125 http://patorjk.com/software/taag/#p=display&f=ANSI%20Shadow&t=BASIC%20CHECKS | 125 http://patorjk.com/software/taag/#p=display&f=ANSI%20Shadow&t=BASIC%20CHECKS |
126 */ | 126 */ |
127 | 127 |
128 // (0x3006, 0x0080) seq. size | 128 // (0x3006, 0x0080) seq. size |
129 EXPECT_EQ(7, structures.size()); | 129 EXPECT_EQ(7u, structures.size()); |
130 | 130 |
131 // (0x3006, 0x0080)[i]/(0x3006, 0x00a4) | 131 // (0x3006, 0x0080)[i]/(0x3006, 0x00a4) |
132 for (size_t i = 0; i < 5; ++i) | 132 for (size_t i = 0; i < 5; ++i) |
133 { | 133 { |
134 EXPECT_EQ(std::string("ORGAN"), structures[i].interpretation_); | 134 EXPECT_EQ(std::string("ORGAN"), structures[i].interpretation_); |
284 | 284 |
285 static void CreateBasicStructure(DicomStructure2& structure) | 285 static void CreateBasicStructure(DicomStructure2& structure) |
286 { | 286 { |
287 // see https://www.dropbox.com/s/1o1vg53hsbvx4cc/test-rtstruct-polygons.jpg?dl=0 | 287 // see https://www.dropbox.com/s/1o1vg53hsbvx4cc/test-rtstruct-polygons.jpg?dl=0 |
288 EXPECT_EQ(pointsCoord1Count, pointsCoord2Count); | 288 EXPECT_EQ(pointsCoord1Count, pointsCoord2Count); |
289 EXPECT_EQ(11, pointsCoord2Count); | 289 EXPECT_EQ(11u, pointsCoord2Count); |
290 | 290 |
291 for (size_t slice = 0; slice < 3; ++slice) | 291 for (size_t slice = 0; slice < 3; ++slice) |
292 { | 292 { |
293 DicomStructurePolygon2 polygon("Oblomptu", "CLOSED_PLANAR"); | 293 DicomStructurePolygon2 polygon("Oblomptu", "CLOSED_PLANAR"); |
294 for (size_t ip = 0; ip < pointsCoord1Count; ++ip) | 294 for (size_t ip = 0; ip < pointsCoord1Count; ++ip) |
381 | 381 |
382 // compute intersection | 382 // compute intersection |
383 bool ok = structure.Project(segments, cuttingPlane); | 383 bool ok = structure.Project(segments, cuttingPlane); |
384 EXPECT_TRUE(ok); | 384 EXPECT_TRUE(ok); |
385 | 385 |
386 EXPECT_EQ(11, segments.size()); | 386 EXPECT_EQ(11u, segments.size()); |
387 for (size_t i = 0; i < segments.size(); ++i) | 387 for (size_t i = 0; i < segments.size(); ++i) |
388 { | 388 { |
389 EXPECT_LT(i, pointsCoord1Count); | 389 EXPECT_LT(i, pointsCoord1Count); |
390 EXPECT_LT(i, pointsCoord2Count); | 390 EXPECT_LT(i, pointsCoord2Count); |
391 | 391 |
469 LinearAlgebra::AssignVector(axisY, 0, 0, 1); | 469 LinearAlgebra::AssignVector(axisY, 0, 0, 1); |
470 CoordinateSystem3D cuttingPlane(origin, axisX, axisY); | 470 CoordinateSystem3D cuttingPlane(origin, axisX, axisY); |
471 | 471 |
472 // compute intersection | 472 // compute intersection |
473 ASSERT_TRUE(structure.Project(segments, cuttingPlane)); | 473 ASSERT_TRUE(structure.Project(segments, cuttingPlane)); |
474 EXPECT_EQ(24, segments.size()); | 474 EXPECT_EQ(24u, segments.size()); |
475 | 475 |
476 size_t numberOfVeryShortSegments = 0; | 476 size_t numberOfVeryShortSegments = 0; |
477 for (size_t iSegment = 0; iSegment < segments.size(); ++iSegment) | 477 for (size_t iSegment = 0; iSegment < segments.size(); ++iSegment) |
478 { | 478 { |
479 // count the NON vertical very short segments | 479 // count the NON vertical very short segments |
483 { | 483 { |
484 numberOfVeryShortSegments++; | 484 numberOfVeryShortSegments++; |
485 } | 485 } |
486 } | 486 } |
487 } | 487 } |
488 EXPECT_EQ(8, numberOfVeryShortSegments); | 488 EXPECT_EQ(8u, numberOfVeryShortSegments); |
489 } | 489 } |
490 | 490 |
491 #endif | 491 #endif |
492 // BGO_ENABLE_DICOMSTRUCTURESETLOADER2 | 492 // BGO_ENABLE_DICOMSTRUCTURESETLOADER2 |
493 | 493 |
1177 structureSet.Clear(); | 1177 structureSet.Clear(); |
1178 | 1178 |
1179 structureSet.FillStructuresFromDataset(dicom); | 1179 structureSet.FillStructuresFromDataset(dicom); |
1180 structureSet.ComputeDependentProperties(); | 1180 structureSet.ComputeDependentProperties(); |
1181 | 1181 |
1182 const std::vector<DicomStructure2>& structures = structureSet.structures_; | 1182 //const std::vector<DicomStructure2>& structures = structureSet.structures_; |
1183 } | 1183 } |
1184 | 1184 |
1185 #endif | 1185 #endif |
1186 // BGO_ENABLE_DICOMSTRUCTURESETLOADER2 | 1186 // BGO_ENABLE_DICOMSTRUCTURESETLOADER2 |