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