source: src/Actions/FragmentationAction/FragmentationAction.cpp@ 92232f

Action_Thermostats Add_AtomRandomPerturbation Add_FitFragmentPartialChargesAction Add_RotateAroundBondAction Add_SelectAtomByNameAction Added_ParseSaveFragmentResults AddingActions_SaveParseParticleParameters Adding_Graph_to_ChangeBondActions Adding_MD_integration_tests Adding_ParticleName_to_Atom Adding_StructOpt_integration_tests AtomFragments Automaking_mpqc_open AutomationFragmentation_failures Candidate_v1.5.4 Candidate_v1.6.0 Candidate_v1.6.1 ChangeBugEmailaddress ChangingTestPorts ChemicalSpaceEvaluator CombiningParticlePotentialParsing Combining_Subpackages Debian_Package_split Debian_package_split_molecuildergui_only Disabling_MemDebug Docu_Python_wait EmpiricalPotential_contain_HomologyGraph EmpiricalPotential_contain_HomologyGraph_documentation Enable_parallel_make_install Enhance_userguide Enhanced_StructuralOptimization Enhanced_StructuralOptimization_continued Example_ManyWaysToTranslateAtom Exclude_Hydrogens_annealWithBondGraph FitPartialCharges_GlobalError Fix_BoundInBox_CenterInBox_MoleculeActions Fix_ChargeSampling_PBC Fix_ChronosMutex Fix_FitPartialCharges Fix_FitPotential_needs_atomicnumbers Fix_ForceAnnealing Fix_IndependentFragmentGrids Fix_ParseParticles Fix_ParseParticles_split_forward_backward_Actions Fix_PopActions Fix_QtFragmentList_sorted_selection Fix_Restrictedkeyset_FragmentMolecule Fix_StatusMsg Fix_StepWorldTime_single_argument Fix_Verbose_Codepatterns Fix_fitting_potentials Fixes ForceAnnealing_goodresults ForceAnnealing_oldresults ForceAnnealing_tocheck ForceAnnealing_with_BondGraph ForceAnnealing_with_BondGraph_continued ForceAnnealing_with_BondGraph_continued_betteresults ForceAnnealing_with_BondGraph_contraction-expansion FragmentAction_writes_AtomFragments FragmentMolecule_checks_bonddegrees GeometryObjects Gui_Fixes Gui_displays_atomic_force_velocity ImplicitCharges IndependentFragmentGrids IndependentFragmentGrids_IndividualZeroInstances IndependentFragmentGrids_IntegrationTest IndependentFragmentGrids_Sole_NN_Calculation JobMarket_RobustOnKillsSegFaults JobMarket_StableWorkerPool JobMarket_unresolvable_hostname_fix MoreRobust_FragmentAutomation ODR_violation_mpqc_open PartialCharges_OrthogonalSummation PdbParser_setsAtomName PythonUI_with_named_parameters QtGui_reactivate_TimeChanged_changes Recreated_GuiChecks Rewrite_FitPartialCharges RotateToPrincipalAxisSystem_UndoRedo SaturateAtoms_findBestMatching SaturateAtoms_singleDegree StoppableMakroAction Subpackage_CodePatterns Subpackage_JobMarket Subpackage_LinearAlgebra Subpackage_levmar Subpackage_mpqc_open Subpackage_vmg Switchable_LogView ThirdParty_MPQC_rebuilt_buildsystem TrajectoryDependenant_MaxOrder TremoloParser_IncreasedPrecision TremoloParser_MultipleTimesteps TremoloParser_setsAtomName Ubuntu_1604_changes stable
Last change on this file since 92232f was 92232f, checked in by Frederik Heber <heber@…>, 9 years ago

Adding warning when inter-distance is given less then minimum required rcut.

  • Property mode set to 100644
