Back to home page

sPhenix code displayed by LXR

 
 

    


File indexing completed on 2025-12-16 09:20:35

0001 /**
0002  * @file trackbase/TrkrClusterIterationMap.cc
0003  * @author D. McGlinchey
0004  * @date June 2018
0005  * @brief TrkrClusterIterationMap implementation
0006  */
0007 
0008 #include "TrkrClusterIterationMapv1.h"
0009 
0010 #include <ostream>  // for operator<<, endl, basic_ostream, ostream, basic_o...
0011 
0012 void TrkrClusterIterationMapv1::Reset()
0013 {
0014   m_map.clear();
0015 }
0016 
0017 void TrkrClusterIterationMapv1::identify(std::ostream& os) const
0018 {
0019   os << "-----TrkrClusterIterationMapv1-----" << std::endl;
0020   os << "Number of associations: " << m_map.size() << std::endl;
0021 
0022   for (auto& entry : m_map)
0023   {
0024     // os << "   cluster key: 0x" << std::hex << entry.first << std::dec
0025     os << "   cluster key: " << entry.first << std::dec
0026        << " iteration: " << entry.second << std::endl;
0027   }
0028 
0029   os << "------------------------------" << std::endl;
0030 
0031   return;
0032 }
0033 
0034 void TrkrClusterIterationMapv1::addIteration(TrkrDefs::cluskey ckey, short int iter)
0035 {
0036   m_map.insert(std::make_pair(ckey, iter));
0037 }
0038 
0039 short int TrkrClusterIterationMapv1::getIteration(TrkrDefs::cluskey ckey)
0040 {
0041   Map::iterator iter = m_map.find(ckey);
0042   if (iter != m_map.end())
0043   {
0044     return (*iter).second;
0045   }
0046   else
0047   {
0048     return std::numeric_limits<short int>::min();
0049   }
0050 }
0051 
0052 unsigned int TrkrClusterIterationMapv1::size() const { return m_map.size(); }