| [7d92f1] | 1 | /*
 | 
|---|
 | 2 |  * Project: MoleCuilder
 | 
|---|
 | 3 |  * Description: creates and alters molecular systems
 | 
|---|
 | 4 |  * Copyright (C)  2012 University of Bonn. All rights reserved.
 | 
|---|
| [5aaa43] | 5 |  * Copyright (C)  2013 Frederik Heber. All rights reserved.
 | 
|---|
| [7d92f1] | 6 |  * 
 | 
|---|
 | 7 |  *
 | 
|---|
 | 8 |  *   This file is part of MoleCuilder.
 | 
|---|
 | 9 |  *
 | 
|---|
 | 10 |  *    MoleCuilder is free software: you can redistribute it and/or modify
 | 
|---|
 | 11 |  *    it under the terms of the GNU General Public License as published by
 | 
|---|
 | 12 |  *    the Free Software Foundation, either version 2 of the License, or
 | 
|---|
 | 13 |  *    (at your option) any later version.
 | 
|---|
 | 14 |  *
 | 
|---|
 | 15 |  *    MoleCuilder is distributed in the hope that it will be useful,
 | 
|---|
 | 16 |  *    but WITHOUT ANY WARRANTY; without even the implied warranty of
 | 
|---|
 | 17 |  *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 | 
|---|
 | 18 |  *    GNU General Public License for more details.
 | 
|---|
 | 19 |  *
 | 
|---|
 | 20 |  *    You should have received a copy of the GNU General Public License
 | 
|---|
 | 21 |  *    along with MoleCuilder.  If not, see <http://www.gnu.org/licenses/>.
 | 
|---|
 | 22 |  */
 | 
|---|
 | 23 | 
 | 
|---|
 | 24 | /*
 | 
|---|
 | 25 |  * IndexedVectorsUnitTest.cpp
 | 
|---|
 | 26 |  *
 | 
|---|
 | 27 |  *  Created on: Jul 29, 2012
 | 
|---|
 | 28 |  *      Author: heber
 | 
|---|
 | 29 |  */
 | 
|---|
 | 30 | 
 | 
|---|
 | 31 | // include config.h
 | 
|---|
 | 32 | #ifdef HAVE_CONFIG_H
 | 
|---|
 | 33 | #include <config.h>
 | 
|---|
 | 34 | #endif
 | 
|---|
 | 35 | 
 | 
|---|
 | 36 | using namespace std;
 | 
|---|
 | 37 | 
 | 
|---|
 | 38 | #include <cppunit/CompilerOutputter.h>
 | 
|---|
 | 39 | #include <cppunit/extensions/TestFactoryRegistry.h>
 | 
|---|
 | 40 | #include <cppunit/ui/text/TestRunner.h>
 | 
|---|
 | 41 | 
 | 
|---|
 | 42 | #include "IndexedVectorsUnitTest.hpp"
 | 
|---|
 | 43 | 
 | 
|---|
 | 44 | #include <cmath>
 | 
|---|
 | 45 | #include <limits>
 | 
|---|
 | 46 | 
 | 
|---|
 | 47 | #include <boost/assign.hpp>
 | 
|---|
 | 48 | 
 | 
|---|
 | 49 | 
 | 
|---|
 | 50 | #include "CodePatterns/Assert.hpp"
 | 
|---|
 | 51 | 
 | 
|---|
 | 52 | #ifdef HAVE_TESTRUNNER
 | 
|---|
 | 53 | #include "UnitTestMain.hpp"
 | 
|---|
 | 54 | #endif /*HAVE_TESTRUNNER*/
 | 
|---|
 | 55 | 
 | 
|---|
 | 56 | using namespace boost::assign;
 | 
|---|
 | 57 | 
 | 
|---|
 | 58 | /********************************************** Test classes **************************************/
 | 
|---|
 | 59 | 
 | 
