mkfit::CombCandidate Class Reference

#include <TrackStructures.h>

Public Types
using	allocator_type = CcAlloc< TrackCand >
enum	SeedState_e { Dormant = 0, Finding, Finished }
using	trk_cand_vec_type = std::vector< TrackCand, CcAlloc< TrackCand > >

Public Member Functions
int	addHit (const HitOnTrack &hot, float chi2, int prev_idx)
void	beginBkwSearch ()
void	clear ()
	CombCandidate (const allocator_type &alloc)
	CombCandidate (const CombCandidate &o)
	CombCandidate (CombCandidate &&o)
void	compactifyHitStorageForBestCand (bool remove_seed_hits, int backward_fit_min_hits)
trk_cand_vec_type::reference	emplace_back (TrackCand &tc)
bool	empty () const
void	endBkwSearch ()
TrackCand &	front ()
const TrackCand &	front () const
HitOnTrack	hot (int i) const
const HoTNode &	hot_node (int i) const
HoTNode &	hot_node_nc (int i)
const HoTNode *	hotsData () const
int	hotsSize () const
void	importSeed (const Track &seed, int region)
void	mergeCandsAndBestShortOne (const IterationParams &params, bool update_score, bool sort_cands)
CombCandidate &	operator= (CombCandidate &&o)
TrackCand &	operator[] (int i)
const TrackCand &	operator[] (int i) const
int	pickupLayer () const
const TrackCand &	refBestShortCand () const
void	reset (int max_cands_per_seed, int expected_num_hots)
void	resize (trk_cand_vec_type::size_type count)
void	setBestShortCand (const TrackCand &tc)
void	setState (SeedState_e ss)
trk_cand_vec_type::size_type	size () const
SeedState_e	state () const

Private Attributes
TrackCand	m_best_short_cand
std::vector< HoTNode >	m_hots
int	m_hots_size = 0
short int	m_lastHitIdx_before_bkwsearch = -1
short int	m_nInsideMinusOneHits_before_bkwsearch = -1
short int	m_nTailMinusOneHits_before_bkwsearch = -1
int	m_pickup_layer: 16
SeedState_e	m_state: 8
trk_cand_vec_type	m_trk_cands

Detailed Description

Definition at line 273 of file TrackStructures.h.

Member Typedef Documentation

allocator_type

using mkfit::CombCandidate::allocator_type = CcAlloc<TrackCand>

Definition at line 276 of file TrackStructures.h.

trk_cand_vec_type

using mkfit::CombCandidate::trk_cand_vec_type = std::vector<TrackCand, CcAlloc<TrackCand> >

Definition at line 275 of file TrackStructures.h.

Member Enumeration Documentation

SeedState_e

enum mkfit::CombCandidate::SeedState_e

Enumerator
Dormant
Finding
Finished

Definition at line 278 of file TrackStructures.h.

{ Dormant = 0, Finding, Finished };

Constructor & Destructor Documentation

CombCandidate() [1/3]

mkfit::CombCandidate::CombCandidate ( const allocator_type &  alloc )

inline

Definition at line 280 of file TrackStructures.h.

: m_trk_cands(alloc), m_state(Dormant), m_pickup_layer(-1) {}

CombCandidate() [2/3]

mkfit::CombCandidate::CombCandidate ( const CombCandidate &  o )

inline

Definition at line 283 of file TrackStructures.h.

        : m_trk_cands(o.m_trk_cands),
          m_state(o.m_state),
          m_pickup_layer(o.m_pickup_layer),
          m_lastHitIdx_before_bkwsearch(o.m_lastHitIdx_before_bkwsearch),
          m_nInsideMinusOneHits_before_bkwsearch(o.m_nInsideMinusOneHits_before_bkwsearch),
          m_nTailMinusOneHits_before_bkwsearch(o.m_nTailMinusOneHits_before_bkwsearch),
#ifdef DUMPHITWINDOW
          m_seed_algo(o.m_seed_algo),
          m_seed_label(o.m_seed_label),
