| 1 | /*
 | 
|---|
| 2 |  * Project: MoleCuilder
 | 
|---|
| 3 |  * Description: creates and alters molecular systems
 | 
|---|
| 4 |  * Copyright (C)  2012 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 |  * SamplingGrid.cpp
 | 
|---|
| 25 |  *
 | 
|---|
| 26 |  *  Created on: 25.07.2012
 | 
|---|
| 27 |  *      Author: heber
 | 
|---|
| 28 |  */
 | 
|---|
| 29 | 
 | 
|---|
| 30 | // include config.h
 | 
|---|
| 31 | #ifdef HAVE_CONFIG_H
 | 
|---|
| 32 | #include <config.h>
 | 
|---|
| 33 | #endif
 | 
|---|
| 34 | 
 | 
|---|
| 35 | // include headers that implement a archive in simple text format
 | 
|---|
| 36 | // otherwise BOOST_CLASS_EXPORT_IMPLEMENT has no effect
 | 
|---|
| 37 | #include <boost/archive/text_oarchive.hpp>
 | 
|---|
| 38 | #include <boost/archive/text_iarchive.hpp>
 | 
|---|
| 39 | 
 | 
|---|
| 40 | #include "CodePatterns/MemDebug.hpp"
 | 
|---|
| 41 | 
 | 
|---|
| 42 | #include "Jobs/Grid/SamplingGrid.hpp"
 | 
|---|
| 43 | 
 | 
|---|
| 44 | #include "CodePatterns/Assert.hpp"
 | 
|---|
| 45 | #include "CodePatterns/Log.hpp"
 | 
|---|
| 46 | 
 | 
|---|
| 47 | SamplingGrid::SamplingGrid(const double _begin[3],
 | 
|---|
| 48 |     const double _size,
 | 
|---|
| 49 |     const int _level,
 | 
|---|
| 50 |     const sampledvalues_t &_sampled_grid) :
 | 
|---|
| 51 |   SamplingGridProperties(_begin, _size, _level),
 | 
|---|
| 52 |   sampled_grid(_sampled_grid)
 | 
|---|
| 53 | {}
 | 
|---|
| 54 | 
 | 
|---|
| 55 | SamplingGrid::SamplingGrid(const SamplingGrid &_grid) :
 | 
|---|
| 56 |   SamplingGridProperties(_grid),
 | 
|---|
| 57 |   sampled_grid(_grid.sampled_grid)
 | 
|---|
| 58 | {}
 | 
|---|
| 59 | 
 | 
|---|
| 60 | SamplingGrid::SamplingGrid(const SamplingGridProperties &_props) :
 | 
|---|
| 61 |   SamplingGridProperties(_props)
 | 
|---|
| 62 | {}
 | 
|---|
| 63 | 
 | 
|---|
| 64 | SamplingGrid::SamplingGrid(
 | 
|---|
| 65 |     const SamplingGridProperties &_props,
 | 
|---|
| 66 |     const sampledvalues_t &_sampled_grid) :
 | 
|---|
| 67 |   SamplingGridProperties(_props),
 | 
|---|
| 68 |   sampled_grid(_sampled_grid)
 | 
|---|
| 69 | {}
 | 
|---|
| 70 | 
 | 
|---|
| 71 | SamplingGrid::~SamplingGrid()
 | 
|---|
| 72 | {}
 | 
|---|
| 73 | 
 | 
|---|
| 74 | SamplingGrid& SamplingGrid::operator=(const SamplingGrid& other)
 | 
|---|
| 75 | {
 | 
|---|
| 76 |   // check for self-assignment
 | 
|---|
| 77 |   if (this != &other) {
 | 
|---|
| 78 |     static_cast<SamplingGridProperties &>(*this) = other;
 | 
|---|
| 79 |     sampled_grid = other.sampled_grid;
 | 
|---|
| 80 |   }
 | 
|---|
| 81 |   return *this;
 | 
|---|
| 82 | }
 | 
|---|
| 83 | 
 | 
|---|
| 84 | SamplingGrid& SamplingGrid::operator*=(const SamplingGrid& other)
 | 
|---|
| 85 | {
 | 
|---|
| 86 |   // check that grids are compatible
 | 
|---|
| 87 |   if (isCompatible(other)) {
 | 
|---|
| 88 |     sampledvalues_t::iterator iter = sampled_grid.begin();
 | 
|---|
| 89 |     sampledvalues_t::const_iterator otheriter = other.sampled_grid.begin();
 | 
|---|
| 90 |     for(; iter != sampled_grid.end(); ++iter, ++otheriter )
 | 
|---|
| 91 |       *iter *= (*otheriter);
 | 
|---|
| 92 |   } else {
 | 
|---|
| 93 |     ASSERT(0, "SamplingGrid::operator*=() - superposing incompatible grids is so far not in the cards.");
 | 
|---|
| 94 |   }
 | 
|---|
| 95 |   return *this;
 | 
|---|
| 96 | }
 | 
