| 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 |  * ExtractorsUnitTest.cpp
 | 
|---|
| 25 |  *
 | 
|---|
| 26 |  *  Created on: Oct 16, 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 "ExtractorsUnitTest.hpp"
 | 
|---|
| 42 | 
 | 
|---|
| 43 | #include <boost/assign.hpp>
 | 
|---|
| 44 | 
 | 
|---|
| 45 | #include "CodePatterns/Assert.hpp"
 | 
|---|
| 46 | 
 | 
|---|
| 47 | #include "FunctionApproximation/Extractors.hpp"
 | 
|---|
| 48 | #include "Potentials/helpers.hpp"
 | 
|---|
| 49 | 
 | 
|---|
| 50 | using namespace boost::assign;
 | 
|---|
| 51 | 
 | 
|---|
| 52 | #ifdef HAVE_TESTRUNNER
 | 
|---|
| 53 | #include "UnitTestMain.hpp"
 | 
|---|
| 54 | #endif /*HAVE_TESTRUNNER*/
 | 
|---|
| 55 | 
 | 
|---|
| 56 | /********************************************** Test classes **************************************/
 | 
|---|
| 57 | 
 | 
|---|
| 58 | // Registers the fixture into the 'registry'
 | 
|---|
| 59 | CPPUNIT_TEST_SUITE_REGISTRATION( ExtractorsTest );
 | 
|---|
| 60 | 
 | 
|---|
| 61 | 
 | 
|---|
| 62 | void ExtractorsTest::setUp()
 | 
|---|
| 63 | {
 | 
|---|
| 64 |   // failing asserts should be thrown
 | 
|---|
| 65 |   ASSERT_DO(Assert::Throw);
 | 
|---|
| 66 | 
 | 
|---|
| 67 | }
 | 
|---|
| 68 | 
 | 
|---|
| 69 | 
 | 
|---|
| 70 | void ExtractorsTest::tearDown()
 | 
|---|
| 71 | {
 | 
|---|
| 72 | }
 | 
|---|
| 73 | 
 | 
|---|
| 74 | /** UnitTest for gatherAllDistanceArguments()
 | 
|---|
| 75 |  */
 | 
|---|
| 76 | void ExtractorsTest::gatherAllDistanceArgumentsTest()
 | 
|---|
| 77 | {
 | 
|---|
| 78 |   // create positions
 | 
|---|
| 79 |   Fragment::positions_t positions;
 | 
|---|
| 80 |   Fragment::position_t pos(3, 0.);
 | 
|---|
| 81 |   for (double i = 0; i < 5; i+=1.) {
 | 
|---|
| 82 |     pos[0] = i;
 | 
|---|
| 83 |     positions.push_back(pos);
 | 
|---|
| 84 |   }
 | 
|---|
| 85 | 
 | 
|---|
| 86 |   // create distances
 | 
|---|
| 87 |   FunctionModel::arguments_t args =
 | 
|---|
| 88 |       Extractors::gatherAllDistanceArguments(positions, 0);
 | 
|---|
| 89 |   CPPUNIT_ASSERT_EQUAL( (size_t)(5*4), args.size() );
 | 
|---|
| 90 | 
 | 
|---|
| 91 |   // check created args
 | 
|---|
| 92 |   for (size_t i=0; i< 5*4; ++i)
 | 
|---|
| 93 |     CPPUNIT_ASSERT( (args[i].distance >= 0) && (args[i].distance <= 4));
 | 
|---|
| 94 | }
 | 
|---|
| 95 | 
 | 
|---|
| 96 | /** UnitTest for gatherPositionOfTuples()
 | 
|---|
| 97 |  */
 | 
|---|
| 98 | void ExtractorsTest::gatherPositionOfTuplesTest()
 | 