#endif
          m_hots_size(o.m_hots_size),
          m_hots(o.m_hots) {
    }

CombCandidate() [3/3]

mkfit::CombCandidate::CombCandidate ( CombCandidate &&  o )

inline

Definition at line 299 of file TrackStructures.h.

        : m_trk_cands(std::move(o.m_trk_cands)),
          m_best_short_cand(std::move(o.m_best_short_cand)),
          m_state(o.m_state),
          m_pickup_layer(o.m_pickup_layer),
          m_lastHitIdx_before_bkwsearch(o.m_lastHitIdx_before_bkwsearch),
          m_nInsideMinusOneHits_before_bkwsearch(o.m_nInsideMinusOneHits_before_bkwsearch),
          m_nTailMinusOneHits_before_bkwsearch(o.m_nTailMinusOneHits_before_bkwsearch),
#ifdef DUMPHITWINDOW
          m_seed_algo(o.m_seed_algo),
          m_seed_label(o.m_seed_label),
#endif
          m_hots_size(o.m_hots_size),
          m_hots(std::move(o.m_hots)) {
      // This is not needed as we do EOCC::reset() after EOCCS::resize which
      // calls Reset here and all CombCands get cleared.
      // However, if at some point we start using this for other purposes this needs
      // to be called as well.
      // for (auto &tc : *this) tc.setCombCandidate(this);
    }

Member Function Documentation

addHit()

int mkfit::CombCandidate::addHit ( const HitOnTrack &  hot, float  chi2, int  prev_idx  )

inline

Definition at line 376 of file TrackStructures.h.

References hltPixelTracks_cff::chi2, hot(), m_hots, and m_hots_size.

Referenced by mkfit::TrackCand::addHitIdx().

                                                                {
      m_hots.push_back({hot, chi2, prev_idx});
      return m_hots_size++;
    }

beginBkwSearch()

void mkfit::CombCandidate::beginBkwSearch

(

)

Definition at line 206 of file TrackStructures.cc.

References Dormant, mkfit::TrackCand::lastCcIndex(), m_hots, m_lastHitIdx_before_bkwsearch, m_nInsideMinusOneHits_before_bkwsearch, m_nTailMinusOneHits_before_bkwsearch, m_pickup_layer, m_state, m_trk_cands, mkfit::TrackCand::nInsideMinusOneHits(), mkfit::TrackCand::nTailMinusOneHits(), mkfit::TrackCand::setLastCcIndex(), mkfit::TrackCand::setNInsideMinusOneHits(), and mkfit::TrackCand::setNTailMinusOneHits().

                                     {
    // Assumes compactifyHitStorageForBestCand() has already been called.
    //
    // This is to be called before backward-search to start with a single
    // input candidate for backward combinatorial search.
    //
    // m_state and m_pickup_layer are also set.

    TrackCand &tc = m_trk_cands[0];

    m_state = Dormant;
    m_pickup_layer = m_hots[0].m_hot.layer;
    m_lastHitIdx_before_bkwsearch = tc.lastCcIndex();
    m_nInsideMinusOneHits_before_bkwsearch = tc.nInsideMinusOneHits();
    m_nTailMinusOneHits_before_bkwsearch = tc.nTailMinusOneHits();
    tc.setLastCcIndex(0);
    tc.setNInsideMinusOneHits(0);
    tc.setNTailMinusOneHits(0);
  }

clear()

void mkfit::CombCandidate::clear ( void  )

inline

Definition at line 354 of file TrackStructures.h.

References m_trk_cands.

Referenced by mkfit::CandCloner::processSeedRange().

{ m_trk_cands.clear(); }

compactifyHitStorageForBestCand()

void mkfit::CombCandidate::compactifyHitStorageForBestCand	(	bool	remove_seed_hits,
		int	backward_fit_min_hits
	)

Definition at line 121 of file TrackStructures.cc.

