| 1 | /* | 
|---|
| 2 | * Project: MoleCuilder | 
|---|
| 3 | * Description: creates and alters molecular systems | 
|---|
| 4 | * Copyright (C)  2013 University of Bonn. All rights reserved. | 
|---|
| 5 | * Copyright (C)  2013 Frederik Heber. All rights reserved. | 
|---|
| 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 |  | 
|---|
| 41 | #include <boost/mpl/for_each.hpp> | 
|---|
| 42 | #include <boost/mpl/remove.hpp> | 
|---|
| 43 | #include <sstream> | 
|---|
| 44 |  | 
|---|
| 45 | #include "CodePatterns/Assert.hpp" | 
|---|
| 46 | #include "CodePatterns/Log.hpp" | 
|---|
| 47 |  | 
|---|
| 48 | #include "Fragmentation/KeySetsContainer.hpp" | 
|---|
| 49 | #include "Fragmentation/parseKeySetFile.hpp" | 
|---|
| 50 | #include "Fragmentation/Summation/Converter/DataConverter.hpp" | 
|---|
| 51 | #include "Fragmentation/Summation/Containers/createMatrixNrLookup.hpp" | 
|---|
| 52 | #include "Fragmentation/Summation/Containers/extractJobIds.hpp" | 
|---|
| 53 | #include "Fragmentation/Summation/AllLevelOrthogonalSummator.hpp" | 
|---|
| 54 | #include "Fragmentation/Summation/IndexSetContainer.hpp" | 
|---|
| 55 | #include "Fragmentation/Summation/OrthogonalSumUpPerLevel.hpp" | 
|---|
| 56 | #include "Fragmentation/Summation/SubsetMap.hpp" | 
|---|
| 57 | #include "Fragmentation/Summation/SumUpPerLevel.hpp" | 
|---|
| 58 |  | 
|---|
| 59 | #include "Helpers/defs.hpp" | 
|---|
| 60 |  | 
|---|
| 61 | FragmentationShortRangeResults::FragmentationShortRangeResults( | 
|---|
| 62 | const std::map<JobId_t,MPQCData> &fragmentData, | 
|---|
| 63 | const KeySetsContainer& _KeySet, | 
|---|
| 64 | const KeySetsContainer& _ForceKeySet) : | 
|---|
| 65 | KeySet(_KeySet), | 
|---|
| 66 | ForceKeySet(_ForceKeySet) | 
|---|
| 67 | { | 
|---|
| 68 | initLookups(fragmentData); | 
|---|
| 69 |  | 
|---|
| 70 | // convert KeySetContainer to IndexSetContainer | 
|---|
| 71 | container.reset(new IndexSetContainer(KeySet)); | 
|---|
| 72 | // create the map of all keysets | 
|---|
| 73 | subsetmap.reset(new SubsetMap(*container)); | 
|---|
| 74 | } | 
|---|
| 75 |  | 
|---|
| 76 | void FragmentationShortRangeResults::initLookups( | 
|---|
| 77 | const std::map<JobId_t,MPQCData> &fragmentData) | 
|---|
| 78 | { | 
|---|
| 79 | // create lookup from job nr to fragment number | 
|---|
| 80 | size_t MPQCFragmentCounter = 0; | 
|---|
| 81 | const std::vector<JobId_t> mpqcjobids = extractJobIds<MPQCData>(fragmentData); | 
|---|
| 82 | MPQCMatrixNrLookup = | 
|---|
| 83 | createMatrixNrLookup(mpqcjobids, MPQCFragmentCounter); | 
|---|
| 84 | } | 
|---|
| 85 |  | 
|---|
| 86 | void FragmentationShortRangeResults::operator()( | 
|---|
| 87 | const std::map<JobId_t,MPQCData> &fragmentData) | 
|---|
| 88 | { | 
|---|
| 89 | MaxLevel = subsetmap->getMaximumSetLevel(); | 
|---|
| 90 | LOG(1, "INFO: Summing up results till level " << MaxLevel << "."); | 
|---|
| 91 | /// convert all MPQCData to MPQCDataMap_t | 
|---|
| 92 | { | 
|---|
| 93 | ASSERT( ForceKeySet.KeySets.size() == fragmentData.size(), | 
|---|
| 94 | "FragmentationShortRangeResults::FragmentationShortRangeResults() - ForceKeySet's KeySets and fragmentData differ in size."); | 
|---|
| 95 |  | 
|---|
| 96 | OrthogonalSumUpPerLevel<MPQCDataEnergyMap_t, MPQCData, MPQCDataEnergyVector_t>( | 
|---|
| 97 | fragmentData, MPQCMatrixNrLookup, container, subsetmap, | 
|---|
| 98 | Result_Energy_fused, Result_perIndexSet_Energy); | 
|---|
| 99 | SumUpPerLevel<MPQCDataTimeMap_t, MPQCData, MPQCDataTimeVector_t>( | 
|---|
| 100 | fragmentData, MPQCMatrixNrLookup, container, subsetmap, | 
|---|
| 101 | Result_Time_fused, Result_perIndexSet_Time); | 
|---|
| 102 |  | 
|---|
| 103 | // force has extra data converter | 
|---|
| 104 | std::map<JobId_t, MPQCDataForceMap_t> MPQCData_Force_fused; | 
|---|
| 105 | convertMPQCDatatoForceMap(fragmentData, ForceKeySet, MPQCData_Force_fused); | 
|---|
| 106 | Result_Force_fused.resize(MaxLevel); // we need the results of correct size already | 
|---|
| 107 | AllLevelOrthogonalSummator<MPQCDataForceMap_t> forceSummer( | 
|---|
| 108 | subsetmap, | 
|---|
| 109 | MPQCData_Force_fused, | 
|---|
| 110 | container->getContainer(), | 
|---|
| 111 | MPQCMatrixNrLookup, | 
|---|
| 112 | Result_Force_fused, | 
|---|
| 113 | Result_perIndexSet_Force); | 
|---|
| 114 | boost::mpl::for_each<MPQCDataForceVector_t>(boost::ref(forceSummer)); | 
|---|
| 115 | } | 
|---|
| 116 | } | 
|---|