| 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 | * FragmentEdge.cpp | 
|---|
| 26 | * | 
|---|
| 27 | *  Created on: Sep 24, 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 "FragmentEdge.hpp" | 
|---|
| 45 |  | 
|---|
| 46 | #include <iostream> | 
|---|
| 47 |  | 
|---|
| 48 | #include "CodePatterns/Assert.hpp" | 
|---|
| 49 |  | 
|---|
| 50 | FragmentEdge::FragmentEdge() : | 
|---|
| 51 | AtomicNumberPair(std::make_pair(0,0)) | 
|---|
| 52 | {} | 
|---|
| 53 |  | 
|---|
| 54 | FragmentEdge::FragmentEdge(const AtomicNumberPair_t &_pair) : | 
|---|
| 55 | AtomicNumberPair(_pair) | 
|---|
| 56 | { | 
|---|
| 57 | ASSERT( AtomicNumberPair.first < AtomicNumberPair.second, | 
|---|
| 58 | "FragmentEdge::FragmentEdge() - when giving as pair, first must be less than second."); | 
|---|
| 59 | } | 
|---|
| 60 |  | 
|---|
| 61 | FragmentEdge::FragmentEdge(const size_t _left, const size_t _right) : | 
|---|
| 62 | AtomicNumberPair( _left < _right ? std::make_pair(_left,_right) : std::make_pair(_right,_left)) | 
|---|
| 63 | {} | 
|---|
| 64 |  | 
|---|
| 65 | /** Assignment operator for class FragmentEdge. | 
|---|
| 66 | * | 
|---|
| 67 | * We need this assignment to overcome the constness of the member. For STL | 
|---|
| 68 | * containers default cstors and usable assignment ops are required. This | 
|---|
| 69 | * const_cast is only way to allow for const member variables. | 
|---|
| 70 | * | 
|---|
| 71 | * @param edge other instance to use in assignment | 
|---|
| 72 | * @return this instance for concatenation | 
|---|
| 73 | */ | 
|---|
| 74 | FragmentEdge& FragmentEdge::operator=(const FragmentEdge &edge) | 
|---|
| 75 | { | 
|---|
| 76 | // check self-assignment | 
|---|
| 77 | if (this != &edge) { | 
|---|
| 78 | const_cast<AtomicNumberPair_t &>(this->AtomicNumberPair) = edge.AtomicNumberPair; | 
|---|
| 79 | } | 
|---|
| 80 | return *this; | 
|---|
| 81 | } | 
|---|
| 82 |  | 
|---|
| 83 | bool FragmentEdge::operator<(const FragmentEdge &edge) const | 
|---|
| 84 | { | 
|---|
| 85 | if (AtomicNumberPair.first < edge.AtomicNumberPair.first) { | 
|---|
| 86 | return true; | 
|---|
| 87 | } else if (AtomicNumberPair.first > edge.AtomicNumberPair.first) { | 
|---|
| 88 | return false; | 
|---|
| 89 | } else { | 
|---|
| 90 | if (AtomicNumberPair.second < edge.AtomicNumberPair.second) | 
|---|
| 91 | return true; | 
|---|
| 92 | else | 
|---|
| 93 | return false; | 
|---|
| 94 | } | 
|---|
| 95 | } | 
|---|
| 96 |  | 
|---|
| 97 | bool FragmentEdge::operator>(const FragmentEdge &edge) const | 
|---|
| 98 | { | 
|---|
| 99 | if (AtomicNumberPair.first > edge.AtomicNumberPair.first) { | 
|---|
| 100 | return true; | 
|---|
| 101 | } else if (AtomicNumberPair.first < edge.AtomicNumberPair.first) { | 
|---|
| 102 | return false; | 
|---|
| 103 | } else { | 
|---|
| 104 | if (AtomicNumberPair.second > edge.AtomicNumberPair.second) | 
|---|
| 105 | return true; | 
|---|
| 106 | else | 
|---|
| 107 | return false; | 
|---|
| 108 | } | 
|---|
| 109 | } | 
|---|
| 110 |  | 
|---|
| 111 | bool FragmentEdge::operator==(const FragmentEdge &edge) const | 
|---|
| 112 | { | 
|---|
| 113 | if (AtomicNumberPair.first != edge.AtomicNumberPair.first) { | 
|---|
| 114 | return false; | 
|---|
| 115 | } else { | 
|---|
| 116 | return (AtomicNumberPair.second == edge.AtomicNumberPair.second); | 
|---|
| 117 | } | 
|---|
| 118 | } | 
|---|
| 119 |  | 
|---|
| 120 | std::ostream& operator<<(std::ostream &out, const FragmentEdge &edge) | 
|---|
| 121 | { | 
|---|
| 122 | out << edge.AtomicNumberPair.first << "<->" << edge.AtomicNumberPair.second; | 
|---|
| 123 | return out; | 
|---|
| 124 | } | 
|---|
| 125 |  | 
|---|
| 126 | // | 
|---|
| 127 | //// we need to explicitly instantiate the serialization functions | 
|---|
| 128 | //BOOST_CLASS_EXPORT_IMPLEMENT(FragmentEdge) | 
|---|