| 1 | /*
 | 
|---|
| 2 |  * Project: MoleCuilder
 | 
|---|
| 3 |  * Description: creates and alters molecular systems
 | 
|---|
| 4 |  * Copyright (C)  2010-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 |  * AdjacencyListUnitTest.cpp
 | 
|---|
| 25 |  *
 | 
|---|
| 26 |  *  Created on: Oct 17, 2011
 | 
|---|
| 27 |  *      Author: heber
 | 
|---|
| 28 |  */
 | 
|---|
| 29 | 
 | 
|---|
| 30 | // include config.h
 | 
|---|
| 31 | #ifdef HAVE_CONFIG_H
 | 
|---|
| 32 | #include <config.h>
 | 
|---|
| 33 | #endif
 | 
|---|
| 34 | 
 | 
|---|
| 35 | #include "AdjacencyListUnitTest.hpp"
 | 
|---|
| 36 | 
 | 
|---|
| 37 | #include <cppunit/CompilerOutputter.h>
 | 
|---|
| 38 | #include <cppunit/extensions/TestFactoryRegistry.h>
 | 
|---|
| 39 | #include <cppunit/ui/text/TestRunner.h>
 | 
|---|
| 40 | 
 | 
|---|
| 41 | #include <boost/lambda/lambda.hpp>
 | 
|---|
| 42 | #include <iostream>
 | 
|---|
| 43 | #include <iterator>
 | 
|---|
| 44 | #include <iostream>
 | 
|---|
| 45 | #include <vector>
 | 
|---|
| 46 | 
 | 
|---|
| 47 | #include "CodePatterns/Assert.hpp"
 | 
|---|
| 48 | #include "CodePatterns/Log.hpp"
 | 
|---|
| 49 | 
 | 
|---|
| 50 | #include "Atom/atom.hpp"
 | 
|---|
| 51 | #include "Descriptors/AtomDescriptor.hpp"
 | 
|---|
| 52 | #include "Element/element.hpp"
 | 
|---|
| 53 | #include "Element/periodentafel.hpp"
 | 
|---|
| 54 | #include "Graph/AdjacencyList.hpp"
 | 
|---|
| 55 | #include "molecule.hpp"
 | 
|---|
| 56 | #include "World.hpp"
 | 
|---|
| 57 | #include "WorldTime.hpp"
 | 
|---|
| 58 | 
 | 
|---|
| 59 | #ifdef HAVE_TESTRUNNER
 | 
|---|
| 60 | #include "UnitTestMain.hpp"
 | 
|---|
| 61 | #endif /*HAVE_TESTRUNNER*/
 | 
|---|
| 62 | 
 | 
|---|
| 63 | /********************************************** Test classes **************************************/
 | 
|---|
| 64 | // Registers the fixture into the 'registry'
 | 
|---|
| 65 | CPPUNIT_TEST_SUITE_REGISTRATION( AdjacencyListTest );
 | 
|---|
| 66 | 
 | 
|---|
| 67 | static std::string adjacencyfile ="\
 | 
|---|
| 68 | 1 2\n\
 | 
|---|
| 69 | 2 1 3\n\
 | 
|---|
| 70 | 3 2 4\n\
 | 
|---|
| 71 | 4 3 5\n\
 | 
|---|
| 72 | 5 4 6\n\
 | 
|---|
| 73 | 6 5 7\n\
 | 
|---|
| 74 | 7 6 8\n\
 | 
|---|
| 75 | 8 7 9\n\
 | 
|---|
| 76 | 9 8 10\n\
 | 
|---|
| 77 | 10 9\n";
 | 
|---|
| 78 | 
 | 
|---|
| 79 | static std::string wrongadjacencyfile1 ="\
 | 
|---|
| 80 | 1 2\n\
 | 
|---|
| 81 | 2 1\n\
 | 
|---|
| 82 | 4 5\n\
 | 
|---|
| 83 | 5 4 6\n\
 | 
|---|
| 84 | 6 5 7\n\
 | 
|---|
| 85 | 7 6 8\n\
 | 
|---|
| 86 | 8 7 9\n\
 | 
|---|
| 87 | 9 8 10\n\
 | 
|---|
| 88 | 10 9\n";
 | 
|---|
| 89 | 
 | 
|---|
| 90 | static std::string wrongadjacencyfile2 ="\
 | 
|---|
| 91 | 1 2\n\
 | 
|---|
| 92 | 2 1 3\n\
 | 
|---|
| 93 | 3 2 4\n\
 | 
|---|
| 94 | 4 3 5\n\
 | 
|---|
| 95 | 5 4 6\n\
 | 
|---|
| 96 | 6 5 7\n\
 | 
|---|
| 97 | 7 6 8\n\
 | 
