| [de0af2] | 1 | /*
 | 
|---|
 | 2 |  * Project: MoleCuilder
 | 
|---|
 | 3 |  * Description: creates and alters molecular systems
 | 
|---|
 | 4 |  * Copyright (C)  2012 University of Bonn. All rights reserved.
 | 
|---|
 | 5 |  *
 | 
|---|
 | 6 |  *
 | 
|---|
 | 7 |  *   This file is part of MoleCuilder.
 | 
|---|
 | 8 |  *
 | 
|---|
 | 9 |  *    MoleCuilder is free software: you can redistribute it and/or modify
 | 
|---|
 | 10 |  *    it under the terms of the GNU General Public License as published by
 | 
|---|
 | 11 |  *    the Free Software Foundation, either version 2 of the License, or
 | 
|---|
 | 12 |  *    (at your option) any later version.
 | 
|---|
 | 13 |  *
 | 
|---|
 | 14 |  *    MoleCuilder is distributed in the hope that it will be useful,
 | 
|---|
 | 15 |  *    but WITHOUT ANY WARRANTY; without even the implied warranty of
 | 
|---|
 | 16 |  *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 | 
|---|
 | 17 |  *    GNU General Public License for more details.
 | 
|---|
 | 18 |  *
 | 
|---|
 | 19 |  *    You should have received a copy of the GNU General Public License
 | 
|---|
 | 20 |  *    along with MoleCuilder.  If not, see <http://www.gnu.org/licenses/>.
 | 
|---|
 | 21 |  */
 | 
|---|
 | 22 | 
 | 
|---|
 | 23 | /*
 | 
|---|
 | 24 |  * ExportGraph_ToFiles.cpp
 | 
|---|
 | 25 |  *
 | 
|---|
 | 26 |  *  Created on: 08.03.2012
 | 
|---|
 | 27 |  *      Author: heber
 | 
|---|
 | 28 |  */
 | 
|---|
 | 29 | 
 | 
|---|
 | 30 | // include config.h
 | 
|---|
 | 31 | #ifdef HAVE_CONFIG_H
 | 
|---|
 | 32 | #include <config.h>
 | 
|---|
 | 33 | #endif
 | 
|---|
 | 34 | 
 | 
|---|
 | 35 | #include "CodePatterns/MemDebug.hpp"
 | 
|---|
 | 36 | 
 | 
|---|
 | 37 | #include "ExportGraph_ToFiles.hpp"
 | 
|---|
 | 38 | 
 | 
|---|
| [ca8bea] | 39 | #include "CodePatterns/Info.hpp"
 | 
|---|
| [de0af2] | 40 | #include "CodePatterns/Log.hpp"
 | 
|---|
| [ca8bea] | 41 | 
 | 
|---|
 | 42 | #include "Bond/bond.hpp"
 | 
|---|
 | 43 | #include "Element/element.hpp"
 | 
|---|
| [de0af2] | 44 | #include "Fragmentation/Graph.hpp"
 | 
|---|
 | 45 | #include "Fragmentation/KeySet.hpp"
 | 
|---|
| [dcbb5d] | 46 | #include "Fragmentation/SortIndex.hpp"
 | 
|---|
| [ca8bea] | 47 | #include "Graph/ListOfLocalAtoms.hpp"
 | 
|---|
 | 48 | #include "molecule.hpp"
 | 
|---|
| [de0af2] | 49 | #include "MoleculeListClass.hpp"
 | 
|---|
| [ca8bea] | 50 | #include "Parser/FormatParserStorage.hpp"
 | 
|---|
| [de0af2] | 51 | #include "World.hpp"
 | 
|---|
 | 52 | 
 | 
|---|
 | 53 | /** Constructor for class ExportGraph_ToFiles.
 | 
|---|
 | 54 |  *
 | 
|---|
 | 55 |  * @param _graph instance of Graph containing keyset of each fragment
 | 
|---|
| [b4f72c] | 56 |  * @param saturation whether to saturate dangling bonds with hydrogen or not
 | 
|---|
| [de0af2] | 57 |  */
 | 
