- Timestamp:
- Sep 12, 2016, 11:48:36 PM (8 years ago)
- Branches:
- Action_Thermostats, Add_AtomRandomPerturbation, Add_FitFragmentPartialChargesAction, Add_RotateAroundBondAction, Add_SelectAtomByNameAction, Adding_Graph_to_ChangeBondActions, Adding_MD_integration_tests, Adding_StructOpt_integration_tests, Automaking_mpqc_open, AutomationFragmentation_failures, Candidate_v1.5.4, Candidate_v1.6.0, Candidate_v1.6.1, ChangeBugEmailaddress, ChangingTestPorts, ChemicalSpaceEvaluator, Combining_Subpackages, Debian_Package_split, Debian_package_split_molecuildergui_only, Disabling_MemDebug, Docu_Python_wait, EmpiricalPotential_contain_HomologyGraph, EmpiricalPotential_contain_HomologyGraph_documentation, Enable_parallel_make_install, Enhance_userguide, Enhanced_StructuralOptimization, Enhanced_StructuralOptimization_continued, Example_ManyWaysToTranslateAtom, Exclude_Hydrogens_annealWithBondGraph, FitPartialCharges_GlobalError, Fix_ChargeSampling_PBC, Fix_ChronosMutex, Fix_FitPartialCharges, Fix_FitPotential_needs_atomicnumbers, Fix_ForceAnnealing, Fix_IndependentFragmentGrids, Fix_ParseParticles, Fix_ParseParticles_split_forward_backward_Actions, Fix_StatusMsg, Fix_StepWorldTime_single_argument, Fix_Verbose_Codepatterns, ForceAnnealing_goodresults, ForceAnnealing_oldresults, ForceAnnealing_tocheck, ForceAnnealing_with_BondGraph, ForceAnnealing_with_BondGraph_continued, ForceAnnealing_with_BondGraph_continued_betteresults, ForceAnnealing_with_BondGraph_contraction-expansion, GeometryObjects, Gui_displays_atomic_force_velocity, IndependentFragmentGrids, IndependentFragmentGrids_IndividualZeroInstances, IndependentFragmentGrids_IntegrationTest, IndependentFragmentGrids_Sole_NN_Calculation, JobMarket_RobustOnKillsSegFaults, JobMarket_StableWorkerPool, JobMarket_unresolvable_hostname_fix, ODR_violation_mpqc_open, PartialCharges_OrthogonalSummation, PythonUI_with_named_parameters, QtGui_reactivate_TimeChanged_changes, Recreated_GuiChecks, RotateToPrincipalAxisSystem_UndoRedo, SaturateAtoms_findBestMatching, StoppableMakroAction, Subpackage_CodePatterns, Subpackage_JobMarket, Subpackage_LinearAlgebra, Subpackage_levmar, Subpackage_mpqc_open, Subpackage_vmg, ThirdParty_MPQC_rebuilt_buildsystem, TrajectoryDependenant_MaxOrder, TremoloParser_IncreasedPrecision, TremoloParser_MultipleTimesteps, Ubuntu_1604_changes, stable
- Children:
- 450adf
- Parents:
- b67d89
- git-author:
- Frederik Heber <heber@…> (06/29/14 18:02:32)
- git-committer:
- Frederik Heber <heber@…> (09/12/16 23:48:36)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/Fragmentation/Exporters/SphericalPointDistribution.cpp
rb67d89 r2199c2 255 255 */ 256 256 SphericalPointDistribution::IndexList_t SphericalPointDistribution::findBestMatching( 257 const SphericalPointDistribution:: Polygon_t &_polygon,257 const SphericalPointDistribution::WeightedPolygon_t &_polygon, 258 258 const SphericalPointDistribution::Polygon_t &_newpolygon 259 259 ) … … 262 262 MCS.foundflag = false; 263 263 MCS.bestL2 = std::numeric_limits<double>::max(); 264 MCS.oldpoints.insert(MCS.oldpoints.begin(), _polygon.begin(),_polygon.end() ); 264 for (WeightedPolygon_t::const_iterator iter = _polygon.begin(); 265 iter != _polygon.end(); ++iter) 266 MCS.oldpoints.push_back(iter->first); 265 267 MCS.newpoints.insert(MCS.newpoints.begin(), _newpolygon.begin(),_newpolygon.end() ); 266 268 … … 494 496 SphericalPointDistribution::Polygon_t 495 497 SphericalPointDistribution::matchSphericalPointDistributions( 496 const SphericalPointDistribution:: Polygon_t &_polygon,498 const SphericalPointDistribution::WeightedPolygon_t &_polygon, 497 499 const SphericalPointDistribution::Polygon_t &_newpolygon 498 500 ) 499 501 { 500 SphericalPointDistribution::Polygon_t remainingreturnpolygon; 501 VectorArray_t remainingold(_polygon.begin(), _polygon.end()); 502 SphericalPointDistribution::Polygon_t remainingpoints; 503 VectorArray_t remainingold; 504 for (WeightedPolygon_t::const_iterator iter = _polygon.begin(); 505 iter != _polygon.end(); ++iter) 506 remainingold.push_back(iter->first); 502 507 VectorArray_t remainingnew(_newpolygon.begin(), _newpolygon.end()); 503 508 LOG(2, "INFO: Matching old polygon " << _polygon … … 507 512 // same number of points desired as are present? Do nothing 508 513 LOG(2, "INFO: There are no vacant points to return."); 509 return remaining returnpolygon;514 return remainingpoints; 510 515 } 511 516
Note:
See TracChangeset
for help on using the changeset viewer.