References mkfit::TrackCand::addHitIdx(), cms::cuda::assert(), mkfit::TrackBase::getNSeedHits(), heavyIonCSV_trainingSettings::idx, mkfit::HitOnTrack::index, mkfit::TrackCand::lastCcIndex(), mkfit::HitOnTrack::layer, mkfit::HoTNode::m_chi2, mkfit::HoTNode::m_hot, m_hots, m_hots_size, m_trk_cands, SiStripPI::max, mkfit::TrackCand::nFoundHits(), mkfit::TrackCand::setLastCcIndex(), mkfit::TrackCand::setNFoundHits(), mkfit::TrackCand::setNInsideMinusOneHits(), mkfit::TrackCand::setNMissingHits(), and mkfit::TrackCand::setNTailMinusOneHits().

                                                                                                      {
    // The best candidate is assumed to be in position 0 (after mergeCandsAndBestShortOne
    // mergeCandsAndBestShortOne has been called).
    // Other cands are dropped, their hits are dropped as well.
    // Seed hits are dropped if remove_seed_hits is true.

    /* The following considerations are related to the following implementation:
  minNrOfHitsForRebuild (checked against "nHits - nseed") has a default at 5, except
  1 in initialStep
  4 in tobTec and pixelLess
  https://github.com/cms-sw/cmssw/blob/master/RecoTracker/CkfPattern/plugins/GroupedCkfTrajectoryBuilder.cc#L1015

  NOTE: some of those can be matched hits !!!

  the hit splitting is triggered here: https://github.com/cms-sw/cmssw/blob/master/RecoTracker/CkfPattern/src/CkfTrackCandidateMakerBase.cc#L468
  after the rebuild has already happened: https://github.com/cms-sw/cmssw/blob/master/RecoTracker/CkfPattern/src/CkfTrackCandidateMakerBase.cc#L313
  */

    assert(!m_trk_cands.empty());
    m_trk_cands.resize(1);
    TrackCand &tc = m_trk_cands[0];

    // Do NOT remove any seed hits if fewer than backward_fit_min_hits hits are available.
    if (remove_seed_hits && tc.nFoundHits() <= backward_fit_min_hits) {
      remove_seed_hits = false;
    }

    // Stash HoTNodes at the end of m_hots.
    int stash_end = m_hots.size();
    int stash_pos = stash_end;

    int idx = tc.lastCcIndex();

    if (remove_seed_hits) {
      // Skip invalid hits that would now be at the head of the candidate.
      // Make sure to subtract / recount number of hits:
      // as this is rather involved, just call addHitIdx() repeatedly so counts
      // of holes get updated correctly.
      // Though one should not care super much ... it's only relevant for relative scores
      // and here we are trimming everything down to a single candidate.

      int n_hits_to_pick = std::max(tc.nFoundHits() - tc.getNSeedHits(), backward_fit_min_hits);
      while (n_hits_to_pick > 0) {
        m_hots[--stash_pos] = m_hots[idx];
        if (m_hots[idx].m_hot.index >= 0)
          --n_hits_to_pick;
        idx = m_hots[idx].m_prev_idx;
      }

      m_hots_size = 0;
      m_hots.clear();
      tc.setLastCcIndex(-1);
      tc.setNFoundHits(0);
      tc.setNMissingHits(0);
      tc.setNInsideMinusOneHits(0);
      tc.setNTailMinusOneHits(0);
      while (stash_pos != stash_end && m_hots[stash_pos].m_hot.index < 0)
        ++stash_pos;
      while (stash_pos != stash_end) {
        HoTNode &hn = m_hots[stash_pos];
        tc.addHitIdx(hn.m_hot.index, hn.m_hot.layer, hn.m_chi2);
        ++stash_pos;
      }
    } else {
      while (idx != -1) {
        m_hots[--stash_pos] = m_hots[idx];
        idx = m_hots[idx].m_prev_idx;
      }

      // If we are not removing seed_hits, track is good as it is,
      // just fixup m_hots and t.lastCcIndex.
      int pos = 0;
      while (stash_pos != stash_end) {
        m_hots[pos].m_hot = m_hots[stash_pos].m_hot;
        m_hots[pos].m_chi2 = m_hots[stash_pos].m_chi2;
        m_hots[pos].m_prev_idx = pos - 1;
        ++pos;
        ++stash_pos;
      }
      m_hots.resize(pos);
      m_hots_size = pos;
      tc.setLastCcIndex(pos - 1);
    }
  }