|---|
| [b4f72c] | 58 | ExportGraph_ToFiles::ExportGraph_ToFiles(const Graph &_graph, const enum HydrogenSaturation _saturation) :
 | 
|---|
| [ca8bea] | 59 |                 ExportGraph(_graph),
 | 
|---|
 | 60 |                 BondFragments(World::getPointer()),
 | 
|---|
 | 61 |                 saturation(_saturation)
 | 
|---|
| [de0af2] | 62 | {}
 | 
|---|
 | 63 | 
 | 
|---|
| [ca8bea] | 64 | /** Destructor of class ExportGraph_ToFiles.
 | 
|---|
| [de0af2] | 65 |  *
 | 
|---|
| [ca8bea] | 66 |  * We free all created molecules again and also removed their copied atoms.
 | 
|---|
| [de0af2] | 67 |  */
 | 
|---|
| [ca8bea] | 68 | ExportGraph_ToFiles::~ExportGraph_ToFiles()
 | 
|---|
| [de0af2] | 69 | {
 | 
|---|
| [ca8bea] | 70 |   // remove all create molecules again from the World including their atoms
 | 
|---|
 | 71 |   for (MoleculeList::iterator iter = BondFragments.ListOfMolecules.begin();
 | 
|---|
 | 72 |       !BondFragments.ListOfMolecules.empty();
 | 
|---|
 | 73 |       iter = BondFragments.ListOfMolecules.begin()) {
 | 
|---|
 | 74 |     // remove copied atoms and molecule again
 | 
|---|
 | 75 |     molecule *mol = *iter;
 | 
|---|
 | 76 |     mol->removeAtomsinMolecule();
 | 
|---|
 | 77 |     World::getInstance().destroyMolecule(mol);
 | 
|---|
 | 78 |     BondFragments.ListOfMolecules.erase(iter);
 | 
|---|
 | 79 |   }
 | 
|---|
 | 80 | }
 | 
|---|
 | 81 | 
 | 
|---|
 | 82 | /** Actual implementation of the export to files function.
 | 
|---|
 | 83 |  */
 | 
|---|
 | 84 | void ExportGraph_ToFiles::operator()()
 | 
|---|
 | 85 | {
 | 
|---|
 | 86 |   if (BondFragments.ListOfMolecules.size() == 0)
 | 
|---|
 | 87 |     prepareMolecule();
 | 
|---|
 | 88 | 
 | 
|---|
 | 89 |   // ===== 9. Save fragments' configuration and keyset files et al to disk ===
 | 
|---|
 | 90 |   LOG(1, "Writing " << BondFragments.ListOfMolecules.size() << " possible bond fragmentation configs");
 | 
|---|
 | 91 |   bool write_status = true;
 | 
|---|
 | 92 |   for (std::vector<std::string>::const_iterator iter = typelist.begin();
 | 
|---|
 | 93 |       iter != typelist.end();
 | 
|---|
 | 94 |       ++iter) {
 | 
|---|
 | 95 |     LOG(2, "INFO: Writing bond fragments for type " << (*iter) << ".");
 | 
|---|
 | 96 |     write_status = write_status
 | 
|---|
 | 97 |     && BondFragments.OutputConfigForListOfFragments(
 | 
|---|
 | 98 |         prefix,
 | 
|---|
 | 99 |         FormatParserStorage::getInstance().getTypeFromName(*iter));
 | 
|---|
 | 100 |   }
 | 
|---|
 | 101 |   if (write_status)
 | 
|---|
 | 102 |     LOG(1, "All configs written.");
 | 
|---|
 | 103 |   else
 | 
|---|
 | 104 |     LOG(1, "Some config writing failed.");
 | 
|---|
 | 105 | 
 | 
|---|
 | 106 |   // store force index reference file
 | 
|---|
| [dcbb5d] | 107 |   {
 | 
|---|
| [b4f72c] | 108 |     SortIndex_t SortIndex;
 | 
|---|
| [dcbb5d] | 109 |     BondFragments.StoreForcesFile(prefix, SortIndex);
 | 
|---|
 | 110 |   }
 | 
|---|
| [ca8bea] | 111 | 
 | 
|---|
 | 112 |   // store keysets file
 | 
|---|
 | 113 |   TotalGraph.StoreKeySetFile(prefix);
 | 
|---|
 | 114 | 
 | 
|---|
 | 115 |   // store Hydrogen saturation correction file
 | 
|---|
 | 116 |   BondFragments.AddHydrogenCorrection(prefix);
 | 
|---|
 | 117 | 
 | 
|---|
 | 118 |   // restore orbital and Stop values
 | 
|---|
 | 119 |   //CalculateOrbitals(*configuration);
 | 
|---|
| [de0af2] | 120 | }
 | 
