| [d699de] | 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 |  * SetValueUnitTest.cpp
 | 
|---|
 | 25 |  *
 | 
|---|
 | 26 |  *  Created on: Jun 27, 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 | 
 | 
|---|
| [30abdc] | 41 | #include "Fragmentation/Summation/IndexSet.hpp"
 | 
|---|
 | 42 | #include "Fragmentation/Summation/IndexSetContainer.hpp"
 | 
|---|
| [d699de] | 43 | #include "Fragmentation/Summation/SetValue.hpp"
 | 
|---|
 | 44 | 
 | 
|---|
 | 45 | #include "SetValueUnitTest.hpp"
 | 
|---|
| [30abdc] | 46 | #include "stubs/SetValueMap_Mock.hpp"
 | 
|---|
 | 47 | #include "stubs/SubsetMap_Mock.hpp"
 | 
|---|
| [d699de] | 48 | 
 | 
|---|
 | 49 | #include <boost/assign.hpp>
 | 
|---|
 | 50 | 
 | 
|---|
 | 51 | #ifdef HAVE_TESTRUNNER
 | 
|---|
 | 52 | #include "UnitTestMain.hpp"
 | 
|---|
 | 53 | #endif /*HAVE_TESTRUNNER*/
 | 
|---|
 | 54 | 
 | 
|---|
 | 55 | using namespace boost::assign;
 | 
|---|
 | 56 | 
 | 
|---|
 | 57 | /********************************************** Test classes **************************************/
 | 
|---|
 | 58 | 
 | 
|---|
 | 59 | enum { OTHER=2, VALUE = 4 };
 | 
|---|
 | 60 | 
 | 
|---|
 | 61 | // Registers the fixture into the 'registry'
 | 
|---|
 | 62 | CPPUNIT_TEST_SUITE_REGISTRATION( SetValueTest );
 | 
|---|
 | 63 | 
 | 
|---|
| [30abdc] | 64 | LookupValue LV;
 | 
|---|
 | 65 | LookupSubset LS;
 | 
|---|
 | 66 | 
 | 
|---|
| [d699de] | 67 | 
 | 
|---|
 | 68 | void SetValueTest::setUp()
 | 
|---|
 | 69 | {
 | 
|---|
 | 70 |   IndexSet set;
 | 
|---|
 | 71 |   set += 1,2,3,4;
 | 
|---|
| [30abdc] | 72 |   indices.reset(new IndexSet( set ));
 | 
|---|
 | 73 |   value.reset(new SetValue<int>(indices, VALUE));
 | 
|---|
 | 74 |   SetValue<int>::lookupSubset =
 | 
|---|
 | 75 |       boost::bind(&LookupSubset::getSubsets, boost::ref(LS), _1);
 | 
|---|
 | 76 |   SetValue<int>::lookupValue =
 | 
|---|
 | 77 |       boost::bind(&LookupValue::getValue, boost::ref(LV), _1);
 | 
|---|
 | 78 |   LV.LookupMap.insert( std::make_pair(indices, value) );
 | 
|---|
 | 79 |   //IndexSet_ptr emptyset(new IndexSet);
 | 
|---|
 | 80 |   //LS.LookupMap.insert( std::make_pair(indices, IndexSetContainer::ptr( new IndexSetContainer(emptyset) )) );
 | 
|---|
| [d699de] | 81 | };
 | 
|---|
 | 82 | 
 | 
|---|
 | 83 | 
 | 
|---|
 | 84 | void SetValueTest::tearDown()
 | 
|---|
 | 85 | {
 | 
|---|
 | 86 | };
 | 
|---|
 | 87 | 
 | 
|---|
 | 88 | /** UnitTest for constructor
 | 
|---|
 | 89 |  */
 | 
|---|
 | 90 | void SetValueTest::constructorTest()
 | 
|---|
 | 91 | {
 | 
|---|
 | 92 |   CPPUNIT_ASSERT( value != NULL );
 | 
|---|
 | 93 |   CPPUNIT_ASSERT_EQUAL( (int)VALUE, value->getValue() );
 | 
|---|
 | 94 | 
 | 
|---|
 | 95 | };
 | 
|---|
 | 96 | 
 | 
|---|
 | 97 | /** UnitTest for operator()
 | 
|---|
 | 98 |  */
 | 
|---|
 | 99 | void SetValueTest::operatorTest()
 | 
|---|
 | 100 | {
 | 
|---|
| [30abdc] | 101 |   SetValue<int> other(indices, OTHER);
 | 
|---|
| [d699de] | 102 | 
 | 
|---|
 | 103 |   // operator-=
 | 
|---|
 | 104 |   other -= *value;
 | 
|---|
 | 105 |   CPPUNIT_ASSERT_EQUAL( (int)OTHER - (int)VALUE, other.getValue() );
 | 
|---|
 | 106 |   CPPUNIT_ASSERT_EQUAL( (int)VALUE, value->getValue() );
 | 
|---|
 | 107 | 
 | 
|---|
 | 108 |   // operator+=
 | 
|---|
 | 109 |   *value -= other;
 | 
|---|
 | 110 |   CPPUNIT_ASSERT_EQUAL( (int)OTHER - (int)VALUE, other.getValue() );
 | 
|---|
 | 111 |   CPPUNIT_ASSERT_EQUAL( (int)VALUE - ((int)OTHER - (int)VALUE), value->getValue() );
 | 
|---|
 | 112 | };
 | 
|---|
| [30abdc] | 113 | 
 | 
|---|
 | 114 | void SetValueTest::getContributiontest()
 | 
|---|
 | 115 | {
 | 
|---|
 | 116 |   IndexSet set;
 | 
|---|
 | 117 |   set += 1,2,3;
 | 
|---|
 | 118 |   IndexSet_ptr otherindices(new IndexSet(set));
 | 
|---|
 | 119 |   SetValue<int>::ptr othervalue(new SetValue<int>(otherindices, OTHER));
 | 
|---|
 | 120 |   LV.LookupMap.insert( std::make_pair(otherindices, othervalue) );
 | 
|---|
 | 121 | 
 | 
|---|
 | 122 |   // connect as subset
 | 
|---|
 | 123 |   LS.LookupMap[indices].reset(new IndexSetContainer(otherindices));
 | 
|---|
 | 124 | 
 | 
|---|
 | 125 |   std::cout << "The following error is intended and does not constitute a failure of the test." << std::endl;
 | 
|---|
 | 126 |   CPPUNIT_ASSERT_EQUAL( (int)OTHER, othervalue->getContribution() );
 | 
|---|
 | 127 |   CPPUNIT_ASSERT_EQUAL( 2, value->getContribution() );
 | 
|---|
 | 128 | 
 | 
|---|
 | 129 |   LS.LookupMap.erase( indices );
 | 
|---|
 | 130 | }
 | 
|---|