|---|
| 98 | 8 7 9\n\
 | 
|---|
| 99 | 9 8 10\n\
 | 
|---|
| 100 | 10 9 11\n\
 | 
|---|
| 101 | 11 10";
 | 
|---|
| 102 | 
 | 
|---|
| 103 | static std::string wrongadjacencyfile3 ="\
 | 
|---|
| 104 | 1 2\n\
 | 
|---|
| 105 | 2 1 3\n\
 | 
|---|
| 106 | 3 2 4\n\
 | 
|---|
| 107 | 4 3 5\n\
 | 
|---|
| 108 | 5 4 7\n\
 | 
|---|
| 109 | 6\n\
 | 
|---|
| 110 | 7 5 8\n\
 | 
|---|
| 111 | 8 7 9\n\
 | 
|---|
| 112 | 9 8 10\n\
 | 
|---|
| 113 | 10 9 11\n\
 | 
|---|
| 114 | 11 10";
 | 
|---|
| 115 | 
 | 
|---|
| 116 | // set up and tear down
 | 
|---|
| 117 | void AdjacencyListTest::setUp()
 | 
|---|
| 118 | {
 | 
|---|
| 119 |   // failing asserts should be thrown
 | 
|---|
| 120 |   ASSERT_DO(Assert::Throw);
 | 
|---|
| 121 | 
 | 
|---|
| 122 |   const element *hydrogen = World::getInstance().getPeriode()->FindElement(1);
 | 
|---|
| 123 |   CPPUNIT_ASSERT(hydrogen != NULL);
 | 
|---|
| 124 | 
 | 
|---|
| 125 |   TestMolecule = World::getInstance().createMolecule();
 | 
|---|
| 126 |   CPPUNIT_ASSERT(TestMolecule != NULL);
 | 
|---|
| 127 |   for(int i=0;i<ATOM_COUNT;++i){
 | 
|---|
| 128 |     atom *_atom = World::getInstance().createAtom();
 | 
|---|
| 129 |     CPPUNIT_ASSERT(_atom != NULL);
 | 
|---|
| 130 |     _atom->setType(hydrogen);
 | 
|---|
| 131 |     TestMolecule->AddAtom(_atom);
 | 
|---|
| 132 |     atoms.push_back(_atom);
 | 
|---|
| 133 |     atomIds.push_back(_atom->getId());
 | 
|---|
| 134 |   }
 | 
|---|
| 135 |   CPPUNIT_ASSERT_EQUAL( (size_t)ATOM_COUNT, atoms.size());
 | 
|---|
| 136 |   CPPUNIT_ASSERT_EQUAL( (size_t)ATOM_COUNT, atomIds.size());
 | 
|---|
| 137 |   // create linear chain
 | 
|---|
| 138 |   for(int i=0;i<ATOM_COUNT-1;++i)
 | 
|---|
| 139 |     atoms[i]->addBond(WorldTime::getTime(), atoms[i+1]);
 | 
|---|
| 140 | 
 | 
|---|
| 141 |   // create map as it should be
 | 
|---|
| 142 |   for(int i=0;i<ATOM_COUNT;++i) {
 | 
|---|
| 143 |     if (i != 0) // first has only one bond
 | 
|---|
| 144 |       comparisonMap.insert( std::make_pair(atomIds[i], atomIds[i-1]) );
 | 
|---|
| 145 |     if (i != ATOM_COUNT-1) // last has only one bond
 | 
|---|
| 146 |       comparisonMap.insert( std::make_pair(atomIds[i], atomIds[i+1]) );
 | 
|---|
| 147 |   }
 | 
|---|
| 148 | }
 | 
|---|
| 149 | 
 | 
|---|
| 150 | void AdjacencyListTest::tearDown()
 | 
|---|
| 151 | {
 | 
|---|
| 152 |   comparisonMap.clear();
 | 
|---|
| 153 | 
 | 
|---|
| 154 |   // destroy molecule and contained atoms
 | 
|---|
| 155 |   TestMolecule->removeAtomsinMolecule();
 | 
|---|
| 156 |   World::getInstance().destroyMolecule(TestMolecule);
 | 
|---|
| 157 |   // destroy World
 | 
|---|
| 158 |   World::purgeInstance();
 | 
|---|
| 159 | //  logger::purgeInstance();
 | 
|---|
| 160 | //  errorLogger::purgeInstance();
 | 
|---|
| 161 | }
 | 
|---|
| 162 | 
 | 
|---|
| 163 | /** Unit tests for AdjacencyList::CreateExternalMap().
 | 
|---|
| 164 |  *
 | 
|---|
| 165 |  */
 | 
|---|
| 166 | void AdjacencyListTest::CreateExternalMapTest()
 | 
