| 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 |  * SamplingGridUnitTest.cpp
 | 
|---|
| 25 |  *
 | 
|---|
| 26 |  *  Created on: Jul 29, 2012
 | 
|---|
| 27 |  *      Author: heber
 | 
|---|
| 28 |  */
 | 
|---|
| 29 | 
 | 
|---|
| 30 | // include config.h
 | 
|---|
| 31 | #ifdef HAVE_CONFIG_H
 | 
|---|
| 32 | #include <config.h>
 | 
|---|
| 33 | #endif
 | 
|---|
| 34 | 
 | 
|---|
| 35 | using namespace std;
 | 
|---|
| 36 | 
 | 
|---|
| 37 | #include <cppunit/CompilerOutputter.h>
 | 
|---|
| 38 | #include <cppunit/extensions/TestFactoryRegistry.h>
 | 
|---|
| 39 | #include <cppunit/ui/text/TestRunner.h>
 | 
|---|
| 40 | 
 | 
|---|
| 41 | #include "SamplingGridUnitTest.hpp"
 | 
|---|
| 42 | 
 | 
|---|
| 43 | #include "CodePatterns/Assert.hpp"
 | 
|---|
| 44 | 
 | 
|---|
| 45 | #include <cmath>
 | 
|---|
| 46 | #include <boost/assign.hpp>
 | 
|---|
| 47 | 
 | 
|---|
| 48 | #ifdef HAVE_TESTRUNNER
 | 
|---|
| 49 | #include "UnitTestMain.hpp"
 | 
|---|
| 50 | #endif /*HAVE_TESTRUNNER*/
 | 
|---|
| 51 | 
 | 
|---|
| 52 | using namespace boost::assign;
 | 
|---|
| 53 | 
 | 
|---|
| 54 | /********************************************** Test classes **************************************/
 | 
|---|
| 55 | 
 | 
|---|
| 56 | const double grid_value=1.;
 | 
|---|
| 57 | 
 | 
|---|
| 58 | #define NUMBEROFSAMPLES(n) (size_t)(pow(pow(2,n),3))
 | 
|---|
| 59 | 
 | 
|---|
| 60 | // Registers the fixture into the 'registry'
 | 
|---|
| 61 | CPPUNIT_TEST_SUITE_REGISTRATION( SamplingGridTest );
 | 
|---|
| 62 | 
 | 
|---|
| 63 | 
 | 
|---|
| 64 | void SamplingGridTest::setUp()
 | 
|---|
| 65 | {
 | 
|---|
| 66 |   // failing asserts should be thrown
 | 
|---|
| 67 |   ASSERT_DO(Assert::Throw);
 | 
|---|
| 68 | 
 | 
|---|
| 69 |   // create the grid
 | 
|---|
| 70 |   const double begin[3] = { 0., 0., 0. };
 | 
|---|
| 71 |   const double end[3] = { 1., 1., 1. };
 | 
|---|
| 72 |   for (size_t i=0; i< pow(1,3)*NUMBEROFSAMPLES(2); ++i)
 | 
|---|
| 73 |     values += grid_value;
 | 
|---|
| 74 |   grid = new SamplingGrid(begin, end, 2, values);
 | 
|---|
| 75 |   CPPUNIT_ASSERT_EQUAL( grid_value, *(grid->sampled_grid.begin()) );
 | 
|---|
| 76 | }
 | 
|---|
| 77 | 
 | 
|---|
| 78 | 
 | 
|---|
| 79 | void SamplingGridTest::tearDown()
 | 
|---|
| 80 | {
 | 
|---|
| 81 |   delete grid;
 | 
|---|
| 82 | }
 | 
|---|
| 83 | 
 | 
|---|
| 84 | #define NUMBEROFSAMPLES(n) pow(pow(2,n),3)
 | 
|---|
| 85 | 
 | 
|---|
| 86 | /** UnitTest for operator+=()
 | 
|---|
| 87 |  */
 | 
|---|
| 88 | void SamplingGridTest::superposeOtherGrid_Test()
 | 
|---|
| 89 | {
 | 
|---|
| 90 |   // check illegal grid
 | 
|---|
| 91 |   const double begin[3] = { 0., 0., 0. };
 | 
|---|
| 92 |   const double end[3] = { 2., 2., 2. };
 | 
|---|
| 93 |   SamplingGridProperties illegal_props(begin, end, 1);
 | 
|---|
| 94 |   CPPUNIT_ASSERT( !grid->isCompatible(illegal_props) );
 | 
|---|
| 95 |   SamplingGrid::sampledvalues_t illegal_values;
 | 
|---|
| 96 |   for (size_t i=0; i< NUMBEROFSAMPLES(1); ++i)
 | 
|---|
| 97 |     illegal_values += 1.5;
 | 
|---|
| 98 |   SamplingGrid illegal_grid(illegal_props, illegal_values);
 | 
|---|
| 99 | #ifndef NDEBUG
 | 
|---|
| 100 |   std::cout << "The following assertion is intended and does not indicate a failure of the test." << std::endl;
 | 
|---|
| 101 |   CPPUNIT_ASSERT_THROW( *grid += illegal_grid, Assert::AssertionFailure );
 | 
|---|
| 102 | #else
 | 
|---|
| 103 |   *grid += illegal_grid;
 | 
|---|
| 104 | #endif
 | 
|---|
| 105 | 
 | 
|---|
| 106 |   // check that grid is still the same
 | 
|---|
| 107 |   for (SamplingGrid::sampledvalues_t::const_iterator iter = grid->sampled_grid.begin();
 | 
|---|
| 108 |       iter != grid->sampled_grid.end(); ++iter)
 | 
|---|
| 109 |     CPPUNIT_ASSERT_EQUAL( grid_value, *iter );
 | 
|---|
| 110 | }
 | 