|---|
| 97 | 
 | 
|---|
| 98 | void SamplingGrid::superposeOtherGrids(const SamplingGrid &other, const double prefactor)
 | 
|---|
| 99 | {
 | 
|---|
| 100 |   // check that grids are compatible
 | 
|---|
| 101 |   if (isCompatible(other)) {
 | 
|---|
| 102 |     // then add other's grid onto this one
 | 
|---|
| 103 |     sampledvalues_t::iterator iter = sampled_grid.begin();
 | 
|---|
| 104 |     sampledvalues_t::const_iterator otheriter = other.sampled_grid.begin();
 | 
|---|
| 105 |     for(; iter != sampled_grid.end(); ++iter, ++otheriter )
 | 
|---|
| 106 |       *iter += prefactor * (*otheriter);
 | 
|---|
| 107 |   } else {
 | 
|---|
| 108 |     ASSERT(0, "SamplingGrid::superposeOtherGrids() - superposing incompatible grids is so far not in the cards.");
 | 
|---|
| 109 |   }
 | 
|---|
| 110 | }
 | 
|---|
| 111 | 
 | 
|---|
| 112 | double SamplingGrid::integral() const
 | 
|---|
| 113 | {
 | 
|---|
| 114 |   const size_t gridpoints = pow(2, level);
 | 
|---|
| 115 |   const double volume_element = pow(size/(double)gridpoints, 3);
 | 
|---|
| 116 |   double int_value = 0.;
 | 
|---|
| 117 |   for (sampledvalues_t::const_iterator iter = sampled_grid.begin();
 | 
|---|
| 118 |       iter != sampled_grid.end();
 | 
|---|
| 119 |       ++iter)
 | 
|---|
| 120 |     int_value += *iter;
 | 
|---|
| 121 |   int_value *= volume_element;
 | 
|---|
| 122 |   LOG(2, "DEBUG: SamplingGrid::integral() is " << scientific << setprecision(13) << int_value << ".");
 | 
|---|
| 123 |   return int_value;
 | 
|---|
| 124 | }
 | 
|---|
| 125 | 
 | 
|---|
| 126 | double SamplingGrid::integral(const SamplingGrid &weight) const
 | 
|---|
| 127 | {
 | 
|---|
| 128 |   if (isCompatible(weight)) {
 | 
|---|
| 129 |     const size_t gridpoints = pow(2, level);
 | 
|---|
| 130 |     const double volume_element = pow(size/(double)gridpoints, 3);
 | 
|---|
| 131 |     double int_value = 0.;
 | 
|---|
| 132 |     sampledvalues_t::const_iterator iter = sampled_grid.begin();
 | 
|---|
| 133 |     sampledvalues_t::const_iterator weightiter = weight.sampled_grid.begin();
 | 
|---|
| 134 |     for (;iter != sampled_grid.end();++iter,++weightiter)
 | 
|---|
| 135 |       int_value += (*weightiter) * (*iter);
 | 
|---|
| 136 |     int_value *= volume_element;
 | 
|---|
| 137 |     //LOG(2, "DEBUG: SamplingGrid::integral() is " << scientific << setprecision(13) << int_value << ".");
 | 
|---|
| 138 |     return int_value;
 | 
|---|
| 139 |   } else
 | 
|---|
| 140 |     return 0.;
 | 
|---|
| 141 | }
 | 
|---|
| 142 | 
 | 
|---|
| 143 | std::ostream & operator<<(std::ostream &ost, const SamplingGrid& other)
 | 
|---|
| 144 | {
 | 
|---|
| 145 |   ost << "SamplingGrid starting at " << other.begin[0] << "," << other.begin[1] << "," << other.begin[2];
 | 
|---|
| 146 |   ost << ", size of " << other.size;
 | 
|---|
| 147 |   ost << ", level of " << other.level;
 | 
|---|
| 148 |   ost << " and integrated value of " << other.integral();
 | 
|---|
| 149 |   return ost;
 | 
|---|
| 150 | }
 | 
|---|
| 151 | 
 | 
|---|
| 152 | // we need to explicitly instantiate the serialization functions as
 | 
|---|
| 153 | // its is only serialized through its base class FragmentJob
 | 
|---|
| 154 | BOOST_CLASS_EXPORT_IMPLEMENT(SamplingGrid)
 | 
|---|