| 1 | /*
|
|---|
| 2 | * Project: MoleCuilder
|
|---|
| 3 | * Description: creates and alters molecular systems
|
|---|
| 4 | * Copyright (C) 2010 University of Bonn. All rights reserved.
|
|---|
| 5 | * Please see the LICENSE file or "Copyright notice" in builder.cpp for details.
|
|---|
| 6 | */
|
|---|
| 7 |
|
|---|
| 8 | /*
|
|---|
| 9 | * SubgraphDissectionAction.cpp
|
|---|
| 10 | *
|
|---|
| 11 | * Created on: May 9, 2010
|
|---|
| 12 | * Author: heber
|
|---|
| 13 | */
|
|---|
| 14 |
|
|---|
| 15 | // include config.h
|
|---|
| 16 | #ifdef HAVE_CONFIG_H
|
|---|
| 17 | #include <config.h>
|
|---|
| 18 | #endif
|
|---|
| 19 |
|
|---|
| 20 | #include "CodePatterns/MemDebug.hpp"
|
|---|
| 21 |
|
|---|
| 22 | #include "Descriptors/AtomIdDescriptor.hpp"
|
|---|
| 23 | #include "Descriptors/MoleculeDescriptor.hpp"
|
|---|
| 24 |
|
|---|
| 25 | #include "atom.hpp"
|
|---|
| 26 | #include "Bond/bond.hpp"
|
|---|
| 27 | #include "config.hpp"
|
|---|
| 28 | #include "CodePatterns/Log.hpp"
|
|---|
| 29 | #include "CodePatterns/Verbose.hpp"
|
|---|
| 30 | #include "Graph/BondGraph.hpp"
|
|---|
| 31 | #include "Graph/DepthFirstSearchAnalysis.hpp"
|
|---|
| 32 | #include "molecule.hpp"
|
|---|
| 33 | #include "World.hpp"
|
|---|
| 34 |
|
|---|
| 35 | #include <iostream>
|
|---|
| 36 | #include <string>
|
|---|
| 37 |
|
|---|
| 38 | typedef std::map< moleculeId_t, std::vector<atomId_t> > MolAtomList;
|
|---|
| 39 | typedef std::map< atomId_t, atomId_t > AtomAtomList;
|
|---|
| 40 |
|
|---|
| 41 | #include "Actions/GraphAction/SubgraphDissectionAction.hpp"
|
|---|
| 42 |
|
|---|
| 43 | using namespace MoleCuilder;
|
|---|
| 44 |
|
|---|
| 45 | // and construct the stuff
|
|---|
| 46 | #include "SubgraphDissectionAction.def"
|
|---|
| 47 | #include "Action_impl_pre.hpp"
|
|---|
| 48 | /** =========== define the function ====================== */
|
|---|
| 49 | Action::state_ptr GraphSubgraphDissectionAction::performCall() {
|
|---|
| 50 | // obtain information
|
|---|
| 51 | getParametersfromValueStorage();
|
|---|
| 52 |
|
|---|
| 53 |
|
|---|
| 54 | // first create stuff for undo state
|
|---|
| 55 | LOG(0, "STATUS: Creating undo state.");
|
|---|
| 56 | MolAtomList moleculelist;
|
|---|
| 57 | vector<molecule *> allmolecules = World::getInstance().getAllMolecules();
|
|---|
| 58 | for (vector<molecule *>::const_iterator moliter = allmolecules.begin(); moliter != allmolecules.end(); ++moliter) {
|
|---|
| 59 | std::vector<atomId_t> atomlist;
|
|---|
| 60 | atomlist.resize((*moliter)->size());
|
|---|
| 61 | for (molecule::const_iterator atomiter = (*moliter)->begin(); atomiter != (*moliter)->end(); ++atomiter) {
|
|---|
| 62 | atomlist.push_back((*atomiter)->getId());
|
|---|
| 63 | }
|
|---|
| 64 | moleculelist.insert( std::pair< moleculeId_t, std::vector<atomId_t> > ((*moliter)->getId(), atomlist));
|
|---|
| 65 | }
|
|---|
| 66 | GraphSubgraphDissectionState *UndoState = new GraphSubgraphDissectionState(moleculelist, params);
|
|---|
| 67 |
|
|---|
| 68 | // 0a. remove all present molecules
|
|---|
| 69 | LOG(0, "STATUS: Removing all present molecules.");
|
|---|
| 70 | MoleculeListClass *molecules = World::getInstance().getMolecules();
|
|---|
| 71 | for (vector<molecule *>::iterator MolRunner = allmolecules.begin(); MolRunner != allmolecules.end(); ++MolRunner) {
|
|---|
| 72 | molecules->erase(*MolRunner);
|
|---|
| 73 | World::getInstance().destroyMolecule(*MolRunner);
|
|---|
| 74 | }
|
|---|
| 75 |
|
|---|
| 76 | // 1. create the bond structure of the single molecule
|
|---|
| 77 | LOG(0, "STATUS: (Re-)constructing adjacency.");
|
|---|
| 78 | BondGraph *BG = World::getInstance().getBondGraph();
|
|---|
| 79 | World::AtomComposite Set = World::getInstance().getAllAtoms();
|
|---|
| 80 | BG->CreateAdjacency(Set);
|
|---|
| 81 |
|
|---|
| 82 | // 2. scan for connected subgraphs
|
|---|
| 83 | DepthFirstSearchAnalysis DFS;
|
|---|
| 84 | DFS();
|
|---|
| 85 | DFS.UpdateMoleculeStructure();
|
|---|
| 86 | if (!World::getInstance().numMolecules()) {
|
|---|
| 87 | //World::getInstance().destroyMolecule(mol);
|
|---|
| 88 | DoeLog(1) && (eLog()<< Verbose(1) << "There are no molecules." << endl);
|
|---|
| 89 | return Action::failure;
|
|---|
| 90 | }
|
|---|
| 91 |
|
|---|
| 92 | DoLog(1) && (Log() << Verbose(1) << "I scanned " << World::getInstance().numMolecules() << " molecules." << endl);
|
|---|
| 93 |
|
|---|
| 94 | return Action::state_ptr(UndoState);
|
|---|
| 95 | }
|
|---|
| 96 |
|
|---|
| 97 | Action::state_ptr GraphSubgraphDissectionAction::performUndo(Action::state_ptr _state) {
|
|---|
| 98 | GraphSubgraphDissectionState *state = assert_cast<GraphSubgraphDissectionState*>(_state.get());
|
|---|
| 99 |
|
|---|
| 100 | {
|
|---|
| 101 | // remove all present molecules
|
|---|
| 102 | MoleculeListClass *molecules = World::getInstance().getMolecules();
|
|---|
| 103 | vector<molecule *> allmolecules = World::getInstance().getAllMolecules();
|
|---|
| 104 | for (vector<molecule *>::iterator MolRunner = allmolecules.begin(); MolRunner != allmolecules.end(); ++MolRunner) {
|
|---|
| 105 | molecules->erase(*MolRunner);
|
|---|
| 106 | World::getInstance().destroyMolecule(*MolRunner);
|
|---|
| 107 | }
|
|---|
| 108 | }
|
|---|
| 109 |
|
|---|
| 110 | {
|
|---|
| 111 | // construct the old state
|
|---|
| 112 | MoleculeListClass *molecules = World::getInstance().getMolecules();
|
|---|
| 113 | molecule *mol = NULL;
|
|---|
| 114 | for (MolAtomList::const_iterator iter = state->moleculelist.begin(); iter != state->moleculelist.end(); ++iter) {
|
|---|
| 115 | mol = World::getInstance().createMolecule();
|
|---|
| 116 | if (mol->getId() != (*iter).first)
|
|---|
| 117 | World::getInstance().changeMoleculeId(mol->getId(), (*iter).first);
|
|---|
| 118 | for (std::vector<atomId_t>::const_iterator atomiter = (*iter).second.begin(); atomiter != (*iter).second.end(); ++atomiter) {
|
|---|
| 119 | atom *Walker = World::getInstance().getAtom(AtomById(*atomiter));
|
|---|
| 120 | mol->AddAtom(Walker);
|
|---|
| 121 | }
|
|---|
| 122 | molecules->insert(mol);
|
|---|
| 123 | }
|
|---|
| 124 | }
|
|---|
| 125 |
|
|---|
| 126 | return Action::state_ptr(_state);
|
|---|
| 127 | }
|
|---|
| 128 |
|
|---|
| 129 | Action::state_ptr GraphSubgraphDissectionAction::performRedo(Action::state_ptr _state){
|
|---|
| 130 | return performCall();
|
|---|
| 131 | }
|
|---|
| 132 |
|
|---|
| 133 | bool GraphSubgraphDissectionAction::canUndo() {
|
|---|
| 134 | return true;
|
|---|
| 135 | }
|
|---|
| 136 |
|
|---|
| 137 | bool GraphSubgraphDissectionAction::shouldUndo() {
|
|---|
| 138 | return true;
|
|---|
| 139 | }
|
|---|
| 140 | /** =========== end of function ====================== */
|
|---|