| 1 | /* | 
|---|
| 2 | * ActionSequenze.cpp | 
|---|
| 3 | * | 
|---|
| 4 | *  Created on: Dec 17, 2009 | 
|---|
| 5 | *      Author: crueger | 
|---|
| 6 | */ | 
|---|
| 7 |  | 
|---|
| 8 | #include "Actions/ActionSequence.hpp" | 
|---|
| 9 | #include "Actions/Action.hpp" | 
|---|
| 10 |  | 
|---|
| 11 | #include "Helpers/Assert.hpp" | 
|---|
| 12 |  | 
|---|
| 13 | using namespace std; | 
|---|
| 14 |  | 
|---|
| 15 | ActionSequence::ActionSequence() | 
|---|
| 16 | {} | 
|---|
| 17 |  | 
|---|
| 18 | ActionSequence::~ActionSequence() | 
|---|
| 19 | {} | 
|---|
| 20 |  | 
|---|
| 21 |  | 
|---|
| 22 | void ActionSequence::addAction(Action* _action){ | 
|---|
| 23 | actions.push_back(_action); | 
|---|
| 24 | } | 
|---|
| 25 |  | 
|---|
| 26 | Action* ActionSequence::removeLastAction(){ | 
|---|
| 27 | if(actions.empty()) { | 
|---|
| 28 | return 0; | 
|---|
| 29 | } | 
|---|
| 30 | else { | 
|---|
| 31 | Action* theAction; | 
|---|
| 32 | theAction = actions.back(); | 
|---|
| 33 | actions.pop_back(); | 
|---|
| 34 | return theAction; | 
|---|
| 35 | } | 
|---|
| 36 | } | 
|---|
| 37 |  | 
|---|
| 38 | ActionSequence::stateSet ActionSequence::callAll(){ | 
|---|
| 39 | stateSet states; | 
|---|
| 40 | for(actionSet::iterator it=actions.begin(); it!=actions.end(); it++){ | 
|---|
| 41 | // we want to have a global bookkeeping for all actions in the sequence, so | 
|---|
| 42 | // we bypass the normal call | 
|---|
| 43 | Action::state_ptr state = (*it)->performCall(); | 
|---|
| 44 | states.push_back(state); | 
|---|
| 45 | } | 
|---|
| 46 | return states; | 
|---|
| 47 | } | 
|---|
| 48 |  | 
|---|
| 49 | ActionSequence::stateSet ActionSequence::undoAll(stateSet states){ | 
|---|
| 50 | ASSERT(canUndo(),"Trying to undo a sequence that contains methods that can't be undone"); | 
|---|
| 51 | stateSet res; | 
|---|
| 52 | actionSet::reverse_iterator actionRit = actions.rbegin(); | 
|---|
| 53 | stateSet::reverse_iterator stateRit = states.rbegin(); | 
|---|
| 54 | for(;actionRit!=actions.rend();++actionRit,++stateRit){ | 
|---|
| 55 | ASSERT(stateRit!=states.rend(),"End of states prematurely reached."); | 
|---|
| 56 | if((*actionRit)->shouldUndo()){ | 
|---|
| 57 | Action::state_ptr newState = (*actionRit)->performUndo(*stateRit); | 
|---|
| 58 | // The order of the states has to correspond to the order of the actions | 
|---|
| 59 | // this is why we have to add at the beginning | 
|---|
| 60 | res.push_front(newState); | 
|---|
| 61 | } | 
|---|
| 62 | else{ | 
|---|
| 63 | res.push_front(Action::success); | 
|---|
| 64 | } | 
|---|
| 65 | } | 
|---|
| 66 | return res; | 
|---|
| 67 | } | 
|---|
| 68 |  | 
|---|
| 69 | ActionSequence::stateSet ActionSequence::redoAll(stateSet states){ | 
|---|
| 70 | stateSet res; | 
|---|
| 71 | actionSet::iterator actionIt = actions.begin(); | 
|---|
| 72 | stateSet::iterator stateIt = states.begin(); | 
|---|
| 73 | for(;actionIt!=actions.end();++actionIt,++stateIt){ | 
|---|
| 74 | ASSERT(stateIt!=states.end(),"End of states prematurely reached."); | 
|---|
| 75 | if((*actionIt)->shouldUndo()){ | 
|---|
| 76 | Action::state_ptr newState =(*actionIt)->performRedo(*stateIt); | 
|---|
| 77 | res.push_back(newState); | 
|---|
| 78 | } | 
|---|
| 79 | else{ | 
|---|
| 80 | res.push_back(Action::success); | 
|---|
| 81 | } | 
|---|
| 82 | } | 
|---|
| 83 | return res; | 
|---|
| 84 | } | 
|---|
| 85 |  | 
|---|
| 86 | bool ActionSequence::canUndo(){ | 
|---|
| 87 | bool canUndo=true; | 
|---|
| 88 | for(deque<Action*>::iterator it=actions.begin(); it!=actions.end(); ++it){ | 
|---|
| 89 | if((*it)->shouldUndo()){ | 
|---|
| 90 | canUndo &= (*it)->canUndo(); | 
|---|
| 91 | } | 
|---|
| 92 | } | 
|---|
| 93 | return canUndo; | 
|---|
| 94 | } | 
|---|
| 95 |  | 
|---|
| 96 | bool ActionSequence::shouldUndo(){ | 
|---|
| 97 | bool shouldUndo = false; | 
|---|
| 98 | for(deque<Action*>::iterator it=actions.begin();it!=actions.end();++it){ | 
|---|
| 99 | shouldUndo |= (*it)->shouldUndo(); | 
|---|
| 100 | } | 
|---|
| 101 | return shouldUndo; | 
|---|
| 102 | } | 
|---|