|---|
| 99 | {
 | 
|---|
| 100 |   // create positions
 | 
|---|
| 101 |   Fragment::positions_t positions;
 | 
|---|
| 102 |   Fragment::position_t pos(3, 0.);
 | 
|---|
| 103 |   for (double i = 0; i < 5; i+=1.) {
 | 
|---|
| 104 |     pos[0] = i;
 | 
|---|
| 105 |     positions.push_back(pos);
 | 
|---|
| 106 |   }
 | 
|---|
| 107 | 
 | 
|---|
| 108 |   // create charges
 | 
|---|
| 109 |   Fragment::charges_t charges;
 | 
|---|
| 110 |   charges += 6., 6., 1., 1., 1.;
 | 
|---|
| 111 | 
 | 
|---|
| 112 |   // create Fragment
 | 
|---|
| 113 |   Fragment fragment(positions, charges);
 | 
|---|
| 114 | 
 | 
|---|
| 115 |   {
 | 
|---|
| 116 |     // extract carbon pairs
 | 
|---|
| 117 |     Fragment::charges_t carbonpair;
 | 
|---|
| 118 |     carbonpair += 6.,6.;
 | 
|---|
| 119 |     FunctionModel::arguments_t args =
 | 
|---|
| 120 |         Extractors::gatherAllSymmetricDistanceArguments(
 | 
|---|
| 121 |             Extractors::gatherPositionOfTuples(fragment, carbonpair),
 | 
|---|
| 122 |             0
 | 
|---|
| 123 |         );
 | 
|---|
| 124 |     CPPUNIT_ASSERT_EQUAL( (size_t)1, args.size() );
 | 
|---|
| 125 |     CPPUNIT_ASSERT_EQUAL( 1., args[0].distance );
 | 
|---|
| 126 |   }
 | 
|---|
| 127 | 
 | 
|---|
| 128 |   {
 | 
|---|
| 129 |     // extract hydrogen triple
 | 
|---|
| 130 |     Fragment::charges_t hydrogentriple;
 | 
|---|
| 131 |     hydrogentriple += 1.,1.,1.;
 | 
|---|
| 132 |     FunctionModel::arguments_t args =
 | 
|---|
| 133 |         Extractors::reorderArgumentsByIncreasingDistance(
 | 
|---|
| 134 |             Extractors::gatherAllSymmetricDistanceArguments(
 | 
|---|
| 135 |                 Extractors::gatherPositionOfTuples(fragment, hydrogentriple),
 | 
|---|
| 136 |                 0
 | 
|---|
| 137 |             )
 | 
|---|
| 138 |         );
 | 
|---|
| 139 |     CPPUNIT_ASSERT_EQUAL( (size_t)3, args.size() );
 | 
|---|
| 140 |     CPPUNIT_ASSERT_EQUAL( 1., args[0].distance );
 | 
|---|
| 141 |     CPPUNIT_ASSERT_EQUAL( 1., args[1].distance );
 | 
|---|
| 142 |     CPPUNIT_ASSERT_EQUAL( 2., args[2].distance );
 | 
|---|
| 143 |   }
 | 
|---|
| 144 | }
 | 
|---|
| 145 | 
 | 
|---|
| 146 | /** UnitTest for reorderArgumentsByIncreasingDistance()
 | 
|---|
| 147 |  */
 | 
|---|
| 148 | void ExtractorsTest::reorderArgumentsByIncreasingDistanceTest()
 | 
|---|
| 149 | {
 | 
|---|
| 150 |   // prepare some arguments
 | 
|---|
| 151 |   FunctionModel::arguments_t args;
 | 
|---|
| 152 |   argument_t arg;
 | 
|---|
| 153 |   arg.distance = 0.1;
 | 
|---|
| 154 |   args.push_back(arg);
 | 
|---|
| 155 |   arg.distance = 0.9;
 | 
|---|
| 156 |   args.push_back(arg);
 | 
|---|
| 157 |   arg.distance = 0.3;
 | 
|---|
| 158 |   args.push_back(arg);
 | 
|---|
| 159 |   CPPUNIT_ASSERT_EQUAL( (size_t)3, args.size() );
 | 
|---|
| 160 | 
 | 
|---|
| 161 |   // reorder
 | 
|---|
| 162 |   FunctionModel::arguments_t args_sorted =
 | 
|---|
| 163 |       Extractors::reorderArgumentsByIncreasingDistance(args);
 | 
|---|
| 164 |   CPPUNIT_ASSERT_EQUAL( (size_t)3, args_sorted.size() );
 | 
|---|
| 165 |   CPPUNIT_ASSERT_EQUAL( args[0].distance, args_sorted[0].distance );
 | 
|---|
| 166 |   CPPUNIT_ASSERT_EQUAL( args[1].distance, args_sorted[2].distance );
 | 
|---|
| 167 |   CPPUNIT_ASSERT_EQUAL( args[2].distance, args_sorted[1].distance );
 | 
|---|
| 168 | }
 | 
|---|