lem::FindMatchesAlg Class Reference

#include "/cvmfs/nova-development.opensciencegrid.org/novasoft/releases/N21-01-16/LEM/func/FindMatchesAlg.h"

Public Member Functions
	FindMatchesAlg (const std::string &libDir, bool preload, bool useHeads)
	~FindMatchesAlg ()
std::vector< Match >	FindMatches (const MatchableEvent &trial, unsigned int numMatches, int enrich) const
const Library *	GetLibrary () const

Protected Member Functions
std::vector< Match >	FindMatchesNoHeads (const MatchableEvent &trial, unsigned int numMatches, int enrich) const
std::vector< Match >	FindMatchesHeads (const MatchableEvent &trial, unsigned int numMatches, int enrich) const
int	BestHeadFor (const FlippedPotentials &trialVs, const MatchableEvent &trial, bool &bestFlipEven, bool &bestFlipOdd, double &bestEnergy) const
std::vector< Match >	PackageMatches (const std::multiset< Match > &matches, const MatchableEvent &trial) const

Protected Attributes
Library *	fLib
Heads *	fHeads

Detailed Description

Definition at line 17 of file FindMatchesAlg.h.

Constructor & Destructor Documentation

lem::FindMatchesAlg::FindMatchesAlg	(	const std::string &	libDir,
		bool	preload,
		bool	useHeads
	)

Definition at line 40 of file FindMatchesAlg.cxx.

References ana::assert(), lem::Heads::FromMMap(), and lem::Library::FromMMap().

  {
    fLib = Library::FromMMap(libDir, preload);
    assert(fLib);

    if(useHeads){
      fHeads = Heads::FromMMap(libDir, preload);
      assert(fHeads);
    }
    else{
      fHeads = 0;
    }
  }

lem::FindMatchesAlg::~FindMatchesAlg

(

)

Definition at line 57 of file FindMatchesAlg.cxx.

References PackageMatches().

  {
    delete fLib;
    delete fHeads;
  }

Member Function Documentation

int lem::FindMatchesAlg::BestHeadFor ( const FlippedPotentials &  trialVs, const MatchableEvent &  trial, bool &  bestFlipEven, bool &  bestFlipOdd, double &  bestEnergy  ) const

protected

Definition at line 130 of file FindMatchesAlg.cxx.

References ana::assert(), lem::CalcEnergy(), E, FindMatchesHeads(), and lem::FlippedPotentials::V.

Referenced by GetLibrary().

  {
    int bestHead = -1;
    bestEnergy = FLT_MAX;

    const int nHeads = fHeads->NHeads();
    for(int iHead = 0; iHead < nHeads; ++iHead){
      const MatchableEvent& headEvt = fLib->Event(fHeads->HeadIdx(iHead));

      for(int flipEven: {0, 1}){
        for(int flipOdd: {0, 1}){
          const float E = CalcEnergy(trialVs.V[flipEven][flipOdd], trial,
                                     headEvt);
          if(E < bestEnergy){
            bestEnergy = E;
            bestHead = iHead;
            bestFlipEven = flipEven;
            bestFlipOdd = flipOdd;
          }
        }
      }
    }
    assert(bestHead >= 0);

    return bestHead;
  }

std::vector< Match > lem::FindMatchesAlg::FindMatches	(	const MatchableEvent &	trial,
		unsigned int	numMatches,
		int	enrich
	)		const

Definition at line 83 of file FindMatchesAlg.cxx.

References FindMatchesNoHeads().

Referenced by PackageMatches(), and lem::FindLEMMatches::produce().

  {
    if(fHeads)
      return FindMatchesHeads  (trial, numMatches, enrich);
    else
      return FindMatchesNoHeads(trial, numMatches, enrich);
  }

std::vector< Match > lem::FindMatchesAlg::FindMatchesHeads ( const MatchableEvent &  trial, unsigned int  numMatches, int  enrich  ) const

protected

Definition at line 162 of file FindMatchesAlg.cxx.

References lem::CalcEnergy(), E, lem::SortedMatchList::emplace(), lem::EventSummary::enrich, lem::FillPotential(), MECModelEnuComparisons::i, calib::j, genie::utils::mec::J(), lem::FlippedPotentials::V, and lem::MatchableEvent::weight.

