Changes in src/analysis_correlation.cpp [d74077:952f38]
- File:
-
- 1 edited
-
src/analysis_correlation.cpp (modified) (11 diffs)
Legend:
- Unmodified
- Added
- Removed
-
src/analysis_correlation.cpp
rd74077 r952f38 11 11 #include <iomanip> 12 12 13 #include "BoundaryTriangleSet.hpp"14 13 #include "analysis_correlation.hpp" 15 14 #include "element.hpp" 16 #include " info.hpp"17 #include " log.hpp"15 #include "Helpers/Info.hpp" 16 #include "Helpers/Log.hpp" 18 17 #include "molecule.hpp" 19 18 #include "tesselation.hpp" 20 19 #include "tesselationhelpers.hpp" 21 20 #include "triangleintersectionlist.hpp" 22 #include " vector.hpp"23 #include " Matrix.hpp"24 #include " verbose.hpp"21 #include "LinearAlgebra/Vector.hpp" 22 #include "LinearAlgebra/Matrix.hpp" 23 #include "Helpers/Verbose.hpp" 25 24 #include "World.hpp" 26 25 #include "Box.hpp" … … 75 74 if ((*iter)->getId() < (*runner)->getId()){ 76 75 for (set <pair<element *, element *> >::iterator PairRunner = PairsOfElements.begin(); PairRunner != PairsOfElements.end(); ++PairRunner) 77 if ((PairRunner->first == (**iter). getType()) && (PairRunner->second == (**runner).getType())) {78 distance = domain.periodicDistance( (*iter)->getPosition(),(*runner)->getPosition());76 if ((PairRunner->first == (**iter).type) && (PairRunner->second == (**runner).type)) { 77 distance = domain.periodicDistance(*(*iter)->node,*(*runner)->node); 79 78 //Log() << Verbose(1) <<"Inserting " << *(*iter) << " and " << *(*runner) << endl; 80 79 outmap->insert ( pair<double, pair <atom *, atom*> > (distance, pair<atom *, atom*> ((*iter), (*runner)) ) ); … … 138 137 for (molecule::const_iterator iter = (*MolWalker)->begin(); iter != (*MolWalker)->end(); ++iter) { 139 138 DoLog(3) && (Log() << Verbose(3) << "Current atom is " << **iter << "." << endl); 140 periodicX = FullInverseMatrix * ( (*iter)->getPosition()); // x now in [0,1)^3139 periodicX = FullInverseMatrix * (*(*iter)->node); // x now in [0,1)^3 141 140 // go through every range in xyz and get distance 142 141 for (n[0]=-ranges[0]; n[0] <= ranges[0]; n[0]++) … … 150 149 if ((*iter)->getId() < (*runner)->getId()){ 151 150 for (set <pair<element *, element *> >::iterator PairRunner = PairsOfElements.begin(); PairRunner != PairsOfElements.end(); ++PairRunner) 152 if ((PairRunner->first == (**iter). getType()) && (PairRunner->second == (**runner).getType())) {153 periodicOtherX = FullInverseMatrix * ( (*runner)->getPosition()); // x now in [0,1)^3151 if ((PairRunner->first == (**iter).type) && (PairRunner->second == (**runner).type)) { 152 periodicOtherX = FullInverseMatrix * (*(*runner)->node); // x now in [0,1)^3 154 153 // go through every range in xyz and get distance 155 154 for (Othern[0]=-ranges[0]; Othern[0] <= ranges[0]; Othern[0]++) … … 197 196 DoLog(3) && (Log() << Verbose(3) << "Current atom is " << **iter << "." << endl); 198 197 for (vector<element *>::const_iterator type = elements.begin(); type != elements.end(); ++type) 199 if ((*type == NULL) || ((*iter)-> getType()== *type)) {200 distance = domain.periodicDistance( (*iter)->getPosition(),*point);198 if ((*type == NULL) || ((*iter)->type == *type)) { 199 distance = domain.periodicDistance(*(*iter)->node,*point); 201 200 DoLog(4) && (Log() << Verbose(4) << "Current distance is " << distance << "." << endl); 202 201 outmap->insert ( pair<double, pair<atom *, const Vector*> >(distance, pair<atom *, const Vector*> ((*iter), point) ) ); … … 238 237 DoLog(3) && (Log() << Verbose(3) << "Current atom is " << **iter << "." << endl); 239 238 for (vector<element *>::const_iterator type = elements.begin(); type != elements.end(); ++type) 240 if ((*type == NULL) || ((*iter)-> getType()== *type)) {241 periodicX = FullInverseMatrix * ( (*iter)->getPosition()); // x now in [0,1)^3239 if ((*type == NULL) || ((*iter)->type == *type)) { 240 periodicX = FullInverseMatrix * (*(*iter)->node); // x now in [0,1)^3 242 241 // go through every range in xyz and get distance 243 242 for (n[0]=-ranges[0]; n[0] <= ranges[0]; n[0]++) … … 285 284 DoLog(3) && (Log() << Verbose(3) << "\tCurrent atom is " << *(*iter) << "." << endl); 286 285 for (vector<element *>::const_iterator type = elements.begin(); type != elements.end(); ++type) 287 if ((*type == NULL) || ((*iter)-> getType()== *type)) {288 TriangleIntersectionList Intersections((*iter)-> getPosition(),Surface,LC);286 if ((*type == NULL) || ((*iter)->type == *type)) { 287 TriangleIntersectionList Intersections((*iter)->node,Surface,LC); 289 288 distance = Intersections.GetSmallestDistance(); 290 289 triangle = Intersections.GetClosestTriangle(); … … 336 335 DoLog(3) && (Log() << Verbose(3) << "Current atom is " << **iter << "." << endl); 337 336 for (vector<element *>::const_iterator type = elements.begin(); type != elements.end(); ++type) 338 if ((*type == NULL) || ((*iter)-> getType()== *type)) {339 periodicX = FullInverseMatrix * ( (*iter)->getPosition()); // x now in [0,1)^3337 if ((*type == NULL) || ((*iter)->type == *type)) { 338 periodicX = FullInverseMatrix * (*(*iter)->node); // x now in [0,1)^3 340 339 // go through every range in xyz and get distance 341 340 ShortestDistance = -1.; … … 344 343 for (n[2]=-ranges[2]; n[2] <= ranges[2]; n[2]++) { 345 344 checkX = FullMatrix * (Vector(n[0], n[1], n[2]) + periodicX); 346 TriangleIntersectionList Intersections( checkX,Surface,LC);345 TriangleIntersectionList Intersections(&checkX,Surface,LC); 347 346 distance = Intersections.GetSmallestDistance(); 348 347 triangle = Intersections.GetClosestTriangle(); … … 412 411 *file << runner->first; 413 412 for (int i=0;i<NDIM;i++) 414 *file << "\t" << setprecision(8) << (runner->second.first-> at(i) - runner->second.second->at(i));413 *file << "\t" << setprecision(8) << (runner->second.first->node->at(i) - runner->second.second->at(i)); 415 414 *file << endl; 416 415 } … … 427 426 if (!map->empty()) 428 427 for (CorrelationToSurfaceMap::const_iterator runner = map->begin(); runner != map->end(); ++runner) { 429 *file << setprecision(8) << runner->first << "\t"; 430 *file << *(runner->second.first) << "\t"; 431 *file << *(runner->second.second) << endl; 432 } 433 }; 434 428 *file << setprecision(8) << runner->first << "\t" << *(runner->second.first) << "\t" << *(runner->second.second) << endl; 429 } 430 }; 431
Note:
See TracChangeset
for help on using the changeset viewer.