|---|
 | 60 | // Registers the fixture into the 'registry'
 | 
|---|
 | 61 | CPPUNIT_TEST_SUITE_REGISTRATION( IndexedVectorsTest );
 | 
|---|
 | 62 | 
 | 
|---|
 | 63 | 
 | 
|---|
 | 64 | void IndexedVectorsTest::setUp()
 | 
|---|
 | 65 | {
 | 
|---|
 | 66 |   // failing asserts should be thrown
 | 
|---|
 | 67 |   ASSERT_DO(Assert::Throw);
 | 
|---|
 | 68 | 
 | 
|---|
 | 69 |   // create two vector_t
 | 
|---|
 | 70 |   ones += 1.,1.,1.;
 | 
|---|
 | 71 |   twos += 2.,2.,2.;
 | 
|---|
 | 72 |   threes += 3.,3.,3.;
 | 
|---|
 | 73 |   CPPUNIT_ASSERT_EQUAL( IndexedVectors::FixedSize, ones.size() );
 | 
|---|
 | 74 |   CPPUNIT_ASSERT_EQUAL( IndexedVectors::FixedSize, twos.size() );
 | 
|---|
 | 75 |   CPPUNIT_ASSERT_EQUAL( IndexedVectors::FixedSize, threes.size() );
 | 
|---|
 | 76 | 
 | 
|---|
 | 77 |   // create vectors
 | 
|---|
 | 78 | 
 | 
|---|
 | 79 |   IndexedVectors::vectors_t vectors;
 | 
|---|
 | 80 |   vectors.push_back(ones);
 | 
|---|
 | 81 |   vectors.push_back(twos);
 | 
|---|
 | 82 |   IndexedVectors::vectors_t othervectors;
 | 
|---|
 | 83 |   othervectors.push_back(threes);
 | 
|---|
 | 84 |   othervectors.push_back(threes);
 | 
|---|
 | 85 | 
 | 
|---|
 | 86 |   // create two indices
 | 
|---|
 | 87 |   IndexedVectors::indices_t indices;
 | 
|---|
 | 88 |   indices += 1,2;
 | 
|---|
 | 89 |   IndexedVectors::indices_t otherindices;
 | 
|---|
 | 90 |   otherindices += 1,3;
 | 
|---|
 | 91 | 
 | 
|---|
 | 92 |   // create indexed vectors
 | 
|---|
 | 93 |   ivectors = new IndexedVectors(indices, vectors);
 | 
|---|
 | 94 |   otherivectors = new IndexedVectors(otherindices, othervectors);
 | 
|---|
 | 95 | }
 | 
|---|
 | 96 | 
 | 
|---|
 | 97 | 
 | 
|---|
 | 98 | void IndexedVectorsTest::tearDown()
 | 
|---|
 | 99 | {
 | 
|---|
 | 100 |   delete ivectors;
 | 
|---|
 | 101 |   delete otherivectors;
 | 
|---|
 | 102 | }
 | 
|---|
 | 103 | 
 | 
|---|
| [a67a04] | 104 | 
 | 
|---|
 | 105 | /** UnitTest for cstor's
 | 
|---|
 | 106 |  */
 | 
|---|
 | 107 | void IndexedVectorsTest::Constructor_Test()
 | 
|---|
 | 108 | {
 | 
|---|
 | 109 |   // check whether -1 is dropped
 | 
|---|
 | 110 |   IndexedVectors::indices_t indices;
 | 
|---|
 | 111 |   indices += 1,-1,3;
 | 
|---|
 | 112 |   IndexedVectors::vectors_t vectors;
 | 
|---|
 | 113 |   vectors.push_back(ones);
 | 
|---|
 | 114 |   vectors.push_back(twos);
 | 
|---|
 | 115 |   vectors.push_back(threes);
 | 
|---|
 | 116 |   IndexedVectors testivectors(indices, vectors);
 | 
|---|
 | 117 | 
 | 
|---|
 | 118 |   CPPUNIT_ASSERT_EQUAL( (size_t)2, testivectors.vectors.size() );
 | 
|---|
| [87d6bd] | 119 |   CPPUNIT_ASSERT( ones == testivectors.vectors[1] );
 | 
|---|
 | 120 |   CPPUNIT_ASSERT( threes == testivectors.vectors[3] );
 | 
|---|
| [a67a04] | 121 |   CPPUNIT_ASSERT( testivectors.vectors.find(-1) == testivectors.vectors.end() );
 | 
|---|
 | 122 | }
 | 
