TRT_DriftCircle.icc

Go to the documentation of this file.

/*
  Copyright (C) 2002-2023 CERN for the benefit of the ATLAS collaboration
*/
 
namespace InDet {
 
inline unsigned int
TRT_DriftCircle::getWord() const
{
  return m_word;
}
 
inline int
TRT_DriftCircle::driftTimeBin() const
{
  if (!m_island.isValid()) {
    Island tmpIsland;
    TRT_LoLumRawData::findLargestIsland(m_word, tmpIsland);
    m_island.set(tmpIsland);
  }
  return m_island.ptr()->m_leadingEdge;
}
 
inline int
TRT_DriftCircle::trailingEdge() const
{
  if (!m_island.isValid()) {
    Island tmpIsland;
    TRT_LoLumRawData::findLargestIsland(m_word, tmpIsland);
    m_island.set(tmpIsland);
  }
  return m_island.ptr()->m_trailingEdge;
}
 
inline bool
TRT_DriftCircle::highLevel() const
{
  return TRT_LoLumRawData::highLevel(m_word);
}
 
inline bool
TRT_DriftCircle::firstBinHigh() const
{
  return (m_word & 0x02000000);
}
 
inline bool
TRT_DriftCircle::lastBinHigh() const
{
  return (m_word & 0x1);
}
 
inline double
TRT_DriftCircle::timeOverThreshold() const {
  unsigned int leadingEdge = driftTimeBin();
  unsigned int trailingEdge = this->trailingEdge();
  if (leadingEdge && trailingEdge) {
    return (trailingEdge - leadingEdge + 1) *
           TRT_LoLumRawData::getDriftTimeBinWidth();
  };
  return 0.;
}
 
inline double
TRT_DriftCircle::rawDriftTime() const {
  return (driftTimeBin() + 0.5) * TRT_LoLumRawData::getDriftTimeBinWidth();
}
 
inline bool
TRT_DriftCircle::driftTimeValid() const
{
  return m_word & 0x08000000;
}
 
inline double
TRT_DriftCircle::driftTime(bool& valid) const
{
  valid = driftTimeValid();
  return rawDriftTime();
}
 
inline void
TRT_DriftCircle::setDriftTimeValid(bool valid)
{
  unsigned maskfalse = 0xF7FFFFFF;
  unsigned masktrue = 0x08000000;
  if (valid) {
    m_word |= masktrue;
  } else {
    m_word &= maskfalse;
  }
}
 
 
inline int
TRT_DriftCircle::numberOfHighsBetweenEdges() const
{
  // should return always 0 with the largest island algorithm
  int LE = driftTimeBin();
  int TE = trailingEdge();
  unsigned mask = 0x02000000;
  int nhigh = 0;
  int i;
  for (i = 0; i < 24; ++i) {
    if ((m_word & mask) && i >= LE && i <= TE)
      nhigh++;
    mask >>= 1;
    if (i == 7 || i == 15)
      mask >>= 1;
  }
  return nhigh;
}
 
inline int
TRT_DriftCircle::numberOfLowsBetweenEdges() const
{
  // should return always 0 with the largest island algorithm
  int LE = driftTimeBin();
  int TE = trailingEdge();
  return (TE - LE + 1 - numberOfHighsBetweenEdges());
}
 
inline bool
TRT_DriftCircle::isNoise() const
{
  if (numberOfHighsBetweenEdges() < 3)
    return true;
  if (timeOverThreshold() < 7.)
    return true;
  return false;
}
 
inline Trk::PrepRawDataType
TRT_DriftCircle::prdType() const {
  return Trk::PrepRawDataType::TRT_DriftCircle;
}
 
inline const InDetDD::TRT_BaseElement*
TRT_DriftCircle::detectorElement() const
{
  return m_detEl;
}
 
}