| [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);
 | 
|---|
 | 102 |     SumUpPerLevel<MPQCDataTimeMap_t, MPQCData, MPQCDataTimeVector_t>(
 | 
|---|
 | 103 |         fragmentData, MPQCMatrixNrLookup, container, subsetmap,
 | 
|---|
 | 104 |         Result_Time_fused, Result_perIndexSet_Time);
 | 
|---|
 | 105 | 
 | 
|---|
 | 106 |     // force has extra data converter
 | 
|---|
 | 107 |     std::map<JobId_t, MPQCDataForceMap_t> MPQCData_Force_fused;
 | 
|---|
 | 108 |     convertMPQCDatatoForceMap(fragmentData, ForceKeySet, MPQCData_Force_fused);
 | 
|---|
 | 109 |     Result_Force_fused.resize(MaxLevel); // we need the results of correct size already
 | 
|---|
 | 110 |     AllLevelOrthogonalSummator<MPQCDataForceMap_t> forceSummer(
 | 
|---|
 | 111 |                 subsetmap,
 | 
|---|
 | 112 |                 MPQCData_Force_fused,
 | 
|---|
 | 113 |                 container->getContainer(),
 | 
|---|
 | 114 |                 MPQCMatrixNrLookup,
 | 
|---|
 | 115 |                 Result_Force_fused,
 | 
|---|
 | 116 |                 Result_perIndexSet_Force);
 | 
|---|
 | 117 |     boost::mpl::for_each<MPQCDataForceVector_t>(boost::ref(forceSummer));
 | 
|---|
 | 118 |   }
 | 
|---|
 | 119 | }
 | 
|---|
| [c8d13f5] | 120 | 
 | 
|---|
 | 121 | const FragmentationShortRangeResults::summedshortrange_t
 | 
|---|
 | 122 | FragmentationShortRangeResults::getSummedShortRangeResults() const
 | 
|---|
 | 123 | {
 | 
|---|
 | 124 |   summedshortrange_t results;
 | 
|---|
 | 125 |   typedef std::map<IndexSet::ptr, std::pair<MPQCDataEnergyMap_t,MPQCDataEnergyMap_t> > maptype_t;
 | 
|---|
 | 126 |   for (typename maptype_t::const_iterator resultiter = Result_perIndexSet_Energy.begin();
 | 
|---|
 | 127 |       resultiter != Result_perIndexSet_Energy.end(); ++resultiter) {
 | 
|---|
 | 128 |     MPQCData values;
 | 
|---|
 | 129 |     values.energies.total = boost::fusion::at_key<MPQCDataFused::energy_total>(resultiter->second.first);
 | 
|---|
 | 130 |     MPQCData contributions;
 | 
|---|
 | 131 |     contributions.energies.total = boost::fusion::at_key<MPQCDataFused::energy_total>(resultiter->second.second);
 | 
|---|
 | 132 |     results.insert( std::make_pair( resultiter->first, std::make_pair(values, contributions) ) );
 | 
|---|
 | 133 |   }
 | 
|---|
 | 134 |   return results;
 | 
|---|
 | 135 | }
 | 
|---|