| 1 | /*
 | 
|---|
| 2 |  * Project: MoleCuilder
 | 
|---|
| 3 |  * Description: creates and alters molecular systems
 | 
|---|
| 4 |  * Copyright (C)  2012 University of Bonn. All rights reserved.
 | 
|---|
| 5 |  * Please see the COPYING file or "Copyright notice" in builder.cpp for details.
 | 
|---|
| 6 |  * 
 | 
|---|
| 7 |  *
 | 
|---|
| 8 |  *   This file is part of MoleCuilder.
 | 
|---|
| 9 |  *
 | 
|---|
| 10 |  *    MoleCuilder is free software: you can redistribute it and/or modify
 | 
|---|
| 11 |  *    it under the terms of the GNU General Public License as published by
 | 
|---|
| 12 |  *    the Free Software Foundation, either version 2 of the License, or
 | 
|---|
| 13 |  *    (at your option) any later version.
 | 
|---|
| 14 |  *
 | 
|---|
| 15 |  *    MoleCuilder is distributed in the hope that it will be useful,
 | 
|---|
| 16 |  *    but WITHOUT ANY WARRANTY; without even the implied warranty of
 | 
|---|
| 17 |  *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 | 
|---|
| 18 |  *    GNU General Public License for more details.
 | 
|---|
| 19 |  *
 | 
|---|
| 20 |  *    You should have received a copy of the GNU General Public License
 | 
|---|
| 21 |  *    along with MoleCuilder.  If not, see <http://www.gnu.org/licenses/>. 
 | 
|---|
| 22 |  */
 | 
|---|
| 23 | 
 | 
|---|
| 24 | /*
 | 
|---|
| 25 |  * HomologyContainer.cpp
 | 
|---|
| 26 |  *
 | 
|---|
| 27 |  *  Created on: Sep 22, 2012
 | 
|---|
| 28 |  *      Author: heber
 | 
|---|
| 29 |  */
 | 
|---|
| 30 | 
 | 
|---|
| 31 | 
 | 
|---|
| 32 | // include config.h
 | 
|---|
| 33 | #ifdef HAVE_CONFIG_H
 | 
|---|
| 34 | #include <config.h>
 | 
|---|
| 35 | #endif
 | 
|---|
| 36 | 
 | 
|---|
| 37 | // include headers that implement a archive in simple text format
 | 
|---|
| 38 | // otherwise BOOST_CLASS_EXPORT_IMPLEMENT has no effect
 | 
|---|
| 39 | #include <boost/archive/text_oarchive.hpp>
 | 
|---|
| 40 | #include <boost/archive/text_iarchive.hpp>
 | 
|---|
| 41 | 
 | 
|---|
| 42 | //#include "CodePatterns/MemDebug.hpp"
 | 
|---|
| 43 | 
 | 
|---|
| 44 | #include "HomologyContainer.hpp"
 | 
|---|
| 45 | 
 | 
|---|
| 46 | #include <iostream>
 | 
|---|
| 47 | 
 | 
|---|
| 48 | #include "Fragmentation/Graph.hpp"
 | 
|---|
| 49 | 
 | 
|---|
| 50 | HomologyContainer::HomologyContainer() :
 | 
|---|
| 51 |   Observable("HomologyContainer")
 | 
|---|
| 52 | {}
 | 
|---|
| 53 | 
 | 
|---|
| 54 | HomologyContainer::HomologyContainer(const container_t &values) :
 | 
|---|
| 55 |   Observable("HomologyContainer"),
 | 
|---|
| 56 |   container(values)
 | 
|---|
| 57 | {}
 | 
|---|
| 58 | 
 | 
|---|
| 59 | std::ostream& operator<<(std::ostream &out, const HomologyContainer &homologycontainer)
 | 
