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