emplace_back()

trk_cand_vec_type::reference mkfit::CombCandidate::emplace_back ( TrackCand &  tc )

inline

Definition at line 353 of file TrackStructures.h.

References m_trk_cands.

Referenced by mkfit::CandCloner::processSeedRange().

{ return m_trk_cands.emplace_back(tc); }

empty()

bool mkfit::CombCandidate::empty ( void  ) const

inline

Definition at line 346 of file TrackStructures.h.

References m_trk_cands.

Referenced by mergeCandsAndBestShortOne().

{ return m_trk_cands.empty(); }

endBkwSearch()

void mkfit::CombCandidate::endBkwSearch

(

)

Definition at line 226 of file TrackStructures.cc.

References mkfit::TrackCand::lastCcIndex(), m_hots, m_lastHitIdx_before_bkwsearch, m_nInsideMinusOneHits_before_bkwsearch, m_nTailMinusOneHits_before_bkwsearch, m_trk_cands, mkfit::TrackCand::nInsideMinusOneHits(), mkfit::TrackCand::nTailMinusOneHits(), mkfit::TrackCand::setLastCcIndex(), mkfit::TrackCand::setNInsideMinusOneHits(), and mkfit::TrackCand::setNTailMinusOneHits().

                                   {
    // mergeCandsAndBestShortOne() has already been called (from MkBuilder::FindXxx()).
    // We have to fixup the best candidate.

    TrackCand &tc = m_trk_cands[0];

    int curr_idx = tc.lastCcIndex();
    if (curr_idx != 0) {
      int last_idx = -1, prev_idx;
      do {
        prev_idx = m_hots[curr_idx].m_prev_idx;

        m_hots[curr_idx].m_prev_idx = last_idx;

        last_idx = curr_idx;
        curr_idx = prev_idx;
      } while (prev_idx != -1);
    }

    tc.setLastCcIndex(m_lastHitIdx_before_bkwsearch);
    tc.setNInsideMinusOneHits(m_nInsideMinusOneHits_before_bkwsearch + tc.nInsideMinusOneHits());
    tc.setNTailMinusOneHits(m_nTailMinusOneHits_before_bkwsearch + tc.nTailMinusOneHits());
    m_lastHitIdx_before_bkwsearch = -1;
    m_nInsideMinusOneHits_before_bkwsearch = -1;
    m_nTailMinusOneHits_before_bkwsearch = -1;
  }

front() [1/2]

TrackCand& mkfit::CombCandidate::front ( )

inline

Definition at line 351 of file TrackStructures.h.

References m_trk_cands.

{ return m_trk_cands.front(); }

front() [2/2]

const TrackCand& mkfit::CombCandidate::front ( ) const

inline

Definition at line 352 of file TrackStructures.h.

References m_trk_cands.

{ return m_trk_cands.front(); }

hot()

HitOnTrack mkfit::CombCandidate::hot ( int  i ) const

inline

Definition at line 392 of file TrackStructures.h.

References mps_fire::i, and m_hots.

Referenced by addHit(), mkfit::MkFinder::findCandidatesCloneEngine(), mkfit::TrackCand::getLastHitIdx(), mkfit::TrackCand::getLastHitLyr(), and mkfit::TrackCand::getLastHitOnTrack().

{ return m_hots[i].m_hot; }

hot_node()

const HoTNode& mkfit::CombCandidate::hot_node ( int  i ) const

inline

Definition at line 390 of file TrackStructures.h.

References mps_fire::i, and m_hots.

Referenced by mkfit::TrackCand::exportTrack(), mkfit::TrackCand::getLastFoundHitLyr(), mkfit::TrackCand::getLastFoundPixelHitLyr(), mkfit::TrackCand::nHitsByTypeEncoded(), mkfit::TrackCand::nLayersByTypeEncoded(), mkfit::TrackCand::nUniqueLayers(), and mkfit::TrackCand::refLastHoTNode().

