[4694df] | 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 | * HomologyContainerUnitTest.cpp
|
---|
| 25 | *
|
---|
[8387e0] | 26 | * Created on: Sep 22, 2012
|
---|
[4694df] | 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 headers that implement a archive in simple text format
|
---|
| 42 | #include <boost/archive/text_oarchive.hpp>
|
---|
| 43 | #include <boost/archive/text_iarchive.hpp>
|
---|
| 44 |
|
---|
[12a24c] | 45 | #include <boost/assign.hpp>
|
---|
| 46 |
|
---|
[4694df] | 47 | #include "Fragmentation/Homology/HomologyContainer.hpp"
|
---|
| 48 | #include "Fragmentation/Graph.hpp"
|
---|
| 49 |
|
---|
| 50 | #include "HomologyContainerUnitTest.hpp"
|
---|
| 51 |
|
---|
[12a24c] | 52 | #include <sstream>
|
---|
| 53 |
|
---|
| 54 | using namespace boost::assign;
|
---|
| 55 |
|
---|
[4694df] | 56 | #ifdef HAVE_TESTRUNNER
|
---|
| 57 | #include "UnitTestMain.hpp"
|
---|
| 58 | #endif /*HAVE_TESTRUNNER*/
|
---|
| 59 |
|
---|
| 60 | /********************************************** Test classes **************************************/
|
---|
| 61 |
|
---|
| 62 | // Registers the fixture into the 'registry'
|
---|
| 63 | CPPUNIT_TEST_SUITE_REGISTRATION( HomologyContainerTest );
|
---|
| 64 |
|
---|
| 65 |
|
---|
| 66 | void HomologyContainerTest::setUp()
|
---|
| 67 | {
|
---|
[12a24c] | 68 | // add nodes
|
---|
| 69 | nodes +=
|
---|
[28e203] | 70 | std::make_pair(FragmentNode(1,1),1),
|
---|
| 71 | std::make_pair(FragmentNode(1,4),1),
|
---|
| 72 | std::make_pair(FragmentNode(2,2),1),
|
---|
| 73 | std::make_pair(FragmentNode(2,4),1);
|
---|
[12a24c] | 74 | othernodes +=
|
---|
[28e203] | 75 | std::make_pair(FragmentNode(1,1),1),
|
---|
| 76 | std::make_pair(FragmentNode(1,4),1);
|
---|
[12a24c] | 77 |
|
---|
| 78 | // add edges
|
---|
| 79 | edges +=
|
---|
[28e203] | 80 | std::make_pair(FragmentEdge(1,1),1),
|
---|
| 81 | std::make_pair(FragmentEdge(1,4),1),
|
---|
| 82 | std::make_pair(FragmentEdge(2,2),1),
|
---|
| 83 | std::make_pair(FragmentEdge(2,4),1);
|
---|
[12a24c] | 84 | otheredges +=
|
---|
[28e203] | 85 | std::make_pair(FragmentEdge(1,4),1),
|
---|
| 86 | std::make_pair(FragmentEdge(2,2),1);
|
---|
[12a24c] | 87 |
|
---|
| 88 | // construct graphs
|
---|
| 89 | HomologyGraph graph(nodes, edges);
|
---|
| 90 | HomologyGraph othergraph(othernodes, otheredges);
|
---|
| 91 |
|
---|
| 92 | // place in container
|
---|
| 93 | Fragment::position_t pos(3, 0.);
|
---|
| 94 | Fragment::positions_t positions(1, pos);
|
---|
| 95 | Fragment::charges_t charges(1,1.);
|
---|
| 96 | Fragment dummy(positions, charges);
|
---|
| 97 | charges[0] = 6.;
|
---|
| 98 | positions[0][0] = 1.;
|
---|
| 99 | Fragment dummy1(positions, charges);
|
---|
| 100 | positions[0][0] = 2.;
|
---|
| 101 | Fragment dummy2(positions, charges);
|
---|
[bf1d1b] | 102 | HomologyContainer::value_t value1;
|
---|
| 103 | value1.fragment = dummy1;
|
---|
| 104 | value1.energy = 1.;
|
---|
| 105 | HomologyContainer::value_t value2;
|
---|
| 106 | value2.fragment = dummy2;
|
---|
| 107 | value2.energy = 1.5;
|
---|
| 108 | HomologyContainer::value_t value3;
|
---|
| 109 | value3.fragment = dummy;
|
---|
| 110 | value3.energy = 2.;
|
---|
[12a24c] | 111 | container +=
|
---|
[bf1d1b] | 112 | std::make_pair( graph, value1 ),
|
---|
| 113 | std::make_pair( graph, value2 ),
|
---|
| 114 | std::make_pair( othergraph, value3 );
|
---|
[12a24c] | 115 | // create HomologyContainer
|
---|
| 116 | Keys = new HomologyContainer(container);
|
---|
[4694df] | 117 | }
|
---|
| 118 |
|
---|
| 119 |
|
---|
| 120 | void HomologyContainerTest::tearDown()
|
---|
| 121 | {
|
---|
| 122 | delete Keys;
|
---|
| 123 | }
|
---|
| 124 |
|
---|
| 125 | /** UnitTest for whether homologies are correctly recognized
|
---|
| 126 | */
|
---|
| 127 | void HomologyContainerTest::InsertionTest()
|
---|
| 128 | {
|
---|
[12a24c] | 129 | // construct graphs
|
---|
| 130 | HomologyGraph graph(nodes, edges);
|
---|
| 131 |
|
---|
| 132 | HomologyContainer::container_t newcontainer;
|
---|
| 133 | Fragment::position_t pos(3, 0.);
|
---|
| 134 | Fragment::positions_t positions(1, pos);
|
---|
| 135 | Fragment::charges_t charges(1,1.);
|
---|
| 136 | Fragment dummy(positions, charges);
|
---|
[bf1d1b] | 137 | HomologyContainer::value_t value;
|
---|
| 138 | value.fragment = dummy;
|
---|
| 139 | value.energy = 1.;
|
---|
[12a24c] | 140 | newcontainer +=
|
---|
[bf1d1b] | 141 | std::make_pair( graph, value );
|
---|
[12a24c] | 142 |
|
---|
| 143 | Keys->insert(newcontainer);
|
---|
| 144 |
|
---|
| 145 | CPPUNIT_ASSERT_EQUAL( (size_t)4, Keys->container.size() );
|
---|
| 146 | }
|
---|
| 147 |
|
---|
| 148 | /** UnitTest for operator==() works correctly.
|
---|
| 149 | */
|
---|
| 150 | void HomologyContainerTest::EqualityTest()
|
---|
| 151 | {
|
---|
| 152 | // compare same container
|
---|
| 153 | CPPUNIT_ASSERT( *Keys == *Keys );
|
---|
| 154 |
|
---|
| 155 | // construct other container
|
---|
| 156 | HomologyGraph graph(nodes, edges);
|
---|
| 157 | HomologyContainer::container_t newcontainer;
|
---|
| 158 | Fragment::position_t pos(3, 0.);
|
---|
| 159 | Fragment::positions_t positions(1, pos);
|
---|
| 160 | Fragment::charges_t charges(1,1.);
|
---|
| 161 | Fragment dummy(positions, charges);
|
---|
[bf1d1b] | 162 | HomologyContainer::value_t value;
|
---|
| 163 | value.fragment = dummy;
|
---|
| 164 | value.energy = 1.;
|
---|
[12a24c] | 165 | newcontainer +=
|
---|
[bf1d1b] | 166 | std::make_pair( graph, value );
|
---|
[12a24c] | 167 |
|
---|
| 168 | HomologyContainer other(newcontainer);
|
---|
| 169 |
|
---|
| 170 | CPPUNIT_ASSERT( *Keys != other );
|
---|
| 171 | }
|
---|
| 172 |
|
---|
| 173 | /** UnitTest for serialization
|
---|
| 174 | */
|
---|
| 175 | void HomologyContainerTest::serializeTest()
|
---|
| 176 | {
|
---|
| 177 | // serialize
|
---|
| 178 | std::stringstream outputstream;
|
---|
| 179 | boost::archive::text_oarchive oa(outputstream);
|
---|
| 180 | oa << Keys;
|
---|
| 181 |
|
---|
| 182 | // deserialize
|
---|
| 183 | HomologyContainer *samekeys = NULL;
|
---|
| 184 | std::stringstream returnstream(outputstream.str());
|
---|
| 185 | boost::archive::text_iarchive ia(returnstream);
|
---|
| 186 | ia >> samekeys;
|
---|
| 187 |
|
---|
| 188 | CPPUNIT_ASSERT( samekeys != NULL );
|
---|
| 189 | //std::cout << *Keys << std::endl;
|
---|
| 190 | CPPUNIT_ASSERT_EQUAL( *Keys, *samekeys );
|
---|
| 191 |
|
---|
| 192 | delete samekeys;
|
---|
[4694df] | 193 | }
|
---|