|---|
| 167 | {
 | 
|---|
| 168 |   std::stringstream input;
 | 
|---|
| 169 |   AdjacencyList fileChecker(input);
 | 
|---|
| 170 |   fileChecker.CreateExternalMap(atomIds);
 | 
|---|
| 171 | 
 | 
|---|
| 172 |   // check size (it's 8*2 + 2*1 = 18 keys)
 | 
|---|
| 173 |   CPPUNIT_ASSERT_EQUAL( (size_t)18, fileChecker.ExternalAtomBondMap.size() );
 | 
|---|
| 174 |   CPPUNIT_ASSERT_EQUAL( (size_t)0, fileChecker.InternalAtomBondMap.size() );
 | 
|---|
| 175 | 
 | 
|---|
| 176 |   // check equality
 | 
|---|
| 177 |   CPPUNIT_ASSERT( comparisonMap.size() == fileChecker.ExternalAtomBondMap.size() );
 | 
|---|
| 178 | //  std::cout << "comparisonMap: " << comparisonMap << std::endl;
 | 
|---|
| 179 | //  std::cout << "fileChecker.InternalAtomBondMap: " << fileChecker.InternalAtomBondMap << std::endl;
 | 
|---|
| 180 |   CPPUNIT_ASSERT( comparisonMap == fileChecker.ExternalAtomBondMap );
 | 
|---|
| 181 | 
 | 
|---|
| 182 |   // check non-equality: more
 | 
|---|
| 183 |   comparisonMap.insert( std::make_pair( (atomId_t)10, (atomId_t)8) );
 | 
|---|
| 184 |   CPPUNIT_ASSERT( comparisonMap != fileChecker.ExternalAtomBondMap );
 | 
|---|
| 185 |   comparisonMap.erase((atomId_t)10);
 | 
|---|
| 186 | 
 | 
|---|
| 187 |   // check non-equality: less
 | 
|---|
| 188 |   comparisonMap.erase((atomId_t)9);
 | 
|---|
| 189 |   CPPUNIT_ASSERT( comparisonMap != fileChecker.ExternalAtomBondMap );
 | 
|---|
| 190 | }
 | 
|---|
| 191 | 
 | 
|---|
| 192 | /** Unit tests for AdjacencyList::ParseInInternalMap().
 | 
|---|
| 193 |  *
 | 
|---|
| 194 |  */
 | 
|---|
| 195 | void AdjacencyListTest::ParseInInternalMapTest()
 | 
|---|
| 196 | {
 | 
|---|
| 197 |   std::stringstream input(adjacencyfile);
 | 
|---|
| 198 |   AdjacencyList fileChecker(input);
 | 
|---|
| 199 |   std::vector<atomId_t> noids;
 | 
|---|
| 200 |   fileChecker.CreateExternalMap(noids);
 | 
|---|
| 201 | 
 | 
|---|
| 202 |   // check size (it's 8*2 + 2*1 = 18 keys)
 | 
|---|
| 203 |   CPPUNIT_ASSERT_EQUAL( (size_t)0, fileChecker.ExternalAtomBondMap.size() );
 | 
|---|
| 204 |   CPPUNIT_ASSERT_EQUAL( (size_t)18, fileChecker.InternalAtomBondMap.size() );
 | 
|---|
| 205 | 
 | 
|---|
| 206 |   // check equality
 | 
|---|
| 207 |   CPPUNIT_ASSERT( comparisonMap.size() == fileChecker.InternalAtomBondMap.size() );
 | 
|---|
| 208 |   CPPUNIT_ASSERT( comparisonMap == fileChecker.InternalAtomBondMap );
 | 
|---|
| 209 | 
 | 
|---|
| 210 |   // check non-equality: more
 | 
|---|
| 211 |   comparisonMap.insert( std::make_pair( (atomId_t)10, (atomId_t)8) );
 | 
|---|
| 212 |   CPPUNIT_ASSERT( comparisonMap != fileChecker.InternalAtomBondMap );
 | 
|---|
| 213 |   comparisonMap.erase((atomId_t)10);
 | 
|---|
| 214 | 
 | 
|---|
| 215 |   // check non-equality: less
 | 
|---|
| 216 |   comparisonMap.erase((atomId_t)9);
 | 
|---|
| 217 |   CPPUNIT_ASSERT( comparisonMap != fileChecker.InternalAtomBondMap );
 | 
|---|
| 218 | }
 | 
|---|
| 219 | 
 | 
|---|
| 220 | /** Unit tests for AdjacencyList::CompareInternalExternalMap().
 | 
|---|
| 221 |  *
 | 
|---|
| 222 |  */
 | 
|---|
| 223 | void AdjacencyListTest::CompareInternalExternalMapTest()
 | 
