| [8387e0] | 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 | * FragmentNodeUnitTest.cpp | 
|---|
|  | 25 | * | 
|---|
|  | 26 | *  Created on: Sep 24, 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 headers that implement a archive in simple text format | 
|---|
|  | 42 | #include <boost/archive/text_oarchive.hpp> | 
|---|
|  | 43 | #include <boost/archive/text_iarchive.hpp> | 
|---|
|  | 44 |  | 
|---|
|  | 45 | #include "Fragmentation/Homology/FragmentNode.hpp" | 
|---|
|  | 46 | #include "Fragmentation/Graph.hpp" | 
|---|
|  | 47 |  | 
|---|
|  | 48 | #include "FragmentNodeUnitTest.hpp" | 
|---|
|  | 49 |  | 
|---|
|  | 50 | #include "CodePatterns/Assert.hpp" | 
|---|
| [67db80] | 51 | #include <sstream> | 
|---|
| [8387e0] | 52 |  | 
|---|
|  | 53 | #ifdef HAVE_TESTRUNNER | 
|---|
|  | 54 | #include "UnitTestMain.hpp" | 
|---|
|  | 55 | #endif /*HAVE_TESTRUNNER*/ | 
|---|
|  | 56 |  | 
|---|
|  | 57 | /********************************************** Test classes **************************************/ | 
|---|
|  | 58 |  | 
|---|
|  | 59 | // Registers the fixture into the 'registry' | 
|---|
|  | 60 | CPPUNIT_TEST_SUITE_REGISTRATION( FragmentNodeTest ); | 
|---|
|  | 61 |  | 
|---|
|  | 62 |  | 
|---|
|  | 63 | void FragmentNodeTest::setUp() | 
|---|
|  | 64 | { | 
|---|
|  | 65 | // failing asserts should be thrown | 
|---|
|  | 66 | ASSERT_DO(Assert::Throw); | 
|---|
|  | 67 | } | 
|---|
|  | 68 |  | 
|---|
|  | 69 |  | 
|---|
|  | 70 | void FragmentNodeTest::tearDown() | 
|---|
|  | 71 | { | 
|---|
|  | 72 | } | 
|---|
|  | 73 |  | 
|---|
|  | 74 | /** UnitTest for operator<(), operator>() and operator==() | 
|---|
|  | 75 | */ | 
|---|
|  | 76 | void FragmentNodeTest::comparatorTest() | 
|---|
|  | 77 | { | 
|---|
|  | 78 | FragmentNode node(1,1); | 
|---|
|  | 79 | FragmentNode samenode(1,1); | 
|---|
|  | 80 | FragmentNode othernode(1,4); | 
|---|
|  | 81 | FragmentNode anothernode(2,2); | 
|---|
|  | 82 | FragmentNode yetanothernode(2,4); | 
|---|
|  | 83 |  | 
|---|
|  | 84 | CPPUNIT_ASSERT( !(node < samenode) ); | 
|---|
|  | 85 | CPPUNIT_ASSERT( node < othernode ); | 
|---|
|  | 86 | CPPUNIT_ASSERT( node < anothernode ); | 
|---|
|  | 87 | CPPUNIT_ASSERT( node < yetanothernode ); | 
|---|
|  | 88 | CPPUNIT_ASSERT( othernode < anothernode ); | 
|---|
|  | 89 | CPPUNIT_ASSERT( othernode < yetanothernode ); | 
|---|
|  | 90 | CPPUNIT_ASSERT( anothernode < yetanothernode ); | 
|---|
|  | 91 |  | 
|---|
|  | 92 | CPPUNIT_ASSERT( !(node > samenode) ); | 
|---|
|  | 93 | CPPUNIT_ASSERT( othernode > node ); | 
|---|
|  | 94 | CPPUNIT_ASSERT( anothernode > node ); | 
|---|
|  | 95 | CPPUNIT_ASSERT( anothernode > othernode ); | 
|---|
|  | 96 | CPPUNIT_ASSERT( yetanothernode > node ); | 
|---|
|  | 97 | CPPUNIT_ASSERT( yetanothernode > othernode ); | 
|---|
|  | 98 | CPPUNIT_ASSERT( yetanothernode > anothernode ); | 
|---|
|  | 99 |  | 
|---|
|  | 100 | CPPUNIT_ASSERT( node == node ); | 
|---|
|  | 101 | CPPUNIT_ASSERT( node == samenode ); | 
|---|
|  | 102 | CPPUNIT_ASSERT( othernode == othernode ); | 
|---|
|  | 103 | CPPUNIT_ASSERT( anothernode == anothernode ); | 
|---|
|  | 104 | CPPUNIT_ASSERT( yetanothernode == yetanothernode ); | 
|---|
|  | 105 |  | 
|---|
|  | 106 | CPPUNIT_ASSERT( node != othernode ); | 
|---|
|  | 107 | CPPUNIT_ASSERT( node != anothernode ); | 
|---|
|  | 108 | CPPUNIT_ASSERT( node != yetanothernode ); | 
|---|
|  | 109 | CPPUNIT_ASSERT( othernode != anothernode ); | 
|---|
|  | 110 | CPPUNIT_ASSERT( othernode != yetanothernode ); | 
|---|
|  | 111 | CPPUNIT_ASSERT( anothernode != yetanothernode ); | 
|---|
|  | 112 | } | 
|---|
|  | 113 |  | 
|---|
|  | 114 | /** UnitTest for operator=() | 
|---|
|  | 115 | */ | 
|---|
|  | 116 | void FragmentNodeTest::assignmentTest() | 
|---|
|  | 117 | { | 
|---|
|  | 118 | FragmentNode node(1,1); | 
|---|
|  | 119 | FragmentNode samenode(1,1); | 
|---|
|  | 120 | FragmentNode othernode(1,4); | 
|---|
|  | 121 |  | 
|---|
|  | 122 | // check initial status | 
|---|
|  | 123 | CPPUNIT_ASSERT( node == samenode); | 
|---|
|  | 124 | CPPUNIT_ASSERT( node != othernode); | 
|---|
|  | 125 |  | 
|---|
|  | 126 | // now assign | 
|---|
|  | 127 | samenode = othernode; | 
|---|
|  | 128 | othernode = node; | 
|---|
|  | 129 |  | 
|---|
|  | 130 | // and check again | 
|---|
|  | 131 | CPPUNIT_ASSERT( node != samenode); | 
|---|
|  | 132 | CPPUNIT_ASSERT( node == othernode); | 
|---|
|  | 133 |  | 
|---|
|  | 134 | // also self-assign | 
|---|
|  | 135 | node = node; | 
|---|
|  | 136 | CPPUNIT_ASSERT( node == node); | 
|---|
|  | 137 | } | 
|---|
| [67db80] | 138 |  | 
|---|
|  | 139 |  | 
|---|
|  | 140 | /** UnitTest for serialization | 
|---|
|  | 141 | */ | 
|---|
|  | 142 | void FragmentNodeTest::serializeTest() | 
|---|
|  | 143 | { | 
|---|
|  | 144 | FragmentNode node(1,1); | 
|---|
|  | 145 | // serialize | 
|---|
|  | 146 | std::stringstream outputstream; | 
|---|
|  | 147 | boost::archive::text_oarchive oa(outputstream); | 
|---|
|  | 148 | oa << node; | 
|---|
|  | 149 |  | 
|---|
|  | 150 | // deserialize | 
|---|
|  | 151 | FragmentNode samenode; | 
|---|
|  | 152 | std::stringstream returnstream(outputstream.str()); | 
|---|
|  | 153 | boost::archive::text_iarchive ia(returnstream); | 
|---|
|  | 154 | ia >> samenode; | 
|---|
|  | 155 |  | 
|---|
|  | 156 | CPPUNIT_ASSERT( node == samenode ); | 
|---|
|  | 157 | } | 
|---|