[c889b7] | 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 |
|
---|
[3d9a8d] | 58 | #define NUMBEROFSAMPLES(n) (size_t)(pow(pow(2,n),3))
|
---|
| 59 |
|
---|
[c889b7] | 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. };
|
---|
[3d9a8d] | 71 | const double end[3] = { 1., 1., 1. };
|
---|
| 72 | for (size_t i=0; i< pow(1,3)*NUMBEROFSAMPLES(2); ++i)
|
---|
[c889b7] | 73 | values += grid_value;
|
---|
[3d9a8d] | 74 | grid = new SamplingGrid(begin, end, 2, values);
|
---|
[c889b7] | 75 | CPPUNIT_ASSERT_EQUAL( grid_value, *(grid->sampled_grid.begin()) );
|
---|
| 76 | }
|
---|
| 77 |
|
---|
| 78 |
|
---|
| 79 | void SamplingGridTest::tearDown()
|
---|
| 80 | {
|
---|
| 81 | delete grid;
|
---|
| 82 | }
|
---|
| 83 |
|
---|
[1a00bb] | 84 | /** UnitTest on compatible combination of props and values
|
---|
[c889b7] | 85 | */
|
---|
[1a00bb] | 86 | void SamplingGridTest::compatibleGrids_Test()
|
---|
[c889b7] | 87 | {
|
---|
| 88 | // check illegal grid
|
---|
| 89 | const double begin[3] = { 0., 0., 0. };
|
---|
[3d9a8d] | 90 | const double end[3] = { 2., 2., 2. };
|
---|
| 91 | SamplingGridProperties illegal_props(begin, end, 1);
|
---|
[1a00bb] | 92 | SamplingGridProperties legal_props(begin, end, 2);
|
---|
[c889b7] | 93 | CPPUNIT_ASSERT( !grid->isCompatible(illegal_props) );
|
---|
[1a00bb] | 94 | CPPUNIT_ASSERT( grid->isCompatible(legal_props) );
|
---|
[c889b7] | 95 | SamplingGrid::sampledvalues_t illegal_values;
|
---|
| 96 | for (size_t i=0; i< NUMBEROFSAMPLES(1); ++i)
|
---|
| 97 | illegal_values += 1.5;
|
---|
[1a00bb] | 98 | SamplingGrid::sampledvalues_t legal_values;
|
---|
| 99 | for (size_t i=0; i< NUMBEROFSAMPLES(2); ++i)
|
---|
| 100 | illegal_values += 1.5;
|
---|
[c889b7] | 101 | #ifndef NDEBUG
|
---|
[1a00bb] | 102 | // throws because props and size of illegal_values don't match
|
---|
| 103 | std::cout << "The following assertion is intended and does not indicate a failure of the test." << std::endl;
|
---|
| 104 | CPPUNIT_ASSERT_THROW( SamplingGrid illegal_grid(illegal_props, illegal_values), Assert::AssertionFailure );
|
---|
[3d9a8d] | 105 | std::cout << "The following assertion is intended and does not indicate a failure of the test." << std::endl;
|
---|
[1a00bb] | 106 | CPPUNIT_ASSERT_THROW( SamplingGrid illegal_grid(legal_props, illegal_values), Assert::AssertionFailure );
|
---|
| 107 | std::cout << "The following assertion is intended and does not indicate a failure of the test." << std::endl;
|
---|
| 108 | CPPUNIT_ASSERT_THROW( SamplingGrid illegal_grid(illegal_props, legal_values), Assert::AssertionFailure );
|
---|
[c889b7] | 109 | #endif
|
---|
| 110 | // check that grid is still the same
|
---|
| 111 | for (SamplingGrid::sampledvalues_t::const_iterator iter = grid->sampled_grid.begin();
|
---|
| 112 | iter != grid->sampled_grid.end(); ++iter)
|
---|
| 113 | CPPUNIT_ASSERT_EQUAL( grid_value, *iter );
|
---|
| 114 | }
|
---|
| 115 |
|
---|
[3d9a8d] | 116 | /** UnitTest for getVolume_Test
|
---|
| 117 | */
|
---|
| 118 | void SamplingGridTest::getVolume_Test()
|
---|
| 119 | {
|
---|
| 120 | CPPUNIT_ASSERT_EQUAL( 1., grid->getVolume() );
|
---|
| 121 | }
|
---|
| 122 |
|
---|
[1a00bb] | 123 | /** UnitTest for getWindowSize_Test
|
---|
| 124 | */
|
---|
| 125 | void SamplingGridTest::getWindowSize_Test()
|
---|
| 126 | {
|
---|
| 127 | // check size of default grid
|
---|
[e2404f] | 128 | CPPUNIT_ASSERT_EQUAL( (size_t)(NUMBEROFSAMPLES(grid->level)), grid->getWindowGridPoints() );
|
---|
[1a00bb] | 129 |
|
---|
| 130 | // create another one and check its size, too
|
---|
| 131 | const double begin[3] = { 0., 0., 0. };
|
---|
| 132 | const double end[3] = { 1., 1., 1. };
|
---|
| 133 | for (size_t level = 3; level<=6; ++level) {
|
---|
| 134 | values.clear();
|
---|
| 135 | for (size_t i=0; i< NUMBEROFSAMPLES(level); ++i)
|
---|
| 136 | values += grid_value;
|
---|
| 137 | delete grid;
|
---|
[e2404f] | 138 | // use other pointer in case something fails
|
---|
| 139 | SamplingGrid *tmpgrid = new SamplingGrid(begin, end, level, values);
|
---|
| 140 | grid = tmpgrid;
|
---|
[1a00bb] | 141 | CPPUNIT_ASSERT_EQUAL( (size_t)NUMBEROFSAMPLES(level), grid->getWindowGridPoints() );
|
---|
| 142 | }
|
---|
| 143 | }
|
---|
| 144 |
|
---|
| 145 | /** UnitTest for extendWindow()
|
---|
| 146 | */
|
---|
| 147 | void SamplingGridTest::extendWindow_Test()
|
---|
| 148 | {
|
---|
| 149 | // we have a grid with size of two, extend to twice the size and check
|
---|
| 150 | const double begin[3] = { 0., 0., 0. };
|
---|
| 151 | const double end[3] = { 2., 2., 2. };
|
---|
| 152 | grid->extendWindow(begin, end);
|
---|
| 153 |
|
---|
| 154 | // check integral
|
---|
| 155 | CPPUNIT_ASSERT_EQUAL( NUMBEROFSAMPLES(2)*grid_value, grid->integral() );
|
---|
| 156 |
|
---|
| 157 | // check number of points
|
---|
| 158 | CPPUNIT_ASSERT_EQUAL( (size_t)NUMBEROFSAMPLES(3), grid->getWindowGridPoints() );
|
---|
| 159 | }
|
---|
| 160 |
|
---|
| 161 | /** UnitTest for addOntoWindow()
|
---|
| 162 | */
|
---|
| 163 | void SamplingGridTest::addOntoWindow_Test()
|
---|
| 164 | {
|
---|
| 165 | // first window is from (0,0,0) to (1,1,1)
|
---|
| 166 | CPPUNIT_ASSERT_EQUAL( 1.*grid_value, grid->integral() );
|
---|
| 167 |
|
---|
| 168 | // create another window from (.5,.5,.5) to (1., 1., 1.)
|
---|
| 169 | const double begin[3] = { .5, .5, .5 };
|
---|
| 170 | const double end[3] = { 1., 1., 1. };
|
---|
| 171 | values.clear();
|
---|
| 172 | for (size_t i=0; i< NUMBEROFSAMPLES(2)/pow(2,3); ++i) // cut in half
|
---|
| 173 | values += grid_value;
|
---|
| 174 | // check that too large a window throws
|
---|
| 175 | #ifndef NDEBUG
|
---|
| 176 | const double wrongend[3] = { 1.5, 1.5, 1.5 };
|
---|
| 177 | std::cout << "The following assertion is intended and does not indicate a failure of the test." << std::endl;
|
---|
| 178 | CPPUNIT_ASSERT_THROW( grid->addOntoWindow(begin, wrongend, values), Assert::AssertionFailure );
|
---|
| 179 | #endif
|
---|
| 180 | // now perform working operation
|
---|
| 181 | grid->addOntoWindow(begin, end, values);
|
---|
| 182 |
|
---|
| 183 | // check integral to be one and half times the old value
|
---|
| 184 | CPPUNIT_ASSERT_EQUAL( (1.+pow(.5,3))*grid_value, grid->integral() );
|
---|
| 185 | }
|
---|
| 186 |
|
---|
[c889b7] | 187 | /** UnitTest for operator+=()
|
---|
| 188 | */
|
---|
| 189 | void SamplingGridTest::operatorPlusEqual_Test()
|
---|
| 190 | {
|
---|
| 191 | // create other grid
|
---|
| 192 | const double begin[3] = { 0., 0., 0. };
|
---|
[3d9a8d] | 193 | const double end[3] = { 1., 1., 1. };
|
---|
[c889b7] | 194 | SamplingGrid::sampledvalues_t othervalues;
|
---|
| 195 | const double othergrid_value = 1.5;
|
---|
| 196 | for (size_t i=0; i< NUMBEROFSAMPLES(2); ++i)
|
---|
| 197 | othervalues += othergrid_value;
|
---|
[3d9a8d] | 198 | SamplingGrid othergrid(begin, end, 2, othervalues);
|
---|
[c889b7] | 199 | CPPUNIT_ASSERT_EQUAL( othergrid_value, *(othergrid.sampled_grid.begin()) );
|
---|
| 200 |
|
---|
| 201 | // perform operation
|
---|
| 202 | CPPUNIT_ASSERT_NO_THROW( *grid += othergrid );
|
---|
| 203 |
|
---|
| 204 | // check the contents of the grid
|
---|
| 205 | const double sum = grid_value+othergrid_value;
|
---|
| 206 | for (SamplingGrid::sampledvalues_t::const_iterator iter = grid->sampled_grid.begin();
|
---|
| 207 | iter != grid->sampled_grid.end(); ++iter)
|
---|
| 208 | CPPUNIT_ASSERT_EQUAL( sum, *iter );
|
---|
| 209 | }
|
---|
| 210 |
|
---|
| 211 | /** UnitTest for operator-=()
|
---|
| 212 | */
|
---|
| 213 | void SamplingGridTest::operatorMinusEqual_Test()
|
---|
| 214 | {
|
---|
| 215 | // create other grid
|
---|
| 216 | const double begin[3] = { 0., 0., 0. };
|
---|
[3d9a8d] | 217 | const double end[3] = { 1., 1., 1. };
|
---|
[c889b7] | 218 | SamplingGrid::sampledvalues_t othervalues;
|
---|
| 219 | const double othergrid_value = 1.5;
|
---|
| 220 | for (size_t i=0; i< NUMBEROFSAMPLES(2); ++i)
|
---|
| 221 | othervalues += othergrid_value;
|
---|
[3d9a8d] | 222 | SamplingGrid othergrid(begin, end, 2, othervalues);
|
---|
[c889b7] | 223 | CPPUNIT_ASSERT_EQUAL( othergrid_value, *(othergrid.sampled_grid.begin()) );
|
---|
| 224 |
|
---|
| 225 | // perform operation
|
---|
| 226 | CPPUNIT_ASSERT_NO_THROW( *grid -= othergrid );
|
---|
| 227 |
|
---|
| 228 | // check the contents of the grid
|
---|
| 229 | const double difference = grid_value-othergrid_value;
|
---|
| 230 | for (SamplingGrid::sampledvalues_t::const_iterator iter = grid->sampled_grid.begin();
|
---|
| 231 | iter != grid->sampled_grid.end(); ++iter)
|
---|
| 232 | CPPUNIT_ASSERT_EQUAL( difference, *iter );
|
---|
| 233 | }
|
---|
| 234 |
|
---|