{ return m_hots[i]; }

hot_node_nc()

HoTNode& mkfit::CombCandidate::hot_node_nc ( int  i )

inline

Definition at line 391 of file TrackStructures.h.

References mps_fire::i, and m_hots.

Referenced by mkfit::TrackCand::refLastHoTNode().

{ return m_hots[i]; }

hotsData()

const HoTNode* mkfit::CombCandidate::hotsData ( ) const

inline

Definition at line 394 of file TrackStructures.h.

References m_hots.

Referenced by mkfit::MkFinder::bkFitInputTracks().

{ return m_hots.data(); }

hotsSize()

int mkfit::CombCandidate::hotsSize ( ) const

inline

Definition at line 389 of file TrackStructures.h.

References m_hots_size.

{ return m_hots_size; }

importSeed()

void mkfit::CombCandidate::importSeed	(	const Track &	seed,
		int	region
	)

Definition at line 53 of file TrackStructures.cc.

References Dormant, dprintf, mkfit::getScoreCand(), trackingPlots::hp, m_pickup_layer, m_state, m_trk_cands, HLT_2022v12_cff::region, fileCollector::seed, and HLT_2022v12_cff::TrackCand.

                                                              {
    m_trk_cands.emplace_back(TrackCand(seed, this));

    m_state = CombCandidate::Dormant;
    m_pickup_layer = seed.getLastHitLyr();
#ifdef DUMPHITWINDOW
    m_seed_algo = seed.algoint();
    m_seed_label = seed.label();
#endif

    TrackCand &cand = m_trk_cands.back();
    cand.setNSeedHits(seed.nTotalHits());
    cand.setEtaRegion(region);

    dprintf("Importing pt=%f eta=%f, lastCcIndex=%d\n", cand.pT(), cand.momEta(), cand.lastCcIndex());

    for (const HitOnTrack *hp = seed.beginHitsOnTrack(); hp != seed.endHitsOnTrack(); ++hp) {
      dprintf(" hit idx=%d lyr=%d\n", hp->index, hp->layer);
      cand.addHitIdx(hp->index, hp->layer, 0.0f);
    }

    cand.setScore(getScoreCand(cand));
  }

mergeCandsAndBestShortOne()

void mkfit::CombCandidate::mergeCandsAndBestShortOne	(	const IterationParams &	params,
		bool	update_score,
		bool	sort_cands
	)

Definition at line 77 of file TrackStructures.cc.

References c, mkfit::TrackCand::combCandidate(), empty(), mkfit::getScoreCand(), m_best_short_cand, m_trk_cands, submitPVValidationJobs::params, mkfit::TrackCand::resetShortTrack(), mkfit::TrackBase::score(), mkfit::TrackBase::setScore(), jetUpdater_cfi::sort, and mkfit::sortByScoreTrackCand().

                                                                                                                 {
    TrackCand *best_short = m_best_short_cand.combCandidate() ? &m_best_short_cand : nullptr;

    if (!empty()) {
      if (update_score) {
        for (auto &c : m_trk_cands)
          c.setScore(getScoreCand(c));
        if (best_short)
          best_short->setScore(getScoreCand(*best_short));
      }
      if (sort_cands) {
        std::sort(m_trk_cands.begin(), m_trk_cands.end(), sortByScoreTrackCand);
      }

      if (best_short && best_short->score() > m_trk_cands.back().score()) {
        auto ci = m_trk_cands.begin();
        while (ci->score() > best_short->score())
          ++ci;

        if ((int)m_trk_cands.size() >= params.maxCandsPerSeed)
          m_trk_cands.pop_back();

          // To print out what has been replaced -- remove when done with short track handling.
#ifdef DEBUG
        if (ci == m_trk_cands.begin()) {
          printf("FindTracksStd -- Replacing best cand (%f) with short one (%f) in final sorting\n",
                 m_trk_cands.front().score(),
                 best_short->score());
        }
#endif

        m_trk_cands.insert(ci, *best_short);
      }

    } else if (best_short) {
      m_trk_cands.push_back(*best_short);
    }

    if (best_short)
      best_short->resetShortTrack();

    // assert(capacity() == (size_t)Config::maxCandsPerSeed);
  }

