Changeset 075729 for molecuilder/src/analysis_correlation.cpp
- 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
-
molecuilder/src/analysis_correlation.cpp (modified) (22 diffs)
Legend:
- Unmodified
- Added
- Removed
-
molecuilder/src/analysis_correlation.cpp
r1561e2 r075729 15 15 #include "tesselation.hpp" 16 16 #include "tesselationhelpers.hpp" 17 #include "triangleintersectionlist.hpp" 17 18 #include "vector.hpp" 18 19 #include "verbose.hpp" 20 #include "World.hpp" 19 21 20 22 … … 34 36 35 37 if (molecules->ListOfMolecules.empty()) { 36 eLog() << Verbose(1) <<"No molecule given." << endl;38 DoeLog(1) && (eLog()<< Verbose(1) <<"No molecule given." << endl); 37 39 return outmap; 38 40 } … … 40 42 for (MoleculeList::const_iterator MolWalker = molecules->ListOfMolecules.begin(); MolWalker != molecules->ListOfMolecules.end(); MolWalker++) 41 43 if ((*MolWalker)->ActiveFlag) { 42 eLog() << Verbose(2) << "Current molecule is " << *MolWalker << "." << endl;43 atom *Walker = (*MolWalker)->start; 44 while (Walker->next != (*MolWalker)->end) { 45 Walker = Walker->next; 46 Log() << Verbose(3) << "Current atom is " << *Walker << "." << endl;44 DoeLog(2) && (eLog()<< Verbose(2) << "Current molecule is " << *MolWalker << "." << endl); 45 atom *Walker = (*MolWalker)->start; 46 while (Walker->next != (*MolWalker)->end) { 47 Walker = Walker->next; 48 DoLog(3) && (Log() << Verbose(3) << "Current atom is " << *Walker << "." << endl); 47 49 if ((type1 == NULL) || (Walker->type == type1)) { 48 50 for (MoleculeList::const_iterator MolOtherWalker = MolWalker; MolOtherWalker != molecules->ListOfMolecules.end(); MolOtherWalker++) 49 51 if ((*MolOtherWalker)->ActiveFlag) { 50 Log() << Verbose(2) << "Current other molecule is " << *MolOtherWalker << "." << endl;52 DoLog(2) && (Log() << Verbose(2) << "Current other molecule is " << *MolOtherWalker << "." << endl); 51 53 atom *OtherWalker = (*MolOtherWalker)->start; 52 54 while (OtherWalker->next != (*MolOtherWalker)->end) { // only go up to Walker 53 55 OtherWalker = OtherWalker->next; 54 Log() << Verbose(3) << "Current otheratom is " << *OtherWalker << "." << endl;56 DoLog(3) && (Log() << Verbose(3) << "Current otheratom is " << *OtherWalker << "." << endl); 55 57 if (Walker->nr < OtherWalker->nr) 56 58 if ((type2 == NULL) || (OtherWalker->type == type2)) { 57 distance = Walker->node->PeriodicDistance(OtherWalker->node, (*MolWalker)->cell_size);59 distance = Walker->node->PeriodicDistance(OtherWalker->node, World::getInstance().getDomain()); 58 60 //Log() << Verbose(1) <<"Inserting " << *Walker << " and " << *OtherWalker << endl; 59 61 outmap->insert ( pair<double, pair <atom *, atom*> > (distance, pair<atom *, atom*> (Walker, OtherWalker) ) ); … … 90 92 91 93 if (molecules->ListOfMolecules.empty()) { 92 eLog() << Verbose(1) <<"No molecule given." << endl;94 DoeLog(1) && (eLog()<< Verbose(1) <<"No molecule given." << endl); 93 95 return outmap; 94 96 } … … 96 98 for (MoleculeList::const_iterator MolWalker = molecules->ListOfMolecules.begin(); MolWalker != molecules->ListOfMolecules.end(); MolWalker++) 97 99 if ((*MolWalker)->ActiveFlag) { 98 double * FullMatrix = ReturnFullMatrixforSymmetric( (*MolWalker)->cell_size);100 double * FullMatrix = ReturnFullMatrixforSymmetric(World::getInstance().getDomain()); 99 101 double * FullInverseMatrix = InverseMatrix(FullMatrix); 100 eLog() << Verbose(2) << "Current molecule is " << *MolWalker << "." << endl;101 atom *Walker = (*MolWalker)->start; 102 while (Walker->next != (*MolWalker)->end) { 103 Walker = Walker->next; 104 Log() << Verbose(3) << "Current atom is " << *Walker << "." << endl;102 DoeLog(2) && (eLog()<< Verbose(2) << "Current molecule is " << *MolWalker << "." << endl); 103 atom *Walker = (*MolWalker)->start; 104 while (Walker->next != (*MolWalker)->end) { 105 Walker = Walker->next; 106 DoLog(3) && (Log() << Verbose(3) << "Current atom is " << *Walker << "." << endl); 105 107 if ((type1 == NULL) || (Walker->type == type1)) { 106 108 periodicX.CopyVector(Walker->node); … … 115 117 for (MoleculeList::const_iterator MolOtherWalker = MolWalker; MolOtherWalker != molecules->ListOfMolecules.end(); MolOtherWalker++) 116 118 if ((*MolOtherWalker)->ActiveFlag) { 117 Log() << Verbose(2) << "Current other molecule is " << *MolOtherWalker << "." << endl;119 DoLog(2) && (Log() << Verbose(2) << "Current other molecule is " << *MolOtherWalker << "." << endl); 118 120 atom *OtherWalker = (*MolOtherWalker)->start; 119 121 while (OtherWalker->next != (*MolOtherWalker)->end) { // only go up to Walker 120 122 OtherWalker = OtherWalker->next; 121 Log() << Verbose(3) << "Current otheratom is " << *OtherWalker << "." << endl;123 DoLog(3) && (Log() << Verbose(3) << "Current otheratom is " << *OtherWalker << "." << endl); 122 124 if (Walker->nr < OtherWalker->nr) 123 125 if ((type2 == NULL) || (OtherWalker->type == type2)) { … … 162 164 163 165 if (molecules->ListOfMolecules.empty()) { 164 Log() << Verbose(1) <<"No molecule given." << endl;166 DoLog(1) && (Log() << Verbose(1) <<"No molecule given." << endl); 165 167 return outmap; 166 168 } … … 168 170 for (MoleculeList::const_iterator MolWalker = molecules->ListOfMolecules.begin(); MolWalker != molecules->ListOfMolecules.end(); MolWalker++) 169 171 if ((*MolWalker)->ActiveFlag) { 170 Log() << Verbose(2) << "Current molecule is " << *MolWalker << "." << endl;171 atom *Walker = (*MolWalker)->start; 172 while (Walker->next != (*MolWalker)->end) { 173 Walker = Walker->next; 174 Log() << Verbose(3) << "Current atom is " << *Walker << "." << endl;172 DoLog(2) && (Log() << Verbose(2) << "Current molecule is " << *MolWalker << "." << endl); 173 atom *Walker = (*MolWalker)->start; 174 while (Walker->next != (*MolWalker)->end) { 175 Walker = Walker->next; 176 DoLog(3) && (Log() << Verbose(3) << "Current atom is " << *Walker << "." << endl); 175 177 if ((type == NULL) || (Walker->type == type)) { 176 distance = Walker->node->PeriodicDistance(point, (*MolWalker)->cell_size);177 Log() << Verbose(4) << "Current distance is " << distance << "." << endl;178 distance = Walker->node->PeriodicDistance(point, World::getInstance().getDomain()); 179 DoLog(4) && (Log() << Verbose(4) << "Current distance is " << distance << "." << endl); 178 180 outmap->insert ( pair<double, pair<atom *, const Vector*> >(distance, pair<atom *, const Vector*> (Walker, point) ) ); 179 181 } … … 202 204 203 205 if (molecules->ListOfMolecules.empty()) { 204 Log() << Verbose(1) <<"No molecule given." << endl;206 DoLog(1) && (Log() << Verbose(1) <<"No molecule given." << endl); 205 207 return outmap; 206 208 } … … 208 210 for (MoleculeList::const_iterator MolWalker = molecules->ListOfMolecules.begin(); MolWalker != molecules->ListOfMolecules.end(); MolWalker++) 209 211 if ((*MolWalker)->ActiveFlag) { 210 double * FullMatrix = ReturnFullMatrixforSymmetric( (*MolWalker)->cell_size);212 double * FullMatrix = ReturnFullMatrixforSymmetric(World::getInstance().getDomain()); 211 213 double * FullInverseMatrix = InverseMatrix(FullMatrix); 212 Log() << Verbose(2) << "Current molecule is " << *MolWalker << "." << endl;213 atom *Walker = (*MolWalker)->start; 214 while (Walker->next != (*MolWalker)->end) { 215 Walker = Walker->next; 216 Log() << Verbose(3) << "Current atom is " << *Walker << "." << endl;214 DoLog(2) && (Log() << Verbose(2) << "Current molecule is " << *MolWalker << "." << endl); 215 atom *Walker = (*MolWalker)->start; 216 while (Walker->next != (*MolWalker)->end) { 217 Walker = Walker->next; 218 DoLog(3) && (Log() << Verbose(3) << "Current atom is " << *Walker << "." << endl); 217 219 if ((type == NULL) || (Walker->type == type)) { 218 220 periodicX.CopyVector(Walker->node); … … 226 228 checkX.MatrixMultiplication(FullMatrix); 227 229 distance = checkX.Distance(point); 228 Log() << Verbose(4) << "Current distance is " << distance << "." << endl;230 DoLog(4) && (Log() << Verbose(4) << "Current distance is " << distance << "." << endl); 229 231 outmap->insert ( pair<double, pair<atom *, const Vector*> >(distance, pair<atom *, const Vector*> (Walker, point) ) ); 230 232 } … … 255 257 256 258 if ((Surface == NULL) || (LC == NULL) || (molecules->ListOfMolecules.empty())) { 257 Log() << Verbose(1) <<"No Tesselation, no LinkedCell or no molecule given." << endl;259 DoeLog(1) && (eLog()<< Verbose(1) <<"No Tesselation, no LinkedCell or no molecule given." << endl); 258 260 return outmap; 259 261 } … … 261 263 for (MoleculeList::const_iterator MolWalker = molecules->ListOfMolecules.begin(); MolWalker != molecules->ListOfMolecules.end(); MolWalker++) 262 264 if ((*MolWalker)->ActiveFlag) { 263 Log() << Verbose(2) << "Current molecule is " << *MolWalker << "." << endl;264 atom *Walker = (*MolWalker)->start; 265 while (Walker->next != (*MolWalker)->end) { 266 Walker = Walker->next; 267 Log() << Verbose(3) << "Current atom is " << *Walker << "." << endl;265 DoLog(1) && (Log() << Verbose(1) << "Current molecule is " << (*MolWalker)->name << "." << endl); 266 atom *Walker = (*MolWalker)->start; 267 while (Walker->next != (*MolWalker)->end) { 268 Walker = Walker->next; 269 //Log() << Verbose(1) << "Current atom is " << *Walker << "." << endl; 268 270 if ((type == NULL) || (Walker->type == type)) { 269 triangle = Surface->FindClosestTriangleToVector(Walker->node, LC);270 if (triangle != NULL) {271 distance = DistanceToTrianglePlane(Walker->node, triangle);272 outmap->insert ( pair<double, pair<atom *, BoundaryTriangleSet*> >(distance, pair<atom *, BoundaryTriangleSet*> (Walker, triangle) ) );273 }274 }275 }276 }271 TriangleIntersectionList Intersections(Walker->node,Surface,LC); 272 distance = Intersections.GetSmallestDistance(); 273 triangle = Intersections.GetClosestTriangle(); 274 outmap->insert ( pair<double, pair<atom *, BoundaryTriangleSet*> >(distance, pair<atom *, BoundaryTriangleSet*> (Walker, triangle) ) ); 275 } 276 } 277 } else 278 DoLog(1) && (Log() << Verbose(1) << "molecule " << (*MolWalker)->name << " is not active." << endl); 277 279 278 280 return outmap; … … 304 306 305 307 if ((Surface == NULL) || (LC == NULL) || (molecules->ListOfMolecules.empty())) { 306 Log() << Verbose(1) <<"No Tesselation, no LinkedCell or no molecule given." << endl;308 DoLog(1) && (Log() << Verbose(1) <<"No Tesselation, no LinkedCell or no molecule given." << endl); 307 309 return outmap; 308 310 } … … 312 314 for (MoleculeList::const_iterator MolWalker = molecules->ListOfMolecules.begin(); MolWalker != molecules->ListOfMolecules.end(); MolWalker++) 313 315 if ((*MolWalker)->ActiveFlag) { 314 double * FullMatrix = ReturnFullMatrixforSymmetric( (*MolWalker)->cell_size);316 double * FullMatrix = ReturnFullMatrixforSymmetric(World::getInstance().getDomain()); 315 317 double * FullInverseMatrix = InverseMatrix(FullMatrix); 316 Log() << Verbose(2) << "Current molecule is " << *MolWalker << "." << endl;317 atom *Walker = (*MolWalker)->start; 318 while (Walker->next != (*MolWalker)->end) { 319 Walker = Walker->next; 320 Log() << Verbose(3) << "Current atom is " << *Walker << "." << endl;318 DoLog(2) && (Log() << Verbose(2) << "Current molecule is " << *MolWalker << "." << endl); 319 atom *Walker = (*MolWalker)->start; 320 while (Walker->next != (*MolWalker)->end) { 321 Walker = Walker->next; 322 DoLog(3) && (Log() << Verbose(3) << "Current atom is " << *Walker << "." << endl); 321 323 if ((type == NULL) || (Walker->type == type)) { 322 324 periodicX.CopyVector(Walker->node); … … 330 332 checkX.AddVector(&periodicX); 331 333 checkX.MatrixMultiplication(FullMatrix); 332 triangle = Surface->FindClosestTriangleToVector(&checkX, LC); 333 distance = Surface->GetDistanceSquaredToTriangle(checkX, triangle); 334 TriangleIntersectionList Intersections(&checkX,Surface,LC); 335 distance = Intersections.GetSmallestDistance(); 336 triangle = Intersections.GetClosestTriangle(); 334 337 if ((ShortestDistance == -1.) || (distance < ShortestDistance)) { 335 338 ShortestDistance = distance; … … 338 341 } 339 342 // insert 340 ShortestDistance = sqrt(ShortestDistance);341 343 outmap->insert ( pair<double, pair<atom *, BoundaryTriangleSet*> >(ShortestDistance, pair<atom *, BoundaryTriangleSet*> (Walker, ShortestTriangle) ) ); 342 344 //Log() << Verbose(1) << "INFO: Inserting " << Walker << " with distance " << ShortestDistance << " to " << *ShortestTriangle << "." << endl; … … 350 352 }; 351 353 352 /** Returns the startof the bin for a given value.354 /** Returns the index of the bin for a given value. 353 355 * \param value value whose bin to look for 354 356 * \param BinWidth width of bin 355 357 * \param BinStart first bin 356 358 */ 357 doubleGetBin ( const double value, const double BinWidth, const double BinStart )358 { 359 Info FunctionInfo(__func__); 360 double bin =(double) (floor((value - BinStart)/BinWidth));361 return (bin *BinWidth+BinStart);359 int GetBin ( const double value, const double BinWidth, const double BinStart ) 360 { 361 Info FunctionInfo(__func__); 362 int bin =(int) (floor((value - BinStart)/BinWidth)); 363 return (bin); 362 364 }; 363 365 … … 372 374 *file << "BinStart\tCount" << endl; 373 375 for (BinPairMap::const_iterator runner = map->begin(); runner != map->end(); ++runner) { 374 *file << runner->first << "\t" << runner->second << endl;376 *file << setprecision(8) << runner->first << "\t" << runner->second << endl; 375 377 } 376 378 }; … … 385 387 *file << "BinStart\tAtom1\tAtom2" << endl; 386 388 for (PairCorrelationMap::const_iterator runner = map->begin(); runner != map->end(); ++runner) { 387 *file << runner->first << "\t" << *(runner->second.first) << "\t" << *(runner->second.second) << endl;389 *file << setprecision(8) << runner->first << "\t" << *(runner->second.first) << "\t" << *(runner->second.second) << endl; 388 390 } 389 391 }; … … 400 402 *file << runner->first; 401 403 for (int i=0;i<NDIM;i++) 402 *file << "\t" << (runner->second.first->node->x[i] - runner->second.second->x[i]);404 *file << "\t" << setprecision(8) << (runner->second.first->node->x[i] - runner->second.second->x[i]); 403 405 *file << endl; 404 406 } … … 413 415 Info FunctionInfo(__func__); 414 416 *file << "BinStart\tTriangle" << endl; 415 for (CorrelationToSurfaceMap::const_iterator runner = map->begin(); runner != map->end(); ++runner) { 416 *file << runner->first << "\t" << *(runner->second.first) << "\t" << *(runner->second.second) << endl; 417 } 418 }; 419 417 if (!map->empty()) 418 for (CorrelationToSurfaceMap::const_iterator runner = map->begin(); runner != map->end(); ++runner) { 419 *file << setprecision(8) << runner->first << "\t" << *(runner->second.first) << "\t" << *(runner->second.second) << endl; 420 } 421 }; 422
Note:
See TracChangeset
for help on using the changeset viewer.
