Changeset 821b07

Timestamp:

Sep 1, 2016, 2:45:48 PM (9 years ago)

Author:

Frederik Heber <heber@…>

Branches:

Gui_Fixes

Children:

0b785a

Parents:

622f71

git-author:

Frederik Heber <heber@…> (09/01/16 14:45:46)

git-committer:

Frederik Heber <heber@…> (09/01/16 14:45:48)

Message:

FIX: PotentialTrainer::getFirstGraphwithSpecifiedElements() did not match graph exactly.

• we just checked for the set of elements to be contained but the given set of elements needs to be matched exactly, e.g. CNH4 contains CH4 but is not what we want.

Location:

src/Potentials

Files:

• PotentialTrainer.cpp (modified) (2 diffs)
• PotentialTrainer.hpp (modified) (1 diff)

src/Potentials/PotentialTrainer.cpp

@@ -192 +192 @@
   ASSERT( !counts_per_charge.empty(),
       "getFirstGraphwithSpecifiedElements() - charge counts are empty?");
-  LOG(2, "DEBUG: counts_per_charge is " << counts_per_charge << ".");
+  LOG(1, "DEBUG: counts_per_charge is " << counts_per_charge << ".");
   // we want to check each (unique) key only once
   HomologyContainer::const_key_iterator olditer = homologies.key_end();
@@ -203 +203 @@
     else
       olditer = iter;
-    // if it's a new key, check if every element has the right number of counts
-    Extractors::elementcounts_t::const_iterator countiter = counts_per_charge.begin();
-    for (; countiter != counts_per_charge.end(); ++countiter)
-      if (!(*iter).hasTimesAtomicNumber(
-          static_cast<size_t>(countiter->first),
-          static_cast<size_t>(countiter->second))
-          )
-        break;
-    if( countiter == counts_per_charge.end())
+    // check whether we have the same set of atomic numbers
+    const HomologyGraph::nodes_t &nodes = (*iter).getNodes();
+    Extractors::elementcounts_t nodes_counts_per_charge;
+    for (HomologyGraph::nodes_t::const_iterator nodeiter = nodes.begin();
+        nodeiter != nodes.end(); ++nodeiter) {
+      const Extractors::element_t elem = nodeiter->first.getAtomicNumber();
+      const std::pair<Extractors::elementcounts_t::iterator, bool> inserter =
+          nodes_counts_per_charge.insert( std::make_pair(elem, (Extractors::count_t)nodeiter->second ) );
+      if (!inserter.second)
+        inserter.first->second += (Extractors::count_t)nodeiter->second;
+    }
+    LOG(1, "DEBUG: Node (" << *iter << ")'s counts_per_charge is " << nodes_counts_per_charge << ".");
+    if (counts_per_charge == nodes_counts_per_charge)
       return *iter;
   }

src/Potentials/PotentialTrainer.hpp

@@ -40 +40 @@
         const unsigned int _best_of_howmany) const;
 
+  /** Get the first matching homologous graph based only on the number of nodes.
+   *
+   * We could directly access the equal_range in the HomologyContainer we if were
+   * specified the full HomologyGraph. However, if we have only get "CH4", then
+   * we lack the bonding structure, hence one half of the graph is missing.
+   *
+   * Therefore, we step through all graphs and get the first to match exactly
+   * with the number of specified element.s
+   *
+   * \param homologies container sorted by homologous fragments/graphs
+   * \param types fragment specification, e.g. "CH4"
+   * \return the first matching HomologyGraph
+   */
   static
   HomologyGraph getFirstGraphwithSpecifiedElements(