operator=()

CombCandidate& mkfit::CombCandidate::operator= ( CombCandidate &&  o )

inline

Definition at line 324 of file TrackStructures.h.

References m_best_short_cand, m_hots, m_hots_size, m_lastHitIdx_before_bkwsearch, m_nInsideMinusOneHits_before_bkwsearch, m_nTailMinusOneHits_before_bkwsearch, m_pickup_layer, m_state, m_trk_cands, eostools::move(), and EcalTangentSkim_cfg::o.

                                                {
      m_trk_cands = (std::move(o.m_trk_cands));
      m_best_short_cand = std::move(o.m_best_short_cand);
      m_state = o.m_state;
      m_pickup_layer = o.m_pickup_layer;
      m_lastHitIdx_before_bkwsearch = o.m_lastHitIdx_before_bkwsearch;
      m_nInsideMinusOneHits_before_bkwsearch = o.m_nInsideMinusOneHits_before_bkwsearch;
      m_nTailMinusOneHits_before_bkwsearch = o.m_nTailMinusOneHits_before_bkwsearch;
#ifdef DUMPHITWINDOW
      m_seed_algo = o.m_seed_algo;
      m_seed_label = o.m_seed_label;
#endif
      m_hots_size = o.m_hots_size;
      m_hots = std::move(o.m_hots);

      for (auto& tc : m_trk_cands)
        tc.setCombCandidate(this);

      return *this;
    }

operator[]() [1/2]

TrackCand& mkfit::CombCandidate::operator[] ( int  i )

inline

Definition at line 349 of file TrackStructures.h.

References mps_fire::i, and m_trk_cands.

{ return m_trk_cands[i]; }

operator[]() [2/2]

const TrackCand& mkfit::CombCandidate::operator[] ( int  i ) const

inline

Definition at line 350 of file TrackStructures.h.

References mps_fire::i, and m_trk_cands.

{ return m_trk_cands[i]; }

pickupLayer()

int mkfit::CombCandidate::pickupLayer ( ) const

inline

Definition at line 402 of file TrackStructures.h.

References m_pickup_layer.

Referenced by mkfit::MkBuilder::find_tracks_unroll_candidates().

{ return m_pickup_layer; }

refBestShortCand()

const TrackCand& mkfit::CombCandidate::refBestShortCand ( ) const

inline

Definition at line 396 of file TrackStructures.h.

References m_best_short_cand.

Referenced by mkfit::CandCloner::processSeedRange().

{ return m_best_short_cand; }

reset()

void mkfit::CombCandidate::reset ( int  max_cands_per_seed, int  expected_num_hots  )

inline

Definition at line 356 of file TrackStructures.h.

References mkfit::getScoreWorstPossible(), m_best_short_cand, m_hots, m_hots_size, m_trk_cands, mkfit::TrackBase::setScore(), and createJobs::tmp.

                                                              {
      std::vector<TrackCand, CcAlloc<TrackCand>> tmp(m_trk_cands.get_allocator());
      m_trk_cands.swap(tmp);
      m_trk_cands.reserve(max_cands_per_seed);  // we *must* never exceed this

      m_best_short_cand.setScore(getScoreWorstPossible());

      // state and pickup_layer set in importSeed.

      // expected_num_hots is different for CloneEngine and Std, especially as long as we
      // instantiate all candidates before purging them.
      // ce:  N_layer * N_cands ~~ 20 * 6 = 120
      // std: i don't know, maybe double?
      m_hots.reserve(expected_num_hots);
      m_hots_size = 0;
      m_hots.clear();
    }

resize()

void mkfit::CombCandidate::resize ( trk_cand_vec_type::size_type  count )

inline

Definition at line 348 of file TrackStructures.h.