|---|
| 111 | 
 | 
|---|
| 112 | /** UnitTest for getVolume_Test
 | 
|---|
| 113 |  */
 | 
|---|
| 114 | void SamplingGridTest::getVolume_Test()
 | 
|---|
| 115 | {
 | 
|---|
| 116 |   CPPUNIT_ASSERT_EQUAL( 1., grid->getVolume() );
 | 
|---|
| 117 | }
 | 
|---|
| 118 | 
 | 
|---|
| 119 | /** UnitTest for operator+=()
 | 
|---|
| 120 |  */
 | 
|---|
| 121 | void SamplingGridTest::operatorPlusEqual_Test()
 | 
|---|
| 122 | {
 | 
|---|
| 123 |   // create other grid
 | 
|---|
| 124 |   const double begin[3] = { 0., 0., 0. };
 | 
|---|
| 125 |   const double end[3] = { 1., 1., 1. };
 | 
|---|
| 126 |   SamplingGrid::sampledvalues_t othervalues;
 | 
|---|
| 127 |   const double othergrid_value = 1.5;
 | 
|---|
| 128 |   for (size_t i=0; i< NUMBEROFSAMPLES(2); ++i)
 | 
|---|
| 129 |     othervalues += othergrid_value;
 | 
|---|
| 130 |   SamplingGrid othergrid(begin, end, 2, othervalues);
 | 
|---|
| 131 |   CPPUNIT_ASSERT_EQUAL( othergrid_value, *(othergrid.sampled_grid.begin()) );
 | 
|---|
| 132 | 
 | 
|---|
| 133 |   // perform operation
 | 
|---|
| 134 |   CPPUNIT_ASSERT_NO_THROW( *grid += othergrid );
 | 
|---|
| 135 | 
 | 
|---|
| 136 |   // check the contents of the grid
 | 
|---|
| 137 |   const double sum = grid_value+othergrid_value;
 | 
|---|
| 138 |   for (SamplingGrid::sampledvalues_t::const_iterator iter = grid->sampled_grid.begin();
 | 
|---|
| 139 |       iter != grid->sampled_grid.end(); ++iter)
 | 
|---|
| 140 |     CPPUNIT_ASSERT_EQUAL( sum, *iter );
 | 
|---|
| 141 | }
 | 
|---|
| 142 | 
 | 
|---|
| 143 | /** UnitTest for operator-=()
 | 
|---|
| 144 |  */
 | 
|---|
| 145 | void SamplingGridTest::operatorMinusEqual_Test()
 | 
|---|
| 146 | {
 | 
|---|
| 147 |   // create other grid
 | 
|---|
| 148 |   const double begin[3] = { 0., 0., 0. };
 | 
|---|
| 149 |   const double end[3] = { 1., 1., 1. };
 | 
|---|
| 150 |   SamplingGrid::sampledvalues_t othervalues;
 | 
|---|
| 151 |   const double othergrid_value = 1.5;
 | 
|---|
| 152 |   for (size_t i=0; i< NUMBEROFSAMPLES(2); ++i)
 | 
|---|
| 153 |     othervalues += othergrid_value;
 | 
|---|
| 154 |   SamplingGrid othergrid(begin, end, 2, othervalues);
 | 
|---|
| 155 |   CPPUNIT_ASSERT_EQUAL( othergrid_value, *(othergrid.sampled_grid.begin()) );
 | 
|---|
| 156 | 
 | 
|---|
| 157 |   // perform operation
 | 
|---|
| 158 |   CPPUNIT_ASSERT_NO_THROW( *grid -= othergrid );
 | 
|---|
| 159 | 
 | 
|---|
| 160 |   // check the contents of the grid
 | 
|---|
| 161 |   const double difference = grid_value-othergrid_value;
 | 
|---|
| 162 |   for (SamplingGrid::sampledvalues_t::const_iterator iter = grid->sampled_grid.begin();
 | 
|---|
| 163 |       iter != grid->sampled_grid.end(); ++iter)
 | 
|---|
| 164 |     CPPUNIT_ASSERT_EQUAL( difference, *iter );
 | 
|---|
| 165 | }
 | 
|---|
| 166 | 
 | 
|---|