- Timestamp:
- Apr 27, 2010, 2:25:42 PM (16 years ago)
- Children:
- 90c4460
- Parents:
- 1561e2 (diff), 2bc713 (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the(diff)links above to see all the changes relative to each parent. - File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
molecuilder/src/unittests/tesselation_insideoutsideunittest.cpp
r1561e2 r075729 98 98 while ((!TesselStruct->OpenLines.empty()) && (OneLoopWithoutSuccessFlag)) { 99 99 // 2a. fill all new OpenLines 100 Log() << Verbose(1) << "There are " << TesselStruct->OpenLines.size() << " open lines to scan for candidates:" << endl;100 DoLog(1) && (Log() << Verbose(1) << "There are " << TesselStruct->OpenLines.size() << " open lines to scan for candidates:" << endl); 101 101 for (CandidateMap::iterator Runner = TesselStruct->OpenLines.begin(); Runner != TesselStruct->OpenLines.end(); Runner++) 102 Log() << Verbose(2) << *(Runner->second) << endl;102 DoLog(2) && (Log() << Verbose(2) << *(Runner->second) << endl); 103 103 104 104 for (CandidateMap::iterator Runner = TesselStruct->OpenLines.begin(); Runner != TesselStruct->OpenLines.end(); Runner++) { … … 106 106 if (baseline->pointlist.empty()) { 107 107 T = (((baseline->BaseLine->triangles.begin()))->second); 108 Log() << Verbose(1) << "Finding best candidate for open line " << *baseline->BaseLine << " of triangle " << *T << endl;108 DoLog(1) && (Log() << Verbose(1) << "Finding best candidate for open line " << *baseline->BaseLine << " of triangle " << *T << endl); 109 109 TesselationFailFlag = TesselStruct->FindNextSuitableTriangle(*baseline, *T, SPHERERADIUS, LinkedList); //the line is there, so there is a triangle, but only one. 110 110 } … … 113 113 // 2b. search for smallest ShortestAngle among all candidates 114 114 double ShortestAngle = 4.*M_PI; 115 Log() << Verbose(1) << "There are " << TesselStruct->OpenLines.size() << " open lines to scan for the best candidates:" << endl;115 DoLog(1) && (Log() << Verbose(1) << "There are " << TesselStruct->OpenLines.size() << " open lines to scan for the best candidates:" << endl); 116 116 for (CandidateMap::iterator Runner = TesselStruct->OpenLines.begin(); Runner != TesselStruct->OpenLines.end(); Runner++) 117 Log() << Verbose(2) << *(Runner->second) << endl;117 DoLog(2) && (Log() << Verbose(2) << *(Runner->second) << endl); 118 118 119 119 for (CandidateMap::iterator Runner = TesselStruct->OpenLines.begin(); Runner != TesselStruct->OpenLines.end(); Runner++) { … … 127 127 OneLoopWithoutSuccessFlag = false; 128 128 else { 129 TesselStruct->AddCandidate Triangle(*baseline);129 TesselStruct->AddCandidatePolygon(*baseline, SPHERERADIUS, LinkedList); 130 130 } 131 131 } … … 137 137 delete(LinkedList); 138 138 delete(TesselStruct); 139 for (Linked Nodes::iterator Runner = Corners.begin(); Runner != Corners.end(); Runner++) {139 for (LinkedCell::LinkedNodes::iterator Runner = Corners.begin(); Runner != Corners.end(); Runner++) { 140 140 delete((*Runner)->node); 141 141 delete(*Runner);
Note:
See TracChangeset
for help on using the changeset viewer.
