1 | /*
|
---|
2 | * Project: MoleCuilder
|
---|
3 | * Description: creates and alters molecular systems
|
---|
4 | * Copyright (C) 2013 University of Bonn. All rights reserved.
|
---|
5 | * Copyright (C) 2013 Frederik Heber. All rights reserved.
|
---|
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/>.
|
---|
22 | */
|
---|
23 |
|
---|
24 | /*
|
---|
25 | * SubgraphDissectionAction.cpp
|
---|
26 | *
|
---|
27 | * Created on: Mar 1, 2013
|
---|
28 | * Author: heber
|
---|
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 "CodePatterns/Chronos.hpp"
|
---|
39 |
|
---|
40 | #include "Actions/GraphAction/CreateAdjacencyAction.hpp"
|
---|
41 | #include "Actions/GraphAction/DestroyAdjacencyAction.hpp"
|
---|
42 | #include "Actions/GraphAction/UpdateMoleculesAction.hpp"
|
---|
43 | #include "Actions/GraphAction/SubgraphDissectionAction.hpp"
|
---|
44 | #include "Actions/ActionQueue.hpp"
|
---|
45 | #include "Actions/ActionRegistry.hpp"
|
---|
46 |
|
---|
47 | #include "Descriptors/AtomDescriptor.hpp"
|
---|
48 |
|
---|
49 | using namespace MoleCuilder;
|
---|
50 |
|
---|
51 | // and construct the stuff
|
---|
52 | #include "SubgraphDissectionAction.def"
|
---|
53 | #include "MakroAction_impl_pre.hpp"
|
---|
54 | /** =========== define the function ====================== */
|
---|
55 |
|
---|
56 | // static instances
|
---|
57 | ActionSequence GraphSubgraphDissectionAction::actions;
|
---|
58 | bool GraphSubgraphDissectionAction::isPrepared = false;
|
---|
59 |
|
---|
60 | void GraphSubgraphDissectionAction::prepare(ActionRegistry &AR)
|
---|
61 | {
|
---|
62 | actions.addAction(AR.getActionByName(std::string("select-all-atoms")));
|
---|
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 |
|
---|
85 | ActionState::ptr GraphSubgraphDissectionAction::performCall(){
|
---|
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();
|
---|
89 | ActionState::ptr state(MakroAction::performCall());
|
---|
90 | reselectAtoms(selected_atoms);
|
---|
91 |
|
---|
92 | return state;
|
---|
93 | }
|
---|
94 |
|
---|
95 | ActionState::ptr GraphSubgraphDissectionAction::performUndo(ActionState::ptr _state) {
|
---|
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();
|
---|
99 | ActionState::ptr state(MakroAction::performUndo(_state));
|
---|
100 | reselectAtoms(selected_atoms);
|
---|
101 |
|
---|
102 | return state;
|
---|
103 | }
|
---|
104 |
|
---|
105 | ActionState::ptr GraphSubgraphDissectionAction::performRedo(ActionState::ptr _state){
|
---|
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();
|
---|
109 | ActionState::ptr state(MakroAction::performRedo(_state));
|
---|
110 | reselectAtoms(selected_atoms);
|
---|
111 |
|
---|
112 | return state;
|
---|
113 | }
|
---|
114 |
|
---|
115 | bool GraphSubgraphDissectionAction::canUndo(){
|
---|
116 | return true;
|
---|
117 | }
|
---|
118 |
|
---|
119 | bool GraphSubgraphDissectionAction::shouldUndo(){
|
---|
120 | return true;
|
---|
121 | }
|
---|