| 1 | /* | 
|---|
| 2 | * Project: MoleCuilder | 
|---|
| 3 | * Description: creates and alters molecular systems | 
|---|
| 4 | * Copyright (C)  2010-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 | * ActionSequence.cpp | 
|---|
| 25 | * | 
|---|
| 26 | *  Created on: Dec 17, 2009 | 
|---|
| 27 | *      Author: crueger | 
|---|
| 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 "Actions/ActionSequence.hpp" | 
|---|
| 38 | #include "Actions/Action.hpp" | 
|---|
| 39 | #include "Actions/ActionExceptions.hpp" | 
|---|
| 40 | #include "UIElements/Dialog.hpp" | 
|---|
| 41 |  | 
|---|
| 42 | #include "CodePatterns/Assert.hpp" | 
|---|
| 43 |  | 
|---|
| 44 | #include <iostream> | 
|---|
| 45 |  | 
|---|
| 46 | using namespace MoleCuilder; | 
|---|
| 47 |  | 
|---|
| 48 | ActionSequence::ActionSequence() : | 
|---|
| 49 | loop(1) | 
|---|
| 50 | {} | 
|---|
| 51 |  | 
|---|
| 52 | ActionSequence::ActionSequence(const ActionSequence &_other) : | 
|---|
| 53 | loop(1) | 
|---|
| 54 | { | 
|---|
| 55 | // we need to override copy cstor as we have pointer referenced objects | 
|---|
| 56 | for(actionSet::const_iterator it=_other.actions.begin(); it!=_other.actions.end(); it++){ | 
|---|
| 57 | actions.push_back((*it)->clone()); | 
|---|
| 58 | } | 
|---|
| 59 | } | 
|---|
| 60 |  | 
|---|
| 61 | ActionSequence::~ActionSequence() | 
|---|
| 62 | { | 
|---|
| 63 | for (actionSet::iterator iter = actions.begin(); !actions.empty(); iter = actions.begin()) { | 
|---|
| 64 | delete *iter; | 
|---|
| 65 | actions.erase(iter); | 
|---|
| 66 | } | 
|---|
| 67 | } | 
|---|
| 68 |  | 
|---|
| 69 |  | 
|---|
| 70 | void ActionSequence::addAction(Action* _action) | 
|---|
| 71 | { | 
|---|
| 72 | // actions are already clone on push as ActionRegistry hands out const refs only | 
|---|
| 73 | actions.push_back(_action); | 
|---|
| 74 | } | 
|---|
| 75 |  | 
|---|
| 76 | bool ActionSequence::removeAction(const std::string &name) | 
|---|
| 77 | { | 
|---|
| 78 | actionSet::iterator it=actions.begin(); | 
|---|
| 79 | for(; it!=actions.end(); it++){ | 
|---|
| 80 | if ((*it)->getName() == name) { | 
|---|
| 81 | delete *it; | 
|---|
| 82 | actions.erase(it); | 
|---|
| 83 | break; | 
|---|
| 84 | } | 
|---|
| 85 | } | 
|---|
| 86 | return it!=actions.end(); | 
|---|
| 87 | } | 
|---|
| 88 |  | 
|---|
| 89 | Action* ActionSequence::removeLastAction() | 
|---|
| 90 | { | 
|---|
| 91 | if(actions.empty()) { | 
|---|
| 92 | return 0; | 
|---|
| 93 | } | 
|---|
| 94 | else { | 
|---|
| 95 | Action* theAction; | 
|---|
| 96 | theAction = actions.back(); | 
|---|
| 97 | actions.pop_back(); | 
|---|
| 98 | return theAction; | 
|---|
| 99 | } | 
|---|
| 100 | } | 
|---|
| 101 |  | 
|---|
| 102 | // this method is used outside the ActionModule | 
|---|
| 103 | // Each action registers itself with the history | 
|---|
| 104 | Dialog* ActionSequence::fillAllDialogs(Dialog *dialog) | 
|---|
| 105 | { | 
|---|
| 106 | for(actionSet::iterator it=actions.begin(); it!=actions.end(); it++){ | 
|---|
| 107 | dialog = (*it)->fillDialog(dialog); | 
|---|
| 108 | } | 
|---|
| 109 | return dialog; | 
|---|
| 110 | } | 
|---|
| 111 |  | 
|---|
| 112 | // this method is used outside the ActionModule | 
|---|
| 113 | // Each action registers itself with the history | 
|---|
| 114 | void ActionSequence::callAll() | 
|---|
| 115 | { | 
|---|
| 116 | for (size_t i=0;i<loop;++i) | 
|---|
| 117 | for(actionSet::iterator it=actions.begin(); it!=actions.end(); it++){ | 
|---|
| 118 | // we want to have a global bookkeeping for all actions in the sequence, so | 
|---|
| 119 | // we bypass the normal call | 
|---|
| 120 | (*it)->call(); | 
|---|
| 121 | } | 
|---|
| 122 | } | 
|---|
| 123 |  | 
|---|
| 124 | // This method is used internally when MakroActions are constructed. | 
|---|
| 125 | // In this case only the makro Action should be registered and | 
|---|
| 126 | // handle the states | 
|---|
| 127 | ActionSequence::stateSet ActionSequence::callAll(bool) | 
|---|
| 128 | { | 
|---|
| 129 | stateSet states; | 
|---|
| 130 | for (size_t i=0;i<loop;++i) | 
|---|
| 131 | for(actionSet::iterator it=actions.begin(); it!=actions.end(); it++){ | 
|---|
| 132 | // we want to have a global bookkeeping for all actions in the sequence, so | 
|---|
| 133 | // we bypass the normal call | 
|---|
| 134 | ActionState::ptr state = (*it)->performCall(); | 
|---|
| 135 | if (state == Action::failure) | 
|---|
| 136 | throw ActionFailureException() << ActionNameString((*it)->getName()); | 
|---|
| 137 | states.push_back(state); | 
|---|
| 138 | } | 
|---|
| 139 | return states; | 
|---|
| 140 | } | 
|---|
| 141 |  | 
|---|
| 142 | ActionSequence::stateSet ActionSequence::undoAll(stateSet states) | 
|---|
| 143 | { | 
|---|
| 144 | ASSERT(canUndo(),"Trying to undo a sequence that contains methods that can't be undone"); | 
|---|
| 145 | stateSet res; | 
|---|
| 146 | actionSet::reverse_iterator actionRit = actions.rbegin(); | 
|---|
| 147 | stateSet::reverse_iterator stateRit = states.rbegin(); | 
|---|
| 148 | for(;actionRit!=actions.rend();++actionRit,++stateRit){ | 
|---|
| 149 | ASSERT(stateRit!=states.rend(),"End of states prematurely reached."); | 
|---|
| 150 | if((*actionRit)->shouldUndo()){ | 
|---|
| 151 | ActionState::ptr newState = (*actionRit)->performUndo(*stateRit); | 
|---|
| 152 | // The order of the states has to correspond to the order of the actions | 
|---|
| 153 | // this is why we have to add at the beginning | 
|---|
| 154 | res.push_front(newState); | 
|---|
| 155 | } | 
|---|
| 156 | else{ | 
|---|
| 157 | res.push_front(Action::success); | 
|---|
| 158 | } | 
|---|
| 159 | } | 
|---|
| 160 | return res; | 
|---|
| 161 | } | 
|---|
| 162 |  | 
|---|
| 163 | ActionSequence::stateSet ActionSequence::redoAll(stateSet states) | 
|---|
| 164 | { | 
|---|
| 165 | stateSet res; | 
|---|
| 166 | actionSet::iterator actionIt = actions.begin(); | 
|---|
| 167 | stateSet::iterator stateIt = states.begin(); | 
|---|
| 168 | for(;actionIt!=actions.end();++actionIt,++stateIt){ | 
|---|
| 169 | ASSERT(stateIt!=states.end(),"End of states prematurely reached."); | 
|---|
| 170 | if((*actionIt)->shouldUndo()){ | 
|---|
| 171 | ActionState::ptr newState =(*actionIt)->performRedo(*stateIt); | 
|---|
| 172 | res.push_back(newState); | 
|---|
| 173 | } | 
|---|
| 174 | else{ | 
|---|
| 175 | res.push_back(Action::success); | 
|---|
| 176 | } | 
|---|
| 177 | } | 
|---|
| 178 | return res; | 
|---|
| 179 | } | 
|---|
| 180 |  | 
|---|
| 181 | bool ActionSequence::canUndo() | 
|---|
| 182 | { | 
|---|
| 183 | bool canUndo=true; | 
|---|
| 184 | for(std::deque<Action*>::iterator it=actions.begin(); it!=actions.end(); ++it){ | 
|---|
| 185 | if((*it)->shouldUndo()){ | 
|---|
| 186 | canUndo &= (*it)->canUndo(); | 
|---|
| 187 | } | 
|---|
| 188 | } | 
|---|
| 189 | return canUndo; | 
|---|
| 190 | } | 
|---|
| 191 |  | 
|---|
| 192 | bool ActionSequence::shouldUndo() | 
|---|
| 193 | { | 
|---|
| 194 | bool shouldUndo = false; | 
|---|
| 195 | for(std::deque<Action*>::iterator it=actions.begin();it!=actions.end();++it){ | 
|---|
| 196 | shouldUndo |= (*it)->shouldUndo(); | 
|---|
| 197 | } | 
|---|
| 198 | return shouldUndo; | 
|---|
| 199 | } | 
|---|
| 200 |  | 
|---|
| 201 | void ActionSequence::outputAsCLI(std::ostream &ost) const | 
|---|
| 202 | { | 
|---|
| 203 | for(std::deque<Action*>::const_iterator it=actions.begin();it!=actions.end();++it){ | 
|---|
| 204 | (*it)->outputAsCLI(ost); | 
|---|
| 205 | ost << " "; | 
|---|
| 206 | } | 
|---|
| 207 | } | 
|---|
| 208 |  | 
|---|
| 209 | void ActionSequence::outputAsPython(std::ostream &ost, const std::string &prefix) const | 
|---|
| 210 | { | 
|---|
| 211 | for(std::deque<Action*>::const_iterator it=actions.begin();it!=actions.end();++it) | 
|---|
| 212 | (*it)->outputAsPython(ost, prefix); | 
|---|
| 213 | } | 
|---|
| 214 |  | 
|---|
| 215 | void ActionSequence::setOptionValue(const std::string &_token, const std::string &_value) | 
|---|
| 216 | { | 
|---|
| 217 | for(std::deque<Action*>::const_iterator it=actions.begin();it!=actions.end();++it) | 
|---|
| 218 | (*it)->setOptionValue(_token, _value); | 
|---|
| 219 | } | 
|---|