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 | * DestroyAdjacencyAction.cpp
|
---|
26 | *
|
---|
27 | * Created on: May 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/Assert.hpp"
|
---|
39 | #include "CodePatterns/Log.hpp"
|
---|
40 |
|
---|
41 | #include "Atom/atom.hpp"
|
---|
42 | #include "Descriptors/AtomIdDescriptor.hpp"
|
---|
43 | #include "Descriptors/AtomSelectionDescriptor.hpp"
|
---|
44 | #include "Graph/BondGraph.hpp"
|
---|
45 | #include "World.hpp"
|
---|
46 | #include "WorldTime.hpp"
|
---|
47 |
|
---|
48 | #include <iostream>
|
---|
49 | #include <list>
|
---|
50 | #include <string>
|
---|
51 |
|
---|
52 | #include "Actions/GraphAction/DestroyAdjacencyAction.hpp"
|
---|
53 |
|
---|
54 | using namespace MoleCuilder;
|
---|
55 |
|
---|
56 | // Storing undo state
|
---|
57 | struct BondInfo_t {
|
---|
58 | atomId_t leftatom;
|
---|
59 | atomId_t rightatom;
|
---|
60 | size_t degree;
|
---|
61 | };
|
---|
62 |
|
---|
63 | // and construct the stuff
|
---|
64 | #include "DestroyAdjacencyAction.def"
|
---|
65 | #include "Action_impl_pre.hpp"
|
---|
66 | /** =========== define the function ====================== */
|
---|
67 | ActionState::ptr GraphDestroyAdjacencyAction::performCall() {
|
---|
68 | BondGraph *BG = World::getInstance().getBondGraph();
|
---|
69 | ASSERT(BG != NULL, "GraphDestroyAdjacencyAction: BondGraph is NULL.");
|
---|
70 |
|
---|
71 | // check precondition
|
---|
72 | World::ConstAtomComposite Set = const_cast<const World &>(World::getInstance()).
|
---|
73 | getAllAtoms(AtomsBySelection());
|
---|
74 | if (Set.empty()) {
|
---|
75 | STATUS("No atoms selected.");
|
---|
76 | return Action::failure;
|
---|
77 | }
|
---|
78 |
|
---|
79 | // count all present bonds
|
---|
80 | std::vector<BondInfo_t> bonds;
|
---|
81 | {
|
---|
82 | size_t count_bonds = 0;
|
---|
83 | for (World::ConstAtomComposite::const_iterator iter = Set.begin();
|
---|
84 | iter != Set.end();
|
---|
85 | ++iter) {
|
---|
86 | const atom * const Walker = *iter;
|
---|
87 | count_bonds += Walker->getListOfBonds().size();
|
---|
88 | }
|
---|
89 | bonds.reserve(count_bonds/2);
|
---|
90 | }
|
---|
91 | // Storing undo info
|
---|
92 | for (World::ConstAtomComposite::const_iterator iter = Set.begin();
|
---|
93 | iter != Set.end();
|
---|
94 | ++iter) {
|
---|
95 | const atom * const Walker = *iter;
|
---|
96 | const BondList& ListOfBonds = Walker->getListOfBonds();
|
---|
97 | for (BondList::const_iterator bonditer = ListOfBonds.begin();
|
---|
98 | bonditer != ListOfBonds.end();
|
---|
99 | ++bonditer) {
|
---|
100 | const bond::ptr &CurrentBond = *bonditer;
|
---|
101 | // if both atoms are in selected set, we check ids otherwise not
|
---|
102 | if (((!World::getInstance().isSelected(CurrentBond->leftatom))
|
---|
103 | || (!World::getInstance().isSelected(CurrentBond->rightatom)))
|
---|
104 | || (CurrentBond->leftatom->getId() < CurrentBond->rightatom->getId())) {
|
---|
105 | BondInfo_t BondInfo;
|
---|
106 | BondInfo.leftatom = CurrentBond->leftatom->getId();
|
---|
107 | BondInfo.rightatom = CurrentBond->rightatom->getId();
|
---|
108 | BondInfo.degree = CurrentBond->getDegree();
|
---|
109 | bonds.push_back(BondInfo);
|
---|
110 | }
|
---|
111 | }
|
---|
112 | }
|
---|
113 | GraphDestroyAdjacencyState *UndoState = new GraphDestroyAdjacencyState(bonds, params);
|
---|
114 |
|
---|
115 | LOG(0, "STATUS: Clearing the Adjacency.");
|
---|
116 | {
|
---|
117 | World::AtomComposite Set = World::getInstance().getAllAtoms(AtomsBySelection());
|
---|
118 | BG->cleanAdjacencyList(Set);
|
---|
119 | }
|
---|
120 |
|
---|
121 | return ActionState::ptr(UndoState);
|
---|
122 | }
|
---|
123 |
|
---|
124 | ActionState::ptr GraphDestroyAdjacencyAction::performUndo(ActionState::ptr _state) {
|
---|
125 | GraphDestroyAdjacencyState *state = assert_cast<GraphDestroyAdjacencyState*>(_state.get());
|
---|
126 |
|
---|
127 | const size_t CurrentTime = WorldTime::getTime();
|
---|
128 | std::vector<BondInfo_t> &bonds = state->bonds;
|
---|
129 | for(std::vector<BondInfo_t>::const_iterator iter = bonds.begin();
|
---|
130 | iter != bonds.end(); ++iter) {
|
---|
131 | atom * const Walker = World::getInstance().getAtom(AtomById(iter->leftatom));
|
---|
132 | ASSERT( Walker != NULL,
|
---|
133 | "GraphDestroyAdjacencyAction::performUndo() - "+toString(iter->leftatom)+" missing.");
|
---|
134 | atom * const OtherWalker = World::getInstance().getAtom(AtomById(iter->rightatom));
|
---|
135 | ASSERT( OtherWalker != NULL,
|
---|
136 | "GraphDestroyAdjacencyAction::performUndo() - "+toString(iter->rightatom)+" missing.");
|
---|
137 | bond::ptr CurrentBond = Walker->addBond(CurrentTime, OtherWalker);
|
---|
138 | CurrentBond->setDegree(iter->degree);
|
---|
139 | }
|
---|
140 | return ActionState::ptr(_state);
|
---|
141 | }
|
---|
142 |
|
---|
143 | ActionState::ptr GraphDestroyAdjacencyAction::performRedo(ActionState::ptr _state){
|
---|
144 | BondGraph *BG = World::getInstance().getBondGraph();
|
---|
145 | ASSERT(BG != NULL, "GraphDestroyAdjacencyAction: BondGraph is NULL.");
|
---|
146 |
|
---|
147 | World::AtomComposite Set = World::getInstance().getAllAtoms(AtomsBySelection());
|
---|
148 | BG->cleanAdjacencyList(Set);
|
---|
149 |
|
---|
150 | return ActionState::ptr(_state);
|
---|
151 | }
|
---|
152 |
|
---|
153 | bool GraphDestroyAdjacencyAction::canUndo() {
|
---|
154 | return true;
|
---|
155 | }
|
---|
156 |
|
---|
157 | bool GraphDestroyAdjacencyAction::shouldUndo() {
|
---|
158 | return true;
|
---|
159 | }
|
---|
160 | /** =========== end of function ====================== */
|
---|