| [4694df] | 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 | 
 | 
|---|
| [12a24c] | 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 | 
 | 
|---|
| [9eb71b3] | 42 | //#include "CodePatterns/MemDebug.hpp"
 | 
|---|
| [4694df] | 43 | 
 | 
|---|
 | 44 | #include "HomologyContainer.hpp"
 | 
|---|
 | 45 | 
 | 
|---|
| [e15ffe] | 46 | #include <iostream>
 | 
|---|
 | 47 | 
 | 
|---|
| [4694df] | 48 | #include "Fragmentation/Graph.hpp"
 | 
|---|
 | 49 | 
 | 
|---|
| [bcc24f3] | 50 | HomologyContainer::HomologyContainer() :
 | 
|---|
 | 51 |   Observable("HomologyContainer")
 | 
|---|
 | 52 | {}
 | 
|---|
 | 53 | 
 | 
|---|
 | 54 | HomologyContainer::HomologyContainer(const container_t &values) :
 | 
|---|
 | 55 |   Observable("HomologyContainer"),
 | 
|---|
 | 56 |   container(values)
 | 
|---|
 | 57 | {}
 | 
|---|
 | 58 | 
 | 
|---|
| [e15ffe] | 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
 | 
|---|
| [bf1d1b] | 64 |         << ", (Fragment " << iter->second.fragment
 | 
|---|
| [564f17] | 65 |         << ":" << iter->second.fragmentenergy
 | 
|---|
 | 66 |         << ":" << iter->second.contribution
 | 
|---|
| [bf1d1b] | 67 |         << ":" << iter->second.charge_distribution.integral()
 | 
|---|
 | 68 |         << ")\n";
 | 
|---|
| [e15ffe] | 69 |   }
 | 
|---|
 | 70 |   return out;
 | 
|---|
 | 71 | }
 | 
|---|
 | 72 | 
 | 
|---|
| [bf1d1b] | 73 | bool HomologyContainer::value_t::operator==(const value_t &othervalue) const
 | 
|---|
 | 74 | {
 | 
|---|
 | 75 |   if (fragment != othervalue.fragment)
 | 
|---|
 | 76 |     return false;
 | 
|---|
| [564f17] | 77 |   if (fragmentenergy != othervalue.fragmentenergy)
 | 
|---|
 | 78 |     return false;
 | 
|---|
 | 79 |   if (contribution != othervalue.contribution)
 | 
|---|
| [bf1d1b] | 80 |     return false;
 | 
|---|
 | 81 |   if (charge_distribution != othervalue.charge_distribution)
 | 
|---|
 | 82 |     return false;
 | 
|---|
 | 83 |   if (potential_distribution != othervalue.potential_distribution)
 | 
|---|
 | 84 |     return false;
 | 
|---|
 | 85 |   return true;
 | 
|---|
 | 86 | }
 | 
|---|
 | 87 | 
 | 
|---|
| [12a24c] | 88 | bool HomologyContainer::operator>=(const HomologyContainer &other) const
 | 
|---|
 | 89 | {
 | 
|---|
 | 90 |   bool status = true;
 | 
|---|
 | 91 |   // go through this container and check each element for presence in other
 | 
|---|
 | 92 |   for (container_t::const_iterator iter = container.begin();
 | 
|---|
 | 93 |       iter != container.end(); ++iter) {
 | 
|---|
 | 94 |     // get all values in other container to the same graph
 | 
|---|
 | 95 |     std::pair<
 | 
|---|
 | 96 |       container_t::const_iterator,
 | 
|---|
 | 97 |       container_t::const_iterator>
 | 
|---|
 | 98 |       keyrange = other.container.equal_range(iter->first);
 | 
|---|
 | 99 |     container_t::const_iterator otheriter = keyrange.first;
 | 
|---|
 | 100 |     for (;otheriter != keyrange.second;
 | 
|---|
 | 101 |         ++otheriter)
 | 
|---|
 | 102 |       if (otheriter->second == iter->second)
 | 
|---|
 | 103 |         break;
 | 
|---|
 | 104 |     status &= (otheriter != keyrange.second);
 | 
|---|
 | 105 |   }
 | 
|---|
 | 106 |   return status;
 | 
|---|
 | 107 | }
 | 
|---|
 | 108 | 
 | 
|---|
| [bcc24f3] | 109 | void HomologyContainer::insert(const container_t &values) {
 | 
|---|
 | 110 |   OBSERVE;
 | 
|---|
 | 111 |   container.insert(values.begin(), values.end());
 | 
|---|
 | 112 | }
 | 
|---|
 | 113 | 
 | 
|---|
 | 114 | void HomologyContainer::clear() {
 | 
|---|
 | 115 |   OBSERVE;
 | 
|---|
 | 116 |   container.clear();
 | 
|---|
 | 117 | }
 | 
|---|
 | 118 | 
 | 
|---|
| [ff2c52] | 119 | bool HomologyContainer::compareEnergyContribution(
 | 
|---|
 | 120 |       const std::pair<const HomologyGraph, HomologyContainer::value_t> &a,
 | 
|---|
 | 121 |       const std::pair<const HomologyGraph, HomologyContainer::value_t> &b) {
 | 
|---|
| [564f17] | 122 |   return a.second.contribution < b.second.contribution;
 | 
|---|
 | 123 | }
 | 
|---|
 | 124 | 
 | 
|---|
 | 125 | bool HomologyContainer::compareEnergy(
 | 
|---|
 | 126 |       const std::pair<const HomologyGraph, HomologyContainer::value_t> &a,
 | 
|---|
 | 127 |       const std::pair<const HomologyGraph, HomologyContainer::value_t> &b) {
 | 
|---|
 | 128 |   return a.second.fragmentenergy < b.second.fragmentenergy;
 | 
|---|
| [ff2c52] | 129 | }
 | 
|---|
 | 130 | 
 | 
|---|
| [12a24c] | 131 | // we need to explicitly instantiate the serialization functions
 | 
|---|
 | 132 | BOOST_CLASS_EXPORT_IMPLEMENT(HomologyContainer)
 | 
|---|
 | 133 | 
 | 
|---|