Changeset d74077 for src/Actions
- Timestamp:
- Jul 31, 2010, 3:23:10 PM (15 years ago)
- Branches:
- 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
- Children:
- 8f4df1
- Parents:
- 5fbaeb
- Location:
- src/Actions
- Files:
-
- 13 edited
Legend:
- Unmodified
- Added
- Removed
-
src/Actions/AnalysisAction/MolecularVolumeAction.cpp
r5fbaeb rd74077 61 61 LCList = new LinkedCell(mol, 10.); 62 62 config * const configuration = World::getInstance().getConfig(); 63 Boundaries *BoundaryPoints = NULL;64 63 //FindConvexBorder(mol, BoundaryPoints, TesselStruct, LCList, argv[argptr]); 65 64 FindNonConvexBorder(mol, TesselStruct, LCList, 5., NULL); -
src/Actions/AnalysisAction/PairCorrelationAction.cpp
r5fbaeb rd74077 70 70 double BinStart = 0.; 71 71 double BinWidth = 0.; 72 molecule *Boundary = NULL;73 72 string outputname; 74 73 string binoutputname; -
src/Actions/AnalysisAction/PointCorrelationAction.cpp
r5fbaeb rd74077 71 71 double BinStart = 0.; 72 72 double BinWidth = 0.; 73 molecule *Boundary = NULL;74 73 string outputname; 75 74 string binoutputname; -
src/Actions/AnalysisAction/SurfaceCorrelationAction.cpp
r5fbaeb rd74077 111 111 // find biggest molecule 112 112 std::vector<molecule*> molecules = World::getInstance().getSelectedMolecules(); 113 int counter = molecules.size();114 113 LCList = new LinkedCell(Boundary, LCWidth); 115 114 FindNonConvexBorder(Boundary, TesselStruct, LCList, radius, NULL); -
src/Actions/AtomAction/AddAction.cpp
r5fbaeb rd74077 61 61 // execute action 62 62 atom * first = World::getInstance().createAtom(); 63 first-> type = elemental;64 first-> x = position;65 DoLog(1) && (Log() << Verbose(1) << "Adding new atom with element " << first-> type->name << " at " << (first->x) << "." << endl);63 first->setType(elemental); 64 first->setPosition(position); 65 DoLog(1) && (Log() << Verbose(1) << "Adding new atom with element " << first->getType()->name << " at " << (first->getPosition()) << "." << endl); 66 66 // TODO: remove when all of World's atoms are stored. 67 67 std::vector<molecule *> molecules = World::getInstance().getAllMolecules(); -
src/Actions/AtomAction/ChangeElementAction.cpp
r5fbaeb rd74077 57 57 first = iter->second; 58 58 DoLog(1) && (Log() << Verbose(1) << "Changing atom " << *first << " to element " << elemental->symbol << "." << endl); 59 first-> type = elemental;59 first->setType(elemental); 60 60 } 61 61 return Action::success; -
src/Actions/FragmentationAction/SubgraphDissectionAction.cpp
r5fbaeb rd74077 10 10 #include "Actions/FragmentationAction/SubgraphDissectionAction.hpp" 11 11 #include "Actions/ActionRegistry.hpp" 12 #include "Descriptors/MoleculeDescriptor.hpp" 13 12 14 #include "atom.hpp" 15 #include "bond.hpp" 16 #include "bondgraph.hpp" 13 17 #include "config.hpp" 14 18 #include "log.hpp" 15 19 #include "molecule.hpp" 16 #include "Descriptors/MoleculeDescriptor.hpp"17 20 #include "stackclass.hpp" 18 21 #include "World.hpp" … … 53 56 // @TODO rather do the dissection afterwards 54 57 MoleculeListClass *molecules = World::getInstance().getMolecules(); 55 molecules->DissectMoleculeIntoConnectedSubgraphs(World::getInstance().getPeriode(), World::getInstance().getConfig()); 58 config * const configuration = World::getInstance().getConfig(); 59 60 // 0a. remove all present molecules 61 vector<molecule *> allmolecules = World::getInstance().getAllMolecules(); 62 for (vector<molecule *>::iterator MolRunner = allmolecules.begin(); MolRunner != allmolecules.end(); ++MolRunner) { 63 molecules->erase(*MolRunner); 64 World::getInstance().destroyMolecule(*MolRunner); 65 } 66 67 // 0b. remove all bonds and construct a molecule with all atoms 68 molecule *mol = World::getInstance().createMolecule(); 69 vector <atom *> allatoms = World::getInstance().getAllAtoms(); 70 for(vector<atom *>::iterator AtomRunner = allatoms.begin(); AtomRunner != allatoms.end(); ++AtomRunner) { 71 for(BondList::iterator BondRunner = (*AtomRunner)->ListOfBonds.begin(); !(*AtomRunner)->ListOfBonds.empty(); BondRunner = (*AtomRunner)->ListOfBonds.begin()) 72 delete(*BondRunner); 73 mol->AddAtom(*AtomRunner); 74 } 75 76 // 1. create the bond structure of the single molecule 77 if (configuration->BG != NULL) { 78 if (!configuration->BG->ConstructBondGraph(mol)) { 79 World::getInstance().destroyMolecule(mol); 80 DoeLog(1) && (eLog()<< Verbose(1) << "There are no bonds." << endl); 81 return Action::failure; 82 } 83 } else { 84 DoeLog(1) && (eLog()<< Verbose(1) << "There is no BondGraph class present to create bonds." << endl); 85 return Action::failure; 86 } 87 88 // 2. scan for connected subgraphs 89 MoleculeLeafClass *Subgraphs = NULL; // list of subgraphs from DFS analysis 90 class StackClass<bond *> *BackEdgeStack = NULL; 91 Subgraphs = mol->DepthFirstSearchAnalysis(BackEdgeStack); 92 delete(BackEdgeStack); 93 if ((Subgraphs == NULL) || (Subgraphs->next == NULL)) { 94 World::getInstance().destroyMolecule(mol); 95 DoeLog(1) && (eLog()<< Verbose(1) << "There are no atoms." << endl); 96 return Action::failure; 97 } 98 99 // 3. dissect (the following construct is needed to have the atoms not in the order of the DFS, but in 100 // the original one as parsed in) 101 // TODO: Optimize this, when molecules just contain pointer list of global atoms! 102 103 // 4a. create array of molecules to fill 104 const int MolCount = Subgraphs->next->Count(); 105 char number[MAXSTRINGSIZE]; 106 molecule **moleculelist = new molecule *[MolCount]; 107 MoleculeLeafClass *MolecularWalker = Subgraphs; 108 for (int i=0;i<MolCount;i++) { 109 MolecularWalker = MolecularWalker->next; 110 moleculelist[i] = World::getInstance().createMolecule(); 111 moleculelist[i]->ActiveFlag = true; 112 strncpy(moleculelist[i]->name, mol->name, MAXSTRINGSIZE); 113 if (MolCount > 1) { 114 sprintf(number, "-%d", i+1); 115 strncat(moleculelist[i]->name, number, MAXSTRINGSIZE - strlen(mol->name) - 1); 116 } 117 DoLog(1) && (Log() << Verbose(1) << "MolName is " << moleculelist[i]->name << ", id is " << moleculelist[i]->getId() << endl); 118 for (molecule::iterator iter = MolecularWalker->Leaf->begin(); iter != MolecularWalker->Leaf->end(); ++iter) { 119 DoLog(1) && (Log() << Verbose(1) << **iter << endl); 120 } 121 molecules->insert(moleculelist[i]); 122 } 123 124 // 4b. create and fill map of which atom is associated to which connected molecule (note, counting starts at 1) 125 int FragmentCounter = 0; 126 map<int, atom *> AtomToFragmentMap; 127 MolecularWalker = Subgraphs; 128 while (MolecularWalker->next != NULL) { 129 MolecularWalker = MolecularWalker->next; 130 for (molecule::iterator iter = MolecularWalker->Leaf->begin(); !MolecularWalker->Leaf->empty(); iter = MolecularWalker->Leaf->begin()) { 131 atom * Walker = *iter; 132 DoLog(1) && (Log() << Verbose(1) << "Re-linking " << Walker << "..." << endl); 133 MolecularWalker->Leaf->erase(iter); 134 moleculelist[FragmentCounter]->AddAtom(Walker); // counting starts at 1 135 } 136 FragmentCounter++; 137 } 138 // TODO: When DepthFirstSearchAnalysis does not use AddCopyAtom() anymore, we don't need to delete all original atoms. 139 // 4d. destroy the original molecule 140 for (molecule::iterator AtomRunner = mol->begin(); !mol->empty(); AtomRunner = mol->begin()) 141 World::getInstance().destroyAtom(*AtomRunner); 142 World::getInstance().destroyMolecule(mol); 143 144 // 4d. we don't need to redo bonds, as they are connected subgraphs and still maintain their ListOfBonds, but we have to remove them from first..last list 145 // TODO: check whether this is really not needed anymore 146 // 4e. free Leafs 147 MolecularWalker = Subgraphs; 148 while (MolecularWalker->next != NULL) { 149 MolecularWalker = MolecularWalker->next; 150 delete(MolecularWalker->previous); 151 } 152 delete(MolecularWalker); 153 delete[](moleculelist); 154 DoLog(1) && (Log() << Verbose(1) << "I scanned " << FragmentCounter << " molecules." << endl); 155 56 156 return Action::success; 57 157 } -
src/Actions/TesselationAction/ConvexEnvelopeAction.cpp
r5fbaeb rd74077 84 84 DoLog(1) && (Log() << Verbose(1) << "Storing tecplot non-convex data in " << filenameNonConvex << "." << endl); 85 85 LCList = new LinkedCell(mol, 100.); 86 Boundaries *BoundaryPoints = NULL;87 86 //FindConvexBorder(mol, BoundaryPoints, TesselStruct, LCList, argv[argptr]); 88 87 // TODO: Beide Funktionen sollten streams anstelle des Filenamen benutzen, besser fuer unit tests -
src/Actions/WorldAction/AddEmptyBoundaryAction.cpp
r5fbaeb rd74077 60 60 ASSERT(AllAtoms.size() > 0, "There must be atoms present for AddingEmptyBoundary."); 61 61 vector<atom *>::iterator AtomRunner = AllAtoms.begin(); 62 Min = (*AtomRunner)-> x;63 Max = (*AtomRunner)-> x;62 Min = (*AtomRunner)->getPosition(); 63 Max = (*AtomRunner)->getPosition(); 64 64 for (; AtomRunner != AllAtoms.end(); ++AtomRunner) { 65 65 for (int i=0;i<NDIM;i++) { 66 if ((*AtomRunner)-> x[i]> Max[i])67 Max[i] = (*AtomRunner)-> x[i];68 if ((*AtomRunner)-> x[i]< Min[i])69 Min[i] = (*AtomRunner)-> x[i];66 if ((*AtomRunner)->at(i) > Max[i]) 67 Max[i] = (*AtomRunner)->at(i); 68 if ((*AtomRunner)->at(i) < Min[i]) 69 Min[i] = (*AtomRunner)->at(i); 70 70 } 71 71 } … … 84 84 AtomRunner = AllAtoms.begin(); 85 85 for (; AtomRunner != AllAtoms.end(); ++AtomRunner) 86 (*AtomRunner)->x-= Min - boundary;86 *(*AtomRunner) -= Min - boundary; 87 87 return Action::success; 88 88 } -
src/Actions/WorldAction/CenterOnEdgeAction.cpp
r5fbaeb rd74077 55 55 ASSERT(AllAtoms.size() > 0, "For CenteronEdge atoms must be present."); 56 56 vector<atom *>::iterator AtomRunner = AllAtoms.begin(); 57 Min = (*AtomRunner)-> x;58 Max = (*AtomRunner)-> x;57 Min = (*AtomRunner)->getPosition(); 58 Max = (*AtomRunner)->getPosition(); 59 59 for (; AtomRunner != AllAtoms.end(); ++AtomRunner) { 60 60 for (int i=0;i<NDIM;i++) { 61 if ((*AtomRunner)-> x[i]> Max[i])62 Max[i] = (*AtomRunner)-> x[i];63 if ((*AtomRunner)-> x[i]< Min[i])64 Min[i] = (*AtomRunner)-> x[i];61 if ((*AtomRunner)->at(i) > Max[i]) 62 Max[i] = (*AtomRunner)->at(i); 63 if ((*AtomRunner)->at(i) < Min[i]) 64 Min[i] = (*AtomRunner)->at(i); 65 65 } 66 66 } … … 75 75 // translate all atoms, such that Min is aty (0,0,0) 76 76 for (vector<atom*>::iterator AtomRunner = AllAtoms.begin(); AtomRunner != AllAtoms.end(); ++AtomRunner) 77 (*AtomRunner)->x-= Min;77 *(*AtomRunner) -= Min; 78 78 79 79 return Action::success; -
src/Actions/WorldAction/RemoveSphereOfAtomsAction.cpp
r5fbaeb rd74077 12 12 #include "Descriptors/AtomDescriptor.hpp" 13 13 #include "atom.hpp" 14 #include "element.hpp" 14 15 #include "log.hpp" 15 16 #include "molecule.hpp" … … 62 63 vector<molecule *> molecules = World::getInstance().getAllMolecules(); 63 64 for (vector<atom*>::iterator AtomRunner = AllAtoms.begin(); AtomRunner != AllAtoms.end(); ++AtomRunner) { 64 if (point.DistanceSquared((*AtomRunner)->x) > radius*radius) { // distance to first above radius ... 65 if ((*AtomRunner)->DistanceSquared(point) > radius*radius) { // distance to first above radius ... 66 // cout << "Removing " << (*AtomRunner)->getType()->symbol << (*AtomRunner)->getId() << " at " << (*AtomRunner)->getPosition() << " as distance is " << sqrt((*AtomRunner)->DistanceSquared(point)) << endl; 65 67 // TODO: This is not necessary anymore when atoms are completely handled by World (create/destroy and load/save) 66 68 for (vector<molecule *>::iterator iter = molecules.begin();iter != molecules.end();++iter) … … 68 70 World::getInstance().destroyAtom(*AtomRunner); 69 71 } 72 // else { 73 // cout << "Keeping" << (*AtomRunner)->getType()->symbol << (*AtomRunner)->getId() << " at " << (*AtomRunner)->getPosition() << " as distance is " << sqrt((*AtomRunner)->DistanceSquared(point)) << endl; 74 // } 70 75 } 71 76 return Action::success; -
src/Actions/WorldAction/RepeatBoxAction.cpp
r5fbaeb rd74077 21 21 #include <iostream> 22 22 #include <string> 23 #include <vector> 23 24 24 25 using namespace std; … … 90 91 91 92 molecule *newmol = NULL; 92 Vector ** vectors = NULL;93 std::vector<Vector> vectors; 93 94 for (n[0] = 0; n[0] < Repeater[0]; n[0]++) { 94 95 y[0] = n[0]; … … 105 106 if (count != 0) { // if there is more than none 106 107 Elements = new const element *[count]; 107 vectors = new Vector *[count];108 vectors.resize(count); 108 109 j = 0; 109 110 for(molecule::iterator AtomRunner = mol->begin(); AtomRunner != mol->end(); ++AtomRunner) { 110 Elements[j] = (*AtomRunner)-> type;111 vectors[j] = &(*AtomRunner)->x;111 Elements[j] = (*AtomRunner)->getType(); 112 vectors[j] = (*AtomRunner)->getPosition(); 112 113 j++; 113 114 } … … 120 121 for (int k=count;k--;) { // go through every atom of the original cell 121 122 Walker = World::getInstance().createAtom(); // create a new body 122 Walker-> x = (*vectors[k]) + x;123 Walker-> type = Elements[k]; // insert original element123 Walker->setPosition((vectors[k]) + x); 124 Walker->setType(Elements[k]); // insert original element 124 125 cout << "new atom is " << *Walker << endl; 125 126 newmol->AddAtom(Walker); // and add to the molecule (which increments ElementsInMolecule, AtomCount, ...) … … 127 128 // free memory 128 129 delete[](Elements); 129 delete[](vectors);130 130 } else { 131 131 DoLog(1) && (Log() << Verbose(1) << "\t ... is empty." << endl); -
src/Actions/WorldAction/ScaleBoxAction.cpp
r5fbaeb rd74077 60 60 vector<atom*> AllAtoms = World::getInstance().getAllAtoms(); 61 61 for(vector<atom*>::iterator AtomRunner = AllAtoms.begin(); AtomRunner != AllAtoms.end(); ++AtomRunner) { 62 (*AtomRunner)-> x.ScaleAll(x);62 (*AtomRunner)->ScaleAll(x); 63 63 } 64 64
Note:
See TracChangeset
for help on using the changeset viewer.