| [600a52] | 1 | /*
 | 
|---|
 | 2 |  * Project: MoleCuilder
 | 
|---|
 | 3 |  * Description: creates and alters molecular systems
 | 
|---|
 | 4 |  * Copyright (C)  2010-2012 University of Bonn. All rights reserved.
 | 
|---|
| [94d5ac6] | 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/>.
 | 
|---|
| [600a52] | 21 |  */
 | 
|---|
 | 22 | 
 | 
|---|
 | 23 | /*
 | 
|---|
 | 24 |  * IsValidInDomain_FillPredicateUnitTest.cpp
 | 
|---|
 | 25 |  *
 | 
|---|
 | 26 |  *  Created on: Jan 18, 2012
 | 
|---|
 | 27 |  *      Author: heber
 | 
|---|
 | 28 |  */
 | 
|---|
 | 29 | 
 | 
|---|
 | 30 | // include config.h
 | 
|---|
 | 31 | #ifdef HAVE_CONFIG_H
 | 
|---|
 | 32 | #include <config.h>
 | 
|---|
 | 33 | #endif
 | 
|---|
 | 34 | 
 | 
|---|
 | 35 | #include <cppunit/CompilerOutputter.h>
 | 
|---|
 | 36 | #include <cppunit/extensions/TestFactoryRegistry.h>
 | 
|---|
 | 37 | #include <cppunit/ui/text/TestRunner.h>
 | 
|---|
 | 38 | 
 | 
|---|
 | 39 | #include "CodePatterns/Assert.hpp"
 | 
|---|
 | 40 | 
 | 
|---|
 | 41 | #include "Box.hpp"
 | 
|---|
 | 42 | #include "Filling/Predicates/IsValidInDomain_FillPredicate.hpp"
 | 
|---|
 | 43 | #include "LinearAlgebra/RealSpaceMatrix.hpp"
 | 
|---|
 | 44 | #include "Filling/NodeTypes.hpp"
 | 
|---|
 | 45 | 
 | 
|---|
 | 46 | #include "IsValidInDomain_FillPredicateUnitTest.hpp"
 | 
|---|
 | 47 | 
 | 
|---|
 | 48 | #ifdef HAVE_TESTRUNNER
 | 
|---|
 | 49 | #include "UnitTestMain.hpp"
 | 
|---|
 | 50 | #endif /*HAVE_TESTRUNNER*/
 | 
|---|
 | 51 | 
 | 
|---|
 | 52 | /********************************************** Test classes **************************************/
 | 
|---|
 | 53 | 
 | 
|---|
 | 54 | // Registers the fixture into the 'registry'
 | 
|---|
 | 55 | CPPUNIT_TEST_SUITE_REGISTRATION( IsValidInDomain_FillPredicateTest );
 | 
|---|
 | 56 | 
 | 
|---|
 | 57 | 
 | 
|---|
 | 58 | void IsValidInDomain_FillPredicateTest::setUp()
 | 
|---|
 | 59 | {
 | 
|---|
 | 60 |   // failing asserts should be thrown
 | 
|---|
 | 61 |   ASSERT_DO(Assert::Throw);
 | 
|---|
 | 62 | 
 | 
|---|
 | 63 |   M = new RealSpaceMatrix;
 | 
|---|
 | 64 |   M->setIdentity();
 | 
|---|
 | 65 |   (*M) *= 20.;
 | 
|---|
 | 66 | 
 | 
|---|
 | 67 |   domain = new Box(*M);
 | 
|---|
 | 68 | 
 | 
|---|
 | 69 |   predicate = new FillPredicate(IsValidInDomain_FillPredicate(*domain));
 | 
|---|
 | 70 | }
 | 
|---|
 | 71 | 
 | 
|---|
 | 72 | 
 | 
|---|
 | 73 | void IsValidInDomain_FillPredicateTest::tearDown()
 | 
|---|
 | 74 | {
 | 
|---|
 | 75 |   delete predicate;
 | 
|---|
 | 76 |   delete domain;
 | 
|---|
 | 77 |   delete M;
 | 
|---|
 | 78 | }
 | 
|---|
 | 79 | 
 | 
