| [98d166] | 1 | /*
 | 
|---|
 | 2 |  * Project: MoleCuilder
 | 
|---|
 | 3 |  * Description: creates and alters molecular systems
 | 
|---|
 | 4 |  * Copyright (C)  2014 Frederik Heber. 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 |  * FitCompoundPotentialAction.cpp
 | 
|---|
 | 25 |  *
 | 
|---|
 | 26 |  *  Created on: Sep 10, 2014
 | 
|---|
 | 27 |  *      Author: heber
 | 
|---|
 | 28 |  */
 | 
|---|
 | 29 | 
 | 
|---|
 | 30 | // include config.h
 | 
|---|
 | 31 | #ifdef HAVE_CONFIG_H
 | 
|---|
 | 32 | #include <config.h>
 | 
|---|
 | 33 | #endif
 | 
|---|
 | 34 | 
 | 
|---|
 | 35 | // needs to come before MemDebug due to placement new
 | 
|---|
 | 36 | #include <boost/archive/text_iarchive.hpp>
 | 
|---|
 | 37 | 
 | 
|---|
 | 38 | #include "CodePatterns/MemDebug.hpp"
 | 
|---|
 | 39 | 
 | 
|---|
 | 40 | #include <algorithm>
 | 
|---|
 | 41 | #include <boost/filesystem.hpp>
 | 
|---|
 | 42 | #include <fstream>
 | 
|---|
 | 43 | 
 | 
|---|
 | 44 | #include "Actions/PotentialAction/FitCompoundPotentialAction.hpp"
 | 
|---|
 | 45 | 
 | 
|---|
 | 46 | #include "CodePatterns/Log.hpp"
 | 
|---|
 | 47 | 
 | 
|---|
 | 48 | #include "Fragmentation/Homology/HomologyContainer.hpp"
 | 
|---|
 | 49 | #include "Fragmentation/Homology/HomologyGraph.hpp"
 | 
|---|
 | 50 | #include "Fragmentation/Summation/SetValues/Fragment.hpp"
 | 
|---|
 | 51 | #include "Potentials/PotentialTrainer.hpp"
 | 
|---|
 | 52 | #include "Potentials/SerializablePotential.hpp"
 | 
|---|
 | 53 | #include "World.hpp"
 | 
|---|
 | 54 | 
 | 
|---|
 | 55 | using namespace MoleCuilder;
 | 
|---|
 | 56 | 
 | 
|---|
 | 57 | // and construct the stuff
 | 
|---|
 | 58 | #include "FitCompoundPotentialAction.def"
 | 
|---|
 | 59 | #include "Action_impl_pre.hpp"
 | 
|---|
 | 60 | /** =========== define the function ====================== */
 | 
|---|
 | 61 | 
 | 
|---|
 | 62 | ActionState::ptr PotentialFitCompoundPotentialAction::performCall() {
 | 
|---|
| [f1eabd] | 63 |   // get homologies container
 | 
|---|
| [98d166] | 64 |   HomologyContainer &homologies = World::getInstance().getHomologies();
 | 
|---|
 | 65 | 
 | 
|---|
 | 66 |   // first we try to look into the HomologyContainer
 | 
|---|
 | 67 |   LOG(1, "INFO: Listing all present homologies ...");
 | 
|---|
 | 68 |   for (HomologyContainer::container_t::const_iterator iter =
 | 
|---|
 | 69 |       homologies.begin(); iter != homologies.end(); ++iter) {
 | 
|---|
 | 70 |     LOG(1, "INFO: graph " << iter->first
 | 
|---|
 | 71 |         << " has Fragment " << iter->second.fragment
 | 
|---|
 | 72 |         << ", associated energy " << iter->second.energy
 | 
|---|
 | 73 |         << ", and sampled grid integral " << iter->second.charge_distribution.integral()
 | 
|---|
 | 74 |         << ".");
 | 
|---|
 | 75 |   }
 | 
|---|
 | 76 | 
 | 
|---|
| [f1eabd] | 77 |   // fragment specifies the homology fragment to use
 | 
|---|
 | 78 |   SerializablePotential::ParticleTypes_t fragmentnumbers =
 | 
|---|
 | 79 |       PotentialTrainer::getNumbersFromElements(params.fragment.get());
 | 
|---|
 | 80 | 
 | 
|---|
| [98d166] | 81 |   // then we ought to pick the right HomologyGraph ...
 | 
|---|
 | 82 |   const HomologyGraph graph =
 | 
|---|
 | 83 |       PotentialTrainer::getFirstGraphwithSpecifiedElements(homologies,fragmentnumbers);
 | 
|---|
 | 84 |   if (graph != HomologyGraph()) {
 | 
|---|
 | 85 |     LOG(1, "First representative graph containing fragment "
 | 
|---|
 | 86 |         << fragmentnumbers << " is " << graph << ".");
 | 
|---|
 | 87 |   } else {
 | 
|---|
 | 88 |     STATUS("Specific fragment "+toString(fragmentnumbers)+" not found in homologies!");
 | 
|---|
 | 89 |     return Action::failure;
 | 
|---|
 | 90 |   }
 | 
|---|
 | 91 | 
 | 
|---|
| [f1eabd] | 92 |   // next we use the set of homologous fragments for training from the present potentials
 | 
|---|
| [98d166] | 93 |   PotentialTrainer trainer;
 | 
|---|
 | 94 |   const bool status = trainer(
 | 
|---|
 | 95 |       homologies,
 | 
|---|
 | 96 |       graph,
 | 
|---|
 | 97 |       params.training_file.get(),
 | 
|---|
 | 98 |       params.threshold.get(),
 | 
|---|
 | 99 |       params.best_of_howmany.get());
 | 
|---|
 | 100 |   if (!status) {
 | 
|---|
 | 101 |     STATUS("No required parameter derivatives for a box constraint minimization known.");
 | 
|---|
 | 102 |     return Action::failure;
 | 
|---|
 | 103 |   }
 | 
|---|
 | 104 | 
 | 
|---|
 | 105 |   return Action::success;
 | 
|---|
 | 106 | }
 | 
|---|
 | 107 | 
 | 
|---|
 | 108 | ActionState::ptr PotentialFitCompoundPotentialAction::performUndo(ActionState::ptr _state) {
 | 
|---|
 | 109 |   return Action::success;
 | 
|---|
 | 110 | }
 | 
|---|
 | 111 | 
 | 
|---|
 | 112 | ActionState::ptr PotentialFitCompoundPotentialAction::performRedo(ActionState::ptr _state){
 | 
|---|
 | 113 |   return Action::success;
 | 
|---|
 | 114 | }
 | 
|---|
 | 115 | 
 | 
|---|
 | 116 | bool PotentialFitCompoundPotentialAction::canUndo() {
 | 
|---|
 | 117 |   return false;
 | 
|---|
 | 118 | }
 | 
|---|
 | 119 | 
 | 
|---|
 | 120 | bool PotentialFitCompoundPotentialAction::shouldUndo() {
 | 
|---|
 | 121 |   return false;
 | 
|---|
 | 122 | }
 | 
|---|
 | 123 | /** =========== end of function ====================== */
 | 
|---|