- Timestamp:
- Nov 27, 2012, 8:35:34 AM (12 years ago)
- Branches:
- Action_Thermostats, Add_AtomRandomPerturbation, Add_FitFragmentPartialChargesAction, Add_RotateAroundBondAction, Add_SelectAtomByNameAction, Added_ParseSaveFragmentResults, AddingActions_SaveParseParticleParameters, Adding_Graph_to_ChangeBondActions, Adding_MD_integration_tests, Adding_ParticleName_to_Atom, Adding_StructOpt_integration_tests, AtomFragments, Automaking_mpqc_open, AutomationFragmentation_failures, Candidate_v1.5.4, Candidate_v1.6.0, Candidate_v1.6.1, ChangeBugEmailaddress, ChangingTestPorts, ChemicalSpaceEvaluator, CombiningParticlePotentialParsing, 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_BoundInBox_CenterInBox_MoleculeActions, Fix_ChargeSampling_PBC, Fix_ChronosMutex, Fix_FitPartialCharges, Fix_FitPotential_needs_atomicnumbers, Fix_ForceAnnealing, Fix_IndependentFragmentGrids, Fix_ParseParticles, Fix_ParseParticles_split_forward_backward_Actions, Fix_PopActions, Fix_QtFragmentList_sorted_selection, Fix_Restrictedkeyset_FragmentMolecule, Fix_StatusMsg, Fix_StepWorldTime_single_argument, Fix_Verbose_Codepatterns, Fix_fitting_potentials, Fixes, ForceAnnealing_goodresults, ForceAnnealing_oldresults, ForceAnnealing_tocheck, ForceAnnealing_with_BondGraph, ForceAnnealing_with_BondGraph_continued, ForceAnnealing_with_BondGraph_continued_betteresults, ForceAnnealing_with_BondGraph_contraction-expansion, FragmentAction_writes_AtomFragments, FragmentMolecule_checks_bonddegrees, GeometryObjects, Gui_Fixes, Gui_displays_atomic_force_velocity, ImplicitCharges, IndependentFragmentGrids, IndependentFragmentGrids_IndividualZeroInstances, IndependentFragmentGrids_IntegrationTest, IndependentFragmentGrids_Sole_NN_Calculation, JobMarket_RobustOnKillsSegFaults, JobMarket_StableWorkerPool, JobMarket_unresolvable_hostname_fix, MoreRobust_FragmentAutomation, ODR_violation_mpqc_open, PartialCharges_OrthogonalSummation, PdbParser_setsAtomName, PythonUI_with_named_parameters, QtGui_reactivate_TimeChanged_changes, Recreated_GuiChecks, Rewrite_FitPartialCharges, RotateToPrincipalAxisSystem_UndoRedo, SaturateAtoms_findBestMatching, SaturateAtoms_singleDegree, StoppableMakroAction, Subpackage_CodePatterns, Subpackage_JobMarket, Subpackage_LinearAlgebra, Subpackage_levmar, Subpackage_mpqc_open, Subpackage_vmg, Switchable_LogView, ThirdParty_MPQC_rebuilt_buildsystem, TrajectoryDependenant_MaxOrder, TremoloParser_IncreasedPrecision, TremoloParser_MultipleTimesteps, TremoloParser_setsAtomName, Ubuntu_1604_changes, stable
- Children:
- 3dd32f
- Parents:
- 995e2f
- git-author:
- Frederik Heber <heber@…> (08/27/12 11:51:09)
- git-committer:
- Frederik Heber <heber@…> (11/27/12 08:35:34)
- Location:
- src
- Files:
-
- 10 edited
Legend:
- Unmodified
- Added
- Removed
-
src/Actions/FragmentationAction/FragmentationAutomationAction.cpp
r995e2f rc9f9bb 40 40 41 41 #include <boost/mpl/remove.hpp> 42 #include <boost/lambda/lambda.hpp> 42 43 43 44 #include "CodePatterns/Assert.hpp" … … 173 174 void ConvertFragmentResultTo( 174 175 const std::vector<FragmentResult::ptr> &results, 175 std:: vector<T> &fragmentData)176 std::map<JobId_t, T> &fragmentData) 176 177 { 177 178 // extract results 178 179 fragmentData.clear(); 179 fragmentData.reserve(results.size());180 180 181 181 LOG(2, "DEBUG: Parsing now through " << results.size() << " results."); … … 189 189 ia >> extractedData; 190 190 LOG(1, "INFO: extracted data is " << extractedData << "."); 191 fragmentData. push_back(extractedData);191 fragmentData.insert( std::make_pair( (*iter)->getId(), extractedData) ); 192 192 } 193 193 … … 225 225 /** Place results from FragmentResult into EnergyMatrix and ForceMatrix. 226 226 * 227 * @param jobids jobids with ids to associate with fragment number228 227 * @param fragmentData MPQCData resulting from the jobs 229 228 * @param MatrixNrLookup Lookup up-map from job id to fragment number … … 235 234 */ 236 235 bool putResultsintoMatrices( 237 const std::vector<JobId_t> &jobids, 238 const std::vector<MPQCData> &fragmentData, 236 const std::map<JobId_t, MPQCData> &fragmentData, 239 237 std::map< JobId_t, size_t > &MatrixNrLookup, 240 238 const size_t FragmentCounter, … … 243 241 ForceMatrix &Force) 244 242 { 245 ASSERT( jobids.size() == fragmentData.size(), 246 "putResultsintoMatrices() - jobids and fragmentData differ in size."); 247 std::vector<MPQCData>::const_iterator dataiter = fragmentData.begin(); 248 std::vector<JobId_t>::const_iterator iditer = jobids.begin(); 249 for (; dataiter != fragmentData.end(); ++dataiter, ++iditer) { 250 const MPQCData &extractedData = *dataiter; 243 for (std::map<JobId_t, MPQCData>::const_iterator dataiter = fragmentData.begin(); 244 dataiter != fragmentData.end(); ++dataiter) { 245 const MPQCData &extractedData = dataiter->second; 246 const JobId_t &jobid = dataiter->first; 251 247 // place results into EnergyMatrix ... 252 248 { … … 255 251 matrix[0].resize(1, extractedData.energies.total); 256 252 if (!Energy.AddMatrix( 257 std::string("MPQCJob ")+toString( *iditer),253 std::string("MPQCJob ")+toString(jobid), 258 254 matrix, 259 MatrixNrLookup[ *iditer])) {255 MatrixNrLookup[jobid])) { 260 256 ELOG(1, "Adding energy matrix failed."); 261 257 return false; … … 276 272 } 277 273 if (!Force.AddMatrix( 278 std::string("MPQCJob ")+toString( *iditer),274 std::string("MPQCJob ")+toString(jobid), 279 275 matrix, 280 MatrixNrLookup[ *iditer])) {276 MatrixNrLookup[jobid])) { 281 277 ELOG(1, "Adding force matrix failed."); 282 278 return false; … … 301 297 /** Print MPQCData from received results. 302 298 * 303 * @param jobids jobids with ids to associate with fragment number 304 * @param fragmentData MPQCData resulting from the jobs 299 * @param fragmentData MPQCData resulting from the jobs, each associated to a job 305 300 * @param KeySetFilename filename with keysets to associate forces correctly 306 301 * @param NoAtoms total number of atoms … … 309 304 */ 310 305 bool sumUpChargeDensity( 311 const std::vector<JobId_t> &jobids, 312 const std::vector<MPQCData> &fragmentData, 306 const std::map<JobId_t,MPQCData> &fragmentData, 313 307 const std::string &KeySetFilename, 314 308 SamplingGrid &full_sample, 315 309 Fragment &full_fragment) 316 310 { 311 // create a vector of all job ids 312 std::vector<JobId_t> jobids; 313 std::transform(fragmentData.begin(),fragmentData.end(), 314 std::back_inserter(jobids), 315 boost::bind( &std::map<JobId_t,MPQCData>::value_type::first, boost::lambda::_1 ) 316 ); 317 317 318 // create lookup from job nr to fragment number 318 319 std::map< JobId_t, size_t > MatrixNrLookup; … … 339 340 std::vector<MPQCDataGridMap_t> Result_Grid_fused( 340 341 OrthogonalSumUpPerLevel<MPQCDataGridMap_t, MPQCDataGridVector_t>( 341 fragmentData, jobids,MatrixNrLookup, container, subsetmap));342 fragmentData, MatrixNrLookup, container, subsetmap)); 342 343 std::vector<MPQCDataFragmentMap_t> Result_Fragment_fused( 343 344 OrthogonalSumUpPerLevel<MPQCDataFragmentMap_t, MPQCDataFragmentVector_t>( 344 fragmentData, jobids,MatrixNrLookup, container, subsetmap));345 fragmentData, MatrixNrLookup, container, subsetmap)); 345 346 // obtain full grid 346 347 full_sample = boost::fusion::at_key<MPQCDataFused::sampled_grid>(Result_Grid_fused.back()); … … 352 353 /** Print MPQCData from received results. 353 354 * 354 * @param results results with ids to associate with fragment number 355 * @param fragmentData MPQCData resulting from the jobs 355 * @param fragmentData MPQCData resulting from the jobs, associated to job id 356 356 * @param KeySetFilename filename with keysets to associate forces correctly 357 357 * @param NoAtoms total number of atoms … … 359 359 */ 360 360 bool printReceivedMPQCResults( 361 const std::vector<JobId_t> &jobids, 362 const std::vector<MPQCData> &fragmentData, 361 const std::map<JobId_t, MPQCData> &fragmentData, 363 362 const std::string &KeySetFilename, 364 363 size_t NoAtoms, 365 364 SamplingGrid &full_sample) 366 365 { 366 // create a vector of all job ids 367 std::vector<JobId_t> jobids; 368 std::transform(fragmentData.begin(),fragmentData.end(), 369 std::back_inserter(jobids), 370 boost::bind( &std::map<JobId_t,MPQCData>::value_type::first, boost::lambda::_1 ) 371 ); 372 367 373 // create lookup from job nr to fragment number 368 374 std::map< JobId_t, size_t > MatrixNrLookup; … … 373 379 EnergyMatrix Energy; 374 380 ForceMatrix Force; 375 if (!putResultsintoMatrices( jobids,fragmentData, MatrixNrLookup, FragmentCounter, NoAtoms, Energy, Force))381 if (!putResultsintoMatrices(fragmentData, MatrixNrLookup, FragmentCounter, NoAtoms, Energy, Force)) 376 382 return false; 377 383 … … 412 418 std::vector<MPQCDataEnergyMap_t> Result_Energy_fused( 413 419 OrthogonalSumUpPerLevel<MPQCDataEnergyMap_t, MPQCDataEnergyVector_t>( 414 fragmentData, jobids,MatrixNrLookup, container, subsetmap));420 fragmentData, MatrixNrLookup, container, subsetmap)); 415 421 std::vector<MPQCDataGridMap_t> Result_Grid_fused( 416 422 OrthogonalSumUpPerLevel<MPQCDataGridMap_t, MPQCDataGridVector_t>( 417 fragmentData, jobids,MatrixNrLookup, container, subsetmap));423 fragmentData, MatrixNrLookup, container, subsetmap)); 418 424 std::vector<MPQCDataTimeMap_t> Result_Time_fused( 419 425 SumUpPerLevel<MPQCDataTimeMap_t, MPQCDataTimeVector_t>( 420 fragmentData, jobids,MatrixNrLookup, container, subsetmap));426 fragmentData, MatrixNrLookup, container, subsetmap)); 421 427 422 428 // force has extra converter 423 std:: vector<MPQCDataForceMap_t> MPQCData_Force_fused;429 std::map<JobId_t, MPQCDataForceMap_t> MPQCData_Force_fused; 424 430 convertMPQCDatatoForceMap(fragmentData, ForceKeySet, MPQCData_Force_fused); 425 431 std::vector<MPQCDataForceMap_t> Result_Force_fused(subsetmap->getMaximumSubsetLevel()); … … 427 433 subsetmap, 428 434 MPQCData_Force_fused, 429 jobids,430 435 container->getContainer(), 431 436 MatrixNrLookup, … … 496 501 /** Print MPQCData from received results. 497 502 * 498 * @param fragmentresults results with short-range job ids to associate with fragment number499 * @param longrangeresults results with long-range job ids to associate with fragment number500 503 * @param fragmentData MPQCData resulting from the jobs 501 504 * @param longrangeData VMGData resulting from long-range jobs … … 506 509 */ 507 510 bool printReceivedFullResults( 508 const std::vector<FragmentResult::ptr> &fragmentresults, 509 const std::vector<FragmentResult::ptr> &longrangeresults, 510 const std::vector<MPQCData> &fragmentData, 511 const std::vector<VMGData> &longrangeData, 511 const std::map<JobId_t,MPQCData> &fragmentData, 512 const std::map<JobId_t,VMGData> &longrangeData, 512 513 const VMGData &fullsolutionData, 513 514 const std::string &KeySetFilename, … … 515 516 SamplingGrid &full_sample) 516 517 { 517 // create a vector of all job ids from short-range 518 std::vector<JobId_t> jobids(fragmentresults.size(), JobId::IllegalJob); 519 std::transform(fragmentresults.begin(), fragmentresults.end(), jobids.begin(), 520 boost::bind(&FragmentResult::getId, 521 boost::bind(&FragmentResult::ptr::operator->, _1))); 518 // create a vector of all job ids 519 std::vector<JobId_t> jobids; 520 std::transform(fragmentData.begin(),fragmentData.end(), 521 std::back_inserter(jobids), 522 boost::bind( &std::map<JobId_t,MPQCData>::value_type::first, boost::lambda::_1 ) 523 ); 522 524 523 525 // create lookup from job nr to fragment number … … 555 557 std::vector<MPQCDataEnergyMap_t> Result_Energy_fused( 556 558 OrthogonalSumUpPerLevel<MPQCDataEnergyMap_t, MPQCDataEnergyVector_t>( 557 fragmentData, jobids,MatrixNrLookup, container, subsetmap));559 fragmentData, MatrixNrLookup, container, subsetmap)); 558 560 std::vector<MPQCDataGridMap_t> Result_Grid_fused( 559 561 OrthogonalSumUpPerLevel<MPQCDataGridMap_t, MPQCDataGridVector_t>( 560 fragmentData, jobids,MatrixNrLookup, container, subsetmap));562 fragmentData, MatrixNrLookup, container, subsetmap)); 561 563 std::vector<MPQCDataTimeMap_t> Result_Time_fused( 562 564 SumUpPerLevel<MPQCDataTimeMap_t, MPQCDataTimeVector_t>( 563 fragmentData, jobids,MatrixNrLookup, container, subsetmap));565 fragmentData, MatrixNrLookup, container, subsetmap)); 564 566 std::vector<MPQCDataFragmentMap_t> Result_Fragment_fused( 565 567 OrthogonalSumUpPerLevel<MPQCDataFragmentMap_t, MPQCDataFragmentVector_t>( 566 fragmentData, jobids,MatrixNrLookup, container, subsetmap));568 fragmentData, MatrixNrLookup, container, subsetmap)); 567 569 568 570 // force has extra converter 569 std:: vector<MPQCDataForceMap_t> MPQCData_Force_fused;571 std::map<JobId_t, MPQCDataForceMap_t> MPQCData_Force_fused; 570 572 convertMPQCDatatoForceMap(fragmentData, ForceKeySet, MPQCData_Force_fused); 571 573 std::vector<MPQCDataForceMap_t> Result_Force_fused(subsetmap->getMaximumSubsetLevel()); … … 573 575 subsetmap, 574 576 MPQCData_Force_fused, 575 jobids,576 577 container->getContainer(), 577 578 MatrixNrLookup, … … 580 581 581 582 // obtain full grid 582 std:: vector<VMGDataMap_t> VMGData_Potential_fused;583 std::map<JobId_t, VMGDataMap_t> VMGData_Potential_fused; 583 584 convertDataTo<VMGData, VMGDataMap_t>(longrangeData, VMGData_Potential_fused); 584 585 OrthogonalFullSummator<VMGDataMap_t, VMGDataFused::sampled_potential> potentialSummer( 585 586 subsetmap, 586 587 VMGData_Potential_fused, 587 jobids,588 588 container->getContainer(), 589 589 MatrixNrLookup); … … 592 592 subsetmap, 593 593 VMGData_Potential_fused, 594 jobids,595 594 container->getContainer(), 596 595 MatrixNrLookup); … … 605 604 subsetmap, 606 605 VMGData_Potential_fused, 607 jobids,608 606 container->getContainer(), 609 607 MatrixNrLookup); … … 685 683 FragmentController &controller, 686 684 const FragmentationFragmentationAutomationAction::FragmentationFragmentationAutomationParameters ¶ms, 687 const std:: vector<MPQCData> &fragmentData,685 const std::map<JobId_t, MPQCData> &fragmentData, 688 686 const SamplingGrid &full_sampled_grid, 689 687 const Fragment &full_fragment) … … 692 690 // add one job for each fragment as the short-range correction which we need 693 691 // to subtract from the obtained full potential to get the long-range part only 694 for (std:: vector<MPQCData>::const_iterator iter = fragmentData.begin();692 for (std::map<JobId_t, MPQCData>::const_iterator iter = fragmentData.begin(); 695 693 iter != fragmentData.end(); ++iter) { 696 694 const JobId_t next_id = controller.getAvailableId(); 697 LOG(1, "INFO: Creating VMGJob with " << iter->s ampled_grid.sampled_grid.size()698 << " gridpoints and " << iter-> charges.size() << " particle charges.");695 LOG(1, "INFO: Creating VMGJob with " << iter->second.sampled_grid.sampled_grid.size() 696 << " gridpoints and " << iter->second.charges.size() << " particle charges."); 699 697 FragmentJob::ptr testJob( 700 new VMGJob(next_id, iter->s ampled_grid, iter->positions, iter->charges) );698 new VMGJob(next_id, iter->second.sampled_grid, iter->second.positions, iter->second.charges) ); 701 699 jobs.push_back(testJob); 702 700 } … … 776 774 RunService(io_service, "Requesting short-range results"); 777 775 std::vector<FragmentResult::ptr> MPQCresults = controller.getReceivedResults(); 778 std:: vector<MPQCData> fragmentData;776 std::map<JobId_t, MPQCData> fragmentData; 779 777 ConvertFragmentResultTo<MPQCData>(MPQCresults, fragmentData); 780 778 … … 795 793 Fragment full_fragment; 796 794 sumUpChargeDensity( 797 jobids,798 795 fragmentData, 799 796 params.path.get(), … … 818 815 "FragmentationFragmentationAutomationAction::performCall() - number of MPQCresultd and VMGresults don't match."); 819 816 820 std:: vector<VMGData> longrangeData;817 std::map<JobId_t, VMGData> longrangeData; 821 818 ConvertFragmentResultTo<VMGData>(VMGresults, longrangeData); 822 // remove full solution from vector, has to be treated extra823 VMGData fullsolutionData = longrangeData.back();824 longrangeData. pop_back();819 // remove full solution from map (must be highest id), has to be treated extra 820 VMGData fullsolutionData = (--longrangeData.end())->second; 821 longrangeData.erase(--longrangeData.end()); 825 822 826 823 // Final phase: print result … … 828 825 LOG(1, "INFO: Parsing fragment files from " << params.path.get() << "."); 829 826 printReceivedFullResults( 830 MPQCresults,831 VMGresults,832 827 fragmentData, 833 828 longrangeData, … … 843 838 LOG(1, "INFO: Parsing fragment files from " << params.path.get() << "."); 844 839 printReceivedMPQCResults( 845 jobids,846 840 fragmentData, 847 841 params.path.get(), -
src/Fragmentation/Converter/DataConverter.hpp
r995e2f rc9f9bb 15 15 #endif 16 16 17 #include < vector>17 #include <map> 18 18 #include <boost/fusion/sequence.hpp> 19 19 … … 38 38 template <typename source, typename dest> 39 39 inline void convertDataTo( 40 const std:: vector<source> &fragmentData,41 std:: vector<dest> &MPQCData_fused)40 const std::map<JobId_t, source> &fragmentData, 41 std::map<JobId_t, dest> &MPQCData_fused) 42 42 { 43 43 MPQCData_fused.clear(); … … 46 46 template <> 47 47 inline void convertDataTo<MPQCData, MPQCDataEnergyMap_t>( 48 const std:: vector<MPQCData> &fragmentData,49 std:: vector<MPQCDataEnergyMap_t> &MPQCData_Energy_fused)48 const std::map<JobId_t, MPQCData> &fragmentData, 49 std::map<JobId_t, MPQCDataEnergyMap_t> &MPQCData_Energy_fused) 50 50 { 51 51 // energy_t 52 52 MPQCData_Energy_fused.clear(); 53 MPQCData_Energy_fused.reserve(fragmentData.size()); 54 for(std::vector<MPQCData>::const_iterator dataiter = fragmentData.begin(); 53 for(std::map<JobId_t, MPQCData>::const_iterator dataiter = fragmentData.begin(); 55 54 dataiter != fragmentData.end(); ++dataiter) { 56 const MPQCData &extractedData = *dataiter;55 const MPQCData &extractedData = dataiter->second; 57 56 LOG(4, "DEBUG: Current extracted Data is " << extractedData << "."); 58 57 MPQCDataEnergyMap_t instance; … … 66 65 boost::fusion::at_key<MPQCDataFused::energy_hcore>(instance) = extractedData.energies.hcore; 67 66 boost::fusion::at_key<MPQCDataFused::energy_eigenvalues>(instance) = extractedData.energies.eigenvalues; 68 MPQCData_Energy_fused. push_back(instance);67 MPQCData_Energy_fused.insert( std::make_pair(dataiter->first, instance) ); 69 68 } 70 69 } … … 73 72 template <> 74 73 inline void convertDataTo<VMGData, VMGDataMap_t>( 75 const std:: vector<VMGData> &longrangeData,76 std:: vector<VMGDataMap_t> &VMGData_fused)74 const std::map<JobId_t, VMGData> &longrangeData, 75 std::map<JobId_t, VMGDataMap_t> &VMGData_fused) 77 76 { 78 77 // energy_t 79 78 VMGData_fused.clear(); 80 VMGData_fused.reserve(longrangeData.size()); 81 for(std::vector<VMGData>::const_iterator dataiter = longrangeData.begin(); 79 for(std::map<JobId_t, VMGData>::const_iterator dataiter = longrangeData.begin(); 82 80 dataiter != longrangeData.end(); ++dataiter) { 83 const VMGData &extractedData = *dataiter;81 const VMGData &extractedData = dataiter->second; 84 82 LOG(4, "DEBUG: Current extracted Data is " << extractedData << "."); 85 83 VMGDataMap_t instance; … … 87 85 boost::fusion::at_key<VMGDataFused::energy_potential>(instance) = extractedData.sampled_potential.integral(); 88 86 boost::fusion::at_key<VMGDataFused::energy_long>(instance) = extractedData.e_long; 89 VMGData_fused. push_back(instance);87 VMGData_fused.insert( std::make_pair(dataiter->first, instance) ); 90 88 } 91 89 } … … 93 91 94 92 inline void convertMPQCDatatoForceMap( 95 const std:: vector<MPQCData> &fragmentData,93 const std::map<JobId_t, MPQCData> &fragmentData, 96 94 const KeySetsContainer &ForceKeySet, 97 std:: vector<MPQCDataForceMap_t> &MPQCData_Force_fused)95 std::map<JobId_t, MPQCDataForceMap_t> &MPQCData_Force_fused) 98 96 { 99 97 // forces … … 101 99 "FragmentationAutomationAction::performCall() - indices and fragmentData differ in size."); 102 100 MPQCData_Force_fused.clear(); 103 MPQCData_Force_fused.reserve(fragmentData.size()); 104 std::vector<MPQCData>::const_iterator dataiter = fragmentData.begin(); 101 std::map<JobId_t, MPQCData>::const_iterator dataiter = fragmentData.begin(); 105 102 KeySetsContainer::ArrayOfIntVectors::const_iterator arrayiter = ForceKeySet.KeySets.begin(); 106 103 for(;dataiter != fragmentData.end(); ++dataiter, ++arrayiter) { 107 const MPQCData &extractedData = *dataiter;104 const MPQCData &extractedData = dataiter->second; 108 105 LOG(4, "DEBUG: Current extracted Data is " << extractedData << "."); 109 106 MPQCDataForceMap_t instance; … … 112 109 boost::fusion::at_key<MPQCDataFused::forces>(instance) = 113 110 IndexedVectors(indices, extractedData.forces); 114 MPQCData_Force_fused. push_back(instance);111 MPQCData_Force_fused.insert( std::make_pair(dataiter->first, instance) ); 115 112 } 116 113 } … … 118 115 template <> 119 116 inline void convertDataTo<MPQCData, MPQCDataGridMap_t>( 120 const std:: vector<MPQCData> &fragmentData,121 std:: vector<MPQCDataGridMap_t> &MPQCData_Grid_fused)117 const std::map<JobId_t, MPQCData> &fragmentData, 118 std::map<JobId_t, MPQCDataGridMap_t> &MPQCData_Grid_fused) 122 119 { 123 120 // sampled_grid 124 121 MPQCData_Grid_fused.clear(); 125 MPQCData_Grid_fused.reserve(fragmentData.size()); 126 for(std::vector<MPQCData>::const_iterator dataiter = fragmentData.begin(); 122 for(std::map<JobId_t, MPQCData>::const_iterator dataiter = fragmentData.begin(); 127 123 dataiter != fragmentData.end(); ++dataiter) { 128 const MPQCData &extractedData = *dataiter;124 const MPQCData &extractedData = dataiter->second; 129 125 LOG(4, "DEBUG: Current extracted Data is " << extractedData << "."); 130 126 MPQCDataGridMap_t instance; 131 127 boost::fusion::at_key<MPQCDataFused::sampled_grid>(instance) = extractedData.sampled_grid; 132 MPQCData_Grid_fused. push_back(instance);128 MPQCData_Grid_fused.insert( std::make_pair(dataiter->first, instance) ); 133 129 } 134 130 } … … 136 132 template <> 137 133 inline void convertDataTo<MPQCData, MPQCDataFragmentMap_t>( 138 const std:: vector<MPQCData> &fragmentData,139 std:: vector<MPQCDataFragmentMap_t> &MPQCData_Fragment_fused)134 const std::map<JobId_t, MPQCData> &fragmentData, 135 std::map<JobId_t, MPQCDataFragmentMap_t> &MPQCData_Fragment_fused) 140 136 { 141 137 // fragment 142 138 MPQCData_Fragment_fused.clear(); 143 MPQCData_Fragment_fused.reserve(fragmentData.size()); 144 for(std::vector<MPQCData>::const_iterator dataiter = fragmentData.begin(); 139 for(std::map<JobId_t, MPQCData>::const_iterator dataiter = fragmentData.begin(); 145 140 dataiter != fragmentData.end(); ++dataiter) { 146 const MPQCData &extractedData = *dataiter;141 const MPQCData &extractedData = dataiter->second; 147 142 LOG(4, "DEBUG: Current extracted Data is " << extractedData << "."); 148 143 MPQCDataFragmentMap_t instance; 149 144 boost::fusion::at_key<MPQCDataFused::fragment>(instance) = 150 145 Fragment(extractedData.positions, extractedData.charges); 151 MPQCData_Fragment_fused. push_back(instance);146 MPQCData_Fragment_fused.insert( std::make_pair(dataiter->first, instance) ); 152 147 } 153 148 } … … 155 150 template <> 156 151 inline void convertDataTo<MPQCData, MPQCDataTimeMap_t>( 157 const std:: vector<MPQCData> &fragmentData,158 std:: vector<MPQCDataTimeMap_t> &MPQCData_Time_fused)152 const std::map<JobId_t, MPQCData> &fragmentData, 153 std::map<JobId_t, MPQCDataTimeMap_t> &MPQCData_Time_fused) 159 154 { 160 155 // times 161 156 MPQCData_Time_fused.clear(); 162 MPQCData_Time_fused.reserve(fragmentData.size()); 163 for(std::vector<MPQCData>::const_iterator dataiter = fragmentData.begin(); 157 for(std::map<JobId_t, MPQCData>::const_iterator dataiter = fragmentData.begin(); 164 158 dataiter != fragmentData.end(); ++dataiter) { 165 const MPQCData &extractedData = *dataiter;159 const MPQCData &extractedData = dataiter->second; 166 160 LOG(4, "DEBUG: Current extracted Data is " << extractedData << "."); 167 161 MPQCDataTimeMap_t instance; … … 169 163 boost::fusion::at_key<MPQCDataFused::times_cputime>(instance) = extractedData.times.cputime; 170 164 boost::fusion::at_key<MPQCDataFused::times_flops>(instance) = extractedData.times.flops; 171 MPQCData_Time_fused. push_back(instance);165 MPQCData_Time_fused.insert( std::make_pair(dataiter->first, instance) ); 172 166 } 173 167 } -
src/Fragmentation/Summation/AllLevelOrthogonalSummator.hpp
r995e2f rc9f9bb 34 34 * 35 35 * \param _subsetmap map with hierarchy of IndexSet's 36 * \param _data MPQCData converted to MPQCDataMap_t type 37 * \param _jobids job ids to sum data in correct order 36 * \param _data MPQCData converted to MPQCDataMap_t type, associated to the jobid 38 37 * \param _container container of IndexSet's such that each set has correct order 39 38 * to job id and hence to _data. … … 43 42 AllLevelOrthogonalSummator( 44 43 SubsetMap::ptr &_subsetmap, 45 const std::vector<MapType> &_data, 46 const std::vector<JobId_t> &_jobids, 44 const std::map<JobId_t, MapType> &_data, 47 45 const IndexSetContainer::Container_t &_container, 48 46 std::map< JobId_t, size_t > &_MatrixNrLookup, /* cannot make this const due to operator[] */ … … 50 48 subsetmap(_subsetmap), 51 49 data(_data), 52 jobids(_jobids),53 50 container(_container), 54 51 MatrixNrLookup(_MatrixNrLookup), … … 70 67 // create OrthogonalSummator instance 71 68 OrthogonalSummator<MapType, MapKey> sum_value( 72 subsetmap, data, jobids,container, MatrixNrLookup69 subsetmap, data, container, MatrixNrLookup 73 70 ); 74 71 const size_t MaxLevel = subsetmap->getMaximumSubsetLevel(); … … 86 83 //!> Hierarchy of IndexSet's 87 84 SubsetMap::ptr &subsetmap; 88 //!> vector of data converted from MPQCData 89 const std::vector<MapType> &data; 90 //!> vector of jobids 91 const std::vector<JobId_t> &jobids; 85 //!> map from jobids to data converted from MPQCData 86 const std::map<JobId_t, MapType> &data; 92 87 //!> container with all IndexSet's 93 88 const IndexSetContainer::Container_t &container; -
src/Fragmentation/Summation/AllLevelSummator.hpp
r995e2f rc9f9bb 34 34 * 35 35 * \param _subsetmap map with hierarchy of IndexSet's 36 * \param _data MPQCData converted to MPQCDataMap_t type 37 * \param _jobids job ids to sum data in correct order 36 * \param _data MPQCData converted to MPQCDataMap_t type, associated to job id 38 37 * \param _container container of IndexSet's such that each set has correct order 39 38 * to job id and hence to _data. … … 43 42 AllLevelSummator( 44 43 SubsetMap::ptr &_subsetmap, 45 const std::vector<MapType> &_data, 46 const std::vector<JobId_t> &_jobids, 44 const std::map<JobId_t, MapType> &_data, 47 45 const IndexSetContainer::Container_t &_container, 48 46 std::map< JobId_t, size_t > &_MatrixNrLookup, /* cannot make this const due to operator[] */ … … 50 48 subsetmap(_subsetmap), 51 49 data(_data), 52 jobids(_jobids),53 50 container(_container), 54 51 MatrixNrLookup(_MatrixNrLookup), … … 70 67 // create Summator instance 71 68 Summator<MapType, MapKey> sum_value( 72 subsetmap, data, jobids,container, MatrixNrLookup69 subsetmap, data, container, MatrixNrLookup 73 70 ); 74 71 const size_t MaxLevel = subsetmap->getMaximumSubsetLevel(); … … 87 84 SubsetMap::ptr &subsetmap; 88 85 //!> vector of data converted from MPQCData 89 const std::vector<MapType> &data; 90 //!> vector of jobids 91 const std::vector<JobId_t> &jobids; 86 const std::map<JobId_t, MapType> &data; 92 87 //!> container with all IndexSet's 93 88 const IndexSetContainer::Container_t &container; -
src/Fragmentation/Summation/OrthogonalFullSummator.hpp
r995e2f rc9f9bb 40 40 * 41 41 * \param _subsetmap map with hierarchy of IndexSet's 42 * \param _data MPQCData converted to MPQCDataMap_t type 43 * \param _jobids job ids to sum data in correct order 42 * \param _data MPQCData converted to MPQCDataMap_t type, associated to job id 44 43 * \param _container container of IndexSet's such that each set has correct order 45 44 * to job id and hence to _data. … … 48 47 OrthogonalFullSummator( 49 48 SubsetMap::ptr &_subsetmap, 50 const std::vector<MapType> &_data, 51 const std::vector<JobId_t> &_jobids, 49 const std::map<JobId_t, MapType> &_data, 52 50 const IndexSetContainer::Container_t &_container, 53 51 std::map< JobId_t, size_t > &_MatrixNrLookup) : /* cannot make this const due to operator[] */ 54 52 indices(getSubsets(_container)), 55 values(createValues(_data, _ jobids, _container, _MatrixNrLookup)),53 values(createValues(_data, _container, _MatrixNrLookup)), 56 54 OS(indices, values, _subsetmap) 57 55 { 58 56 ASSERT( _data.size() == _container.size(), 59 57 "OrthogonalFullSummator() - data and indices don't have same size."); 60 ASSERT( _data.size() == _jobids.size(), 61 "OrthogonalFullSummator() - data and ids don't have same size."); 62 ASSERT( _jobids.size() == _MatrixNrLookup.size(), 58 ASSERT( _data.size() == _MatrixNrLookup.size(), 63 59 "OrthogonalFullSummator() - ids and MatrixNrLookup don't have same size."); 64 60 } … … 107 103 * 108 104 * @param data 109 * @param jobids110 105 * @param container 111 106 * @param MatrixNrLookup … … 113 108 */ 114 109 typename OrthogonalSummation<MapValue>::InputValues_t createValues( 115 const std::vector<MapType> &data, 116 const std::vector<JobId_t> &jobids, 110 const std::map<JobId_t, MapType> &data, 117 111 const IndexSetContainer::Container_t &container, 118 112 std::map< JobId_t, size_t > &MatrixNrLookup) 119 113 { 120 114 typename OrthogonalSummation<MapValue>::InputValues_t values(container.size()); 121 typename std::vector<MapType>::const_iterator dataiter = data.begin();122 std::vector<size_t>::const_iterator iditer = jobids.begin();123 for (; dataiter != data.end(); ++dataiter, ++iditer) {124 const MapType &Data = *dataiter;115 for (typename std::map<JobId_t, MapType>::const_iterator dataiter = data.begin(); 116 dataiter != data.end(); ++dataiter) { 117 const MapType &Data = dataiter->second; 118 const JobId_t &jobid = dataiter->first; 125 119 const MapValue &value = boost::fusion::at_key<MapKey>(Data); 126 values[ MatrixNrLookup[ *iditer] ] = value;120 values[ MatrixNrLookup[jobid] ] = value; 127 121 } 128 122 return values; -
src/Fragmentation/Summation/OrthogonalSumUpPerLevel.hpp
r995e2f rc9f9bb 29 29 template <typename TypeMap, typename TypeVector> 30 30 std::vector<TypeMap> OrthogonalSumUpPerLevel( 31 const std::vector<MPQCData> &fragmentData, 32 const std::vector<JobId_t> &jobids, 31 const std::map<JobId_t, MPQCData> &fragmentData, 33 32 std::map< JobId_t, size_t > &MatrixNrLookup, 34 33 const IndexSetContainer::ptr &container, … … 37 36 { 38 37 // place data into boost::fusion::map instance 39 std:: vector<TypeMap> MPQCData_fused;38 std::map<JobId_t, TypeMap> MPQCData_fused; 40 39 convertDataTo<MPQCData, TypeMap>(fragmentData, MPQCData_fused); 41 40 // instantiate summator … … 44 43 subsetmap, 45 44 MPQCData_fused, 46 jobids,47 45 container->getContainer(), 48 46 MatrixNrLookup, -
src/Fragmentation/Summation/OrthogonalSummator.hpp
r995e2f rc9f9bb 63 63 * 64 64 * \param _subsetmap map with hierarchy of IndexSet's 65 * \param _data MPQCData converted to MPQCDataMap_t type 66 * \param _jobids job ids to sum data in correct order 65 * \param _data MPQCData converted to MPQCDataMap_t type, associated to job id 67 66 * \param _container container of IndexSet's such that each set has correct order 68 67 * to job id and hence to _data. … … 71 70 OrthogonalSummator( 72 71 SubsetMap::ptr &_subsetmap, 73 const std::vector<MapType> &_data, 74 const std::vector<JobId_t> &_jobids, 72 const std::map<JobId_t, MapType> &_data, 75 73 const IndexSetContainer::Container_t &_container, 76 74 std::map< JobId_t, size_t > &_MatrixNrLookup) : /* cannot make this const due to operator[] */ 77 75 indices(getSubsets(_data.size(),_container)), 78 values(createValues(_data, _ jobids, _container, _MatrixNrLookup)),76 values(createValues(_data, _container, _MatrixNrLookup)), 79 77 OS(indices, values, _subsetmap) 80 78 { 81 ASSERT( _data.size() == _jobids.size(), 82 "OrthogonalSummator() - data and ids don't have same size."); 83 ASSERT( _jobids.size() == _MatrixNrLookup.size(), 79 ASSERT( _data.size() == _MatrixNrLookup.size(), 84 80 "OrthogonalSummator() - ids and MatrixNrLookup don't have same size."); 85 81 } … … 124 120 * 125 121 * @param data 126 * @param jobids127 122 * @param container 128 123 * @param MatrixNrLookup … … 130 125 */ 131 126 typename OrthogonalSummation<MapValue>::InputValues_t createValues( 132 const std::vector<MapType> &data, 133 const std::vector<JobId_t> &jobids, 127 const std::map<JobId_t, MapType> &data, 134 128 const IndexSetContainer::Container_t &container, 135 129 std::map< JobId_t, size_t > &MatrixNrLookup) … … 137 131 // if the power set of , we don't need to get rid of the "union index set" 138 132 typename OrthogonalSummation<MapValue>::InputValues_t values(data.size()); 139 typename std::vector<MapType>::const_iterator dataiter = data.begin();140 std::vector<size_t>::const_iterator iditer = jobids.begin();141 for (; dataiter != data.end(); ++dataiter, ++iditer) {142 const MapType &Data = *dataiter;133 for (typename std::map<JobId_t, MapType>::const_iterator dataiter = data.begin(); 134 dataiter != data.end(); ++dataiter) { 135 const MapType &Data = dataiter->second; 136 const JobId_t &jobid = dataiter->first; 143 137 const MapValue &value = boost::fusion::at_key<MapKey>(Data); 144 values[ MatrixNrLookup[ *iditer] ] = value;138 values[ MatrixNrLookup[jobid] ] = value; 145 139 } 146 140 return values; -
src/Fragmentation/Summation/SumUpPerLevel.hpp
r995e2f rc9f9bb 28 28 template <typename TypeMap, typename TypeVector> 29 29 std::vector<TypeMap> SumUpPerLevel( 30 const std::vector<MPQCData> &fragmentData, 31 const std::vector<JobId_t> &jobids, 30 const std::map<JobId_t, MPQCData> &fragmentData, 32 31 std::map< JobId_t, size_t > &MatrixNrLookup, 33 32 const IndexSetContainer::ptr &container, … … 36 35 { 37 36 // place data into boost::fusion::map instance 38 std:: vector<TypeMap> MPQCData_fused;37 std::map<JobId_t, TypeMap> MPQCData_fused; 39 38 convertDataTo<MPQCData, TypeMap>(fragmentData, MPQCData_fused); 40 39 // instantiate summator … … 43 42 subsetmap, 44 43 MPQCData_fused, 45 jobids,46 44 container->getContainer(), 47 45 MatrixNrLookup, -
src/Fragmentation/Summation/Summator.hpp
r995e2f rc9f9bb 63 63 * 64 64 * \param _subsetmap map with hierarchy of IndexSet's 65 * \param _data MPQCData converted to MPQCDataMap_t type 66 * \param _jobids job ids to sum data in correct order 65 * \param _data MPQCData converted to MPQCDataMap_t type, associated to job id 67 66 * \param _container container of IndexSet's such that each set has correct order 68 67 * to job id and hence to _data. … … 71 70 Summator( 72 71 SubsetMap::ptr &_subsetmap, 73 const std::vector<MapType> &_data, 74 const std::vector<JobId_t> &_jobids, 72 const std::map<JobId_t, MapType> &_data, 75 73 const IndexSetContainer::Container_t &_container, 76 74 std::map< JobId_t, size_t > &_MatrixNrLookup) : /* cannot make this const due to operator[] */ 77 75 indices(getSubsets(_data.size(),_container)), 78 values(createValues(_data, _ jobids, _container, _MatrixNrLookup)),76 values(createValues(_data, _container, _MatrixNrLookup)), 79 77 OS(indices, values, _subsetmap) 80 78 { 81 ASSERT( _data.size() == _jobids.size(), 82 "Summator() - data and ids don't have same size."); 83 ASSERT( _jobids.size() == _MatrixNrLookup.size(), 79 ASSERT( _data.size() == _MatrixNrLookup.size(), 84 80 "Summator() - ids and MatrixNrLookup don't have same size."); 85 81 } … … 124 120 * 125 121 * @param data 126 * @param jobids127 122 * @param container 128 123 * @param MatrixNrLookup … … 130 125 */ 131 126 typename Summation<MapValue>::InputValues_t createValues( 132 const std::vector<MapType> &data, 133 const std::vector<JobId_t> &jobids, 127 const std::map<JobId_t, MapType> &data, 134 128 const IndexSetContainer::Container_t &container, 135 129 std::map< JobId_t, size_t > &MatrixNrLookup) … … 137 131 // if we just have one indexset, we don't need to get rid of the "union index set" 138 132 typename Summation<MapValue>::InputValues_t values(data.size()); 139 typename std::vector<MapType>::const_iterator dataiter = data.begin();140 std::vector<size_t>::const_iterator iditer = jobids.begin();141 for (; dataiter != data.end(); ++dataiter, ++iditer) {142 const MapType &Data = *dataiter;133 for (typename std::map<JobId_t, MapType>::const_iterator dataiter = data.begin(); 134 dataiter != data.end(); ++dataiter) { 135 const MapType &Data = dataiter->second; 136 const JobId_t &jobid = dataiter->first; 143 137 const MapValue &value = boost::fusion::at_key<MapKey>(Data); 144 values[ MatrixNrLookup[ *iditer] ] = value;138 values[ MatrixNrLookup[jobid] ] = value; 145 139 } 146 140 return values; -
src/UIElements/Makefile.am
r995e2f rc9f9bb 253 253 endif 254 254 libMolecuilderUI_la_LIBADD += \ 255 libMolecuilderFragmentationConverter.la \ 255 256 libMolecuilderFragmentationSummation.la \ 256 257 libMolecuilderFragmentationSetValues.la \
Note:
See TracChangeset
for help on using the changeset viewer.