|---|
 | 121 | 
 | 
|---|
 | 122 | /** Internal helper to create from each keyset a molecule
 | 
|---|
 | 123 |  *
 | 
|---|
 | 124 |  */
 | 
|---|
 | 125 | void ExportGraph_ToFiles::prepareMolecule()
 | 
|---|
 | 126 | {
 | 
|---|
 | 127 |   size_t count = 0;
 | 
|---|
| [ca8bea] | 128 |   for(Graph::const_iterator runner = TotalGraph.begin(); runner != TotalGraph.end(); runner++) {
 | 
|---|
| [de0af2] | 129 |     KeySet test = (*runner).first;
 | 
|---|
 | 130 |     LOG(2, "DEBUG: Fragment No." << (*runner).second.first << " with TEFactor "
 | 
|---|
 | 131 |                 << (*runner).second.second << ".");
 | 
|---|
| [b4f72c] | 132 |     BondFragments.insert(StoreFragmentFromKeySet(test, World::getInstance().getConfig()));
 | 
|---|
| [de0af2] | 133 |     ++count;
 | 
|---|
 | 134 |   }
 | 
|---|
| [ca8bea] | 135 |   LOG(1, "INFO: " << count << "/" << BondFragments.ListOfMolecules.size()
 | 
|---|
| [de0af2] | 136 |                 << " fragments generated from the keysets.");
 | 
|---|
 | 137 | }
 | 
|---|
| [ca8bea] | 138 | 
 | 
|---|
 | 139 | /** Stores a fragment from \a KeySet into \a molecule.
 | 
|---|
 | 140 |  * First creates the minimal set of atoms from the KeySet, then creates the bond structure from the complete
 | 
|---|
 | 141 |  * molecule and adds missing hydrogen where bonds were cut.
 | 
|---|
 | 142 |  * \param &Leaflet pointer to KeySet structure
 | 
|---|
 | 143 |  * \param IsAngstroem whether we have Ansgtroem or bohrradius
 | 
|---|
 | 144 |  * \return pointer to constructed molecule
 | 
|---|
 | 145 |  */
 | 
|---|
| [b4f72c] | 146 | molecule * ExportGraph_ToFiles::StoreFragmentFromKeySet(KeySet &Leaflet, bool IsAngstroem)
 | 
|---|
| [ca8bea] | 147 | {
 | 
|---|
 | 148 |   Info info(__func__);
 | 
|---|
 | 149 |   ListOfLocalAtoms_t SonList;
 | 
|---|
 | 150 |   molecule *Leaf = World::getInstance().createMolecule();
 | 
|---|
 | 151 | 
 | 
|---|
| [b4f72c] | 152 |   StoreFragmentFromKeySet_Init(Leaf, Leaflet, SonList);
 | 
|---|
| [ca8bea] | 153 |   // create the bonds between all: Make it an induced subgraph and add hydrogen
 | 
|---|
 | 154 | //  LOG(2, "Creating bonds from father graph (i.e. induced subgraph creation).");
 | 
|---|
| [b4f72c] | 155 |   CreateInducedSubgraphOfFragment(Leaf, SonList, IsAngstroem);
 | 
|---|
| [ca8bea] | 156 | 
 | 
|---|
 | 157 |   //Leaflet->Leaf->ScanForPeriodicCorrection(out);
 | 
|---|
 | 158 |   return Leaf;
 | 
|---|
 | 159 | }
 | 