References submitPVResolutionJobs::count, and m_trk_cands.

Referenced by mkfit::CandCloner::processSeedRange().

{ m_trk_cands.resize(count); }

setBestShortCand()

void mkfit::CombCandidate::setBestShortCand ( const TrackCand &  tc )

inline

Definition at line 397 of file TrackStructures.h.

References m_best_short_cand.

Referenced by mkfit::CandCloner::processSeedRange().

{ m_best_short_cand = tc; }

setState()

void mkfit::CombCandidate::setState ( SeedState_e  ss )

inline

Definition at line 400 of file TrackStructures.h.

References m_state, and contentValuesCheck::ss.

Referenced by mkfit::MkBuilder::find_tracks_unroll_candidates().

{ m_state = ss; }

size()

trk_cand_vec_type::size_type mkfit::CombCandidate::size ( void  ) const

inline

Definition at line 347 of file TrackStructures.h.

References m_trk_cands.

Referenced by ntupleDataFormat._Collection::__iter__(), ntupleDataFormat._Collection::__len__(), and mkfit::MkBuilder::find_tracks_unroll_candidates().

{ return m_trk_cands.size(); }

state()

SeedState_e mkfit::CombCandidate::state ( ) const

inline

Definition at line 399 of file TrackStructures.h.

References m_state.

Referenced by mkfit::MkBuilder::find_tracks_unroll_candidates(), and mkfit::CandCloner::processSeedRange().

{ return m_state; }

Member Data Documentation

m_best_short_cand

TrackCand mkfit::CombCandidate::m_best_short_cand

private

Definition at line 411 of file TrackStructures.h.

Referenced by mergeCandsAndBestShortOne(), operator=(), refBestShortCand(), reset(), and setBestShortCand().

m_hots

std::vector<HoTNode> mkfit::CombCandidate::m_hots

private

Definition at line 423 of file TrackStructures.h.

Referenced by addHit(), beginBkwSearch(), compactifyHitStorageForBestCand(), endBkwSearch(), hot(), hot_node(), hot_node_nc(), hotsData(), operator=(), and reset().

m_hots_size

int mkfit::CombCandidate::m_hots_size = 0

private

Definition at line 422 of file TrackStructures.h.

Referenced by addHit(), compactifyHitStorageForBestCand(), hotsSize(), operator=(), and reset().

m_lastHitIdx_before_bkwsearch

short int mkfit::CombCandidate::m_lastHitIdx_before_bkwsearch = -1

private

Definition at line 414 of file TrackStructures.h.

Referenced by beginBkwSearch(), endBkwSearch(), and operator=().

m_nInsideMinusOneHits_before_bkwsearch

short int mkfit::CombCandidate::m_nInsideMinusOneHits_before_bkwsearch = -1

private

Definition at line 415 of file TrackStructures.h.

Referenced by beginBkwSearch(), endBkwSearch(), and operator=().

m_nTailMinusOneHits_before_bkwsearch

short int mkfit::CombCandidate::m_nTailMinusOneHits_before_bkwsearch = -1

private

Definition at line 416 of file TrackStructures.h.

Referenced by beginBkwSearch(), endBkwSearch(), and operator=().

m_pickup_layer

int mkfit::CombCandidate::m_pickup_layer

private

Definition at line 413 of file TrackStructures.h.

Referenced by beginBkwSearch(), importSeed(), operator=(), and pickupLayer().

m_state

SeedState_e mkfit::CombCandidate::m_state

private

Definition at line 412 of file TrackStructures.h.

Referenced by beginBkwSearch(), importSeed(), operator=(), setState(), and state().

m_trk_cands

trk_cand_vec_type mkfit::CombCandidate::m_trk_cands

private

Definition at line 410 of file TrackStructures.h.

Referenced by beginBkwSearch(), clear(), compactifyHitStorageForBestCand(), emplace_back(), empty(), endBkwSearch(), front(), importSeed(), mergeCandsAndBestShortOne(), operator=(), operator[](), reset(), resize(), and size().