| [0cd8cf] | 1 | /* | 
|---|
|  | 2 | * Project: MoleCuilder | 
|---|
|  | 3 | * Description: creates and alters molecular systems | 
|---|
|  | 4 | * Copyright (C)  2013 University of Bonn. All rights reserved. | 
|---|
| [5aaa43] | 5 | * Copyright (C)  2013 Frederik Heber. All rights reserved. | 
|---|
| [0cd8cf] | 6 | * | 
|---|
|  | 7 | * | 
|---|
|  | 8 | *   This file is part of MoleCuilder. | 
|---|
|  | 9 | * | 
|---|
|  | 10 | *    MoleCuilder is free software: you can redistribute it and/or modify | 
|---|
|  | 11 | *    it under the terms of the GNU General Public License as published by | 
|---|
|  | 12 | *    the Free Software Foundation, either version 2 of the License, or | 
|---|
|  | 13 | *    (at your option) any later version. | 
|---|
|  | 14 | * | 
|---|
|  | 15 | *    MoleCuilder is distributed in the hope that it will be useful, | 
|---|
|  | 16 | *    but WITHOUT ANY WARRANTY; without even the implied warranty of | 
|---|
|  | 17 | *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the | 
|---|
|  | 18 | *    GNU General Public License for more details. | 
|---|
|  | 19 | * | 
|---|
|  | 20 | *    You should have received a copy of the GNU General Public License | 
|---|
|  | 21 | *    along with MoleCuilder.  If not, see <http://www.gnu.org/licenses/>. | 
|---|
|  | 22 | */ | 
|---|
|  | 23 |  | 
|---|
|  | 24 | /* | 
|---|
|  | 25 | * FragmentationShortRangeResults.cpp | 
|---|
|  | 26 | * | 
|---|
|  | 27 | *  Created on: Mar 07, 2013 | 
|---|
|  | 28 | *      Author: heber | 
|---|
|  | 29 | */ | 
|---|
|  | 30 |  | 
|---|
|  | 31 |  | 
|---|
|  | 32 | // include config.h | 
|---|
|  | 33 | #ifdef HAVE_CONFIG_H | 
|---|
|  | 34 | #include <config.h> | 
|---|
|  | 35 | #endif | 
|---|
|  | 36 |  | 
|---|
|  | 37 | #include "CodePatterns/MemDebug.hpp" | 
|---|
|  | 38 |  | 
|---|
|  | 39 | #include "FragmentationShortRangeResults.hpp" | 
|---|
|  | 40 |  | 
|---|
| [c8d13f5] | 41 | #include <boost/fusion/container/map.hpp> | 
|---|
| [0cd8cf] | 42 | #include <boost/mpl/for_each.hpp> | 
|---|
|  | 43 | #include <boost/mpl/remove.hpp> | 
|---|
|  | 44 | #include <sstream> | 
|---|
|  | 45 |  | 
|---|
|  | 46 | #include "CodePatterns/Assert.hpp" | 
|---|
|  | 47 | #include "CodePatterns/Log.hpp" | 
|---|
|  | 48 |  | 
|---|
|  | 49 | #include "Fragmentation/KeySetsContainer.hpp" | 
|---|
| [fbf143] | 50 | #include "Fragmentation/parseKeySetFile.hpp" | 
|---|
|  | 51 | #include "Fragmentation/Summation/Converter/DataConverter.hpp" | 
|---|
|  | 52 | #include "Fragmentation/Summation/Containers/createMatrixNrLookup.hpp" | 
|---|
|  | 53 | #include "Fragmentation/Summation/Containers/extractJobIds.hpp" | 
|---|
| [0cd8cf] | 54 | #include "Fragmentation/Summation/AllLevelOrthogonalSummator.hpp" | 
|---|
|  | 55 | #include "Fragmentation/Summation/IndexSetContainer.hpp" | 
|---|
|  | 56 | #include "Fragmentation/Summation/OrthogonalSumUpPerLevel.hpp" | 
|---|
|  | 57 | #include "Fragmentation/Summation/SubsetMap.hpp" | 
|---|
|  | 58 | #include "Fragmentation/Summation/SumUpPerLevel.hpp" | 
|---|
|  | 59 |  | 
|---|
|  | 60 | #include "Helpers/defs.hpp" | 
|---|
|  | 61 |  | 
|---|
|  | 62 | FragmentationShortRangeResults::FragmentationShortRangeResults( | 
|---|
|  | 63 | const std::map<JobId_t,MPQCData> &fragmentData, | 
|---|
|  | 64 | const KeySetsContainer& _KeySet, | 
|---|
| [e0ae58d] | 65 | const KeySetsContainer& _ForceKeySet, | 
|---|
|  | 66 | std::vector<bool> &_ValueMask) : | 
|---|
| [0cd8cf] | 67 | KeySet(_KeySet), | 
|---|
|  | 68 | ForceKeySet(_ForceKeySet) | 
|---|
|  | 69 | { | 
|---|
| [e0ae58d] | 70 | initLookups(fragmentData,_ValueMask); | 
|---|
| [0cd8cf] | 71 |  | 
|---|
|  | 72 | // convert KeySetContainer to IndexSetContainer | 
|---|
|  | 73 | container.reset(new IndexSetContainer(KeySet)); | 
|---|
|  | 74 | // create the map of all keysets | 
|---|
|  | 75 | subsetmap.reset(new SubsetMap(*container)); | 
|---|
|  | 76 | } | 
|---|
|  | 77 |  | 
|---|
| [5281ff] | 78 | void FragmentationShortRangeResults::initLookups( | 
|---|
| [e0ae58d] | 79 | const std::map<JobId_t,MPQCData> &fragmentData, | 
|---|
|  | 80 | std::vector<bool> &_ValueMask) | 
|---|
| [5281ff] | 81 | { | 
|---|
|  | 82 | // create lookup from job nr to fragment number | 
|---|
|  | 83 | size_t MPQCFragmentCounter = 0; | 
|---|
|  | 84 | const std::vector<JobId_t> mpqcjobids = extractJobIds<MPQCData>(fragmentData); | 
|---|
|  | 85 | MPQCMatrixNrLookup = | 
|---|
| [e0ae58d] | 86 | createMatrixNrLookup(mpqcjobids, MPQCFragmentCounter, _ValueMask); | 
|---|
| [5281ff] | 87 | } | 
|---|
|  | 88 |  | 
|---|
| [0cd8cf] | 89 | void FragmentationShortRangeResults::operator()( | 
|---|
|  | 90 | const std::map<JobId_t,MPQCData> &fragmentData) | 
|---|
|  | 91 | { | 
|---|
|  | 92 | MaxLevel = subsetmap->getMaximumSetLevel(); | 
|---|
|  | 93 | LOG(1, "INFO: Summing up results till level " << MaxLevel << "."); | 
|---|
|  | 94 | /// convert all MPQCData to MPQCDataMap_t | 
|---|
|  | 95 | { | 
|---|
|  | 96 | ASSERT( ForceKeySet.KeySets.size() == fragmentData.size(), | 
|---|
|  | 97 | "FragmentationShortRangeResults::FragmentationShortRangeResults() - ForceKeySet's KeySets and fragmentData differ in size."); | 
|---|
|  | 98 |  | 
|---|
|  | 99 | OrthogonalSumUpPerLevel<MPQCDataEnergyMap_t, MPQCData, MPQCDataEnergyVector_t>( | 
|---|
|  | 100 | fragmentData, MPQCMatrixNrLookup, container, subsetmap, | 
|---|
|  | 101 | Result_Energy_fused, Result_perIndexSet_Energy); | 
|---|
| [d76d65] | 102 | OrthogonalSumUpPerLevel<MPQCDataFragmentMap_t, MPQCData, MPQCDataFragmentVector_t>( | 
|---|
|  | 103 | fragmentData, MPQCMatrixNrLookup, container, subsetmap, | 
|---|
|  | 104 | Result_Fragment_fused, Result_perIndexSet_Fragment); | 
|---|
| [0cd8cf] | 105 | SumUpPerLevel<MPQCDataTimeMap_t, MPQCData, MPQCDataTimeVector_t>( | 
|---|
|  | 106 | fragmentData, MPQCMatrixNrLookup, container, subsetmap, | 
|---|
|  | 107 | Result_Time_fused, Result_perIndexSet_Time); | 
|---|
|  | 108 |  | 
|---|
|  | 109 | // force has extra data converter | 
|---|
|  | 110 | std::map<JobId_t, MPQCDataForceMap_t> MPQCData_Force_fused; | 
|---|
| [94db13] | 111 | convertDatatoForceMap<MPQCData, MPQCDataForceMap_t, MPQCDataFused>(fragmentData, ForceKeySet, MPQCData_Force_fused); | 
|---|
| [0cd8cf] | 112 | Result_Force_fused.resize(MaxLevel); // we need the results of correct size already | 
|---|
|  | 113 | AllLevelOrthogonalSummator<MPQCDataForceMap_t> forceSummer( | 
|---|
|  | 114 | subsetmap, | 
|---|
|  | 115 | MPQCData_Force_fused, | 
|---|
|  | 116 | container->getContainer(), | 
|---|
|  | 117 | MPQCMatrixNrLookup, | 
|---|
|  | 118 | Result_Force_fused, | 
|---|
|  | 119 | Result_perIndexSet_Force); | 
|---|
|  | 120 | boost::mpl::for_each<MPQCDataForceVector_t>(boost::ref(forceSummer)); | 
|---|
|  | 121 | } | 
|---|
|  | 122 | } | 
|---|
| [c8d13f5] | 123 |  | 
|---|
|  | 124 | const FragmentationShortRangeResults::summedshortrange_t | 
|---|
|  | 125 | FragmentationShortRangeResults::getSummedShortRangeResults() const | 
|---|
|  | 126 | { | 
|---|
|  | 127 | summedshortrange_t results; | 
|---|
| [eddab7] | 128 | typedef std::map< | 
|---|
|  | 129 | IndexSet::ptr, | 
|---|
|  | 130 | std::pair<MPQCDataEnergyMap_t,MPQCDataEnergyMap_t> | 
|---|
|  | 131 | >::const_iterator maptype_citer_t; | 
|---|
|  | 132 | for (maptype_citer_t resultiter = Result_perIndexSet_Energy.begin(); | 
|---|
| [c8d13f5] | 133 | resultiter != Result_perIndexSet_Energy.end(); ++resultiter) { | 
|---|
|  | 134 | MPQCData values; | 
|---|
|  | 135 | values.energies.total = boost::fusion::at_key<MPQCDataFused::energy_total>(resultiter->second.first); | 
|---|
|  | 136 | MPQCData contributions; | 
|---|
|  | 137 | contributions.energies.total = boost::fusion::at_key<MPQCDataFused::energy_total>(resultiter->second.second); | 
|---|
|  | 138 | results.insert( std::make_pair( resultiter->first, std::make_pair(values, contributions) ) ); | 
|---|
|  | 139 | } | 
|---|
|  | 140 | return results; | 
|---|
|  | 141 | } | 
|---|