|---|
| 224 | {
 | 
|---|
| 225 |   std::stringstream input(adjacencyfile);
 | 
|---|
| 226 |   AdjacencyList fileChecker(input);
 | 
|---|
| 227 | 
 | 
|---|
| 228 |   // assert equality before parsing (empty sets should always return true)
 | 
|---|
| 229 |   CPPUNIT_ASSERT( fileChecker.ExternalAtomBondMap.size() != fileChecker.InternalAtomBondMap.size() );
 | 
|---|
| 230 |   CPPUNIT_ASSERT( fileChecker.ExternalAtomBondMap != fileChecker.InternalAtomBondMap );
 | 
|---|
| 231 |   CPPUNIT_ASSERT( fileChecker.CompareInternalExternalMap() );
 | 
|---|
| 232 | 
 | 
|---|
| 233 |   // parse in external map
 | 
|---|
| 234 |   fileChecker.CreateExternalMap(atomIds);
 | 
|---|
| 235 | 
 | 
|---|
| 236 |   // assert equality after parsing
 | 
|---|
| 237 |   CPPUNIT_ASSERT_EQUAL( fileChecker.ExternalAtomBondMap.size(), fileChecker.InternalAtomBondMap.size() );
 | 
|---|
| 238 |   CPPUNIT_ASSERT_EQUAL( fileChecker.ExternalAtomBondMap, fileChecker.InternalAtomBondMap );
 | 
|---|
| 239 |   CPPUNIT_ASSERT( fileChecker.CompareInternalExternalMap() );
 | 
|---|
| 240 | }
 | 
|---|
| 241 | 
 | 
|---|
| 242 | /** Unit tests for AdjacencyList::operator()().
 | 
|---|
| 243 |  *
 | 
|---|
| 244 |  */
 | 
|---|
| 245 | void AdjacencyListTest::CheckAgainstSubsetTest()
 | 
|---|
| 246 | {
 | 
|---|
| 247 |   {
 | 
|---|
| 248 |     // parse right
 | 
|---|
| 249 |     std::stringstream input(adjacencyfile);
 | 
|---|
| 250 |     AdjacencyList fileChecker(input);
 | 
|---|
| 251 |     CPPUNIT_ASSERT( fileChecker.CheckAgainstSubset(atomIds) );
 | 
|---|
| 252 |   }
 | 
|---|
| 253 |   {
 | 
|---|
| 254 |     // parse wrong1 (more atoms in the world than in file, hence wrong)
 | 
|---|
| 255 |     std::stringstream input(wrongadjacencyfile1);
 | 
|---|
| 256 |     AdjacencyList fileChecker(input);
 | 
|---|
| 257 |     CPPUNIT_ASSERT( !fileChecker.CheckAgainstSubset(atomIds) );
 | 
|---|
| 258 |   }
 | 
|---|
| 259 |   {
 | 
|---|
| 260 |     // remove third atom (index starts at 0) and test for equality then
 | 
|---|
| 261 |     std::vector<atomId_t> validids;
 | 
|---|
| 262 |     std::remove_copy_if(atomIds.begin(), atomIds.end(), std::back_inserter(validids), boost::lambda::_1 == (atomId_t)2);
 | 
|---|
| 263 |     CPPUNIT_ASSERT_EQUAL( (size_t)ATOM_COUNT-1, validids.size() );
 | 
|---|
| 264 |     // parse wrong1 (more atoms in the world than in file, hence wrong)
 | 
|---|
| 265 |     std::stringstream input(wrongadjacencyfile1);
 | 
|---|
| 266 |     AdjacencyList fileChecker(input);
 | 
|---|
| 267 |     CPPUNIT_ASSERT( fileChecker.CheckAgainstSubset(validids) );
 | 
|---|
| 268 |   }
 | 
|---|
| 269 |   {
 | 
|---|
| 270 |     // parse wrong2 (there is no atom 10, but present in file. hence true)
 | 
|---|
| 271 |     std::stringstream input(wrongadjacencyfile2);
 | 
|---|
| 272 |     AdjacencyList fileChecker(input);
 | 
|---|
| 273 |     CPPUNIT_ASSERT( !fileChecker.CheckAgainstSubset(atomIds) );
 | 
|---|
| 274 |   }
 | 
|---|
| 275 |   {
 | 
|---|
| 276 |     // parse wrong3 (6 is not connected)
 | 
|---|
| 277 |     std::stringstream input(wrongadjacencyfile3);
 | 
|---|
| 278 |     AdjacencyList fileChecker(input);
 | 
|---|
| 279 |     CPPUNIT_ASSERT( !fileChecker.CheckAgainstSubset(atomIds) );
 | 
|---|
| 280 |   }
 | 
|---|
| 281 | }
 | 
|---|