|---|
 | 123 | 
 | 
|---|
| [7d92f1] | 124 | /** UnitTest for operator+=()
 | 
|---|
 | 125 |  */
 | 
|---|
 | 126 | void IndexedVectorsTest::operatorPlusEqual_Test()
 | 
|---|
 | 127 | {
 | 
|---|
 | 128 |   // safeguard initial sizes
 | 
|---|
 | 129 |   CPPUNIT_ASSERT_EQUAL( (size_t)2, ivectors->vectors.size() );
 | 
|---|
 | 130 |   CPPUNIT_ASSERT_EQUAL( (size_t)2, otherivectors->vectors.size() );
 | 
|---|
 | 131 | 
 | 
|---|
 | 132 |   // perform operation
 | 
|---|
 | 133 |   *ivectors += *otherivectors;
 | 
|---|
 | 134 | 
 | 
|---|
 | 135 |   // check new and ole sizes
 | 
|---|
 | 136 |   CPPUNIT_ASSERT_EQUAL( (size_t)3, ivectors->vectors.size() );
 | 
|---|
 | 137 |   CPPUNIT_ASSERT_EQUAL( (size_t)2, otherivectors->vectors.size() );
 | 
|---|
 | 138 | 
 | 
|---|
 | 139 |   // then check result
 | 
|---|
 | 140 |   IndexedVectors::vector_t result( IndexedVectors::nullvector );
 | 
|---|
 | 141 |   CPPUNIT_ASSERT_EQUAL( IndexedVectors::FixedSize, result.size() );
 | 
|---|
 | 142 |   for (size_t i=0; i<IndexedVectors::FixedSize; ++i)
 | 
|---|
 | 143 |     result[i] = ones[i] + threes[i];
 | 
|---|
 | 144 |   for (IndexedVectors::indexedvectors_t::const_iterator iter = ivectors->vectors.begin();
 | 
|---|
 | 145 |       iter != ivectors->vectors.end(); ++iter) {
 | 
|---|
 | 146 |     CPPUNIT_ASSERT_EQUAL( IndexedVectors::FixedSize, iter->second.size() );
 | 
|---|
 | 147 |   }
 | 
|---|
| [87d6bd] | 148 |   CPPUNIT_ASSERT( result == ivectors->vectors[1] );
 | 
|---|
 | 149 |   CPPUNIT_ASSERT( twos == ivectors->vectors[2] );
 | 
|---|
 | 150 |   CPPUNIT_ASSERT( threes == ivectors->vectors[3] );
 | 
|---|
| [7d92f1] | 151 | }
 | 
|---|
 | 152 | 
 | 
|---|
 | 153 | /** UnitTest for operator-=()
 | 
|---|
 | 154 |  */
 | 
|---|
 | 155 | void IndexedVectorsTest::operatorMinusEqual_Test()
 | 