File size: 16.9 KB
Line 
1/*
2 * Project: MoleCuilder
3 * Description: creates and alters molecular systems
4 * Copyright (C) 2010-2012 University of Bonn. All rights reserved.
5 * Copyright (C) 2013 Frederik Heber. All rights reserved.
6 *
7 *
8 * This file is part of MoleCuilder.
9 *
10 * MoleCuilder is free software: you can redistribute it and/or modify
11 * it under the terms of the GNU General Public License as published by
12 * the Free Software Foundation, either version 2 of the License, or
13 * (at your option) any later version.
14 *
15 * MoleCuilder is distributed in the hope that it will be useful,
16 * but WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 * GNU General Public License for more details.
19 *
20 * You should have received a copy of the GNU General Public License
21 * along with MoleCuilder. If not, see <http://www.gnu.org/licenses/>.
22 */
23
24/*
25 * FragmentationAction.cpp
26 *
27 * Created on: May 9, 2010
28 * Author: heber
29 */
30
31// include config.h
32#ifdef HAVE_CONFIG_H
33#include <config.h>
34#endif
35
36#include "CodePatterns/MemDebug.hpp"
37
38#include "Atom/atom.hpp"
39#include "CodePatterns/IteratorAdaptors.hpp"
40#include "CodePatterns/Log.hpp"
41#include "Descriptors/AtomSelectionDescriptor.hpp"
42#include "Descriptors/MoleculeIdDescriptor.hpp"
43#include "Fragmentation/Exporters/ExportGraph_ToFiles.hpp"
44#include "Fragmentation/Exporters/ExportGraph_ToJobs.hpp"
45#include "Fragmentation/Exporters/SaturatedBond.hpp"
46#include "Fragmentation/Exporters/SaturatedFragment.hpp"
47#include "Fragmentation/Exporters/SaturationDistanceMaximizer.hpp"
48#include "Fragmentation/Fragmentation.hpp"
49#include "Fragmentation/Graph.hpp"
50#include "Fragmentation/HydrogenSaturation_enum.hpp"
51#include "Fragmentation/Interfragmenter.hpp"
52#include "Fragmentation/KeySetsContainer.hpp"
53#include "Fragmentation/Summation/Containers/FragmentationResultContainer.hpp"
54#include "Graph/AdjacencyList.hpp"
55#include "Graph/BondGraph.hpp"
56#include "Graph/CyclicStructureAnalysis.hpp"
57#include "Graph/DepthFirstSearchAnalysis.hpp"
58#include "Helpers/defs.hpp"
59#include "molecule.hpp"
60#include "World.hpp"
61
62#include <boost/shared_ptr.hpp>
63#include <boost/filesystem.hpp>
64#include <algorithm>
65#include <iostream>
66#include <map>
67#include <string>
68#include <vector>
69
70#include "Actions/FragmentationAction/FragmentationAction.hpp"
71
72using namespace MoleCuilder;
73
74// and construct the stuff
75#include "FragmentationAction.def"
76#include "Action_impl_pre.hpp"
77/** =========== define the function ====================== */
78ActionState::ptr FragmentationFragmentationAction::performCall() {
79 clock_t start,end;
80 int ExitFlag = -1;
81 World &world = World::getInstance();
82
83 // inform about used parameters
84 LOG(0, "STATUS: Fragmenting molecular system with current connection matrix up to "
85 << params.order.get() << " order. ");
86 if (params.types.get().size() != 0)
87 LOG(0, "STATUS: Fragment files begin with "
88 << params.prefix.get() << " and are stored as: "
89 << params.types.get() << "." << std::endl);
90
91 // check for selected atoms
92 if (world.beginAtomSelection() == world.endAtomSelection()) {
93 STATUS("There are no atoms selected for fragmentation.");
94 return Action::failure;
95 }
96
97 // go through all atoms, note down their molecules and group them
98 typedef std::multimap<const molecule *, atom *> clusters_t;
99 typedef std::vector<atomId_t> atomids_t;
100 atomids_t atomids;
101 clusters_t clusters;
102 for (World::AtomSelectionConstIterator iter = world.beginAtomSelection();
103 iter != world.endAtomSelection(); ++iter) {
104 clusters.insert( std::make_pair(iter->second->getMolecule(), iter->second) );
105 atomids.push_back(iter->second->getId());
106 }
107 {
108 std::vector<const molecule *> molecules;
109 molecules.insert( molecules.end(), MapKeyIterator<clusters_t::const_iterator>(clusters.begin()),
110 MapKeyIterator<clusters_t::const_iterator>(clusters.end()) );
111 molecules.erase( std::unique(molecules.begin(), molecules.end()), molecules.end() );
112 LOG(1, "INFO: There are " << molecules.size() << " molecules to consider.");
113 }
114
115 // parse in Adjacency file
116 boost::shared_ptr<AdjacencyList> FileChecker;
117 boost::filesystem::path filename(params.prefix.get() + std::string(ADJACENCYFILE));
118 if (boost::filesystem::exists(filename) && boost::filesystem::is_regular_file(filename)) {
119 std::ifstream File;
120 File.open(filename.string().c_str(), ios::out);
121 FileChecker.reset(new AdjacencyList(File));
122 File.close();
123 } else {
124 LOG(1, "INFO: Could not open default adjacency file " << filename.string() << ".");
125 FileChecker.reset(new AdjacencyList);
126 }
127
128 // make sure bond degree is correct
129 {
130 BondGraph *BG = World::getInstance().getBondGraph();
131 World::AtomComposite Set = World::getInstance().getAllAtoms(AtomsBySelection());
132 // check whether bond graph is correct
133 if (!BG->checkBondDegree(Set))
134 BG->CorrectBondDegree(Set);
135 else
136 LOG(1, "INFO: Bond degrees all valid, not correcting.");
137 }
138
139 // we parse in the keysets from last time if present
140 Graph StoredGraph;
141 StoredGraph.ParseKeySetFile(params.prefix.get());
142
143 start = clock();
144 // go through all keys (i.e. all molecules)
145 clusters_t::const_iterator advanceiter;
146 Graph TotalGraph;
147 int keysetcounter = 0;
148 for (clusters_t::const_iterator iter = clusters.begin();
149 iter != clusters.end();
150 iter = advanceiter) {
151 // get iterator to past last atom in this molecule
152 const molecule * mol = iter->first;
153 advanceiter = clusters.upper_bound(mol);
154
155 // copy molecule's atoms' ids as parameters to Fragmentation's AtomMask
156 std::vector<atomId_t> mols_atomids;
157 std::transform(iter, advanceiter, std::back_inserter(mols_atomids),
158 boost::bind( &atom::getNr,
159 boost::bind( &clusters_t::value_type::second, _1 ))
160 );
161 LOG(2, "INFO: Fragmenting in molecule " << mol->getName() << " in " << clusters.count(mol)
162 << " atoms, out of " << mol->getAtomCount() << ".");
163 const enum HydrogenTreatment treatment = params.HowtoTreatHydrogen.get() ? ExcludeHydrogen : IncludeHydrogen;
164 molecule * non_const_mol = World::getInstance().getMolecule(MoleculeById(mol->getId()));
165 Fragmentation Fragmenter(non_const_mol, *FileChecker, treatment);
166
167 // perform fragmentation
168 LOG(0, std::endl << " ========== Fragmentation of molecule " << mol->getName() << " ========================= ");
169 {
170 Graph StoredLocalGraph(StoredGraph.getLocalGraph(mol));
171 const int tempFlag = Fragmenter.FragmentMolecule(mols_atomids, params.order.get(), params.prefix.get(), StoredLocalGraph);
172 if ((ExitFlag == 2) && (tempFlag != 2))
173 ExitFlag = tempFlag; // if there is one molecule that needs further fragmentation, it overrides others
174 if (ExitFlag == -1)
175 ExitFlag = tempFlag; // if we are the first, we set the standard
176 }
177 if (TotalGraph.empty()) {
178 TotalGraph = Fragmenter.getGraph();
179 keysetcounter = TotalGraph.size();
180 } else
181 TotalGraph.InsertGraph(Fragmenter.getGraph(), keysetcounter);
182
183 }
184 // add full cycles if desired
185 if (params.DoCyclesFull.get()) {
186 // get the BackEdgeStack from somewhere
187 DepthFirstSearchAnalysis DFS;
188 DFS();
189 std::deque<bond::ptr> BackEdgeStack = DFS.getBackEdgeStack();
190 // then we analyse the cycles and get them
191 CyclicStructureAnalysis CycleAnalysis(params.HowtoTreatHydrogen.get() ? ExcludeHydrogen : IncludeHydrogen);
192 CycleAnalysis(&BackEdgeStack);
193 CyclicStructureAnalysis::cycles_t cycles = CycleAnalysis.getAllCycles();
194 // sort them according to KeySet::operator<()
195 std::sort(cycles.begin(), cycles.end());
196 // store all found cycles to file
197 {
198 boost::filesystem::path filename(params.prefix.get() + std::string(CYCLEKEYSETFILE));
199 std::ofstream File;
200 LOG(1, "INFO: Storing cycle keysets to " << filename.string() << ".");
201 File.open(filename.string().c_str(), ios::out);
202 for (CyclicStructureAnalysis::cycles_t::const_iterator iter = cycles.begin();
203 iter != cycles.end(); ++iter) {
204 for (CyclicStructureAnalysis::cycle_t::const_iterator cycleiter = (*iter).begin();
205 cycleiter != (*iter).end(); ++cycleiter) {
206 File << *cycleiter << "\t";
207 }
208 File << "\n";
209 }
210 File.close();
211 }
212 // ... and to result container
213 {
214 KeySetsContainer cyclekeys;
215 for (CyclicStructureAnalysis::cycles_t::const_iterator iter = cycles.begin();
216 iter != cycles.end(); ++iter) {
217 const CyclicStructureAnalysis::cycle_t &cycle = *iter;
218 const size_t order = cycle.size();
219 KeySetsContainer::IntVector temp_cycle(cycle.begin(), cycle.end());
220 cyclekeys.insert(temp_cycle, order);
221 }
222 FragmentationResultContainer::getInstance().addCycles(cyclekeys);
223 }
224 // Create graph and insert into TotalGraph
225 LOG(0, "STATUS: Adding " << cycles.size() << " cycles.");
226 {
227 Graph CycleGraph;
228 for (CyclicStructureAnalysis::cycles_t::const_iterator iter = cycles.begin();
229 iter != cycles.end(); ++iter) {
230 const CyclicStructureAnalysis::cycle_t &currentcycle = *iter;
231 LOG(2, "INFO: Inserting cycle " << currentcycle << ".");
232#ifndef NDEBUG
233 std::pair< Graph::iterator, bool > inserter =
234#endif
235 CycleGraph.insert( std::make_pair(currentcycle, NumberValuePair(1,1.)) );
236 ASSERT( inserter.second,
237 "FragmentationFragmentationAction::performCall() - keyset "
238 +toString(currentcycle)+" inserted twice into CycleGraph.");
239 }
240 TotalGraph.InsertGraph(CycleGraph, keysetcounter);
241 }
242 }
243
244 LOG(0, "STATUS: There are " << TotalGraph.size() << " fragments.");
245
246 {
247 // remove OrderAtSite file
248 std::string line;
249 std::ofstream file;
250 line = params.prefix.get() + ORDERATSITEFILE;
251 file.open(line.c_str(), std::ofstream::out | std::ofstream::trunc);
252 file << "";
253 file.close();
254 }
255
256 // now add interfragments
257 if (params.InterOrder.get() != 0) {
258 LOG(0, "STATUS: Putting fragments together up to order "
259 << params.InterOrder.get() << " and distance of "
260 << params.distance.get() << ".");
261 const enum HydrogenTreatment treatment =
262 params.HowtoTreatHydrogen.get() ? ExcludeHydrogen : IncludeHydrogen;
263 const double UpperBound = std::max(10., params.distance.get());
264 Interfragmenter fragmenter(TotalGraph);
265
266 // check the largest Rcut that causes no additional inter-fragments
267 const double Min_Rcut =
268 fragmenter.findLargestCutoff(params.InterOrder.get(), UpperBound, treatment);
269
270 // if we smear out electronic charges, warn when non-overlapping criterion does not hold
271 if (params.InterOrder.get() < Min_Rcut)
272 ELOG(2, "Inter-order is too low to cause any additional fragments.");
273
274 // then add fragments
275 fragmenter(params.InterOrder.get(), params.distance.get(), treatment);
276
277 LOG(0, "STATUS: There are now " << TotalGraph.size() << " fragments after interfragmenting.");
278 }
279
280 // store keysets to file
281 {
282 TotalGraph.StoreKeySetFile(params.prefix.get());
283 }
284
285 // create global saturation positions map
286 SaturatedFragment::GlobalSaturationPositions_t globalsaturationpositions;
287 {
288 // go through each atom
289 for (World::AtomSelectionConstIterator iter = world.beginAtomSelection();
290 iter != world.endAtomSelection(); ++iter) {
291 const atom * const _atom = iter->second;
292
293 // skip hydrogens if treated special
294 const enum HydrogenTreatment treatment = params.HowtoTreatHydrogen.get() ? ExcludeHydrogen : IncludeHydrogen;
295 if ((treatment == ExcludeHydrogen) && (_atom->getType()->getAtomicNumber() == 1)) {
296 LOG(4, "DEBUG: Skipping hydrogen atom " << *_atom);
297 continue;
298 }
299
300 // get the valence
301 unsigned int NumberOfPoints = _atom->getElement().getNoValenceOrbitals();
302 LOG(3, "DEBUG: There are " << NumberOfPoints
303 << " places to fill in in total for this atom " << *_atom << ".");
304
305 // check whether there are any bonds with degree larger than 1
306 unsigned int SumOfDegrees = 0;
307 bool PresentHigherBonds = false;
308 const BondList &bondlist = _atom->getListOfBonds();
309 for (BondList::const_iterator bonditer = bondlist.begin();
310 bonditer != bondlist.end(); ++bonditer) {
311 SumOfDegrees += (*bonditer)->getDegree();
312 PresentHigherBonds |= (*bonditer)->getDegree() > 1;
313 }
314
315 // check whether there are alphas to maximize the hydrogens distances
316 SaturationDistanceMaximizer::position_bins_t position_bins;
317 {
318 // gather all bonds and convert to SaturatedBonds
319 SaturationDistanceMaximizer::PositionContainers_t CutBonds;
320 for (BondList::const_iterator bonditer = bondlist.begin();
321 bonditer != bondlist.end(); ++bonditer) {
322 CutBonds.push_back(
323 SaturatedBond::ptr(new SaturatedBond(*(bonditer->get()), *_atom) )
324 );
325 }
326 SaturationDistanceMaximizer maximizer(CutBonds);
327 if (PresentHigherBonds) {
328 // then find best alphas
329 maximizer();
330 } else {
331 // if no higher order bonds, we simply gather the scaled positions
332 }
333 position_bins = maximizer.getAllPositionBins();
334 LOG(4, "DEBUG: Positions for atom " << *_atom << " are " << position_bins);
335 }
336
337 // convert into the desired entry in the map
338 SaturatedFragment::SaturationsPositionsPerNeighbor_t positions_per_neighbor;
339 {
340 BondList::const_iterator bonditer = bondlist.begin();
341 SaturationDistanceMaximizer::position_bins_t::const_iterator biniter =
342 position_bins.begin();
343
344 for (;bonditer != bondlist.end(); ++bonditer, ++biniter) {
345 const atom * const OtherAtom = (*bonditer)->GetOtherAtom(_atom);
346 std::pair<
347 SaturatedFragment::SaturationsPositionsPerNeighbor_t::iterator,
348 bool
349 > inserter;
350 // check whether we treat hydrogen special
351 if ((treatment == ExcludeHydrogen) && (OtherAtom->getType()->getAtomicNumber() == 1)) {
352 // if hydrogen, forget rescaled position and use original one
353 inserter =
354 positions_per_neighbor.insert(
355 std::make_pair(
356 OtherAtom->getId(),
357 SaturatedFragment::SaturationsPositions_t(
358 1, OtherAtom->getPosition() - _atom->getPosition())
359 )
360 );
361 } else {
362 inserter =
363 positions_per_neighbor.insert(
364 std::make_pair(
365 OtherAtom->getId(),
366 SaturatedFragment::SaturationsPositions_t(
367 biniter->begin(),
368 biniter->end())
369 )
370 );
371 }
372 // if already pressent, add to this present list
373 ASSERT (inserter.second,
374 "FragmentationAction::performCall() - other atom "
375 +toString(*OtherAtom)+" already present?");
376 }
377 // bonditer follows nicely
378 ASSERT( biniter == position_bins.end(),
379 "FragmentationAction::performCall() - biniter is out of step, it still points at bond "
380 +toString(*biniter)+".");
381 }
382 // and insert
383 globalsaturationpositions.insert(
384 std::make_pair( _atom->getId(),
385 positions_per_neighbor
386 ));
387 }
388 }
389
390 {
391 const enum HydrogenSaturation saturation = params.DoSaturation.get() ? DoSaturate : DontSaturate;
392 const enum HydrogenTreatment treatment = params.HowtoTreatHydrogen.get() ? ExcludeHydrogen : IncludeHydrogen;
393 if (params.types.get().size() != 0) {
394 // store molecule's fragment to file
395 ExportGraph_ToFiles exporter(TotalGraph, treatment, saturation, globalsaturationpositions);
396 exporter.setPrefix(params.prefix.get());
397 exporter.setOutputTypes(params.types.get());
398 exporter();
399 } else {
400 // store molecule's fragment in FragmentJobQueue
401 ExportGraph_ToJobs exporter(TotalGraph, treatment, saturation, globalsaturationpositions);
402 exporter.setLevel(params.level.get());
403 exporter();
404 }
405 }
406
407 // store Adjacency to file
408 {
409 std::string filename = params.prefix.get() + ADJACENCYFILE;
410 std::ofstream AdjacencyFile;
411 AdjacencyFile.open(filename.c_str(), ios::out);
412 AdjacencyList adjacency(atomids);
413 adjacency.StoreToFile(AdjacencyFile);
414 AdjacencyFile.close();
415 }
416
417 World::getInstance().setExitFlag(ExitFlag);
418 end = clock();
419 LOG(0, "STATUS: Clocks for this operation: " << (end-start) << ", time: " << ((double)(end-start)/CLOCKS_PER_SEC) << "s.");
420
421 return Action::success;
422}
423
424ActionState::ptr FragmentationFragmentationAction::performUndo(ActionState::ptr _state) {
425 return Action::success;
426}
427
428ActionState::ptr FragmentationFragmentationAction::performRedo(ActionState::ptr _state){
429 return Action::success;
430}
431
432bool FragmentationFragmentationAction::canUndo() {
433 return true;
434}
435
436bool FragmentationFragmentationAction::shouldUndo() {
437 return true;
438}
439/** =========== end of function ====================== */
Note: See TracBrowser for help on using the repository browser.