[c40e15d] | 1 | /*
|
---|
[ff9963] | 2 | * AllLevelSummator.hpp
|
---|
[c40e15d] | 3 | *
|
---|
| 4 | * Created on: 29.07.2012
|
---|
| 5 | * Author: heber
|
---|
| 6 | */
|
---|
| 7 |
|
---|
[ff9963] | 8 | #ifndef ALLLEVELSUMMATOR_HPP_
|
---|
| 9 | #define ALLLEVELSUMMATOR_HPP_
|
---|
[c40e15d] | 10 |
|
---|
| 11 | // include config.h
|
---|
| 12 | #ifdef HAVE_CONFIG_H
|
---|
| 13 | #include <config.h>
|
---|
| 14 | #endif
|
---|
| 15 |
|
---|
| 16 | #include <vector>
|
---|
| 17 |
|
---|
[ff9963] | 18 | #include "CodePatterns/Assert.hpp"
|
---|
| 19 |
|
---|
[c40e15d] | 20 | #include "Fragmentation/Summation/IndexSetContainer.hpp"
|
---|
| 21 | #include "Fragmentation/Summation/SubsetMap.hpp"
|
---|
| 22 | #include "Fragmentation/Summation/Summator.hpp"
|
---|
| 23 |
|
---|
| 24 | #include "Fragmentation/Summation/printKeyNames.hpp"
|
---|
| 25 |
|
---|
[ff9963] | 26 | /** Tiny template functor to use Summation, sum up each level, and store the
|
---|
| 27 | * result in a given vector.
|
---|
[c40e15d] | 28 | *
|
---|
| 29 | */
|
---|
| 30 | template <typename MapType>
|
---|
[ff9963] | 31 | struct AllLevelSummator {
|
---|
[c40e15d] | 32 | /** Constructor takes the arguments that \a Summator also needs and stores
|
---|
| 33 | * them internally.
|
---|
| 34 | *
|
---|
| 35 | * \param _subsetmap map with hierarchy of IndexSet's
|
---|
[c9f9bb] | 36 | * \param _data MPQCData converted to MPQCDataMap_t type, associated to job id
|
---|
[c40e15d] | 37 | * \param _container container of IndexSet's such that each set has correct order
|
---|
| 38 | * to job id and hence to _data.
|
---|
| 39 | * \param _MatrixNrLookup lookup from job id to ordering in above vectors
|
---|
[b8f0b25] | 40 | * \param _levelresults vector place levelresults into
|
---|
[c40e15d] | 41 | */
|
---|
[ff9963] | 42 | AllLevelSummator(
|
---|
[c40e15d] | 43 | SubsetMap::ptr &_subsetmap,
|
---|
[c9f9bb] | 44 | const std::map<JobId_t, MapType> &_data,
|
---|
[c40e15d] | 45 | const IndexSetContainer::Container_t &_container,
|
---|
[3dd32f] | 46 | const std::map< JobId_t, size_t > &_MatrixNrLookup,
|
---|
[b8f0b25] | 47 | std::vector<MapType> &_levelresults,
|
---|
[79398d] | 48 | std::map<IndexSet::ptr, std::pair<MapType, MapType> > &_keysetresults) :
|
---|
[c40e15d] | 49 | subsetmap(_subsetmap),
|
---|
| 50 | data(_data),
|
---|
| 51 | container(_container),
|
---|
[ff9963] | 52 | MatrixNrLookup(_MatrixNrLookup),
|
---|
[b8f0b25] | 53 | levelresults(_levelresults),
|
---|
| 54 | keysetresults(_keysetresults)
|
---|
[ff9963] | 55 | {
|
---|
[b8f0b25] | 56 | ASSERT( levelresults.size() >= subsetmap->getMaximumSetLevel(),
|
---|
[ff9963] | 57 | "AllLevelSummator() - result vector is not large enough.");
|
---|
| 58 | }
|
---|
[c40e15d] | 59 |
|
---|
| 60 | /** Operator that calls on Summator and prints the value.
|
---|
| 61 | *
|
---|
| 62 | * \note the parameter is needed for boost::mpl::for_each but is not
|
---|
| 63 | * used here.
|
---|
| 64 | */
|
---|
| 65 | template <typename MapKey>
|
---|
| 66 | void operator()(MapKey &) {
|
---|
| 67 | // We retrieve the type of the MPQCData member variable from the boost::fusion::map.
|
---|
| 68 | typedef typename boost::fusion::result_of::value_at_key<MapType, MapKey>::type MapValue;
|
---|
[b8f0b25] | 69 |
|
---|
[c40e15d] | 70 | // create Summator instance
|
---|
| 71 | Summator<MapType, MapKey> sum_value(
|
---|
[c9f9bb] | 72 | subsetmap, data, container, MatrixNrLookup
|
---|
[c40e15d] | 73 | );
|
---|
[b8f0b25] | 74 |
|
---|
| 75 | // fill levelresults
|
---|
[19c50e] | 76 | const size_t MaxLevel = subsetmap->getMaximumSetLevel();
|
---|
[ff9963] | 77 | for (size_t level=1; level <= MaxLevel; ++level) {
|
---|
[b8f0b25] | 78 | MapType &LevelResults = levelresults[level-1];
|
---|
| 79 | // sum up and store in levelresults
|
---|
[ff9963] | 80 | const MapValue value = sum_value(level);
|
---|
| 81 | boost::fusion::at_key<MapKey>(LevelResults) = value;
|
---|
| 82 | // print value
|
---|
| 83 | //LOG(0, "STATUS: Level " << level << " resulting " << printKeyNames::printName<MapKey>() << " is " << value << ".");
|
---|
| 84 | }
|
---|
[b8f0b25] | 85 |
|
---|
| 86 | // fill keysetresults
|
---|
| 87 | for (IndexSetContainer::Container_t::const_iterator indexsetiter = container.begin();
|
---|
| 88 | indexsetiter != container.end(); ++indexsetiter) {
|
---|
| 89 | const IndexSet::ptr &index = *indexsetiter;
|
---|
| 90 | // this either generates a new entry or updates the present one, as we obtain ref to value
|
---|
[79398d] | 91 | boost::fusion::at_key<MapKey>(keysetresults[index].first) =
|
---|
| 92 | sum_value.getValueForIndexSet(index);
|
---|
| 93 | boost::fusion::at_key<MapKey>(keysetresults[index].second) =
|
---|
[b8f0b25] | 94 | sum_value.getContributionForIndexSet(index);
|
---|
| 95 | }
|
---|
[c40e15d] | 96 | }
|
---|
| 97 |
|
---|
| 98 | private:
|
---|
| 99 | //!> Hierarchy of IndexSet's
|
---|
| 100 | SubsetMap::ptr &subsetmap;
|
---|
| 101 | //!> vector of data converted from MPQCData
|
---|
[c9f9bb] | 102 | const std::map<JobId_t, MapType> &data;
|
---|
[c40e15d] | 103 | //!> container with all IndexSet's
|
---|
| 104 | const IndexSetContainer::Container_t &container;
|
---|
| 105 | //!> lookup map from job ids to ordering in above vectors
|
---|
[3dd32f] | 106 | const std::map< JobId_t, size_t > &MatrixNrLookup;
|
---|
[b8f0b25] | 107 | //!> vector of levelresults
|
---|
| 108 | std::vector<MapType> &levelresults;
|
---|
[79398d] | 109 | typedef std::pair< IndexSet::ptr, std::pair<MapType, MapType> > keysetresults_pair_t;
|
---|
[b8f0b25] | 110 | //!> typedef for map for keyset and each resulting value
|
---|
[79398d] | 111 | typedef std::map<IndexSet::ptr, std::pair<MapType, MapType> > keysetresults_t;
|
---|
[b8f0b25] | 112 | //!> map for IndexSet and its associated contribution
|
---|
| 113 | keysetresults_t &keysetresults;
|
---|
[c40e15d] | 114 | };
|
---|
| 115 |
|
---|
[ff9963] | 116 | #endif /* ALLLEVELSUMMATOR_HPP_ */
|
---|