| 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 |  * SetValueMapUnitTest.cpp
 | 
|---|
| 25 |  *
 | 
|---|
| 26 |  *  Created on: Jul 4, 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 "Fragmentation/Summation/IndexSet.hpp"
 | 
|---|
| 42 | #include "Fragmentation/Summation/IndexSetContainer.hpp"
 | 
|---|
| 43 | #include "Fragmentation/Summation/SetValueMap.hpp"
 | 
|---|
| 44 | 
 | 
|---|
| 45 | #include "SetValueMapUnitTest.hpp"
 | 
|---|
| 46 | 
 | 
|---|
| 47 | #include <boost/assign.hpp>
 | 
|---|
| 48 | 
 | 
|---|
| 49 | #ifdef HAVE_TESTRUNNER
 | 
|---|
| 50 | #include "UnitTestMain.hpp"
 | 
|---|
| 51 | #endif /*HAVE_TESTRUNNER*/
 | 
|---|
| 52 | 
 | 
|---|
| 53 | using namespace boost::assign;
 | 
|---|
| 54 | 
 | 
|---|
| 55 | /********************************************** Test classes **************************************/
 | 
|---|
| 56 | 
 | 
|---|
| 57 | // Registers the fixture into the 'registry'
 | 
|---|
| 58 | CPPUNIT_TEST_SUITE_REGISTRATION( SetValueMapTest );
 | 
|---|
| 59 | 
 | 
|---|
| 60 | 
 | 
|---|
| 61 | void SetValueMapTest::setUp()
 | 
|---|
| 62 | {
 | 
|---|
| 63 | }
 | 
|---|
| 64 | 
 | 
|---|
| 65 | 
 | 
|---|
| 66 | void SetValueMapTest::tearDown()
 | 
|---|
| 67 | {
 | 
|---|
| 68 | }
 | 
|---|
| 69 | 
 | 
|---|
| 70 | /** UnitTest for addValue()
 | 
|---|
| 71 |  */
 | 
|---|
| 72 | void SetValueMapTest::addValueTest()
 | 
|---|
| 73 | {
 | 
|---|
| 74 |   IndexSet::ptr set(new IndexSet);
 | 
|---|
| 75 |   *set += 1,2,3,4;
 | 
|---|
| 76 |   CPPUNIT_ASSERT_EQUAL( (size_t)0, setmap.Lookup.size() );
 | 
|---|
| 77 |   // adding once increases number of elements
 | 
|---|
| 78 |   setmap.addValue(set, 4);
 | 
|---|
| 79 |   CPPUNIT_ASSERT_EQUAL( (size_t)1, setmap.Lookup.size() );
 | 
|---|
| 80 |   // adding set again does not introduce new element
 | 
|---|
| 81 |   setmap.addValue(set, 5);
 | 
|---|
| 82 |   CPPUNIT_ASSERT_EQUAL( (size_t)1, setmap.Lookup.size() );
 | 
|---|
| 83 | }
 | 
|---|
| 84 | 
 | 
|---|
| 85 | /** UnitTest for getValue()
 | 
|---|
| 86 |  */
 | 
|---|
| 87 | void SetValueMapTest::getValueTest()
 | 
|---|
| 88 | {
 | 
|---|
| 89 |   IndexSet::ptr set(new IndexSet);
 | 
|---|
| 90 |   *set += 1,2,3,4;
 | 
|---|
| 91 |   setmap.addValue(set, 4);
 | 
|---|
| 92 |   CPPUNIT_ASSERT_EQUAL( 4, setmap.getValue(set)->getValue() );
 | 
|---|
| 93 |   setmap.addValue(set, 5);
 | 
|---|
| 94 |   CPPUNIT_ASSERT_EQUAL( 5, setmap.getValue(set)->getValue() );
 | 
|---|
| 95 | }
 | 
|---|
| 96 | 
 | 
|---|
| 97 | /** UnitTest for getValue()
 | 
|---|
| 98 |  */
 | 
|---|
| 99 | void SetValueMapTest::removeValueTest()
 | 
|---|
| 100 | {
 | 
|---|
| 101 |   IndexSet::ptr set(new IndexSet);
 | 
|---|
| 102 |   *set += 1,2,3,4;
 | 
|---|
| 103 |   IndexSet::ptr otherset(new IndexSet);
 | 
|---|
| 104 |   *set += 1,2,3;
 | 
|---|
| 105 |   setmap.addValue(set, 4);
 | 
|---|
| 106 |   CPPUNIT_ASSERT_EQUAL( (size_t)1, setmap.Lookup.size() );
 | 
|---|
| 107 |   // remove non-present set
 | 
|---|
| 108 |   CPPUNIT_ASSERT( !setmap.removeValue(otherset) );
 | 
|---|
| 109 |   CPPUNIT_ASSERT_EQUAL( (size_t)1, setmap.Lookup.size() );
 | 
|---|
| 110 |   // remove present value
 | 
|---|
| 111 |   CPPUNIT_ASSERT( setmap.removeValue(set) );
 | 
|---|
| 112 |   CPPUNIT_ASSERT_EQUAL( (size_t)0, setmap.Lookup.size() );
 | 
|---|
| 113 |   // re-add
 | 
|---|
| 114 |   setmap.addValue(set, 4);
 | 
|---|
| 115 |   CPPUNIT_ASSERT_EQUAL( (size_t)1, setmap.Lookup.size() );
 | 
|---|
| 116 | }
 | 
|---|
| 117 | 
 | 
|---|
| 118 | /** UnitTest for iteration of internal map is working
 | 
|---|
| 119 |  */
 | 
|---|
| 120 | void SetValueMapTest::iteratorTest()
 | 
|---|
| 121 | {
 | 
|---|
| 122 |   SetValueMap<int>::const_iterator iter = setmap.begin();
 | 
|---|
| 123 |   CPPUNIT_ASSERT( iter == setmap.end() );
 | 
|---|
| 124 |   IndexSet::ptr set(new IndexSet);
 | 
|---|
| 125 |   *set += 1,2,3,4;
 | 
|---|
| 126 |   setmap.addValue(set, 4);
 | 
|---|
| 127 |   iter = setmap.begin();
 | 
|---|
| 128 |   CPPUNIT_ASSERT( iter != setmap.end() );
 | 
|---|
| 129 |   CPPUNIT_ASSERT_EQUAL (4,  iter->second->getValue());
 | 
|---|
| 130 | }
 | 
|---|