Changeset 372c912 for src


Ignore:
Timestamp:
Dec 14, 2012, 5:39:41 PM (12 years ago)
Author:
Frederik Heber <heber@…>
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:
766767
Parents:
b8f0b25
git-author:
Frederik Heber <heber@…> (09/27/12 16:24:25)
git-committer:
Frederik Heber <heber@…> (12/14/12 17:39:41)
Message:

Extended HomologyGraph to also be constructable from IndexSet reference.

  • we templated logic in getNodesFromSet() and getEdgesFromSet() and have a version for either KeySet (int) or IndexSet (size_t) that instantiates the template accordingly.
  • also extended the stub by two more dummy functions such that we avoid still the clutter of World, atom, ...
Location:
src/Fragmentation/Homology
Files:
4 edited

Legend:

Unmodified
Added
Removed
  • src/Fragmentation/Homology/HomologyGraph.cpp

    rb8f0b25 r372c912  
    4949  nodes(detail::getNodesFromKeySet(keyset)),
    5050  edges(detail::getEdgesFromKeySet(keyset))
     51{}
     52
     53HomologyGraph::HomologyGraph(const IndexSet &index) :
     54  nodes(detail::getNodesFromIndexSet(index)),
     55  edges(detail::getEdgesFromIndexSet(index))
    5156{}
    5257
  • src/Fragmentation/Homology/HomologyGraph.hpp

    rb8f0b25 r372c912  
    2424#include "Fragmentation/Homology/FragmentNode.hpp"
    2525
     26class IndexSet;
    2627class KeySet;
    2728
     
    7273  HomologyGraph(const KeySet &keyset);
    7374
     75  /** Constructor for class HomologyGraph from a IndexSet (i.e. from atoms in the World).
     76   *
     77   * @param index global ids of atoms to pick
     78   */
     79  HomologyGraph(const IndexSet &index);
     80
    7481  /** Destructor for class HomologyGraph.
    7582   *
     
    119126  const HomologyGraph::nodes_t getNodesFromKeySet(const KeySet &keyset);
    120127  const HomologyGraph::edges_t getEdgesFromKeySet(const KeySet &keyset);
     128  const HomologyGraph::nodes_t getNodesFromIndexSet(const IndexSet &keyset);
     129  const HomologyGraph::edges_t getEdgesFromIndexSet(const IndexSet &keyset);
    121130};
    122131
  • src/Fragmentation/Homology/HomologyGraph_getFromKeyset.cpp

    rb8f0b25 r372c912  
    4545#include "Descriptors/AtomIdDescriptor.hpp"
    4646#include "Fragmentation/KeySet.hpp"
     47#include "Fragmentation/Summation/IndexSet.hpp"
    4748#include "World.hpp"
    4849
     
    5152// in all the cludder of World, atom, molecule, and so on ...
    5253
     54template <typename T>
     55const HomologyGraph::nodes_t getNodesFromSet(const std::set<T> &keyset)
     56{
     57  HomologyGraph::nodes_t nodes;
     58  for (typename std::set<T>::const_iterator iter = keyset.begin();
     59      iter != keyset.end(); ++iter) {
     60    const atom *Walker = World::getInstance().getAtom(AtomById(*iter));
     61    if (Walker != NULL) {
     62      const BondList& ListOfBonds = Walker->getListOfBonds();
     63#ifndef NDEBUG
     64    std::pair<HomologyGraph::nodes_t::iterator,bool> inserter =
     65#endif
     66        nodes.insert( FragmentNode(Walker->getElementNo(), ListOfBonds.size()) );
     67    } else {
     68      ELOG(0, "Id " << *iter << " is not associated with any atom.");
     69    }
     70  }
     71  return nodes;
     72}
     73
     74template <typename T>
     75const HomologyGraph::edges_t getEdgesFromSet(const std::set<T> &keyset)
     76{
     77  HomologyGraph::edges_t edges;
     78  for (typename std::set<T>::const_iterator iter = keyset.begin();
     79      iter != keyset.end(); ++iter) {
     80    const atom *Walker = World::getInstance().getAtom(AtomById(*iter));
     81    if (Walker != NULL) {
     82      const BondList& ListOfBonds = Walker->getListOfBonds();
     83      for (BondList::const_iterator bonditer = ListOfBonds.begin();
     84          bonditer != ListOfBonds.end(); ++bonditer) {
     85        const atom *OtherWalker = (*bonditer)->GetOtherAtom(Walker);
     86        if (Walker->getId() < OtherWalker->getId())
     87          edges.insert( FragmentEdge( Walker->getElementNo(), OtherWalker->getElementNo()) );
     88      }
     89    } else {
     90      ELOG(0, "Id " << *iter << " is not associated with any atom.");
     91    }
     92  }
     93  return edges;
     94}
     95
    5396namespace detail {
    54   const HomologyGraph::nodes_t getNodesFromKeySet(const KeySet &keyset)
    55   {
    56     HomologyGraph::nodes_t nodes;
    57     for (KeySet::const_iterator iter = keyset.begin();
    58         iter != keyset.end(); ++iter) {
    59       const atom *Walker = World::getInstance().getAtom(AtomById(*iter));
    60       if (Walker != NULL) {
    61         const BondList& ListOfBonds = Walker->getListOfBonds();
    62   #ifndef NDEBUG
    63       std::pair<HomologyGraph::nodes_t::iterator,bool> inserter =
    64   #endif
    65           nodes.insert( FragmentNode(Walker->getElementNo(), ListOfBonds.size()) );
    66       } else {
    67         ELOG(0, "Id " << *iter << " is not associated with any atom.");
    68       }
    69     }
    70     return nodes;
     97  const HomologyGraph::nodes_t getNodesFromKeySet(const KeySet &keyset) {
     98    return getNodesFromSet<int>(keyset);
    7199  }
    72 
    73   const HomologyGraph::edges_t getEdgesFromKeySet(const KeySet &keyset)
    74   {
    75     HomologyGraph::edges_t edges;
    76     for (KeySet::const_iterator iter = keyset.begin();
    77         iter != keyset.end(); ++iter) {
    78       const atom *Walker = World::getInstance().getAtom(AtomById(*iter));
    79       if (Walker != NULL) {
    80         const BondList& ListOfBonds = Walker->getListOfBonds();
    81         for (BondList::const_iterator bonditer = ListOfBonds.begin();
    82             bonditer != ListOfBonds.begin(); ++iter) {
    83           const atom *OtherWalker = (*bonditer)->GetOtherAtom(Walker);
    84           if (Walker->getId() < OtherWalker->getId())
    85             edges.insert( FragmentEdge( Walker->getElementNo(), OtherWalker->getElementNo()) );
    86         }
    87       } else {
    88         ELOG(0, "Id " << *iter << " is not associated with any atom.");
    89       }
    90     }
    91     return edges;
     100  const HomologyGraph::nodes_t getNodesFromIndexSet(const IndexSet &keyset) {
     101    return getNodesFromSet<size_t>(keyset);
     102  }
     103  const HomologyGraph::edges_t getEdgesFromKeySet(const KeySet &keyset) {
     104    return getEdgesFromSet<int>(keyset);
     105  }
     106  const HomologyGraph::edges_t getEdgesFromIndexSet(const IndexSet &keyset) {
     107    return getEdgesFromSet<size_t>(keyset);
    92108  }
    93109};  /* namespace detail */
  • src/Fragmentation/Homology/unittests/stubs/HomologyGraph_getFromKeysetStub.cpp

    rb8f0b25 r372c912  
    3939#include "Fragmentation/Homology/HomologyGraph.hpp"
    4040#include "Fragmentation/KeySet.hpp"
     41#include "Fragmentation/Summation/IndexSet.hpp"
    4142
    4243namespace detail {
     
    5253  }
    5354
     55  const HomologyGraph::nodes_t getNodesFromIndexSet(const IndexSet &keyset)
     56  {
     57    return HomologyGraph::nodes_t();
     58  }
     59
     60  const HomologyGraph::edges_t getEdgesFromIndexSet(const IndexSet &keyset)
     61  {
     62    return HomologyGraph::edges_t();
     63  }
     64
    5465};  /* namespace detail */
Note: See TracChangeset for help on using the changeset viewer.