| [a3427f] | 1 | /* | 
|---|
|  | 2 | * Project: MoleCuilder | 
|---|
|  | 3 | * Description: creates and alters molecular systems | 
|---|
|  | 4 | * Copyright (C)  2013 University of Bonn. All rights reserved. | 
|---|
| [5aaa43] | 5 | * Copyright (C)  2013 Frederik Heber. All rights reserved. | 
|---|
| [a3427f] | 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 | * FragmentationResultContainer.cpp | 
|---|
|  | 26 | * | 
|---|
|  | 27 | *  Created on: Mar 8, 2013 | 
|---|
|  | 28 | *      Author: heber | 
|---|
|  | 29 | */ | 
|---|
|  | 30 |  | 
|---|
|  | 31 | // include config.h | 
|---|
|  | 32 | #ifdef HAVE_CONFIG_H | 
|---|
|  | 33 | #include <config.h> | 
|---|
|  | 34 | #endif | 
|---|
|  | 35 |  | 
|---|
|  | 36 | #include "CodePatterns/MemDebug.hpp" | 
|---|
|  | 37 |  | 
|---|
|  | 38 | #include "FragmentationResultContainer.hpp" | 
|---|
|  | 39 |  | 
|---|
|  | 40 | #include "CodePatterns/Assert.hpp" | 
|---|
|  | 41 | #include "CodePatterns/Singleton_impl.hpp" | 
|---|
|  | 42 |  | 
|---|
|  | 43 | #ifdef HAVE_VMG | 
|---|
|  | 44 | void FragmentationResultContainer::addFullResults( | 
|---|
|  | 45 | const KeySetsContainer &_keysets, | 
|---|
|  | 46 | const KeySetsContainer &_forcekeysets, | 
|---|
|  | 47 | const shortrangedata_t &_shortrangedata, | 
|---|
|  | 48 | const longrangedata_t &_longrangedata | 
|---|
|  | 49 | ) | 
|---|
|  | 50 | { | 
|---|
|  | 51 | ASSERT( ResultsType == BothRanges, | 
|---|
|  | 52 | "FragmentationResultContainer::getLongRangeResults() - mixing full and short range is not in the cards."); | 
|---|
|  | 53 | ASSERT( _keysets.KeySets.size() == _forcekeysets.KeySets.size(), | 
|---|
|  | 54 | "FragmentationResultContainer::addFullResults() - keysets (" | 
|---|
|  | 55 | +toString(_keysets.KeySets.size())+") and forcekeysets ("+toString(_forcekeysets.KeySets.size()) | 
|---|
|  | 56 | +") differ in size."); | 
|---|
|  | 57 | ASSERT( _keysets.KeySets.size() == _shortrangedata.size(), | 
|---|
|  | 58 | "FragmentationResultContainer::addFullResults() - keysets (" | 
|---|
|  | 59 | +toString(_keysets.KeySets.size())+") and shortrangedata ("+toString(_shortrangedata.size()) | 
|---|
|  | 60 | +") differ in size."); | 
|---|
|  | 61 | // there are more results for longrangedata! | 
|---|
|  | 62 | //  ASSERT( _keysets.KeySets.size() == _longrangedata.size(), | 
|---|
|  | 63 | //      "FragmentationResultContainer::addFullResults() - keysets (" | 
|---|
|  | 64 | //      +toString(_keysets.KeySets.size())+") and longrangedata ("+toString(_longrangedata.size()) | 
|---|
|  | 65 | //      +") differ in size."); | 
|---|
|  | 66 | keysets.insert(_keysets); | 
|---|
|  | 67 | forcekeysets.insert(_forcekeysets); | 
|---|
|  | 68 | shortrangedata.insert(_shortrangedata.begin(), _shortrangedata.end()); | 
|---|
|  | 69 | longrangedata.insert(_longrangedata.begin(), _longrangedata.end()); | 
|---|
|  | 70 | } | 
|---|
|  | 71 | #endif | 
|---|
|  | 72 |  | 
|---|
|  | 73 | void FragmentationResultContainer::addShortRangeResults( | 
|---|
|  | 74 | const KeySetsContainer &_keysets, | 
|---|
|  | 75 | const KeySetsContainer &_forcekeysets, | 
|---|
|  | 76 | const shortrangedata_t &_shortrangedata | 
|---|
|  | 77 | ) | 
|---|
|  | 78 | { | 
|---|
|  | 79 | ASSERT( (ResultsType == ShortRangeOnly) || (keysets.KeySets.empty()) , | 
|---|
|  | 80 | "FragmentationResultContainer::getLongRangeResults() - mixing full and short range is not in the cards."); | 
|---|
|  | 81 | ASSERT( _keysets.KeySets.size() == _forcekeysets.KeySets.size(), | 
|---|
|  | 82 | "FragmentationResultContainer::addFullResults() - keysets (" | 
|---|
|  | 83 | +toString(_keysets.KeySets.size())+") and forcekeysets ("+toString(_forcekeysets.KeySets.size()) | 
|---|
|  | 84 | +") differ in size."); | 
|---|
|  | 85 | ASSERT( _keysets.KeySets.size() == _shortrangedata.size(), | 
|---|
|  | 86 | "FragmentationResultContainer::addFullResults() - keysets (" | 
|---|
|  | 87 | +toString(_keysets.KeySets.size())+") and shortrangedata ("+toString(_shortrangedata.size()) | 
|---|
|  | 88 | +") differ in size."); | 
|---|
|  | 89 | // deteriorate to short range only | 
|---|
|  | 90 | ResultsType = ShortRangeOnly; | 
|---|
|  | 91 | keysets.insert(_keysets); | 
|---|
|  | 92 | forcekeysets.insert(_forcekeysets); | 
|---|
|  | 93 | shortrangedata.insert(_shortrangedata.begin(), _shortrangedata.end()); | 
|---|
|  | 94 | } | 
|---|
|  | 95 |  | 
|---|
|  | 96 |  | 
|---|
|  | 97 | #ifdef HAVE_VMG | 
|---|
|  | 98 | const FragmentationResultContainer::longrangedata_t& | 
|---|
|  | 99 | FragmentationResultContainer::getLongRangeResults() const | 
|---|
|  | 100 | { | 
|---|
|  | 101 | ASSERT( ResultsType == BothRanges, | 
|---|
|  | 102 | "FragmentationResultContainer::getLongRangeResults() - access although storing only short range."); | 
|---|
|  | 103 | return longrangedata; | 
|---|
|  | 104 | } | 
|---|
|  | 105 | #endif | 
|---|
|  | 106 |  | 
|---|
|  | 107 | CONSTRUCT_SINGLETON(FragmentationResultContainer) | 
|---|