Changeset c9f9bb for src/Fragmentation/Summation
- Timestamp:
- Nov 27, 2012, 8:35:34 AM (13 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/Fragmentation/Summation
- Files:
-
- 7 edited
Legend:
- Unmodified
- Added
- Removed
-
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;
Note:
See TracChangeset
for help on using the changeset viewer.