|---|
 | 80 | /** Test whether operator() returns as desired
 | 
|---|
 | 81 |  *
 | 
|---|
 | 82 |  */
 | 
|---|
 | 83 | void IsValidInDomain_FillPredicateTest::operatorTest()
 | 
|---|
 | 84 | {
 | 
|---|
 | 85 |   Node origin(0.,0.,0.);
 | 
|---|
 | 86 |   Node center(10.,10.,10.);
 | 
|---|
 | 87 |   Node corner(20.,20.,20.);
 | 
|---|
 | 88 |   Node outside(30.,30.,30.);
 | 
|---|
 | 89 | 
 | 
|---|
 | 90 |   for (size_t i=0;i<NDIM;++i)
 | 
|---|
 | 91 |     domain->setCondition(i, BoundaryConditions::Wrap);
 | 
|---|
 | 92 | 
 | 
|---|
 | 93 |   // boundary conditions: Wrap
 | 
|---|
 | 94 |   {
 | 
|---|
 | 95 |     // origin is inside
 | 
|---|
 | 96 |     CPPUNIT_ASSERT( (*predicate)(origin) );
 | 
|---|
 | 97 | 
 | 
|---|
 | 98 |     // center is inside
 | 
|---|
 | 99 |     CPPUNIT_ASSERT( (*predicate)(center) );
 | 
|---|
 | 100 | 
 | 
|---|
 | 101 |     // corner is inside
 | 
|---|
 | 102 |     CPPUNIT_ASSERT( (*predicate)(corner) );
 | 
|---|
 | 103 | 
 | 
|---|
 | 104 |     // outside is outside
 | 
|---|
 | 105 |     CPPUNIT_ASSERT( (*predicate)(outside) );
 | 
|---|
 | 106 |   }
 | 
|---|
 | 107 | 
 | 
|---|
 | 108 |   // boundary conditions: Bounce
 | 
|---|
 | 109 |   {
 | 
|---|
 | 110 |     domain->setCondition(0, BoundaryConditions::Bounce);
 | 
|---|
 | 111 |     // origin is inside
 | 
|---|
 | 112 |     CPPUNIT_ASSERT( (*predicate)(origin) );
 | 
|---|
 | 113 | 
 | 
|---|
 | 114 |     // center is inside
 | 
|---|
 | 115 |     CPPUNIT_ASSERT( (*predicate)(center) );
 | 
|---|
 | 116 | 
 | 
|---|
 | 117 |     // corner is inside
 | 
|---|
 | 118 |     CPPUNIT_ASSERT( (*predicate)(corner) );
 | 
|---|
 | 119 | 
 | 
|---|
 | 120 |     // outside is outside
 | 
|---|
 | 121 |     CPPUNIT_ASSERT( (*predicate)(outside) );
 | 
|---|
 | 122 |     domain->setCondition(0, BoundaryConditions::Wrap);
 | 
|---|
 | 123 |   }
 | 
|---|
 | 124 | 
 | 
|---|
 | 125 |   // boundary conditions: Ignore
 | 
|---|
 | 126 |   {
 | 
|---|
 | 127 |     domain->setCondition(0, BoundaryConditions::Ignore);
 | 
|---|
 | 128 |     // origin is inside
 | 
|---|
 | 129 |     CPPUNIT_ASSERT( (*predicate)(origin) );
 | 
|---|
 | 130 | 
 | 
|---|
 | 131 |     // center is inside
 | 
|---|
 | 132 |     CPPUNIT_ASSERT( (*predicate)(center) );
 | 
|---|
 | 133 | 
 | 
|---|
 | 134 |     // corner is inside
 | 
|---|
 | 135 |     CPPUNIT_ASSERT( (*predicate)(corner) );
 | 
|---|
 | 136 | 
 | 
|---|
 | 137 |     // outside is outside
 | 
|---|
 | 138 |     CPPUNIT_ASSERT( !(*predicate)(outside) );
 | 
|---|
 | 139 |     domain->setCondition(0, BoundaryConditions::Wrap);
 | 
|---|
 | 140 |   }
 | 
|---|
 | 141 | }
 | 
|---|