| [e23075] | 1 | /* | 
|---|
|  | 2 | * Project: MoleCuilder | 
|---|
|  | 3 | * Description: creates and alters molecular systems | 
|---|
| [6d608d] | 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/>. | 
|---|
| [e23075] | 21 | */ | 
|---|
|  | 22 |  | 
|---|
|  | 23 | /* | 
|---|
|  | 24 | * VectorSetUnitTest.cpp | 
|---|
|  | 25 | * | 
|---|
|  | 26 | *  Created on: Jan 06, 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 "VectorSetUnitTest.hpp" | 
|---|
|  | 42 |  | 
|---|
| [f6ad4d] | 43 | #include "RealSpaceMatrix.hpp" | 
|---|
|  | 44 | #include "VectorSet.hpp" | 
|---|
|  | 45 |  | 
|---|
| [e23075] | 46 | #ifdef HAVE_TESTRUNNER | 
|---|
|  | 47 | #include "UnitTestMain.hpp" | 
|---|
|  | 48 | #endif /*HAVE_TESTRUNNER*/ | 
|---|
|  | 49 |  | 
|---|
|  | 50 | #include <iostream> | 
|---|
|  | 51 |  | 
|---|
|  | 52 | /********************************************** Test classes **************************************/ | 
|---|
|  | 53 |  | 
|---|
|  | 54 | // Registers the fixture into the 'registry' | 
|---|
|  | 55 | CPPUNIT_TEST_SUITE_REGISTRATION( VectorSetTest ); | 
|---|
|  | 56 |  | 
|---|
|  | 57 |  | 
|---|
|  | 58 | void VectorSetTest::setUp() | 
|---|
|  | 59 | { | 
|---|
|  | 60 | list.push_back(Vector(0.,0.,0.)); | 
|---|
|  | 61 | list.push_back(Vector(1.,0.,0.)); | 
|---|
|  | 62 | list.push_back(Vector(0.,1.,0.)); | 
|---|
|  | 63 | list.push_back(Vector(0.,1.,1.)); | 
|---|
|  | 64 | list.push_back(Vector(2.,1.,0.)); | 
|---|
|  | 65 | list.push_back(Vector(1.,2.,3.)); | 
|---|
|  | 66 |  | 
|---|
|  | 67 | CPPUNIT_ASSERT_EQUAL( (size_t)6, list.size() ); | 
|---|
|  | 68 | } | 
|---|
|  | 69 |  | 
|---|
|  | 70 |  | 
|---|
|  | 71 | void VectorSetTest::tearDown() | 
|---|
|  | 72 | { | 
|---|
|  | 73 | list.clear(); | 
|---|
|  | 74 | } | 
|---|
|  | 75 |  | 
|---|
| [f6ad4d] | 76 | /** UnitTest for Cstor(Set &) | 
|---|
|  | 77 | */ | 
|---|
|  | 78 | void VectorSetTest::copyConstructorTest() | 
|---|
|  | 79 | { | 
|---|
|  | 80 | VECTORSET(std::vector) worklist(list); | 
|---|
|  | 81 | CPPUNIT_ASSERT_EQUAL( list.size(), worklist.size() ); | 
|---|
|  | 82 | std::vector<Vector>::const_iterator iter = list.begin(); | 
|---|
|  | 83 | VECTORSET(std::vector)::const_iterator workiter = worklist.begin(); | 
|---|
|  | 84 | for (;(iter != list.end()) && (workiter != worklist.end()); ++iter, ++workiter) | 
|---|
|  | 85 | CPPUNIT_ASSERT( ((*iter)) == (*workiter) ); | 
|---|
|  | 86 | } | 
|---|
|  | 87 |  | 
|---|
|  | 88 |  | 
|---|
| [e23075] | 89 | /** UnitTest for translate() | 
|---|
|  | 90 | */ | 
|---|
|  | 91 | void VectorSetTest::translateTest() | 
|---|
|  | 92 | { | 
|---|
|  | 93 | VECTORSET(std::vector) worklist(list); | 
|---|
|  | 94 | Vector translater(1.,0.,0.); | 
|---|
|  | 95 | worklist.translate(translater); | 
|---|
|  | 96 | VECTORSET(std::vector)::const_iterator iter = list.begin(); | 
|---|
|  | 97 | VECTORSET(std::vector)::const_iterator workiter = worklist.begin(); | 
|---|
|  | 98 | for (;(iter != list.end()) && (workiter != worklist.end()); ++iter, ++workiter) | 
|---|
|  | 99 | CPPUNIT_ASSERT( ((*iter)+(translater)) == (*workiter) ); | 
|---|
|  | 100 | } | 
|---|
|  | 101 |  | 
|---|
| [f6ad4d] | 102 | /** UnitTest for transform() | 
|---|
|  | 103 | */ | 
|---|
|  | 104 | void VectorSetTest::transformTest() | 
|---|
|  | 105 | { | 
|---|
|  | 106 | VECTORSET(std::vector) worklist(list); | 
|---|
|  | 107 | RealSpaceMatrix M; | 
|---|
|  | 108 | M.setIdentity(); | 
|---|
|  | 109 | M *= 2.; | 
|---|
|  | 110 | worklist.transform(M); | 
|---|
|  | 111 | VECTORSET(std::vector)::const_iterator iter = list.begin(); | 
|---|
|  | 112 | VECTORSET(std::vector)::const_iterator workiter = worklist.begin(); | 
|---|
|  | 113 | for (;(iter != list.end()) && (workiter != worklist.end()); ++iter, ++workiter) | 
|---|
|  | 114 | CPPUNIT_ASSERT( (2.*(*iter)) == (*workiter) ); | 
|---|
|  | 115 | } | 
|---|
|  | 116 |  | 
|---|
| [e23075] | 117 | /** UnitTest for minDistance() | 
|---|
|  | 118 | */ | 
|---|
|  | 119 | void VectorSetTest::minDistanceTest() | 
|---|
|  | 120 | { | 
|---|
| [f6ad4d] | 121 | VECTORSET(std::vector) worklist(list); | 
|---|
| [e23075] | 122 | { | 
|---|
|  | 123 | VECTORSET(std::vector) somelist; | 
|---|
|  | 124 | for (double x=1.;x<6.;++x) | 
|---|
|  | 125 | somelist.push_back(Vector(x,0.,0.)); | 
|---|
|  | 126 | Vector center(0.,0.,0.); | 
|---|
|  | 127 | Vector mindist = somelist.minDistance(center); | 
|---|
|  | 128 | CPPUNIT_ASSERT_EQUAL (Vector(1., 0., 0.), mindist); | 
|---|
| [31021ab] | 129 | // check that vector has changed (by nothing) | 
|---|
|  | 130 | for (size_t i=0;i<somelist.size();++i) | 
|---|
|  | 131 | CPPUNIT_ASSERT_EQUAL (Vector(i+1.,0.,0.), somelist[i]); | 
|---|
| [e23075] | 132 | } | 
|---|
|  | 133 | { | 
|---|
|  | 134 | Vector center(5.,0.,0.); | 
|---|
| [31021ab] | 135 | VECTORSET(std::vector) somelist(worklist); | 
|---|
|  | 136 | Vector mindist = somelist.minDistance(center); | 
|---|
| [e23075] | 137 | CPPUNIT_ASSERT_EQUAL (Vector(2., 1., 0.)-center, mindist); | 
|---|
| [31021ab] | 138 | // check that vector has changed | 
|---|
|  | 139 | for (size_t i=0;i<somelist.size();++i) | 
|---|
|  | 140 | CPPUNIT_ASSERT_EQUAL (somelist[i], worklist[i]-center); | 
|---|
| [e23075] | 141 | } | 
|---|
|  | 142 | { | 
|---|
| [f6ad4d] | 143 | for (VECTORSET(std::vector)::const_iterator iter = worklist.begin(); | 
|---|
|  | 144 | iter != worklist.end(); ++iter) { | 
|---|
| [31021ab] | 145 | // copy list as we change it | 
|---|
|  | 146 | VECTORSET(std::vector) somelist(worklist); | 
|---|
|  | 147 | Vector mindist = somelist.minDistance(*iter); | 
|---|
| [e23075] | 148 | CPPUNIT_ASSERT_EQUAL( Vector(0.,0.,0.), mindist ); | 
|---|
|  | 149 | } | 
|---|
|  | 150 | } | 
|---|
|  | 151 | } | 
|---|
|  | 152 |  | 
|---|