| [bcf653] | 1 | /* | 
|---|
|  | 2 | * Project: MoleCuilder | 
|---|
|  | 3 | * Description: creates and alters molecular systems | 
|---|
| [22b786] | 4 | * Copyright (C)  2013 University of Bonn. All rights reserved. | 
|---|
| [5aaa43] | 5 | * Copyright (C)  2013 Frederik Heber. All rights reserved. | 
|---|
| [94d5ac6] | 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/>. | 
|---|
| [bcf653] | 22 | */ | 
|---|
|  | 23 |  | 
|---|
| [97ebf8] | 24 | /* | 
|---|
|  | 25 | * SubgraphDissectionAction.cpp | 
|---|
|  | 26 | * | 
|---|
| [22b786] | 27 | *  Created on: Mar 1, 2013 | 
|---|
| [97ebf8] | 28 | *      Author: heber | 
|---|
|  | 29 | */ | 
|---|
|  | 30 |  | 
|---|
| [bf3817] | 31 | // include config.h | 
|---|
|  | 32 | #ifdef HAVE_CONFIG_H | 
|---|
|  | 33 | #include <config.h> | 
|---|
|  | 34 | #endif | 
|---|
|  | 35 |  | 
|---|
| [ad011c] | 36 | #include "CodePatterns/MemDebug.hpp" | 
|---|
| [112b09] | 37 |  | 
|---|
| [22b786] | 38 | #include "CodePatterns/Chronos.hpp" | 
|---|
| [d74077] | 39 |  | 
|---|
| [22b786] | 40 | #include "Actions/GraphAction/CreateAdjacencyAction.hpp" | 
|---|
|  | 41 | #include "Actions/GraphAction/DestroyAdjacencyAction.hpp" | 
|---|
|  | 42 | #include "Actions/GraphAction/UpdateMoleculesAction.hpp" | 
|---|
|  | 43 | #include "Actions/GraphAction/SubgraphDissectionAction.hpp" | 
|---|
| [628577] | 44 | #include "Actions/ActionQueue.hpp" | 
|---|
| [ed3944] | 45 | #include "Actions/ActionRegistry.hpp" | 
|---|
| [97ebf8] | 46 |  | 
|---|
| [22b786] | 47 | #include "Descriptors/AtomDescriptor.hpp" | 
|---|
| [97ebf8] | 48 |  | 
|---|
| [f47e00b] | 49 | using namespace MoleCuilder; | 
|---|
| [faa1c9] | 50 |  | 
|---|
| [f47e00b] | 51 | // and construct the stuff | 
|---|
|  | 52 | #include "SubgraphDissectionAction.def" | 
|---|
|  | 53 | #include "MakroAction_impl_pre.hpp" | 
|---|
|  | 54 | /** =========== define the function ====================== */ | 
|---|
| [ce7fdc] | 55 |  | 
|---|
| [22b786] | 56 | // static instances | 
|---|
|  | 57 | ActionSequence GraphSubgraphDissectionAction::actions; | 
|---|
|  | 58 | bool GraphSubgraphDissectionAction::isPrepared = false; | 
|---|
|  | 59 |  | 
|---|
|  | 60 | void GraphSubgraphDissectionAction::prepare(ActionRegistry &AR) | 
|---|
|  | 61 | { | 
|---|
| [f47e00b] | 62 | actions.addAction(AR.getActionByName(std::string("select-all-atoms"))); | 
|---|
| [22b786] | 63 | actions.addAction(AR.getActionByName(std::string("destroy-adjacency"))); | 
|---|
|  | 64 | actions.addAction(AR.getActionByName(std::string("create-adjacency"))); | 
|---|
|  | 65 | actions.addAction(AR.getActionByName(std::string("update-molecules"))); | 
|---|
|  | 66 | isPrepared = true; | 
|---|
|  | 67 | } | 
|---|
|  | 68 |  | 
|---|
|  | 69 | void GraphSubgraphDissectionAction::unprepare(ActionRegistry &AR) | 
|---|
|  | 70 | { | 
|---|
|  | 71 | // empty sequence | 
|---|
|  | 72 | while (actions.removeLastAction() != NULL); | 
|---|
|  | 73 | isPrepared = false; | 
|---|
|  | 74 | } | 
|---|
|  | 75 |  | 
|---|
|  | 76 | void reselectAtoms(const std::vector<atom *> &selected_atoms) | 
|---|
|  | 77 | { | 
|---|
|  | 78 | World::getInstance().clearAtomSelection(); | 
|---|
|  | 79 | for (std::vector<atom *>::const_iterator iter = selected_atoms.begin(); | 
|---|
|  | 80 | iter != selected_atoms.end(); | 
|---|
|  | 81 | ++iter) | 
|---|
|  | 82 | World::getInstance().selectAtom(*iter); | 
|---|
|  | 83 | } | 
|---|
|  | 84 |  | 
|---|
| [b5b01e] | 85 | ActionState::ptr GraphSubgraphDissectionAction::performCall(){ | 
|---|
| [22b786] | 86 | // we need to "emulate" that all atoms have been selected without destroying | 
|---|
|  | 87 | // current selection | 
|---|
|  | 88 | const std::vector<atom *> selected_atoms = World::getInstance().getSelectedAtoms(); | 
|---|
| [b5b01e] | 89 | ActionState::ptr state(MakroAction::performCall()); | 
|---|
| [22b786] | 90 | reselectAtoms(selected_atoms); | 
|---|
|  | 91 |  | 
|---|
|  | 92 | return state; | 
|---|
| [97ebf8] | 93 | } | 
|---|
|  | 94 |  | 
|---|
| [b5b01e] | 95 | ActionState::ptr GraphSubgraphDissectionAction::performUndo(ActionState::ptr _state) { | 
|---|
| [22b786] | 96 | // we need to "emulate" that all atoms have been selected without destroying | 
|---|
|  | 97 | // current selection | 
|---|
|  | 98 | const std::vector<atom *> selected_atoms = World::getInstance().getSelectedAtoms(); | 
|---|
| [b5b01e] | 99 | ActionState::ptr state(MakroAction::performUndo(_state)); | 
|---|
| [22b786] | 100 | reselectAtoms(selected_atoms); | 
|---|
|  | 101 |  | 
|---|
|  | 102 | return state; | 
|---|
| [97ebf8] | 103 | } | 
|---|
|  | 104 |  | 
|---|
| [b5b01e] | 105 | ActionState::ptr GraphSubgraphDissectionAction::performRedo(ActionState::ptr _state){ | 
|---|
| [22b786] | 106 | // we need to "emulate" that all atoms have been selected without destroying | 
|---|
|  | 107 | // current selection | 
|---|
|  | 108 | const std::vector<atom *> selected_atoms = World::getInstance().getSelectedAtoms(); | 
|---|
| [b5b01e] | 109 | ActionState::ptr state(MakroAction::performRedo(_state)); | 
|---|
| [22b786] | 110 | reselectAtoms(selected_atoms); | 
|---|
|  | 111 |  | 
|---|
|  | 112 | return state; | 
|---|
| [97ebf8] | 113 | } | 
|---|
|  | 114 |  | 
|---|
| [f47e00b] | 115 | bool GraphSubgraphDissectionAction::canUndo(){ | 
|---|
|  | 116 | return true; | 
|---|
|  | 117 | } | 
|---|
| [97ebf8] | 118 |  | 
|---|
| [f47e00b] | 119 | bool GraphSubgraphDissectionAction::shouldUndo(){ | 
|---|
|  | 120 | return true; | 
|---|
| [97ebf8] | 121 | } | 
|---|