|---|
 | 156 | {
 | 
|---|
 | 157 |   // safeguard initial sizes
 | 
|---|
 | 158 |   CPPUNIT_ASSERT_EQUAL( (size_t)2, ivectors->vectors.size() );
 | 
|---|
 | 159 |   CPPUNIT_ASSERT_EQUAL( (size_t)2, otherivectors->vectors.size() );
 | 
|---|
 | 160 | 
 | 
|---|
 | 161 |   // perform operation
 | 
|---|
 | 162 |   *ivectors -= *otherivectors;
 | 
|---|
 | 163 | 
 | 
|---|
 | 164 |   // check new and ole sizes
 | 
|---|
 | 165 |   CPPUNIT_ASSERT_EQUAL( (size_t)3, ivectors->vectors.size() );
 | 
|---|
 | 166 |   CPPUNIT_ASSERT_EQUAL( (size_t)2, otherivectors->vectors.size() );
 | 
|---|
 | 167 | 
 | 
|---|
 | 168 |   // then check result
 | 
|---|
 | 169 |   IndexedVectors::vector_t result( IndexedVectors::nullvector );
 | 
|---|
 | 170 |   IndexedVectors::vector_t thirdresult( IndexedVectors::nullvector );
 | 
|---|
 | 171 |   CPPUNIT_ASSERT_EQUAL( IndexedVectors::FixedSize, result.size() );
 | 
|---|
 | 172 |   for (size_t i=0; i<IndexedVectors::FixedSize; ++i) {
 | 
|---|
 | 173 |     result[i] = ones[i] - threes[i];
 | 
|---|
 | 174 |     thirdresult[i] = -threes[i];
 | 
|---|
 | 175 |   }
 | 
|---|
 | 176 |   for (IndexedVectors::indexedvectors_t::const_iterator iter = ivectors->vectors.begin();
 | 
|---|
 | 177 |       iter != ivectors->vectors.end(); ++iter) {
 | 
|---|
 | 178 |     CPPUNIT_ASSERT_EQUAL( IndexedVectors::FixedSize, iter->second.size() );
 | 
|---|
 | 179 |   }
 | 
|---|
| [87d6bd] | 180 |   CPPUNIT_ASSERT( result == ivectors->vectors[1] );
 | 
|---|
 | 181 |   CPPUNIT_ASSERT( twos == ivectors->vectors[2] );
 | 
|---|
 | 182 |   CPPUNIT_ASSERT( thirdresult == ivectors->vectors[3] );
 | 
|---|
| [7d92f1] | 183 | }
 | 
|---|
 | 184 | 
 | 
|---|
| [955051] | 185 | 
 | 
|---|
 | 186 | /** UnitTest for operator==()
 | 
|---|
 | 187 |  */
 | 
|---|
 | 188 | void IndexedVectorsTest::equality_Test()
 | 
|---|
 | 189 | {
 | 
|---|
 | 190 |   CPPUNIT_ASSERT( !(*ivectors == *otherivectors) );
 | 
|---|
 | 191 |   CPPUNIT_ASSERT( *ivectors != *otherivectors );
 | 
|---|
 | 192 | 
 | 
|---|
 | 193 |   // test against empty ivectors
 | 
|---|
 | 194 |   IndexedVectors emptyivectors;
 | 
|---|
 | 195 |   CPPUNIT_ASSERT( !(*ivectors == emptyivectors) );
 | 
|---|
 | 196 |   CPPUNIT_ASSERT( *ivectors != emptyivectors );
 | 
|---|
 | 197 | 
 | 
|---|
 | 198 |   // tests against themselves
 | 
|---|
 | 199 |   CPPUNIT_ASSERT( *ivectors == *ivectors );
 | 
|---|
 | 200 |   CPPUNIT_ASSERT( *otherivectors == *otherivectors );
 | 
|---|
 | 201 |   CPPUNIT_ASSERT( emptyivectors == emptyivectors );
 | 
|---|
 | 202 | 
 | 
|---|
 | 203 |   // check against ZeroInstance
 | 
|---|
 | 204 |   CPPUNIT_ASSERT( *ivectors != ZeroInstance<IndexedVectors>() );
 | 
|---|
 | 205 |   CPPUNIT_ASSERT( *otherivectors != ZeroInstance<IndexedVectors>() );
 | 
|---|
 | 206 | }
 | 
|---|