- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/unittests/tesselationunittest.cpp
r920c70 rd74077 16 16 17 17 #include "defs.hpp" 18 #include "tesselation.hpp" 18 #include "TesselPoint.hpp" 19 #include "BoundaryLineSet.hpp" 20 #include "BoundaryTriangleSet.hpp" 21 #include "CandidateForTesselation.hpp" 19 22 #include "tesselationunittest.hpp" 20 23 … … 36 39 class TesselPoint *Walker; 37 40 Walker = new TesselPoint; 38 Walker-> node = new Vector(1., 0., -1.);41 Walker->setPosition(Vector(1., 0., -1.)); 39 42 Walker->setName("1"); 40 43 Walker->nr = 1; 41 44 Corners.push_back(Walker); 42 45 Walker = new TesselPoint; 43 Walker-> node = new Vector(-1., 1., -1.);46 Walker->setPosition(Vector(-1., 1., -1.)); 44 47 Walker->setName("2"); 45 48 Walker->nr = 2; 46 49 Corners.push_back(Walker); 47 50 Walker = new TesselPoint; 48 Walker-> node = new Vector(-1., -1., -1.);51 Walker->setPosition(Vector(-1., -1., -1.)); 49 52 Walker->setName("3"); 50 53 Walker->nr = 3; 51 54 Corners.push_back(Walker); 52 55 Walker = new TesselPoint; 53 Walker-> node = new Vector(-1., 0., 1.);56 Walker->setPosition(Vector(-1., 0., 1.)); 54 57 Walker->setName("4"); 55 58 Walker->nr = 4; … … 101 104 delete(LinkedList); 102 105 delete(TesselStruct); 103 for (LinkedCell::LinkedNodes::iterator Runner = Corners.begin(); Runner != Corners.end(); Runner++) { 104 delete((*Runner)->node); 106 for (LinkedCell::LinkedNodes::iterator Runner = Corners.begin(); Runner != Corners.end(); Runner++) 105 107 delete(*Runner); 106 }107 108 Corners.clear(); 108 109 logger::purgeInstance();
Note:
See TracChangeset
for help on using the changeset viewer.