[bcf653] | 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 |
|
---|
[e138de] | 8 | /** \file MoleculeListClass.cpp
|
---|
| 9 | *
|
---|
| 10 | * Function implementations for the class MoleculeListClass.
|
---|
| 11 | *
|
---|
| 12 | */
|
---|
| 13 |
|
---|
[bf3817] | 14 | // include config.h
|
---|
[aafd77] | 15 | #ifdef HAVE_CONFIG_H
|
---|
| 16 | #include <config.h>
|
---|
| 17 | #endif
|
---|
| 18 |
|
---|
[ad011c] | 19 | #include "CodePatterns/MemDebug.hpp"
|
---|
[112b09] | 20 |
|
---|
[49e1ae] | 21 | #include <cstring>
|
---|
| 22 |
|
---|
[aafd77] | 23 | #include <gsl/gsl_inline.h>
|
---|
| 24 | #include <gsl/gsl_heapsort.h>
|
---|
| 25 |
|
---|
[cbc5fb] | 26 | #include "World.hpp"
|
---|
[e138de] | 27 | #include "atom.hpp"
|
---|
| 28 | #include "bond.hpp"
|
---|
[a3fded] | 29 | #include "bondgraph.hpp"
|
---|
[e138de] | 30 | #include "boundary.hpp"
|
---|
| 31 | #include "config.hpp"
|
---|
| 32 | #include "element.hpp"
|
---|
[952f38] | 33 | #include "Helpers/helpers.hpp"
|
---|
[e138de] | 34 | #include "linkedcell.hpp"
|
---|
| 35 | #include "lists.hpp"
|
---|
[ad011c] | 36 | #include "CodePatterns/Verbose.hpp"
|
---|
| 37 | #include "CodePatterns/Log.hpp"
|
---|
[e138de] | 38 | #include "molecule.hpp"
|
---|
| 39 | #include "periodentafel.hpp"
|
---|
[88b400] | 40 | #include "tesselation.hpp"
|
---|
[ad011c] | 41 | #include "CodePatterns/Assert.hpp"
|
---|
[cca9ef] | 42 | #include "LinearAlgebra/RealSpaceMatrix.hpp"
|
---|
[84c494] | 43 | #include "Box.hpp"
|
---|
[e138de] | 44 |
|
---|
[a0064e] | 45 | #include "Helpers/fast_functions.hpp"
|
---|
| 46 |
|
---|
[ad011c] | 47 | #include "CodePatterns/Assert.hpp"
|
---|
[920c70] | 48 |
|
---|
[e138de] | 49 | /*********************************** Functions for class MoleculeListClass *************************/
|
---|
| 50 |
|
---|
| 51 | /** Constructor for MoleculeListClass.
|
---|
| 52 | */
|
---|
[cbc5fb] | 53 | MoleculeListClass::MoleculeListClass(World *_world) :
|
---|
[cd5047] | 54 | Observable("MoleculeListClass"),
|
---|
[81a9bc] | 55 | MaxIndex(1),
|
---|
| 56 | world(_world)
|
---|
[97b825] | 57 | {};
|
---|
[e138de] | 58 |
|
---|
| 59 | /** Destructor for MoleculeListClass.
|
---|
| 60 | */
|
---|
| 61 | MoleculeListClass::~MoleculeListClass()
|
---|
| 62 | {
|
---|
[bd6bfa] | 63 | DoLog(4) && (Log() << Verbose(4) << "Clearing ListOfMolecules." << endl);
|
---|
| 64 | for(MoleculeList::iterator MolRunner = ListOfMolecules.begin(); MolRunner != ListOfMolecules.end(); ++MolRunner)
|
---|
| 65 | (*MolRunner)->signOff(this);
|
---|
[e138de] | 66 | ListOfMolecules.clear(); // empty list
|
---|
| 67 | };
|
---|
| 68 |
|
---|
| 69 | /** Insert a new molecule into the list and set its number.
|
---|
| 70 | * \param *mol molecule to add to list.
|
---|
| 71 | */
|
---|
| 72 | void MoleculeListClass::insert(molecule *mol)
|
---|
| 73 | {
|
---|
[2ba827] | 74 | OBSERVE;
|
---|
[e138de] | 75 | mol->IndexNr = MaxIndex++;
|
---|
| 76 | ListOfMolecules.push_back(mol);
|
---|
[520c8b] | 77 | mol->signOn(this);
|
---|
[e138de] | 78 | };
|
---|
| 79 |
|
---|
[bd6bfa] | 80 | /** Erases a molecule from the list.
|
---|
| 81 | * \param *mol molecule to add to list.
|
---|
| 82 | */
|
---|
| 83 | void MoleculeListClass::erase(molecule *mol)
|
---|
| 84 | {
|
---|
| 85 | OBSERVE;
|
---|
| 86 | mol->signOff(this);
|
---|
| 87 | ListOfMolecules.remove(mol);
|
---|
| 88 | };
|
---|
| 89 |
|
---|
[a0064e] | 90 | /** Comparison function for two values.
|
---|
| 91 | * \param *a
|
---|
| 92 | * \param *b
|
---|
| 93 | * \return <0, \a *a less than \a *b, ==0 if equal, >0 \a *a greater than \a *b
|
---|
| 94 | */
|
---|
| 95 | int CompareDoubles (const void * a, const void * b)
|
---|
| 96 | {
|
---|
| 97 | if (*(double *)a > *(double *)b)
|
---|
| 98 | return -1;
|
---|
| 99 | else if (*(double *)a < *(double *)b)
|
---|
| 100 | return 1;
|
---|
| 101 | else
|
---|
| 102 | return 0;
|
---|
| 103 | };
|
---|
| 104 |
|
---|
| 105 |
|
---|
[e138de] | 106 | /** Compare whether two molecules are equal.
|
---|
| 107 | * \param *a molecule one
|
---|
| 108 | * \param *n molecule two
|
---|
| 109 | * \return lexical value (-1, 0, +1)
|
---|
| 110 | */
|
---|
| 111 | int MolCompare(const void *a, const void *b)
|
---|
| 112 | {
|
---|
| 113 | int *aList = NULL, *bList = NULL;
|
---|
| 114 | int Count, Counter, aCounter, bCounter;
|
---|
| 115 | int flag;
|
---|
| 116 |
|
---|
| 117 | // sort each atom list and put the numbers into a list, then go through
|
---|
| 118 | //Log() << Verbose(0) << "Comparing fragment no. " << *(molecule **)a << " to " << *(molecule **)b << "." << endl;
|
---|
[ea7176] | 119 | // Yes those types are awkward... but check it for yourself it checks out this way
|
---|
| 120 | molecule *const *mol1_ptr= static_cast<molecule *const *>(a);
|
---|
| 121 | molecule *mol1 = *mol1_ptr;
|
---|
| 122 | molecule *const *mol2_ptr= static_cast<molecule *const *>(b);
|
---|
| 123 | molecule *mol2 = *mol2_ptr;
|
---|
| 124 | if (mol1->getAtomCount() < mol2->getAtomCount()) {
|
---|
[e138de] | 125 | return -1;
|
---|
| 126 | } else {
|
---|
[ea7176] | 127 | if (mol1->getAtomCount() > mol2->getAtomCount())
|
---|
[e138de] | 128 | return +1;
|
---|
| 129 | else {
|
---|
[ea7176] | 130 | Count = mol1->getAtomCount();
|
---|
[e138de] | 131 | aList = new int[Count];
|
---|
| 132 | bList = new int[Count];
|
---|
| 133 |
|
---|
| 134 | // fill the lists
|
---|
| 135 | Counter = 0;
|
---|
| 136 | aCounter = 0;
|
---|
| 137 | bCounter = 0;
|
---|
[ea7176] | 138 | molecule::const_iterator aiter = mol1->begin();
|
---|
| 139 | molecule::const_iterator biter = mol2->begin();
|
---|
| 140 | for (;(aiter != mol1->end()) && (biter != mol2->end());
|
---|
[9879f6] | 141 | ++aiter, ++biter) {
|
---|
| 142 | if ((*aiter)->GetTrueFather() == NULL)
|
---|
[e138de] | 143 | aList[Counter] = Count + (aCounter++);
|
---|
| 144 | else
|
---|
[9879f6] | 145 | aList[Counter] = (*aiter)->GetTrueFather()->nr;
|
---|
| 146 | if ((*biter)->GetTrueFather() == NULL)
|
---|
[e138de] | 147 | bList[Counter] = Count + (bCounter++);
|
---|
| 148 | else
|
---|
[9879f6] | 149 | bList[Counter] = (*biter)->GetTrueFather()->nr;
|
---|
[e138de] | 150 | Counter++;
|
---|
| 151 | }
|
---|
| 152 | // check if AtomCount was for real
|
---|
| 153 | flag = 0;
|
---|
[ea7176] | 154 | if ((aiter == mol1->end()) && (biter != mol2->end())) {
|
---|
[e138de] | 155 | flag = -1;
|
---|
| 156 | } else {
|
---|
[ea7176] | 157 | if ((aiter != mol1->end()) && (biter == mol2->end()))
|
---|
[e138de] | 158 | flag = 1;
|
---|
| 159 | }
|
---|
| 160 | if (flag == 0) {
|
---|
| 161 | // sort the lists
|
---|
| 162 | gsl_heapsort(aList, Count, sizeof(int), CompareDoubles);
|
---|
| 163 | gsl_heapsort(bList, Count, sizeof(int), CompareDoubles);
|
---|
| 164 | // compare the lists
|
---|
| 165 |
|
---|
| 166 | flag = 0;
|
---|
| 167 | for (int i = 0; i < Count; i++) {
|
---|
| 168 | if (aList[i] < bList[i]) {
|
---|
| 169 | flag = -1;
|
---|
| 170 | } else {
|
---|
| 171 | if (aList[i] > bList[i])
|
---|
| 172 | flag = 1;
|
---|
| 173 | }
|
---|
| 174 | if (flag != 0)
|
---|
| 175 | break;
|
---|
| 176 | }
|
---|
| 177 | }
|
---|
| 178 | delete[] (aList);
|
---|
| 179 | delete[] (bList);
|
---|
| 180 | return flag;
|
---|
| 181 | }
|
---|
| 182 | }
|
---|
| 183 | return -1;
|
---|
| 184 | };
|
---|
| 185 |
|
---|
| 186 | /** Output of a list of all molecules.
|
---|
| 187 | * \param *out output stream
|
---|
| 188 | */
|
---|
[24a5e0] | 189 | void MoleculeListClass::Enumerate(ostream *out)
|
---|
[e138de] | 190 | {
|
---|
[ead4e6] | 191 | periodentafel *periode = World::getInstance().getPeriode();
|
---|
| 192 | std::map<atomicNumber_t,unsigned int> counts;
|
---|
[e138de] | 193 | double size=0;
|
---|
| 194 | Vector Origin;
|
---|
| 195 |
|
---|
| 196 | // header
|
---|
[835a0f] | 197 | (*out) << "Index\tName\t\tAtoms\tFormula\tCenter\tSize" << endl;
|
---|
| 198 | (*out) << "-----------------------------------------------" << endl;
|
---|
[e138de] | 199 | if (ListOfMolecules.size() == 0)
|
---|
[835a0f] | 200 | (*out) << "\tNone" << endl;
|
---|
[e138de] | 201 | else {
|
---|
| 202 | Origin.Zero();
|
---|
| 203 | for (MoleculeList::iterator ListRunner = ListOfMolecules.begin(); ListRunner != ListOfMolecules.end(); ListRunner++) {
|
---|
| 204 | // count atoms per element and determine size of bounding sphere
|
---|
| 205 | size=0.;
|
---|
[9879f6] | 206 | for (molecule::const_iterator iter = (*ListRunner)->begin(); iter != (*ListRunner)->end(); ++iter) {
|
---|
[d74077] | 207 | counts[(*iter)->getType()->getNumber()]++;
|
---|
| 208 | if ((*iter)->DistanceSquared(Origin) > size)
|
---|
| 209 | size = (*iter)->DistanceSquared(Origin);
|
---|
[e138de] | 210 | }
|
---|
| 211 | // output Index, Name, number of atoms, chemical formula
|
---|
[ea7176] | 212 | (*out) << ((*ListRunner)->ActiveFlag ? "*" : " ") << (*ListRunner)->IndexNr << "\t" << (*ListRunner)->name << "\t\t" << (*ListRunner)->getAtomCount() << "\t";
|
---|
[ead4e6] | 213 |
|
---|
| 214 | std::map<atomicNumber_t,unsigned int>::reverse_iterator iter;
|
---|
| 215 | for(iter=counts.rbegin(); iter!=counts.rend();++iter){
|
---|
| 216 | atomicNumber_t Z =(*iter).first;
|
---|
| 217 | (*out) << periode->FindElement(Z)->getSymbol() << (*iter).second;
|
---|
[e138de] | 218 | }
|
---|
| 219 | // Center and size
|
---|
[1883f9] | 220 | Vector *Center = (*ListRunner)->DetermineCenterOfAll();
|
---|
| 221 | (*out) << "\t" << *Center << "\t" << sqrt(size) << endl;
|
---|
| 222 | delete(Center);
|
---|
[e138de] | 223 | }
|
---|
| 224 | }
|
---|
| 225 | };
|
---|
| 226 |
|
---|
| 227 | /** Returns the molecule with the given index \a index.
|
---|
| 228 | * \param index index of the desired molecule
|
---|
[1907a7] | 229 | * \return pointer to molecule structure, NULL if not found
|
---|
[e138de] | 230 | */
|
---|
| 231 | molecule * MoleculeListClass::ReturnIndex(int index)
|
---|
| 232 | {
|
---|
| 233 | for(MoleculeList::iterator ListRunner = ListOfMolecules.begin(); ListRunner != ListOfMolecules.end(); ListRunner++)
|
---|
| 234 | if ((*ListRunner)->IndexNr == index)
|
---|
| 235 | return (*ListRunner);
|
---|
| 236 | return NULL;
|
---|
| 237 | };
|
---|
| 238 |
|
---|
| 239 |
|
---|
| 240 | /** Simple output of the pointers in ListOfMolecules.
|
---|
| 241 | * \param *out output stream
|
---|
| 242 | */
|
---|
| 243 | void MoleculeListClass::Output(ofstream *out)
|
---|
| 244 | {
|
---|
[a67d19] | 245 | DoLog(1) && (Log() << Verbose(1) << "MoleculeList: ");
|
---|
[e138de] | 246 | for (MoleculeList::iterator ListRunner = ListOfMolecules.begin(); ListRunner != ListOfMolecules.end(); ListRunner++)
|
---|
[a67d19] | 247 | DoLog(0) && (Log() << Verbose(0) << *ListRunner << "\t");
|
---|
| 248 | DoLog(0) && (Log() << Verbose(0) << endl);
|
---|
[e138de] | 249 | };
|
---|
| 250 |
|
---|
| 251 | /** Calculates necessary hydrogen correction due to unwanted interaction between saturated ones.
|
---|
| 252 | * If for a pair of two hydrogen atoms a and b, at least is a saturated one, and a and b are not
|
---|
| 253 | * bonded to the same atom, then we add for this pair a correction term constructed from a Morse
|
---|
| 254 | * potential function fit to QM calculations with respecting to the interatomic hydrogen distance.
|
---|
[35b698] | 255 | * \param &path path to file
|
---|
[e138de] | 256 | */
|
---|
[35b698] | 257 | bool MoleculeListClass::AddHydrogenCorrection(std::string &path)
|
---|
[e138de] | 258 | {
|
---|
| 259 | bond *Binder = NULL;
|
---|
| 260 | double ***FitConstant = NULL, **correction = NULL;
|
---|
| 261 | int a, b;
|
---|
| 262 | ofstream output;
|
---|
| 263 | ifstream input;
|
---|
| 264 | string line;
|
---|
| 265 | stringstream zeile;
|
---|
| 266 | double distance;
|
---|
| 267 | char ParsedLine[1023];
|
---|
| 268 | double tmp;
|
---|
| 269 | char *FragmentNumber = NULL;
|
---|
| 270 |
|
---|
[a67d19] | 271 | DoLog(1) && (Log() << Verbose(1) << "Saving hydrogen saturation correction ... ");
|
---|
[e138de] | 272 | // 0. parse in fit constant files that should have the same dimension as the final energy files
|
---|
| 273 | // 0a. find dimension of matrices with constants
|
---|
| 274 | line = path;
|
---|
| 275 | line += "1";
|
---|
| 276 | line += FITCONSTANTSUFFIX;
|
---|
| 277 | input.open(line.c_str());
|
---|
[35b698] | 278 | if (input.fail()) {
|
---|
[a67d19] | 279 | DoLog(1) && (Log() << Verbose(1) << endl << "Unable to open " << line << ", is the directory correct?" << endl);
|
---|
[e138de] | 280 | return false;
|
---|
| 281 | }
|
---|
| 282 | a = 0;
|
---|
| 283 | b = -1; // we overcount by one
|
---|
| 284 | while (!input.eof()) {
|
---|
| 285 | input.getline(ParsedLine, 1023);
|
---|
| 286 | zeile.str(ParsedLine);
|
---|
| 287 | int i = 0;
|
---|
| 288 | while (!zeile.eof()) {
|
---|
| 289 | zeile >> distance;
|
---|
| 290 | i++;
|
---|
| 291 | }
|
---|
| 292 | if (i > a)
|
---|
| 293 | a = i;
|
---|
| 294 | b++;
|
---|
| 295 | }
|
---|
[a67d19] | 296 | DoLog(0) && (Log() << Verbose(0) << "I recognized " << a << " columns and " << b << " rows, ");
|
---|
[e138de] | 297 | input.close();
|
---|
| 298 |
|
---|
| 299 | // 0b. allocate memory for constants
|
---|
[920c70] | 300 | FitConstant = new double**[3];
|
---|
[e138de] | 301 | for (int k = 0; k < 3; k++) {
|
---|
[920c70] | 302 | FitConstant[k] = new double*[a];
|
---|
[e138de] | 303 | for (int i = a; i--;) {
|
---|
[920c70] | 304 | FitConstant[k][i] = new double[b];
|
---|
| 305 | for (int j = b; j--;) {
|
---|
| 306 | FitConstant[k][i][j] = 0.;
|
---|
| 307 | }
|
---|
[e138de] | 308 | }
|
---|
| 309 | }
|
---|
| 310 | // 0c. parse in constants
|
---|
| 311 | for (int i = 0; i < 3; i++) {
|
---|
| 312 | line = path;
|
---|
| 313 | line.append("/");
|
---|
| 314 | line += FRAGMENTPREFIX;
|
---|
| 315 | sprintf(ParsedLine, "%d", i + 1);
|
---|
| 316 | line += ParsedLine;
|
---|
| 317 | line += FITCONSTANTSUFFIX;
|
---|
| 318 | input.open(line.c_str());
|
---|
| 319 | if (input == NULL) {
|
---|
[58ed4a] | 320 | DoeLog(0) && (eLog()<< Verbose(0) << endl << "Unable to open " << line << ", is the directory correct?" << endl);
|
---|
[e359a8] | 321 | performCriticalExit();
|
---|
[e138de] | 322 | return false;
|
---|
| 323 | }
|
---|
| 324 | int k = 0, l;
|
---|
| 325 | while ((!input.eof()) && (k < b)) {
|
---|
| 326 | input.getline(ParsedLine, 1023);
|
---|
| 327 | //Log() << Verbose(0) << "Current Line: " << ParsedLine << endl;
|
---|
| 328 | zeile.str(ParsedLine);
|
---|
| 329 | zeile.clear();
|
---|
| 330 | l = 0;
|
---|
| 331 | while ((!zeile.eof()) && (l < a)) {
|
---|
| 332 | zeile >> FitConstant[i][l][k];
|
---|
| 333 | //Log() << Verbose(0) << FitConstant[i][l][k] << "\t";
|
---|
| 334 | l++;
|
---|
| 335 | }
|
---|
| 336 | //Log() << Verbose(0) << endl;
|
---|
| 337 | k++;
|
---|
| 338 | }
|
---|
| 339 | input.close();
|
---|
| 340 | }
|
---|
| 341 | for (int k = 0; k < 3; k++) {
|
---|
[a67d19] | 342 | DoLog(0) && (Log() << Verbose(0) << "Constants " << k << ":" << endl);
|
---|
[e138de] | 343 | for (int j = 0; j < b; j++) {
|
---|
| 344 | for (int i = 0; i < a; i++) {
|
---|
[a67d19] | 345 | DoLog(0) && (Log() << Verbose(0) << FitConstant[k][i][j] << "\t");
|
---|
[e138de] | 346 | }
|
---|
[a67d19] | 347 | DoLog(0) && (Log() << Verbose(0) << endl);
|
---|
[e138de] | 348 | }
|
---|
[a67d19] | 349 | DoLog(0) && (Log() << Verbose(0) << endl);
|
---|
[e138de] | 350 | }
|
---|
| 351 |
|
---|
| 352 | // 0d. allocate final correction matrix
|
---|
[920c70] | 353 | correction = new double*[a];
|
---|
[e138de] | 354 | for (int i = a; i--;)
|
---|
[920c70] | 355 | correction[i] = new double[b];
|
---|
[e138de] | 356 |
|
---|
| 357 | // 1a. go through every molecule in the list
|
---|
| 358 | for (MoleculeList::iterator ListRunner = ListOfMolecules.begin(); ListRunner != ListOfMolecules.end(); ListRunner++) {
|
---|
| 359 | // 1b. zero final correction matrix
|
---|
| 360 | for (int k = a; k--;)
|
---|
| 361 | for (int j = b; j--;)
|
---|
| 362 | correction[k][j] = 0.;
|
---|
| 363 | // 2. take every hydrogen that is a saturated one
|
---|
[9879f6] | 364 | for (molecule::const_iterator iter = (*ListRunner)->begin(); iter != (*ListRunner)->end(); ++iter) {
|
---|
| 365 | //Log() << Verbose(1) << "(*iter): " << *(*iter) << " with first bond " << *((*iter)->ListOfBonds.begin()) << "." << endl;
|
---|
[83f176] | 366 | if (((*iter)->getType()->getAtomicNumber() == 1) && (((*iter)->father == NULL)
|
---|
| 367 | || ((*iter)->father->getType()->getAtomicNumber() != 1))) { // if it's a hydrogen
|
---|
[9879f6] | 368 | for (molecule::const_iterator runner = (*ListRunner)->begin(); runner != (*ListRunner)->end(); ++runner) {
|
---|
| 369 | //Log() << Verbose(2) << "Runner: " << *(*runner) << " with first bond " << *((*iter)->ListOfBonds.begin()) << "." << endl;
|
---|
[e138de] | 370 | // 3. take every other hydrogen that is the not the first and not bound to same bonding partner
|
---|
[9879f6] | 371 | Binder = *((*runner)->ListOfBonds.begin());
|
---|
[83f176] | 372 | if (((*runner)->getType()->getAtomicNumber() == 1) && ((*runner)->nr > (*iter)->nr) && (Binder->GetOtherAtom((*runner)) != Binder->GetOtherAtom((*iter)))) { // (hydrogens have only one bonding partner!)
|
---|
[e138de] | 373 | // 4. evaluate the morse potential for each matrix component and add up
|
---|
[d74077] | 374 | distance = (*runner)->distance(*(*iter));
|
---|
[9879f6] | 375 | //Log() << Verbose(0) << "Fragment " << (*ListRunner)->name << ": " << *(*runner) << "<= " << distance << "=>" << *(*iter) << ":" << endl;
|
---|
[e138de] | 376 | for (int k = 0; k < a; k++) {
|
---|
| 377 | for (int j = 0; j < b; j++) {
|
---|
| 378 | switch (k) {
|
---|
| 379 | case 1:
|
---|
| 380 | case 7:
|
---|
| 381 | case 11:
|
---|
| 382 | tmp = pow(FitConstant[0][k][j] * (1. - exp(-FitConstant[1][k][j] * (distance - FitConstant[2][k][j]))), 2);
|
---|
| 383 | break;
|
---|
| 384 | default:
|
---|
| 385 | tmp = FitConstant[0][k][j] * pow(distance, FitConstant[1][k][j]) + FitConstant[2][k][j];
|
---|
| 386 | };
|
---|
| 387 | correction[k][j] -= tmp; // ground state is actually lower (disturbed by additional interaction)
|
---|
| 388 | //Log() << Verbose(0) << tmp << "\t";
|
---|
| 389 | }
|
---|
| 390 | //Log() << Verbose(0) << endl;
|
---|
| 391 | }
|
---|
| 392 | //Log() << Verbose(0) << endl;
|
---|
| 393 | }
|
---|
| 394 | }
|
---|
| 395 | }
|
---|
| 396 | }
|
---|
| 397 | // 5. write final matrix to file
|
---|
| 398 | line = path;
|
---|
| 399 | line.append("/");
|
---|
| 400 | line += FRAGMENTPREFIX;
|
---|
| 401 | FragmentNumber = FixedDigitNumber(ListOfMolecules.size(), (*ListRunner)->IndexNr);
|
---|
| 402 | line += FragmentNumber;
|
---|
[920c70] | 403 | delete[] (FragmentNumber);
|
---|
[e138de] | 404 | line += HCORRECTIONSUFFIX;
|
---|
| 405 | output.open(line.c_str());
|
---|
| 406 | output << "Time\t\tTotal\t\tKinetic\t\tNonLocal\tCorrelation\tExchange\tPseudo\t\tHartree\t\t-Gauss\t\tEwald\t\tIonKin\t\tETotal" << endl;
|
---|
| 407 | for (int j = 0; j < b; j++) {
|
---|
| 408 | for (int i = 0; i < a; i++)
|
---|
| 409 | output << correction[i][j] << "\t";
|
---|
| 410 | output << endl;
|
---|
| 411 | }
|
---|
| 412 | output.close();
|
---|
| 413 | }
|
---|
[920c70] | 414 | for (int i = a; i--;)
|
---|
| 415 | delete[](correction[i]);
|
---|
| 416 | delete[](correction);
|
---|
| 417 |
|
---|
[e138de] | 418 | line = path;
|
---|
| 419 | line.append("/");
|
---|
| 420 | line += HCORRECTIONSUFFIX;
|
---|
| 421 | output.open(line.c_str());
|
---|
| 422 | output << "Time\t\tTotal\t\tKinetic\t\tNonLocal\tCorrelation\tExchange\tPseudo\t\tHartree\t\t-Gauss\t\tEwald\t\tIonKin\t\tETotal" << endl;
|
---|
| 423 | for (int j = 0; j < b; j++) {
|
---|
| 424 | for (int i = 0; i < a; i++)
|
---|
| 425 | output << 0 << "\t";
|
---|
| 426 | output << endl;
|
---|
| 427 | }
|
---|
| 428 | output.close();
|
---|
| 429 | // 6. free memory of parsed matrices
|
---|
| 430 | for (int k = 0; k < 3; k++) {
|
---|
| 431 | for (int i = a; i--;) {
|
---|
[920c70] | 432 | delete[](FitConstant[k][i]);
|
---|
[e138de] | 433 | }
|
---|
[920c70] | 434 | delete[](FitConstant[k]);
|
---|
[e138de] | 435 | }
|
---|
[920c70] | 436 | delete[](FitConstant);
|
---|
[a67d19] | 437 | DoLog(0) && (Log() << Verbose(0) << "done." << endl);
|
---|
[e138de] | 438 | return true;
|
---|
| 439 | };
|
---|
| 440 |
|
---|
| 441 | /** Store force indices, i.e. the connection between the nuclear index in the total molecule config and the respective atom in fragment config.
|
---|
[35b698] | 442 | * \param &path path to file
|
---|
[e138de] | 443 | * \param *SortIndex Index to map from the BFS labeling to the sequence how of Ion_Type in the config
|
---|
| 444 | * \return true - file written successfully, false - writing failed
|
---|
| 445 | */
|
---|
[35b698] | 446 | bool MoleculeListClass::StoreForcesFile(std::string &path, int *SortIndex)
|
---|
[e138de] | 447 | {
|
---|
| 448 | bool status = true;
|
---|
[35b698] | 449 | string filename(path);
|
---|
| 450 | filename += FORCESFILE;
|
---|
| 451 | ofstream ForcesFile(filename.c_str());
|
---|
[ead4e6] | 452 | periodentafel *periode=World::getInstance().getPeriode();
|
---|
[e138de] | 453 |
|
---|
| 454 | // open file for the force factors
|
---|
[a67d19] | 455 | DoLog(1) && (Log() << Verbose(1) << "Saving force factors ... ");
|
---|
[35b698] | 456 | if (!ForcesFile.fail()) {
|
---|
[e138de] | 457 | //Log() << Verbose(1) << "Final AtomicForcesList: ";
|
---|
| 458 | //output << prefix << "Forces" << endl;
|
---|
| 459 | for (MoleculeList::iterator ListRunner = ListOfMolecules.begin(); ListRunner != ListOfMolecules.end(); ListRunner++) {
|
---|
[ead4e6] | 460 | periodentafel::const_iterator elemIter;
|
---|
| 461 | for(elemIter=periode->begin();elemIter!=periode->end();++elemIter){
|
---|
[389cc8] | 462 | if ((*ListRunner)->hasElement((*elemIter).first)) { // if this element got atoms
|
---|
[a7b761b] | 463 | for(molecule::iterator atomIter = (*ListRunner)->begin(); atomIter !=(*ListRunner)->end();++atomIter){
|
---|
[d74077] | 464 | if ((*atomIter)->getType()->getNumber() == (*elemIter).first) {
|
---|
[a7b761b] | 465 | if (((*atomIter)->GetTrueFather() != NULL) && ((*atomIter)->GetTrueFather() != (*atomIter))) {// if there is a rea
|
---|
[e138de] | 466 | //Log() << Verbose(0) << "Walker is " << *Walker << " with true father " << *( Walker->GetTrueFather()) << ", it
|
---|
[a7b761b] | 467 | ForcesFile << SortIndex[(*atomIter)->GetTrueFather()->nr] << "\t";
|
---|
[e138de] | 468 | } else
|
---|
| 469 | // otherwise a -1 to indicate an added saturation hydrogen
|
---|
| 470 | ForcesFile << "-1\t";
|
---|
| 471 | }
|
---|
| 472 | }
|
---|
| 473 | }
|
---|
| 474 | }
|
---|
| 475 | ForcesFile << endl;
|
---|
| 476 | }
|
---|
| 477 | ForcesFile.close();
|
---|
[a67d19] | 478 | DoLog(1) && (Log() << Verbose(1) << "done." << endl);
|
---|
[e138de] | 479 | } else {
|
---|
| 480 | status = false;
|
---|
[35b698] | 481 | DoLog(1) && (Log() << Verbose(1) << "failed to open file " << filename << "." << endl);
|
---|
[e138de] | 482 | }
|
---|
| 483 | ForcesFile.close();
|
---|
| 484 |
|
---|
| 485 | return status;
|
---|
| 486 | };
|
---|
| 487 |
|
---|
| 488 | /** Writes a config file for each molecule in the given \a **FragmentList.
|
---|
| 489 | * \param *out output stream for debugging
|
---|
[35b698] | 490 | * \param &prefix path and prefix to the fragment config files
|
---|
[e138de] | 491 | * \param *SortIndex Index to map from the BFS labeling to the sequence how of Ion_Type in the config
|
---|
| 492 | * \return true - success (each file was written), false - something went wrong.
|
---|
| 493 | */
|
---|
[35b698] | 494 | bool MoleculeListClass::OutputConfigForListOfFragments(std::string &prefix, int *SortIndex)
|
---|
[e138de] | 495 | {
|
---|
| 496 | ofstream outputFragment;
|
---|
[35b698] | 497 | std::string FragmentName;
|
---|
[e138de] | 498 | char PathBackup[MAXSTRINGSIZE];
|
---|
| 499 | bool result = true;
|
---|
| 500 | bool intermediateResult = true;
|
---|
| 501 | Vector BoxDimension;
|
---|
| 502 | char *FragmentNumber = NULL;
|
---|
| 503 | char *path = NULL;
|
---|
| 504 | int FragmentCounter = 0;
|
---|
| 505 | ofstream output;
|
---|
[cca9ef] | 506 | RealSpaceMatrix cell_size = World::getInstance().getDomain().getM();
|
---|
| 507 | RealSpaceMatrix cell_size_backup = cell_size;
|
---|
[e138de] | 508 |
|
---|
| 509 | // store the fragments as config and as xyz
|
---|
| 510 | for (MoleculeList::iterator ListRunner = ListOfMolecules.begin(); ListRunner != ListOfMolecules.end(); ListRunner++) {
|
---|
| 511 | // save default path as it is changed for each fragment
|
---|
[35b698] | 512 | path = World::getInstance().getConfig()->GetDefaultPath();
|
---|
[e138de] | 513 | if (path != NULL)
|
---|
| 514 | strcpy(PathBackup, path);
|
---|
[e359a8] | 515 | else {
|
---|
[58ed4a] | 516 | DoeLog(0) && (eLog()<< Verbose(0) << "OutputConfigForListOfFragments: NULL default path obtained from config!" << endl);
|
---|
[e359a8] | 517 | performCriticalExit();
|
---|
| 518 | }
|
---|
[e138de] | 519 |
|
---|
| 520 | // correct periodic
|
---|
| 521 | (*ListRunner)->ScanForPeriodicCorrection();
|
---|
| 522 |
|
---|
| 523 | // output xyz file
|
---|
| 524 | FragmentNumber = FixedDigitNumber(ListOfMolecules.size(), FragmentCounter++);
|
---|
[35b698] | 525 | FragmentName = prefix + FragmentNumber + ".conf.xyz";
|
---|
| 526 | outputFragment.open(FragmentName.c_str(), ios::out);
|
---|
[a67d19] | 527 | DoLog(2) && (Log() << Verbose(2) << "Saving bond fragment No. " << FragmentNumber << "/" << FragmentCounter - 1 << " as XYZ ...");
|
---|
[e138de] | 528 | if ((intermediateResult = (*ListRunner)->OutputXYZ(&outputFragment)))
|
---|
[a67d19] | 529 | DoLog(0) && (Log() << Verbose(0) << " done." << endl);
|
---|
[e138de] | 530 | else
|
---|
[a67d19] | 531 | DoLog(0) && (Log() << Verbose(0) << " failed." << endl);
|
---|
[e138de] | 532 | result = result && intermediateResult;
|
---|
| 533 | outputFragment.close();
|
---|
| 534 | outputFragment.clear();
|
---|
| 535 |
|
---|
| 536 | // list atoms in fragment for debugging
|
---|
[a67d19] | 537 | DoLog(2) && (Log() << Verbose(2) << "Contained atoms: ");
|
---|
[9879f6] | 538 | for (molecule::const_iterator iter = (*ListRunner)->begin(); iter != (*ListRunner)->end(); ++iter) {
|
---|
[a7b761b] | 539 | DoLog(0) && (Log() << Verbose(0) << (*iter)->getName() << " ");
|
---|
[e138de] | 540 | }
|
---|
[a67d19] | 541 | DoLog(0) && (Log() << Verbose(0) << endl);
|
---|
[e138de] | 542 |
|
---|
| 543 | // center on edge
|
---|
| 544 | (*ListRunner)->CenterEdge(&BoxDimension);
|
---|
| 545 | (*ListRunner)->SetBoxDimension(&BoxDimension); // update Box of atoms by boundary
|
---|
| 546 | for (int k = 0; k < NDIM; k++) {
|
---|
[35b698] | 547 | BoxDimension[k] = 2.5 * (World::getInstance().getConfig()->GetIsAngstroem() ? 1. : 1. / AtomicLengthToAngstroem);
|
---|
[84c494] | 548 | cell_size.at(k,k) = BoxDimension[k] * 2.;
|
---|
[e138de] | 549 | }
|
---|
[84c494] | 550 | World::getInstance().setDomain(cell_size);
|
---|
[e138de] | 551 | (*ListRunner)->Translate(&BoxDimension);
|
---|
| 552 |
|
---|
| 553 | // also calculate necessary orbitals
|
---|
[35b698] | 554 | //(*ListRunner)->CalculateOrbitals(*World::getInstance().getConfig);
|
---|
[e138de] | 555 |
|
---|
| 556 | // change path in config
|
---|
[35b698] | 557 | FragmentName = PathBackup;
|
---|
| 558 | FragmentName += "/";
|
---|
| 559 | FragmentName += FRAGMENTPREFIX;
|
---|
| 560 | FragmentName += FragmentNumber;
|
---|
| 561 | FragmentName += "/";
|
---|
| 562 | World::getInstance().getConfig()->SetDefaultPath(FragmentName.c_str());
|
---|
[e138de] | 563 |
|
---|
| 564 | // and save as config
|
---|
[35b698] | 565 | FragmentName = prefix + FragmentNumber + ".conf";
|
---|
[a67d19] | 566 | DoLog(2) && (Log() << Verbose(2) << "Saving bond fragment No. " << FragmentNumber << "/" << FragmentCounter - 1 << " as config ...");
|
---|
[35b698] | 567 | if ((intermediateResult = World::getInstance().getConfig()->Save(FragmentName.c_str(), (*ListRunner)->elemente, (*ListRunner))))
|
---|
[a67d19] | 568 | DoLog(0) && (Log() << Verbose(0) << " done." << endl);
|
---|
[e138de] | 569 | else
|
---|
[a67d19] | 570 | DoLog(0) && (Log() << Verbose(0) << " failed." << endl);
|
---|
[e138de] | 571 | result = result && intermediateResult;
|
---|
| 572 |
|
---|
| 573 | // restore old config
|
---|
[35b698] | 574 | World::getInstance().getConfig()->SetDefaultPath(PathBackup);
|
---|
[e138de] | 575 |
|
---|
| 576 | // and save as mpqc input file
|
---|
[35b698] | 577 | FragmentName = prefix + FragmentNumber + ".conf";
|
---|
[a67d19] | 578 | DoLog(2) && (Log() << Verbose(2) << "Saving bond fragment No. " << FragmentNumber << "/" << FragmentCounter - 1 << " as mpqc input ...");
|
---|
[35b698] | 579 | if ((intermediateResult = World::getInstance().getConfig()->SaveMPQC(FragmentName.c_str(), (*ListRunner))))
|
---|
[a67d19] | 580 | DoLog(2) && (Log() << Verbose(2) << " done." << endl);
|
---|
[e138de] | 581 | else
|
---|
[a67d19] | 582 | DoLog(0) && (Log() << Verbose(0) << " failed." << endl);
|
---|
[e138de] | 583 |
|
---|
| 584 | result = result && intermediateResult;
|
---|
| 585 | //outputFragment.close();
|
---|
| 586 | //outputFragment.clear();
|
---|
[920c70] | 587 | delete[](FragmentNumber);
|
---|
[e138de] | 588 | }
|
---|
[a67d19] | 589 | DoLog(0) && (Log() << Verbose(0) << " done." << endl);
|
---|
[e138de] | 590 |
|
---|
| 591 | // printing final number
|
---|
[a67d19] | 592 | DoLog(2) && (Log() << Verbose(2) << "Final number of fragments: " << FragmentCounter << "." << endl);
|
---|
[e138de] | 593 |
|
---|
[b34306] | 594 | // restore cell_size
|
---|
[84c494] | 595 | World::getInstance().setDomain(cell_size_backup);
|
---|
[e138de] | 596 |
|
---|
| 597 | return result;
|
---|
| 598 | };
|
---|
| 599 |
|
---|
| 600 | /** Counts the number of molecules with the molecule::ActiveFlag set.
|
---|
[1907a7] | 601 | * \return number of molecules with ActiveFlag set to true.
|
---|
[e138de] | 602 | */
|
---|
| 603 | int MoleculeListClass::NumberOfActiveMolecules()
|
---|
| 604 | {
|
---|
| 605 | int count = 0;
|
---|
| 606 | for (MoleculeList::iterator ListRunner = ListOfMolecules.begin(); ListRunner != ListOfMolecules.end(); ListRunner++)
|
---|
| 607 | count += ((*ListRunner)->ActiveFlag ? 1 : 0);
|
---|
| 608 | return count;
|
---|
| 609 | };
|
---|
| 610 |
|
---|
[568be7] | 611 | /** Count all atoms in each molecule.
|
---|
| 612 | * \return number of atoms in the MoleculeListClass.
|
---|
| 613 | * TODO: the inner loop should be done by some (double molecule::CountAtom()) function
|
---|
| 614 | */
|
---|
| 615 | int MoleculeListClass::CountAllAtoms() const
|
---|
| 616 | {
|
---|
| 617 | int AtomNo = 0;
|
---|
| 618 | for (MoleculeList::const_iterator MolWalker = ListOfMolecules.begin(); MolWalker != ListOfMolecules.end(); MolWalker++) {
|
---|
[9879f6] | 619 | AtomNo += (*MolWalker)->size();
|
---|
[568be7] | 620 | }
|
---|
| 621 | return AtomNo;
|
---|
| 622 | }
|
---|
| 623 |
|
---|
[477bb2] | 624 | /***********
|
---|
| 625 | * Methods Moved here from the menus
|
---|
| 626 | */
|
---|
[568be7] | 627 |
|
---|
[477bb2] | 628 | void MoleculeListClass::createNewMolecule(periodentafel *periode) {
|
---|
[2ba827] | 629 | OBSERVE;
|
---|
[477bb2] | 630 | molecule *mol = NULL;
|
---|
[23b547] | 631 | mol = World::getInstance().createMolecule();
|
---|
[477bb2] | 632 | insert(mol);
|
---|
| 633 | };
|
---|
| 634 |
|
---|
| 635 | void MoleculeListClass::loadFromXYZ(periodentafel *periode){
|
---|
| 636 | molecule *mol = NULL;
|
---|
| 637 | Vector center;
|
---|
| 638 | char filename[MAXSTRINGSIZE];
|
---|
| 639 | Log() << Verbose(0) << "Format should be XYZ with: ShorthandOfElement\tX\tY\tZ" << endl;
|
---|
[23b547] | 640 | mol = World::getInstance().createMolecule();
|
---|
[477bb2] | 641 | do {
|
---|
| 642 | Log() << Verbose(0) << "Enter file name: ";
|
---|
| 643 | cin >> filename;
|
---|
| 644 | } while (!mol->AddXYZFile(filename));
|
---|
| 645 | mol->SetNameFromFilename(filename);
|
---|
| 646 | // center at set box dimensions
|
---|
| 647 | mol->CenterEdge(¢er);
|
---|
[cca9ef] | 648 | RealSpaceMatrix domain;
|
---|
[84c494] | 649 | for(int i =0;i<NDIM;++i)
|
---|
| 650 | domain.at(i,i) = center[i];
|
---|
| 651 | World::getInstance().setDomain(domain);
|
---|
[477bb2] | 652 | insert(mol);
|
---|
| 653 | }
|
---|
| 654 |
|
---|
| 655 | void MoleculeListClass::setMoleculeFilename() {
|
---|
| 656 | char filename[MAXSTRINGSIZE];
|
---|
| 657 | int nr;
|
---|
| 658 | molecule *mol = NULL;
|
---|
| 659 | do {
|
---|
| 660 | Log() << Verbose(0) << "Enter index of molecule: ";
|
---|
| 661 | cin >> nr;
|
---|
| 662 | mol = ReturnIndex(nr);
|
---|
| 663 | } while (mol == NULL);
|
---|
| 664 | Log() << Verbose(0) << "Enter name: ";
|
---|
| 665 | cin >> filename;
|
---|
| 666 | mol->SetNameFromFilename(filename);
|
---|
| 667 | }
|
---|
| 668 |
|
---|
| 669 | void MoleculeListClass::parseXYZIntoMolecule(){
|
---|
| 670 | char filename[MAXSTRINGSIZE];
|
---|
| 671 | int nr;
|
---|
| 672 | molecule *mol = NULL;
|
---|
| 673 | mol = NULL;
|
---|
| 674 | do {
|
---|
| 675 | Log() << Verbose(0) << "Enter index of molecule: ";
|
---|
| 676 | cin >> nr;
|
---|
| 677 | mol = ReturnIndex(nr);
|
---|
| 678 | } while (mol == NULL);
|
---|
| 679 | Log() << Verbose(0) << "Format should be XYZ with: ShorthandOfElement\tX\tY\tZ" << endl;
|
---|
| 680 | do {
|
---|
| 681 | Log() << Verbose(0) << "Enter file name: ";
|
---|
| 682 | cin >> filename;
|
---|
| 683 | } while (!mol->AddXYZFile(filename));
|
---|
| 684 | mol->SetNameFromFilename(filename);
|
---|
| 685 | };
|
---|
| 686 |
|
---|
| 687 | void MoleculeListClass::eraseMolecule(){
|
---|
| 688 | int nr;
|
---|
| 689 | molecule *mol = NULL;
|
---|
| 690 | Log() << Verbose(0) << "Enter index of molecule: ";
|
---|
| 691 | cin >> nr;
|
---|
| 692 | for(MoleculeList::iterator ListRunner = ListOfMolecules.begin(); ListRunner != ListOfMolecules.end(); ListRunner++)
|
---|
| 693 | if (nr == (*ListRunner)->IndexNr) {
|
---|
| 694 | mol = *ListRunner;
|
---|
| 695 | ListOfMolecules.erase(ListRunner);
|
---|
[23b547] | 696 | World::getInstance().destroyMolecule(mol);
|
---|
[477bb2] | 697 | break;
|
---|
| 698 | }
|
---|
| 699 | };
|
---|
| 700 |
|
---|
[77675f] | 701 |
|
---|
[e138de] | 702 | /******************************************* Class MoleculeLeafClass ************************************************/
|
---|
| 703 |
|
---|
| 704 | /** Constructor for MoleculeLeafClass root leaf.
|
---|
| 705 | * \param *Up Leaf on upper level
|
---|
| 706 | * \param *PreviousLeaf NULL - We are the first leaf on this level, otherwise points to previous in list
|
---|
| 707 | */
|
---|
| 708 | //MoleculeLeafClass::MoleculeLeafClass(MoleculeLeafClass *Up = NULL, MoleculeLeafClass *Previous = NULL)
|
---|
[97b825] | 709 | MoleculeLeafClass::MoleculeLeafClass(MoleculeLeafClass *PreviousLeaf = NULL) :
|
---|
| 710 | Leaf(NULL),
|
---|
| 711 | previous(PreviousLeaf)
|
---|
[e138de] | 712 | {
|
---|
| 713 | // if (Up != NULL)
|
---|
| 714 | // if (Up->DownLeaf == NULL) // are we the first down leaf for the upper leaf?
|
---|
| 715 | // Up->DownLeaf = this;
|
---|
| 716 | // UpLeaf = Up;
|
---|
| 717 | // DownLeaf = NULL;
|
---|
| 718 | if (previous != NULL) {
|
---|
| 719 | MoleculeLeafClass *Walker = previous->next;
|
---|
| 720 | previous->next = this;
|
---|
| 721 | next = Walker;
|
---|
| 722 | } else {
|
---|
| 723 | next = NULL;
|
---|
| 724 | }
|
---|
| 725 | };
|
---|
| 726 |
|
---|
| 727 | /** Destructor for MoleculeLeafClass.
|
---|
| 728 | */
|
---|
| 729 | MoleculeLeafClass::~MoleculeLeafClass()
|
---|
| 730 | {
|
---|
| 731 | // if (DownLeaf != NULL) {// drop leaves further down
|
---|
| 732 | // MoleculeLeafClass *Walker = DownLeaf;
|
---|
| 733 | // MoleculeLeafClass *Next;
|
---|
| 734 | // do {
|
---|
| 735 | // Next = Walker->NextLeaf;
|
---|
| 736 | // delete(Walker);
|
---|
| 737 | // Walker = Next;
|
---|
| 738 | // } while (Walker != NULL);
|
---|
| 739 | // // Last Walker sets DownLeaf automatically to NULL
|
---|
| 740 | // }
|
---|
| 741 | // remove the leaf itself
|
---|
| 742 | if (Leaf != NULL) {
|
---|
[23b547] | 743 | World::getInstance().destroyMolecule(Leaf);
|
---|
[e138de] | 744 | Leaf = NULL;
|
---|
| 745 | }
|
---|
| 746 | // remove this Leaf from level list
|
---|
| 747 | if (previous != NULL)
|
---|
| 748 | previous->next = next;
|
---|
| 749 | // } else { // we are first in list (connects to UpLeaf->DownLeaf)
|
---|
| 750 | // if ((NextLeaf != NULL) && (NextLeaf->UpLeaf == NULL))
|
---|
| 751 | // NextLeaf->UpLeaf = UpLeaf; // either null as we are top level or the upleaf of the first node
|
---|
| 752 | // if (UpLeaf != NULL)
|
---|
| 753 | // UpLeaf->DownLeaf = NextLeaf; // either null as we are only leaf or NextLeaf if we are just the first
|
---|
| 754 | // }
|
---|
| 755 | // UpLeaf = NULL;
|
---|
| 756 | if (next != NULL) // are we last in list
|
---|
| 757 | next->previous = previous;
|
---|
| 758 | next = NULL;
|
---|
| 759 | previous = NULL;
|
---|
| 760 | };
|
---|
| 761 |
|
---|
| 762 | /** Adds \a molecule leaf to the tree.
|
---|
| 763 | * \param *ptr ptr to molecule to be added
|
---|
| 764 | * \param *Previous previous MoleculeLeafClass referencing level and which on the level
|
---|
| 765 | * \return true - success, false - something went wrong
|
---|
| 766 | */
|
---|
| 767 | bool MoleculeLeafClass::AddLeaf(molecule *ptr, MoleculeLeafClass *Previous)
|
---|
| 768 | {
|
---|
| 769 | return false;
|
---|
| 770 | };
|
---|
| 771 |
|
---|
| 772 | /** Fills the bond structure of this chain list subgraphs that are derived from a complete \a *reference molecule.
|
---|
| 773 | * Calls this routine in each MoleculeLeafClass::next subgraph if it's not NULL.
|
---|
| 774 | * \param *out output stream for debugging
|
---|
| 775 | * \param *reference reference molecule with the bond structure to be copied
|
---|
[c27778] | 776 | * \param **&ListOfLocalAtoms Lookup table for this subgraph and index of each atom in \a *reference, may be NULL on start, then it is filled
|
---|
[e138de] | 777 | * \param FreeList true - ***ListOfLocalAtoms is free'd before return, false - it is not
|
---|
| 778 | * \return true - success, false - faoilure
|
---|
| 779 | */
|
---|
[c27778] | 780 | bool MoleculeLeafClass::FillBondStructureFromReference(const molecule * const reference, atom **&ListOfLocalAtoms, bool FreeList)
|
---|
[e138de] | 781 | {
|
---|
| 782 | atom *OtherWalker = NULL;
|
---|
| 783 | atom *Father = NULL;
|
---|
| 784 | bool status = true;
|
---|
| 785 | int AtomNo;
|
---|
| 786 |
|
---|
[a67d19] | 787 | DoLog(1) && (Log() << Verbose(1) << "Begin of FillBondStructureFromReference." << endl);
|
---|
[e138de] | 788 | // fill ListOfLocalAtoms if NULL was given
|
---|
[c27778] | 789 | if (!FillListOfLocalAtoms(ListOfLocalAtoms, reference->getAtomCount(), FreeList)) {
|
---|
[a67d19] | 790 | DoLog(1) && (Log() << Verbose(1) << "Filling of ListOfLocalAtoms failed." << endl);
|
---|
[e138de] | 791 | return false;
|
---|
| 792 | }
|
---|
| 793 |
|
---|
| 794 | if (status) {
|
---|
[a67d19] | 795 | DoLog(1) && (Log() << Verbose(1) << "Creating adjacency list for subgraph " << Leaf << "." << endl);
|
---|
[e138de] | 796 | // remove every bond from the list
|
---|
[e08c46] | 797 | for(molecule::iterator AtomRunner = Leaf->begin(); AtomRunner != Leaf->end(); ++AtomRunner)
|
---|
| 798 | for(BondList::iterator BondRunner = (*AtomRunner)->ListOfBonds.begin(); !(*AtomRunner)->ListOfBonds.empty(); BondRunner = (*AtomRunner)->ListOfBonds.begin())
|
---|
| 799 | if ((*BondRunner)->leftatom == *AtomRunner)
|
---|
| 800 | delete((*BondRunner));
|
---|
[e138de] | 801 |
|
---|
[9879f6] | 802 | for(molecule::const_iterator iter = Leaf->begin(); iter != Leaf->end(); ++iter) {
|
---|
| 803 | Father = (*iter)->GetTrueFather();
|
---|
[e138de] | 804 | AtomNo = Father->nr; // global id of the current walker
|
---|
| 805 | for (BondList::const_iterator Runner = Father->ListOfBonds.begin(); Runner != Father->ListOfBonds.end(); (++Runner)) {
|
---|
[c27778] | 806 | OtherWalker = ListOfLocalAtoms[(*Runner)->GetOtherAtom((*iter)->GetTrueFather())->nr]; // local copy of current bond partner of walker
|
---|
[e138de] | 807 | if (OtherWalker != NULL) {
|
---|
[9879f6] | 808 | if (OtherWalker->nr > (*iter)->nr)
|
---|
| 809 | Leaf->AddBond((*iter), OtherWalker, (*Runner)->BondDegree);
|
---|
[e138de] | 810 | } else {
|
---|
[c27778] | 811 | DoLog(1) && (Log() << Verbose(1) << "OtherWalker = ListOfLocalAtoms[" << (*Runner)->GetOtherAtom((*iter)->GetTrueFather())->nr << "] is NULL!" << endl);
|
---|
[e138de] | 812 | status = false;
|
---|
| 813 | }
|
---|
| 814 | }
|
---|
| 815 | }
|
---|
| 816 | }
|
---|
| 817 |
|
---|
| 818 | if ((FreeList) && (ListOfLocalAtoms != NULL)) {
|
---|
| 819 | // free the index lookup list
|
---|
[c27778] | 820 | delete[](ListOfLocalAtoms);
|
---|
[e138de] | 821 | }
|
---|
[a67d19] | 822 | DoLog(1) && (Log() << Verbose(1) << "End of FillBondStructureFromReference." << endl);
|
---|
[e138de] | 823 | return status;
|
---|
| 824 | };
|
---|
| 825 |
|
---|
| 826 | /** Fills the root stack for sites to be used as root in fragmentation depending on order or adaptivity criteria
|
---|
| 827 | * Again, as in \sa FillBondStructureFromReference steps recursively through each Leaf in this chain list of molecule's.
|
---|
| 828 | * \param *out output stream for debugging
|
---|
| 829 | * \param *&RootStack stack to be filled
|
---|
| 830 | * \param *AtomMask defines true/false per global Atom::nr to mask in/out each nuclear site
|
---|
| 831 | * \param &FragmentCounter counts through the fragments in this MoleculeLeafClass
|
---|
| 832 | * \return true - stack is non-empty, fragmentation necessary, false - stack is empty, no more sites to update
|
---|
| 833 | */
|
---|
| 834 | bool MoleculeLeafClass::FillRootStackForSubgraphs(KeyStack *&RootStack, bool *AtomMask, int &FragmentCounter)
|
---|
| 835 | {
|
---|
[9879f6] | 836 | atom *Father = NULL;
|
---|
[e138de] | 837 |
|
---|
| 838 | if (RootStack != NULL) {
|
---|
| 839 | // find first root candidates
|
---|
| 840 | if (&(RootStack[FragmentCounter]) != NULL) {
|
---|
| 841 | RootStack[FragmentCounter].clear();
|
---|
[9879f6] | 842 | for(molecule::const_iterator iter = Leaf->begin(); iter != Leaf->end(); ++iter) {
|
---|
| 843 | Father = (*iter)->GetTrueFather();
|
---|
[e138de] | 844 | if (AtomMask[Father->nr]) // apply mask
|
---|
| 845 | #ifdef ADDHYDROGEN
|
---|
[83f176] | 846 | if ((*iter)->getType()->getAtomicNumber() != 1) // skip hydrogen
|
---|
[e138de] | 847 | #endif
|
---|
[9879f6] | 848 | RootStack[FragmentCounter].push_front((*iter)->nr);
|
---|
[e138de] | 849 | }
|
---|
| 850 | if (next != NULL)
|
---|
| 851 | next->FillRootStackForSubgraphs(RootStack, AtomMask, ++FragmentCounter);
|
---|
| 852 | } else {
|
---|
[a67d19] | 853 | DoLog(1) && (Log() << Verbose(1) << "Rootstack[" << FragmentCounter << "] is NULL." << endl);
|
---|
[e138de] | 854 | return false;
|
---|
| 855 | }
|
---|
| 856 | FragmentCounter--;
|
---|
| 857 | return true;
|
---|
| 858 | } else {
|
---|
[a67d19] | 859 | DoLog(1) && (Log() << Verbose(1) << "Rootstack is NULL." << endl);
|
---|
[e138de] | 860 | return false;
|
---|
| 861 | }
|
---|
| 862 | };
|
---|
| 863 |
|
---|
| 864 | /** Fills a lookup list of father's Atom::nr -> atom for each subgraph.
|
---|
| 865 | * \param *out output stream from debugging
|
---|
[c27778] | 866 | * \param **&ListOfLocalAtoms Lookup table for each subgraph and index of each atom in global molecule, may be NULL on start, then it is filled
|
---|
[e138de] | 867 | * \param GlobalAtomCount number of atoms in the complete molecule
|
---|
| 868 | * \param &FreeList true - ***ListOfLocalAtoms is free'd before return, false - it is not
|
---|
[c27778] | 869 | * \return true - success, false - failure (ListOfLocalAtoms != NULL)
|
---|
[e138de] | 870 | */
|
---|
[c27778] | 871 | bool MoleculeLeafClass::FillListOfLocalAtoms(atom **&ListOfLocalAtoms, const int GlobalAtomCount, bool &FreeList)
|
---|
[e138de] | 872 | {
|
---|
| 873 | bool status = true;
|
---|
| 874 |
|
---|
[c27778] | 875 | if (ListOfLocalAtoms == NULL) { // allocate and fill list of this fragment/subgraph
|
---|
| 876 | status = status && Leaf->CreateFatherLookupTable(ListOfLocalAtoms, GlobalAtomCount);
|
---|
[e138de] | 877 | FreeList = FreeList && true;
|
---|
[c27778] | 878 | } else
|
---|
| 879 | return false;
|
---|
[e138de] | 880 |
|
---|
| 881 | return status;
|
---|
| 882 | };
|
---|
| 883 |
|
---|
| 884 | /** The indices per keyset are compared to the respective father's Atom::nr in each subgraph and thus put into \a **&FragmentList.
|
---|
| 885 | * \param *out output stream fro debugging
|
---|
| 886 | * \param *reference reference molecule with the bond structure to be copied
|
---|
| 887 | * \param *KeySetList list with all keysets
|
---|
| 888 | * \param ***ListOfLocalAtoms Lookup table for each subgraph and index of each atom in global molecule, may be NULL on start, then it is filled
|
---|
| 889 | * \param **&FragmentList list to be allocated and returned
|
---|
| 890 | * \param &FragmentCounter counts the fragments as we move along the list
|
---|
| 891 | * \param FreeList true - ***ListOfLocalAtoms is free'd before return, false - it is not
|
---|
| 892 | * \retuen true - success, false - failure
|
---|
| 893 | */
|
---|
| 894 | bool MoleculeLeafClass::AssignKeySetsToFragment(molecule *reference, Graph *KeySetList, atom ***&ListOfLocalAtoms, Graph **&FragmentList, int &FragmentCounter, bool FreeList)
|
---|
| 895 | {
|
---|
| 896 | bool status = true;
|
---|
| 897 | int KeySetCounter = 0;
|
---|
| 898 |
|
---|
[a67d19] | 899 | DoLog(1) && (Log() << Verbose(1) << "Begin of AssignKeySetsToFragment." << endl);
|
---|
[e138de] | 900 | // fill ListOfLocalAtoms if NULL was given
|
---|
[c27778] | 901 | if (!FillListOfLocalAtoms(ListOfLocalAtoms[FragmentCounter], reference->getAtomCount(), FreeList)) {
|
---|
[a67d19] | 902 | DoLog(1) && (Log() << Verbose(1) << "Filling of ListOfLocalAtoms failed." << endl);
|
---|
[e138de] | 903 | return false;
|
---|
| 904 | }
|
---|
| 905 |
|
---|
| 906 | // allocate fragment list
|
---|
| 907 | if (FragmentList == NULL) {
|
---|
| 908 | KeySetCounter = Count();
|
---|
[920c70] | 909 | FragmentList = new Graph*[KeySetCounter];
|
---|
| 910 | for (int i=0;i<KeySetCounter;i++)
|
---|
| 911 | FragmentList[i] = NULL;
|
---|
[e138de] | 912 | KeySetCounter = 0;
|
---|
| 913 | }
|
---|
| 914 |
|
---|
| 915 | if ((KeySetList != NULL) && (KeySetList->size() != 0)) { // if there are some scanned keysets at all
|
---|
| 916 | // assign scanned keysets
|
---|
| 917 | if (FragmentList[FragmentCounter] == NULL)
|
---|
| 918 | FragmentList[FragmentCounter] = new Graph;
|
---|
| 919 | KeySet *TempSet = new KeySet;
|
---|
| 920 | for (Graph::iterator runner = KeySetList->begin(); runner != KeySetList->end(); runner++) { // key sets contain global numbers!
|
---|
| 921 | if (ListOfLocalAtoms[FragmentCounter][reference->FindAtom(*((*runner).first.begin()))->nr] != NULL) {// as we may assume that that bond structure is unchanged, we only test the first key in each set
|
---|
| 922 | // translate keyset to local numbers
|
---|
| 923 | for (KeySet::iterator sprinter = (*runner).first.begin(); sprinter != (*runner).first.end(); sprinter++)
|
---|
| 924 | TempSet->insert(ListOfLocalAtoms[FragmentCounter][reference->FindAtom(*sprinter)->nr]->nr);
|
---|
| 925 | // insert into FragmentList
|
---|
| 926 | FragmentList[FragmentCounter]->insert(GraphPair(*TempSet, pair<int, double> (KeySetCounter++, (*runner).second.second)));
|
---|
| 927 | }
|
---|
| 928 | TempSet->clear();
|
---|
| 929 | }
|
---|
| 930 | delete (TempSet);
|
---|
| 931 | if (KeySetCounter == 0) {// if there are no keysets, delete the list
|
---|
[a67d19] | 932 | DoLog(1) && (Log() << Verbose(1) << "KeySetCounter is zero, deleting FragmentList." << endl);
|
---|
[e138de] | 933 | delete (FragmentList[FragmentCounter]);
|
---|
| 934 | } else
|
---|
[a67d19] | 935 | DoLog(1) && (Log() << Verbose(1) << KeySetCounter << " keysets were assigned to subgraph " << FragmentCounter << "." << endl);
|
---|
[e138de] | 936 | FragmentCounter++;
|
---|
| 937 | if (next != NULL)
|
---|
| 938 | next->AssignKeySetsToFragment(reference, KeySetList, ListOfLocalAtoms, FragmentList, FragmentCounter, FreeList);
|
---|
| 939 | FragmentCounter--;
|
---|
| 940 | } else
|
---|
[a67d19] | 941 | DoLog(1) && (Log() << Verbose(1) << "KeySetList is NULL or empty." << endl);
|
---|
[e138de] | 942 |
|
---|
| 943 | if ((FreeList) && (ListOfLocalAtoms != NULL)) {
|
---|
| 944 | // free the index lookup list
|
---|
[920c70] | 945 | delete[](ListOfLocalAtoms[FragmentCounter]);
|
---|
[e138de] | 946 | }
|
---|
[a67d19] | 947 | DoLog(1) && (Log() << Verbose(1) << "End of AssignKeySetsToFragment." << endl);
|
---|
[e138de] | 948 | return status;
|
---|
| 949 | };
|
---|
| 950 |
|
---|
| 951 | /** Translate list into global numbers (i.e. ones that are valid in "this" molecule, not in MolecularWalker->Leaf)
|
---|
| 952 | * \param *out output stream for debugging
|
---|
| 953 | * \param **FragmentList Graph with local numbers per fragment
|
---|
| 954 | * \param &FragmentCounter counts the fragments as we move along the list
|
---|
| 955 | * \param &TotalNumberOfKeySets global key set counter
|
---|
| 956 | * \param &TotalGraph Graph to be filled with global numbers
|
---|
| 957 | */
|
---|
| 958 | void MoleculeLeafClass::TranslateIndicesToGlobalIDs(Graph **FragmentList, int &FragmentCounter, int &TotalNumberOfKeySets, Graph &TotalGraph)
|
---|
| 959 | {
|
---|
[a67d19] | 960 | DoLog(1) && (Log() << Verbose(1) << "Begin of TranslateIndicesToGlobalIDs." << endl);
|
---|
[e138de] | 961 | KeySet *TempSet = new KeySet;
|
---|
| 962 | if (FragmentList[FragmentCounter] != NULL) {
|
---|
| 963 | for (Graph::iterator runner = FragmentList[FragmentCounter]->begin(); runner != FragmentList[FragmentCounter]->end(); runner++) {
|
---|
| 964 | for (KeySet::iterator sprinter = (*runner).first.begin(); sprinter != (*runner).first.end(); sprinter++)
|
---|
| 965 | TempSet->insert((Leaf->FindAtom(*sprinter))->GetTrueFather()->nr);
|
---|
| 966 | TotalGraph.insert(GraphPair(*TempSet, pair<int, double> (TotalNumberOfKeySets++, (*runner).second.second)));
|
---|
| 967 | TempSet->clear();
|
---|
| 968 | }
|
---|
| 969 | delete (TempSet);
|
---|
| 970 | } else {
|
---|
[a67d19] | 971 | DoLog(1) && (Log() << Verbose(1) << "FragmentList is NULL." << endl);
|
---|
[e138de] | 972 | }
|
---|
| 973 | if (next != NULL)
|
---|
| 974 | next->TranslateIndicesToGlobalIDs(FragmentList, ++FragmentCounter, TotalNumberOfKeySets, TotalGraph);
|
---|
| 975 | FragmentCounter--;
|
---|
[a67d19] | 976 | DoLog(1) && (Log() << Verbose(1) << "End of TranslateIndicesToGlobalIDs." << endl);
|
---|
[e138de] | 977 | };
|
---|
| 978 |
|
---|
| 979 | /** Simply counts the number of items in the list, from given MoleculeLeafClass.
|
---|
| 980 | * \return number of items
|
---|
| 981 | */
|
---|
| 982 | int MoleculeLeafClass::Count() const
|
---|
| 983 | {
|
---|
| 984 | if (next != NULL)
|
---|
| 985 | return next->Count() + 1;
|
---|
| 986 | else
|
---|
| 987 | return 1;
|
---|
| 988 | };
|
---|
| 989 |
|
---|