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