|---|
 | 160 | 
 | 
|---|
 | 161 | /** Initializes some value for putting fragment of \a *mol into \a *Leaf.
 | 
|---|
 | 162 |  * \param *Leaf fragment molecule
 | 
|---|
 | 163 |  * \param &Leaflet pointer to KeySet structure
 | 
|---|
 | 164 |  * \param SonList calloc'd list which atom of \a *Leaf is a son of which atom in \a *mol
 | 
|---|
 | 165 |  * \return number of atoms in fragment
 | 
|---|
 | 166 |  */
 | 
|---|
| [b4f72c] | 167 | int ExportGraph_ToFiles::StoreFragmentFromKeySet_Init(molecule *Leaf, KeySet &Leaflet, ListOfLocalAtoms_t &SonList)
 | 
|---|
| [ca8bea] | 168 | {
 | 
|---|
 | 169 |   atom *FatherOfRunner = NULL;
 | 
|---|
 | 170 | 
 | 
|---|
 | 171 |   // first create the minimal set of atoms from the KeySet
 | 
|---|
| [b4f72c] | 172 |   World &world = World::getInstance();
 | 
|---|
| [ca8bea] | 173 |   int size = 0;
 | 
|---|
 | 174 |   for(KeySet::const_iterator runner = Leaflet.begin(); runner != Leaflet.end(); runner++) {
 | 
|---|
| [b4f72c] | 175 |     FatherOfRunner = world.getAtom(AtomById(*runner));  // find the id
 | 
|---|
| [ca8bea] | 176 |     SonList.insert( std::make_pair(FatherOfRunner->getNr(), Leaf->AddCopyAtom(FatherOfRunner) ) );
 | 
|---|
 | 177 |     size++;
 | 
|---|
 | 178 |   }
 | 
|---|
 | 179 |   return size;
 | 
|---|
 | 180 | }
 | 
|---|
 | 181 | 
 | 
|---|
 | 182 | /** Creates an induced subgraph out of a fragmental key set, adding bonds and hydrogens (if treated specially).
 | 
|---|
 | 183 |  * \param *Leaf fragment molecule
 | 
|---|
 | 184 |  * \param IsAngstroem whether we have Ansgtroem or bohrradius
 | 
|---|
| [b4f72c] | 185 |  * \param SonList list which atom of \a *Leaf is another atom's son
 | 
|---|
| [ca8bea] | 186 |  */
 | 
|---|
| [b4f72c] | 187 | void ExportGraph_ToFiles::CreateInducedSubgraphOfFragment(molecule *Leaf, ListOfLocalAtoms_t &SonList, bool IsAngstroem)
 | 
