| 1 | /*
 | 
|---|
| 2 |  * OrthogonalSummation.hpp
 | 
|---|
| 3 |  *
 | 
|---|
| 4 |  *  Created on: Jun 25, 2012
 | 
|---|
| 5 |  *      Author: heber
 | 
|---|
| 6 |  */
 | 
|---|
| 7 | 
 | 
|---|
| 8 | #ifndef ORTHOGONALSUMMATION_HPP_
 | 
|---|
| 9 | #define ORTHOGONALSUMMATION_HPP_
 | 
|---|
| 10 | 
 | 
|---|
| 11 | 
 | 
|---|
| 12 | // include config.h
 | 
|---|
| 13 | #ifdef HAVE_CONFIG_H
 | 
|---|
| 14 | #include <config.h>
 | 
|---|
| 15 | #endif
 | 
|---|
| 16 | 
 | 
|---|
| 17 | #include <map>
 | 
|---|
| 18 | 
 | 
|---|
| 19 | #include "SetValue.hpp"
 | 
|---|
| 20 | #include "SubsetMap.hpp"
 | 
|---|
| 21 | #include "SetValueMap.hpp"
 | 
|---|
| 22 | 
 | 
|---|
| 23 | /** OrthogonalSummation is a functor executing an orthogonal summation of SetValue's
 | 
|---|
| 24 |  * that are each associated to a certain IndexSet whose union is a SetOfIndexSets.
 | 
|---|
| 25 |  *
 | 
|---|
| 26 |  *  For the given class we require the following functions:
 | 
|---|
| 27 |  *  -# operator=(): assignment operator for placement in vector
 | 
|---|
| 28 |  *  -# operator+=(): addition operator for adding one instance from another
 | 
|---|
| 29 |  *  -# operator-=(): subtraction operator for subtracting one instance from another
 | 
|---|
| 30 |  *  -# operator<<(): output operator
 | 
|---|
| 31 |  */
 | 
|---|
| 32 | template <class T>
 | 
|---|
| 33 | class OrthogonalSummation
 | 
|---|
| 34 | {
 | 
|---|
| 35 | public:
 | 
|---|
| 36 |   typedef std::vector< IndexSet::ptr > InputSets_t;
 | 
|---|
| 37 |   typedef std::vector< T > InputValues_t;
 | 
|---|
| 38 |   OrthogonalSummation(InputSets_t &indices, InputValues_t& values, SubsetMap::ptr _subsetmap = SubsetMap::ptr());
 | 
|---|
| 39 | 
 | 
|---|
| 40 |   /** Performs the orthogonal summation and returns result.
 | 
|---|
| 41 |    *
 | 
|---|
| 42 |    * @param level sum up to this level
 | 
|---|
| 43 |    * @return resulting value
 | 
|---|
| 44 |    */
 | 
|---|
| 45 |   T operator()(const size_t level) const;
 | 
|---|
| 46 | 
 | 
|---|
| 47 |   /** Returns const reference to internal setvalues.
 | 
|---|
| 48 |    *
 | 
|---|
| 49 |    * @return const reference to internal setvalues.
 | 
|---|
| 50 |    */
 | 
|---|
| 51 |   const SetValueMap<T> & getSetValues() const {
 | 
|---|
| 52 |     return setvalues;
 | 
|---|
| 53 |   }
 | 
|---|
| 54 | 
 | 
|---|
| 55 |   /** Setter for the zero instance to use as the base in summation.
 | 
|---|
| 56 |    *
 | 
|---|
| 57 |    * This may be used to force some parameters in the summation. We
 | 
|---|
| 58 |    * will use this value to set the initial value and all contributions
 | 
|---|
| 59 |    * are added via operator+(). E.g. In summing SamplingGrid (charge
 | 
|---|
| 60 |    * grids) we may use this instance to enforce a smaller grid size
 | 
|---|
| 61 |    * in the summation of the contributions if fragments have been
 | 
|---|
| 62 |    * calculated at a much higher grid level.
 | 
|---|
| 63 |    *
 | 
|---|
| 64 |    * \param _zeroinstance
 | 
|---|
| 65 |    */
 | 
|---|
| 66 |   void setZeroInstance(const T &_zeroinstance)
 | 
|---|
| 67 |   {
 | 
|---|
| 68 |     zeroinstance = _zeroinstance;
 | 
|---|
| 69 |   }
 | 
|---|
| 70 | 
 | 
|---|
| 71 | private:
 | 
|---|
| 72 |   T Sum(const size_t level) const;
 | 
|---|
| 73 | 
 | 
|---|
| 74 | private:
 | 
|---|
| 75 |   //!> SubsetTree with the tree-like structure of subsets
 | 
|---|
| 76 |   SubsetMap::ptr subsetmap;
 | 
|---|
| 77 |   //!> set of all subset values
 | 
|---|
| 78 |   SetValueMap<T> setvalues;
 | 
|---|
| 79 |   //!> base/"zero" instance to sum upon, defaults to ZeroInstance<T>
 | 
|---|
| 80 |   T zeroinstance;
 | 
|---|
| 81 | };
 | 
|---|
| 82 | 
 | 
|---|
| 83 | #include "OrthogonalSummation_impl.hpp"
 | 
|---|
| 84 | 
 | 
|---|
| 85 | #endif /* ORTHOGONALSUMMATION_HPP_ */
 | 
|---|