|---|
| 60 | {
 | 
|---|
| 61 |   for(HomologyContainer::container_t::const_iterator iter = homologycontainer.container.begin();
 | 
|---|
| 62 |       iter != homologycontainer.container.end(); ++iter) {
 | 
|---|
| 63 |     out << "Graph: " << iter->first
 | 
|---|
| 64 |         << ", (Fragment " << iter->second.fragment
 | 
|---|
| 65 |         << ":" << iter->second.energy
 | 
|---|
| 66 |         << ":" << iter->second.charge_distribution.integral()
 | 
|---|
| 67 |         << ")\n";
 | 
|---|
| 68 |   }
 | 
|---|
| 69 |   return out;
 | 
|---|
| 70 | }
 | 
|---|
| 71 | 
 | 
|---|
| 72 | bool HomologyContainer::value_t::operator==(const value_t &othervalue) const
 | 
|---|
| 73 | {
 | 
|---|
| 74 |   if (fragment != othervalue.fragment)
 | 
|---|
| 75 |     return false;
 | 
|---|
| 76 |   if (energy != othervalue.energy)
 | 
|---|
| 77 |     return false;
 | 
|---|
| 78 |   if (charge_distribution != othervalue.charge_distribution)
 | 
|---|
| 79 |     return false;
 | 
|---|
| 80 |   if (potential_distribution != othervalue.potential_distribution)
 | 
|---|
| 81 |     return false;
 | 
|---|
| 82 |   return true;
 | 
|---|
| 83 | }
 | 
|---|
| 84 | 
 | 
|---|
| 85 | bool HomologyContainer::operator>=(const HomologyContainer &other) const
 | 
|---|
| 86 | {
 | 
|---|
| 87 |   bool status = true;
 | 
|---|
| 88 |   // go through this container and check each element for presence in other
 | 
|---|
| 89 |   for (container_t::const_iterator iter = container.begin();
 | 
|---|
| 90 |       iter != container.end(); ++iter) {
 | 
|---|
| 91 |     // get all values in other container to the same graph
 | 
|---|
| 92 |     std::pair<
 | 
|---|
| 93 |       container_t::const_iterator,
 | 
|---|
| 94 |       container_t::const_iterator>
 | 
|---|
| 95 |       keyrange = other.container.equal_range(iter->first);
 | 
|---|
| 96 |     container_t::const_iterator otheriter = keyrange.first;
 | 
|---|
| 97 |     for (;otheriter != keyrange.second;
 | 
|---|
| 98 |         ++otheriter)
 | 
|---|
| 99 |       if (otheriter->second == iter->second)
 | 
|---|
| 100 |         break;
 | 
|---|
| 101 |     status &= (otheriter != keyrange.second);
 | 
|---|
| 102 |   }
 | 
|---|
| 103 |   return status;
 | 
|---|
| 104 | }
 | 
|---|
| 105 | 
 | 
|---|
| 106 | void HomologyContainer::insert(const container_t &values) {
 | 
|---|
| 107 |   OBSERVE;
 | 
|---|
| 108 |   container.insert(values.begin(), values.end());
 | 
|---|
| 109 | }
 | 
|---|
| 110 | 
 | 
|---|
| 111 | void HomologyContainer::clear() {
 | 
|---|
| 112 |   OBSERVE;
 | 
|---|
| 113 |   container.clear();
 | 
|---|
| 114 | }
 | 
|---|
| 115 | 
 | 
|---|
| 116 | bool HomologyContainer::compareEnergyContribution(
 | 
|---|
| 117 |       const std::pair<const HomologyGraph, HomologyContainer::value_t> &a,
 | 
|---|
| 118 |       const std::pair<const HomologyGraph, HomologyContainer::value_t> &b) {
 | 
|---|
| 119 |   return a.second.energy < b.second.energy;
 | 
|---|
| 120 | }
 | 
|---|
| 121 | 
 | 
|---|
| 122 | // we need to explicitly instantiate the serialization functions
 | 
|---|
| 123 | BOOST_CLASS_EXPORT_IMPLEMENT(HomologyContainer)
 | 
|---|
| 124 | 
 | 
|---|