TimedHitCollection.icc

Go to the documentation of this file.

/* -*- C++ -*- */
 
/*
  Copyright (C) 2002-2020 CERN for the benefit of the ATLAS collaboration
*/
 
#include <algorithm>
#include <exception>
template <class HIT>
void
TimedHitCollection<HIT>::insert(const PileUpTimeEventIndex& timeEventIndex,
                                const AtlasHitsVector<HIT>* inputCollection) {
  if (!inputCollection){
    throw("Empty input collection!");
  }
  typename AtlasHitsVector<HIT>::const_iterator i(inputCollection->begin());
  typename AtlasHitsVector<HIT>::const_iterator e(inputCollection->end());
  while (i!=e) m_hits.push_back(TimedHitPtr<HIT>(timeEventIndex.time(), timeEventIndex.index(), &(*i++), timeEventIndex.type() ));
  if (m_sorted) {
    m_sorted=false;
    throw SortedException();
  }
}
 
template <class HIT>
void
TimedHitCollection<HIT>::insert(float evtTime,
                                const AtlasHitsVector<HIT>* inputCollection) {
  if (!inputCollection){
    throw("Empty input collection!");
  }
  typename AtlasHitsVector<HIT>::const_iterator i(inputCollection->begin());
  typename AtlasHitsVector<HIT>::const_iterator e(inputCollection->end());
  while (i!=e) m_hits.push_back(TimedHitPtr<HIT>(evtTime, &(*i++)));
  if (m_sorted) {
    m_sorted=false;
    throw SortedException();
  }
}
 
template <class HIT>
void
TimedHitCollection<HIT>::reserve(unsigned int numberOfHits) {
  m_hits.reserve(numberOfHits);
  return;
}
 
///returns an iterator range with the hits of current detector element
template <class HIT>
bool
TimedHitCollection<HIT>::nextDetectorElement(const_iterator& b, const_iterator& e) {
  if (!m_sorted) sortVector();
  b = m_currentHit;
  while (m_currentHit != m_hits.end() && !(*b < *m_currentHit)) ++m_currentHit;
  e = m_currentHit;
  return (b != e);
}
 
template <class HIT>
void
TimedHitCollection<HIT>::sortVector() {
  std::stable_sort(m_hits.begin(), m_hits.end());
  m_currentHit = m_hits.begin();
  m_sorted=true;
}