| 1 | /* | 
|---|
| 2 | * Project: MoleCuilder | 
|---|
| 3 | * Description: creates and alters molecular systems | 
|---|
| 4 | * Copyright (C)  2012 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 | * TimeStepPresentValidator.cpp | 
|---|
| 25 | * | 
|---|
| 26 | *  Created on: May 10, 2012 | 
|---|
| 27 | *      Author: ankele | 
|---|
| 28 | */ | 
|---|
| 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 "TimeStepPresentValidator.hpp" | 
|---|
| 39 |  | 
|---|
| 40 | #include "WorldTime.hpp" | 
|---|
| 41 | #include "World.hpp" | 
|---|
| 42 |  | 
|---|
| 43 | bool TimeStepPresentValidator::isValid(const unsigned int & _value) const | 
|---|
| 44 | { | 
|---|
| 45 | size_t maxTime = 0; | 
|---|
| 46 | std::vector<atom*> AllAtoms = World::getInstance().getAllAtoms(); | 
|---|
| 47 | for(std::vector<atom*>::iterator AtomRunner = AllAtoms.begin(); AtomRunner != AllAtoms.end(); ++AtomRunner) { | 
|---|
| 48 | size_t sizeTrajectory = (dynamic_cast<AtomInfo *>(*AtomRunner))->getTrajectorySize(); | 
|---|
| 49 | if (sizeTrajectory > maxTime) | 
|---|
| 50 | maxTime = sizeTrajectory; | 
|---|
| 51 | } | 
|---|
| 52 |  | 
|---|
| 53 | return (_value <= maxTime); | 
|---|
| 54 | } | 
|---|
| 55 |  | 
|---|
| 56 | bool TimeStepPresentValidator::operator==(const Validator<unsigned int> &_instance) const | 
|---|
| 57 | { | 
|---|
| 58 | const TimeStepPresentValidator *inst = | 
|---|
| 59 | dynamic_cast<const TimeStepPresentValidator *>(&_instance); | 
|---|
| 60 | if (inst) | 
|---|
| 61 | return true; | 
|---|
| 62 | else | 
|---|
| 63 | return false; | 
|---|
| 64 | } | 
|---|
| 65 |  | 
|---|
| 66 | Validator< unsigned int >* TimeStepPresentValidator::clone() const | 
|---|
| 67 | { | 
|---|
| 68 | Validator< unsigned int > *inst = | 
|---|
| 69 | new TimeStepPresentValidator(); | 
|---|
| 70 | return inst; | 
|---|
| 71 | } | 
|---|
| 72 |  | 
|---|
| 73 |  | 
|---|
| 74 |  | 
|---|
| 75 |  | 
|---|