| 1 | /* | 
|---|
| 2 | * Project: MoleCuilder | 
|---|
| 3 | * Description: creates and alters molecular systems | 
|---|
| 4 | * Copyright (C)  2010-2012 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/atom.hpp" | 
|---|
| 26 | #include "Bond/bond.hpp" | 
|---|
| 27 | #include "CodePatterns/Log.hpp" | 
|---|
| 28 | #include "CodePatterns/Verbose.hpp" | 
|---|
| 29 | #include "Graph/BondGraph.hpp" | 
|---|
| 30 | #include "Graph/DepthFirstSearchAnalysis.hpp" | 
|---|
| 31 | #include "molecule.hpp" | 
|---|
| 32 | #include "MoleculeListClass.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 | // first create stuff for undo state | 
|---|
| 51 | LOG(0, "STATUS: Creating undo state."); | 
|---|
| 52 | MolAtomList moleculelist; | 
|---|
| 53 | vector<molecule *> allmolecules = World::getInstance().getAllMolecules(); | 
|---|
| 54 | for (vector<molecule *>::const_iterator moliter = allmolecules.begin(); moliter != allmolecules.end(); ++moliter) { | 
|---|
| 55 | std::vector<atomId_t> atomlist; | 
|---|
| 56 | atomlist.resize((*moliter)->size()); | 
|---|
| 57 | for (molecule::const_iterator atomiter = (*moliter)->begin(); atomiter != (*moliter)->end(); ++atomiter) { | 
|---|
| 58 | atomlist.push_back((*atomiter)->getId()); | 
|---|
| 59 | } | 
|---|
| 60 | moleculelist.insert( std::pair< moleculeId_t, std::vector<atomId_t> > ((*moliter)->getId(), atomlist)); | 
|---|
| 61 | } | 
|---|
| 62 | GraphSubgraphDissectionState *UndoState = new GraphSubgraphDissectionState(moleculelist, params); | 
|---|
| 63 |  | 
|---|
| 64 | // 0a. remove all present molecules | 
|---|
| 65 | LOG(0, "STATUS: Removing all present molecules."); | 
|---|
| 66 | MoleculeListClass *molecules = World::getInstance().getMolecules(); | 
|---|
| 67 | for (vector<molecule *>::iterator MolRunner = allmolecules.begin(); MolRunner != allmolecules.end(); ++MolRunner) { | 
|---|
| 68 | molecules->erase(*MolRunner); | 
|---|
| 69 | World::getInstance().destroyMolecule(*MolRunner); | 
|---|
| 70 | } | 
|---|
| 71 |  | 
|---|
| 72 | // 1. create the bond structure of the single molecule | 
|---|
| 73 | LOG(0, "STATUS: (Re-)constructing adjacency."); | 
|---|
| 74 | BondGraph *BG = World::getInstance().getBondGraph(); | 
|---|
| 75 | World::AtomComposite Set = World::getInstance().getAllAtoms(); | 
|---|
| 76 | BG->CreateAdjacency(Set); | 
|---|
| 77 |  | 
|---|
| 78 | // 2. scan for connected subgraphs | 
|---|
| 79 | DepthFirstSearchAnalysis DFS; | 
|---|
| 80 | DFS(); | 
|---|
| 81 | DFS.UpdateMoleculeStructure(); | 
|---|
| 82 | if (!World::getInstance().numMolecules()) { | 
|---|
| 83 | //World::getInstance().destroyMolecule(mol); | 
|---|
| 84 | ELOG(1, "There are no molecules."); | 
|---|
| 85 | return Action::failure; | 
|---|
| 86 | } | 
|---|
| 87 |  | 
|---|
| 88 | LOG(1, "I scanned " << World::getInstance().numMolecules() << " molecules."); | 
|---|
| 89 |  | 
|---|
| 90 | return Action::state_ptr(UndoState); | 
|---|
| 91 | } | 
|---|
| 92 |  | 
|---|
| 93 | Action::state_ptr GraphSubgraphDissectionAction::performUndo(Action::state_ptr _state) { | 
|---|
| 94 | GraphSubgraphDissectionState *state = assert_cast<GraphSubgraphDissectionState*>(_state.get()); | 
|---|
| 95 |  | 
|---|
| 96 | { | 
|---|
| 97 | // remove all present molecules | 
|---|
| 98 | MoleculeListClass *molecules = World::getInstance().getMolecules(); | 
|---|
| 99 | vector<molecule *> allmolecules = World::getInstance().getAllMolecules(); | 
|---|
| 100 | for (vector<molecule *>::iterator MolRunner = allmolecules.begin(); MolRunner != allmolecules.end(); ++MolRunner) { | 
|---|
| 101 | molecules->erase(*MolRunner); | 
|---|
| 102 | World::getInstance().destroyMolecule(*MolRunner); | 
|---|
| 103 | } | 
|---|
| 104 | } | 
|---|
| 105 |  | 
|---|
| 106 | { | 
|---|
| 107 | // construct the old state | 
|---|
| 108 | MoleculeListClass *molecules = World::getInstance().getMolecules(); | 
|---|
| 109 | molecule *mol = NULL; | 
|---|
| 110 | for (MolAtomList::const_iterator iter = state->moleculelist.begin(); iter != state->moleculelist.end(); ++iter) { | 
|---|
| 111 | mol = World::getInstance().createMolecule(); | 
|---|
| 112 | if (mol->getId() != (*iter).first) | 
|---|
| 113 | World::getInstance().changeMoleculeId(mol->getId(), (*iter).first); | 
|---|
| 114 | for (std::vector<atomId_t>::const_iterator atomiter = (*iter).second.begin(); atomiter != (*iter).second.end(); ++atomiter) { | 
|---|
| 115 | atom *Walker = World::getInstance().getAtom(AtomById(*atomiter)); | 
|---|
| 116 | mol->AddAtom(Walker); | 
|---|
| 117 | } | 
|---|
| 118 | molecules->insert(mol); | 
|---|
| 119 | } | 
|---|
| 120 | } | 
|---|
| 121 |  | 
|---|
| 122 | return Action::state_ptr(_state); | 
|---|
| 123 | } | 
|---|
| 124 |  | 
|---|
| 125 | Action::state_ptr GraphSubgraphDissectionAction::performRedo(Action::state_ptr _state){ | 
|---|
| 126 | return performCall(); | 
|---|
| 127 | } | 
|---|
| 128 |  | 
|---|
| 129 | bool GraphSubgraphDissectionAction::canUndo() { | 
|---|
| 130 | return true; | 
|---|
| 131 | } | 
|---|
| 132 |  | 
|---|
| 133 | bool GraphSubgraphDissectionAction::shouldUndo() { | 
|---|
| 134 | return true; | 
|---|
| 135 | } | 
|---|
| 136 | /** =========== end of function ====================== */ | 
|---|