Changeset e4048f


Ignore:
Timestamp:
Nov 8, 2012, 1:13:52 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:
e11e23
Parents:
1dd419
git-author:
Frederik Heber <heber@…> (07/27/12 14:11:48)
git-committer:
Frederik Heber <heber@…> (11/08/12 13:13:52)
Message:

Added Histogram::extendMissingBins() to generalize superpositions.

  • extended unit tests on Histogram::operator..=() to also test superposition of both larger and smaller histograms.
  • unit test function superposeOtherHistogram_Test() now checks whether the correct amount of bins have been added instead of thrown AssertFailure.
  • removed asserts in superposeOtherHistogram().
Location:
src/Fragmentation/Histogram
Files:
3 edited

Legend:

Unmodified
Added
Removed
  • src/Fragmentation/Histogram/Histogram.cpp

    r1dd419 re4048f  
    140140}
    141141
     142void Histogram::extendMissingBins(const BinLowerEnd LowerEnd, const BinLowerEnd NextLowerEnd)
     143{
     144  Bins_t::const_iterator loweriter = getLowerEndBin(LowerEnd);
     145  Bins_t::const_iterator upperiter = getHigherEndBin(NextLowerEnd);
     146  if (loweriter == bins.end()) {
     147    // we need bins beneath our first, add them
     148    for(BinLowerEnd offset = getLowerEnd(LowerEnd);
     149        offset < getLowerEnd(NextLowerEnd);
     150        offset += binwidth)
     151      bins.insert( std::make_pair (offset, 0. ) );
     152    LOG(2, "DEBUG: Bins after adding empties before start are " << printBins() << ".");
     153    loweriter = getLowerEndBin(LowerEnd);
     154    ASSERT( loweriter != bins.end(),
     155        "Histogram::extendMissingBins() - still no lower bound after adding empties.");
     156  }
     157  if (upperiter == bins.end()) {
     158    // we need bins after our last, add them
     159    for(BinLowerEnd offset = getLowerEnd(LowerEnd);
     160        offset <= getLowerEnd(NextLowerEnd)+binwidth;
     161        offset += binwidth)
     162      bins.insert( std::make_pair (offset, 0. ) );
     163    LOG(2, "DEBUG: Bins after adding empties after end are " << printBins() << ".");
     164    upperiter = getHigherEndBin(NextLowerEnd);
     165    ASSERT( upperiter != bins.end(),
     166        "Histogram::extendMissingBins() - still no upper bound after adding empties.");
     167  }
     168}
     169
    142170void Histogram::superposeOtherHistogram(const Histogram &other, const double prefactor)
    143171{
    144   // check that other histogram lays within this one
    145   ASSERT( getLowerEndBin(other.bins.begin()->first) != bins.end(),
    146       "Histogram::superposeOtherHistogram() - other histogram's bins start sooner.");
    147   ASSERT( getHigherEndBin((--other.bins.end())->first) != bins.end(),
    148       "Histogram::superposeOtherHistogram() - other histogram's bins end later.");
    149172  // go through each of the other histogram's bins
    150173  Bins_t::const_iterator enditer = --other.bins.end(); // (except internal last one)
     
    156179
    157180    LOG(2, "DEBUG: Current bin is " << bin << ", next bin is " << nextbin << ".");
     181
     182    // Check first whether start or end actually fit into our histogram, if not extend.
     183    extendMissingBins(bin.first, nextbin.first);
     184
    158185    // The bin will in general not fit into one bin in this histogram, but overlap.
    159186    // Hence, we determine the contribution of the bin to each bin in this histogram
     
    161188    Bins_t::const_iterator loweriter = getLowerEndBin(bin.first);
    162189    Bins_t::const_iterator upperiter = getHigherEndBin(nextbin.first);
    163     ASSERT( loweriter != bins.end(),
    164         "Histogram::superposeOtherHistogram() - lower end is invalid.");
    165     ASSERT( upperiter != bins.end(),
    166         "Histogram::superposeOtherHistogram() - higher end is invalid.");
     190
    167191    ASSERT( loweriter->first < upperiter->first,
    168192        "Histogram::superposeOtherHistogram() - the bin range is invalid.");
  • src/Fragmentation/Histogram/Histogram.hpp

    r1dd419 re4048f  
    118118  void superposeOtherHistogram(const Histogram &other, const double prefactor);
    119119
     120  /** Helper function to add missing bins in superposition operation.
     121   *
     122   *  We add here enough bins, initialized to weight zero such that the bin
     123   *  of [LowerEnd, NextLowerEnd) fully fits. Does nothing if the bins are
     124   *  already present.
     125   *
     126   * @param LowerEnd lowerend of the other bin (to superpose)
     127   * @param NextLowerEnd lower end of bin (to superpose) next adjacent to other
     128   */
     129  void extendMissingBins(const BinLowerEnd LowerEnd, const BinLowerEnd NextLowerEnd);
     130
    120131  /** Helper function to print BinLowerEnd and BinWeight to a string for every bin.
    121132   *
  • src/Fragmentation/Histogram/unittests/HistogramUnitTest.cpp

    r1dd419 re4048f  
    234234  more_values += 1.75,2.5,3.;
    235235  Histogram otherhistogram(more_values, 3);
    236 #ifndef NDEBUG
    237   CPPUNIT_ASSERT_THROW ( otherhistogram += *histogram, Assert::AssertionFailure );
    238 #endif
     236
     237  // check that size increases
     238  CPPUNIT_ASSERT_EQUAL( (size_t)3+1, otherhistogram.bins.size() );
     239  otherhistogram += *histogram;
     240  const size_t number = (size_t)((
     241      otherhistogram.getLowerEnd(4.+histogram->binwidth)
     242      + otherhistogram.binwidth
     243      - otherhistogram.getLowerEnd(1.))/otherhistogram.binwidth)+1;
     244  CPPUNIT_ASSERT_EQUAL( number, otherhistogram.bins.size() );
    239245}
    240246
     
    247253  sampled_values += 1.,2.,3.,4.;
    248254  histogram = new Histogram(sampled_values, 4);
    249   Histogram::samples_t more_values;
    250   more_values += 1.75,2.5,3.;
    251   Histogram otherhistogram(more_values, 3);
    252   const double sums = histogram->area() + otherhistogram.area();
    253 
    254   // check that sum is now sum of both
    255   *histogram += otherhistogram;
    256   CPPUNIT_ASSERT( fabs(sums - histogram->area()) < std::numeric_limits<double>::epsilon()*1e+1 );
     255
     256  // add upon larger
     257  {
     258    Histogram::samples_t more_values;
     259    more_values += 0.5, 1.25, 2.5,3., 4.2;
     260    Histogram otherhistogram(more_values, 5);
     261    const double areas = histogram->area() + otherhistogram.area();
     262
     263    // check that sum is now sum of both
     264    otherhistogram += *histogram;
     265//    CPPUNIT_ASSERT_EQUAL( areas, otherhistogram.area() );
     266    CPPUNIT_ASSERT( fabs(areas - otherhistogram.area()) < std::numeric_limits<double>::epsilon()*1e+1 );
     267  }
     268
     269  // add upon smaller
     270  {
     271    Histogram::samples_t more_values;
     272    more_values += 1.75,2.5,3.;
     273    Histogram otherhistogram(more_values, 3);
     274    const double areas = histogram->area() + otherhistogram.area();
     275
     276    // check that sum is now sum of both
     277    otherhistogram += *histogram;
     278//    CPPUNIT_ASSERT_EQUAL( areas, otherhistogram.area() );
     279    CPPUNIT_ASSERT( fabs(areas - otherhistogram.area()) < std::numeric_limits<double>::epsilon()*1e+1 );
     280  }
    257281}
    258282
     
    265289  sampled_values += 1.,2.,3.,4.;
    266290  histogram = new Histogram(sampled_values, 4);
    267   Histogram::samples_t more_values;
    268   more_values += 1.75,2.5,3.;
    269   Histogram otherhistogram(more_values, 3);
    270   const double difference = histogram->area() - otherhistogram.area();
    271 
    272   // check that sum is now difference of both
    273   *histogram -= otherhistogram;
    274   CPPUNIT_ASSERT( fabs(difference - histogram->area()) < std::numeric_limits<double>::epsilon()*1e+1 );
    275 }
    276 
     291
     292  // subtract smaller
     293  {
     294    Histogram::samples_t more_values;
     295    more_values += 1.75,2.5,3.;
     296    Histogram otherhistogram(more_values, 3);
     297    const double difference = otherhistogram.area() - histogram->area();
     298
     299    // check that sum is now difference of both
     300    otherhistogram -= *histogram;
     301//    CPPUNIT_ASSERT_EQUAL( difference, otherhistogram.area() );
     302    CPPUNIT_ASSERT( fabs(difference - otherhistogram.area()) < std::numeric_limits<double>::epsilon()*1e+1 );
     303  }
     304
     305  // subtract larger
     306  {
     307    Histogram::samples_t more_values;
     308    more_values += 0.5, 1.25, 2.5,3., 4.2;
     309    Histogram otherhistogram(more_values, 5);
     310    const double difference = otherhistogram.area() - histogram->area();
     311
     312    // check that sum is now difference of both
     313    otherhistogram -= *histogram;
     314//    CPPUNIT_ASSERT_EQUAL( difference, otherhistogram.area() );
     315    CPPUNIT_ASSERT( fabs(difference - otherhistogram.area()) < std::numeric_limits<double>::epsilon()*1e+1 );
     316  }
     317}
     318
Note: See TracChangeset for help on using the changeset viewer.