|---|
| [ca8bea] | 188 | {
 | 
|---|
 | 189 |   bool LonelyFlag = false;
 | 
|---|
 | 190 |   atom *OtherFather = NULL;
 | 
|---|
 | 191 |   atom *FatherOfRunner = NULL;
 | 
|---|
 | 192 | 
 | 
|---|
 | 193 |   // we increment the iter just before skipping the hydrogen
 | 
|---|
 | 194 |   // as we use AddBond, we cannot have a const_iterator here
 | 
|---|
 | 195 |   for (molecule::iterator iter = Leaf->begin(); iter != Leaf->end();) {
 | 
|---|
 | 196 |     LonelyFlag = true;
 | 
|---|
 | 197 |     FatherOfRunner = (*iter)->father;
 | 
|---|
 | 198 |     ASSERT(FatherOfRunner,"Atom without father found");
 | 
|---|
 | 199 |     if (SonList.find(FatherOfRunner->getNr()) != SonList.end())  {  // check if this, our father, is present in list
 | 
|---|
 | 200 |       // create all bonds
 | 
|---|
 | 201 |       const BondList& ListOfBonds = FatherOfRunner->getListOfBonds();
 | 
|---|
 | 202 |       for (BondList::const_iterator BondRunner = ListOfBonds.begin();
 | 
|---|
 | 203 |           BondRunner != ListOfBonds.end();
 | 
|---|
 | 204 |           ++BondRunner) {
 | 
|---|
 | 205 |         OtherFather = (*BondRunner)->GetOtherAtom(FatherOfRunner);
 | 
|---|
 | 206 |         if (SonList.find(OtherFather->getNr()) != SonList.end()) {
 | 
|---|
 | 207 | //          LOG(2, "INFO: Father " << *FatherOfRunner << " of son " << *SonList[FatherOfRunner->getNr()]
 | 
|---|
 | 208 | //              << " is bound to " << *OtherFather << ", whose son is "
 | 
|---|
 | 209 | //              << *SonList[OtherFather->getNr()] << ".");
 | 
|---|
 | 210 |           if (OtherFather->getNr() > FatherOfRunner->getNr()) { // add bond (Nr check is for adding only one of both variants: ab, ba)
 | 
|---|
 | 211 |             std::stringstream output;
 | 
|---|
 | 212 | //            output << "ACCEPT: Adding Bond: "
 | 
|---|
 | 213 |             output << Leaf->AddBond((*iter), SonList[OtherFather->getNr()], (*BondRunner)->BondDegree);
 | 
|---|
 | 214 | //            LOG(3, output.str());
 | 
|---|
 | 215 |             //NumBonds[(*iter)->getNr()]++;
 | 
|---|
 | 216 |           } else {
 | 
|---|
 | 217 | //            LOG(3, "REJECY: Not adding bond, labels in wrong order.");
 | 
|---|
 | 218 |           }
 | 
|---|
 | 219 |           LonelyFlag = false;
 | 
|---|
 | 220 |         } else {
 | 
|---|
 | 221 | //          LOG(2, "INFO: Father " << *FatherOfRunner << " of son " << *SonList[FatherOfRunner->getNr()]
 | 
|---|
 | 222 | //              << " is bound to " << *OtherFather << ", who has no son in this fragment molecule.");
 | 
|---|
 | 223 |           if (saturation == DoSaturate) {
 | 
|---|
 | 224 | //          LOG(3, "ACCEPT: Adding Hydrogen to " << (*iter)->Name << " and a bond in between.");
 | 
|---|
 | 225 |             if (!Leaf->AddHydrogenReplacementAtom((*BondRunner), (*iter), FatherOfRunner, OtherFather, IsAngstroem))
 | 
|---|
 | 226 |               exit(1);
 | 
|---|
 | 227 |           }
 | 
|---|
 | 228 |           //NumBonds[(*iter)->getNr()] += Binder->BondDegree;
 | 
|---|
 | 229 |         }
 | 
|---|
 | 230 |       }
 | 
|---|
 | 231 |     } else {
 | 
|---|
 | 232 |     ELOG(1, "Son " << (*iter)->getName() << " has father " << FatherOfRunner->getName() << " but its entry in SonList is " << SonList[FatherOfRunner->getNr()] << "!");
 | 
|---|
 | 233 |     }
 | 
|---|
 | 234 |     if ((LonelyFlag) && (Leaf->getAtomCount() > 1)) {
 | 
|---|
 | 235 |       LOG(0, **iter << "has got bonds only to hydrogens!");
 | 
|---|
 | 236 |     }
 | 
|---|
 | 237 |     ++iter;
 | 
|---|
 | 238 |     if (saturation == DoSaturate) {
 | 
|---|
 | 239 |       while ((iter != Leaf->end()) && ((*iter)->getType()->getAtomicNumber() == 1)){ // skip added hydrogen
 | 
|---|
 | 240 |         iter++;
 | 
|---|
 | 241 |       }
 | 
|---|
 | 242 |     }
 | 
|---|
 | 243 |   }
 | 
|---|
 | 244 | }
 | 
|---|
 | 245 | 
 | 
|---|