Referenced by BestHeadFor(), and GetLibrary().

  {
    FlippedPotentials trialVs;
    FillPotential(trial, trialVs);

    bool headFlipEven, headFlipOdd;
    double headE;
    const int headIdx = BestHeadFor(trialVs, trial,
                                    headFlipEven, headFlipOdd, headE);
    //    const MatchableEvent& head = fLib->Event(fHeads->HeadIdx(headIdx));

    // Candidates for return, remains sorted
    SortedMatchList Elist(numMatches);

    // This is the quickest ordering of the loops (locality into lib?)
    const unsigned int J = fHeads->HeadSeqsLen();
    for(unsigned int j = 0; j < J; ++j){
      const int i = fHeads->ChildIdxFor(headIdx, j);

      const MatchableEvent& libEvt = fLib->Event(i);

      if(enrich != 2){
        if(libEvt.enrich != bool(enrich)) continue;
      }

      // There's beam nue in the library, but we don't want to match to it
      if(libEvt.weight  == 0) continue;

      const bool flipEven = (fHeads->FlipEvenFor(headIdx, j) ^ headFlipEven);
      const bool flipOdd  = (fHeads->FlipOddFor (headIdx, j) ^ headFlipOdd );

      const float E = CalcEnergy(trialVs.V[flipEven][flipOdd], trial, libEvt);
      Elist.emplace(E, &libEvt, flipEven, flipOdd, j);
    } // end for i/j

    return PackageMatches(Elist, trial);
  }

std::vector< Match > lem::FindMatchesAlg::FindMatchesNoHeads ( const MatchableEvent &  trial, unsigned int  numMatches, int  enrich  ) const

protected

Definition at line 95 of file FindMatchesAlg.cxx.

References lem::CalcEnergy(), E, lem::SortedMatchList::emplace(), lem::EventSummary::enrich, lem::FillPotential(), MECModelEnuComparisons::i, lem::FlippedPotentials::V, and lem::MatchableEvent::weight.

Referenced by FindMatches(), and GetLibrary().

  {
    FlippedPotentials trialVs;
    FillPotential(trial, trialVs);

    // Candidates for return, remains sorted
    SortedMatchList Elist(numMatches);

    // This is the quickest ordering of the loops (locality into lib?)
    const unsigned int I = fLib->NEvents();
    for(unsigned int i = 0; i < I; ++i){
      const MatchableEvent& libEvt = fLib->Event(i);

      if(enrich != 2){
        if(libEvt.enrich != bool(enrich)) continue;
      }

      // There's beam nue in the library, but we don't want to match to it
      if(libEvt.weight  == 0) continue;

      for(int flipEven: {0, 1}){
        for(int flipOdd: {0, 1}){

          const float E = CalcEnergy(trialVs.V[flipEven][flipOdd], trial, libEvt);
          Elist.emplace(E, &libEvt, flipEven, flipOdd, i);
        } // end for flipOdd
      } // end for flipEven
    } // end for i

    return PackageMatches(Elist, trial);
  }

const Library* lem::FindMatchesAlg::GetLibrary ( ) const

inline

Definition at line 27 of file FindMatchesAlg.h.

References BestHeadFor(), FindMatchesHeads(), FindMatchesNoHeads(), fLib, overlay_prestage_def::matches, and PackageMatches().

Referenced by lem::FindLEMMatches::beginRun(), and lem::FindLEMMatches::produce().

{return fLib;}

std::vector< Match > lem::FindMatchesAlg::PackageMatches ( const std::multiset< Match > &  matches, const MatchableEvent &  trial  ) const

protected

Definition at line 65 of file FindMatchesAlg.cxx.

References FindMatches(), lem::FracChargeMatched(), m, runNovaSAM::ret, and lem::MatchableEvent::selfEnergy.

Referenced by GetLibrary(), and ~FindMatchesAlg().

  {
    // Convert back to a vector, and calculate the qfrac variable for surviving
    // matches.
    std::vector<Match> ret;
    ret.reserve(matches.size());
    for(const Match& m: matches){
      ret.push_back(m);
      ret.back().qfrac = FracChargeMatched(trial, *m.evt, m.flipEven, m.flipOdd);
      ret.back().energy /= trial.selfEnergy; // Normalize to approx 0-1
    }

    return ret;
  }

Member Data Documentation

Heads* lem::FindMatchesAlg::fHeads

protected

Definition at line 47 of file FindMatchesAlg.h.

Library* lem::FindMatchesAlg::fLib

protected

Definition at line 46 of file FindMatchesAlg.h.

Referenced by GetLibrary().

---

The documentation for this class was generated from the following files:

• /cvmfs/nova-development.opensciencegrid.org/novasoft/releases/N21-01-16/LEM/func/FindMatchesAlg.h
• /cvmfs/nova-development.opensciencegrid.org/novasoft/releases/N21-01-16/LEM/func/FindMatchesAlg.cxx