LArSamples::HistoryIterator Class Reference

storage of the time histories of all the cells More...

#include <HistoryIterator.h>

Collaboration diagram for LArSamples::HistoryIterator:

Public Member Functions
	HistoryIterator (const Interface &interface, unsigned int pos=0, double eMin=-1, double adcMaxMin=-1)
	Constructor More...
virtual	~HistoryIterator ()
const History *	history () const
unsigned int	pos () const
bool	isValid () const
const History *	operator* () const
HistoryIterator *	operator++ ()
const History *	next ()
bool	operator== (unsigned int otherPos) const

Private Attributes
const Interface *	m_interface
unsigned int	m_pos
double	m_eMin
double	m_adcMaxMin

Detailed Description

storage of the time histories of all the cells

Definition at line 20 of file HistoryIterator.h.

Constructor & Destructor Documentation

HistoryIterator()

HistoryIterator::HistoryIterator	(	const Interface &	interface,
		unsigned int	pos = 0,
		double	eMin = -1,
		double	adcMaxMin = -1
	)

Constructor

Definition at line 17 of file HistoryIterator.cxx.

  : m_interface(&interface), m_pos(pos),
    m_eMin(eMin), m_adcMaxMin(adcMaxMin)
{
  if (!isValid()) next();
}

~HistoryIterator()

virtual LArSamples::HistoryIterator::~HistoryIterator ( )

inlinevirtual

Definition at line 27 of file HistoryIterator.h.

{ }

Member Function Documentation

history()

const History * HistoryIterator::history

(

)

const

Definition at line 26 of file HistoryIterator.cxx.

{
 return m_interface->cellHistory(m_pos);
}

isValid()

bool HistoryIterator::isValid

(

)

const

Definition at line 32 of file HistoryIterator.cxx.

{
  if (m_pos >= Definitions::nChannels) return false;
  unsigned int size = m_interface->historySize(m_pos);
  if (size == 0) return false;    
  if (m_eMin < 0 && m_adcMaxMin < 0) return true;
  
  const History* history = m_interface->cellHistory(m_pos);
  bool found = false; 
  for (unsigned int i = 0; i < history->nData(); i++) {
    if (history->data(i)->energy() > m_eMin && history->data(i)->adcMax() > m_adcMaxMin) {
      found = true;
      break;
    }
  }
  return found;
}

next()

const History * HistoryIterator::next

(

)

Definition at line 51 of file HistoryIterator.cxx.

{
  m_pos++;
  
  for (; m_pos < m_interface->end(); m_pos++)
    if (isValid()) break;
   
  return history();
}

operator*()

const History* LArSamples::HistoryIterator::operator* ( ) const

inline

Definition at line 34 of file HistoryIterator.h.

{ return history(); } 

operator++()

HistoryIterator * HistoryIterator::operator++

(

)

Definition at line 62 of file HistoryIterator.cxx.

{
  next();
  return this;
}

operator==()

bool LArSamples::HistoryIterator::operator== ( unsigned int  otherPos ) const

inline

Definition at line 38 of file HistoryIterator.h.

{ return pos() == otherPos; }

pos()

unsigned int LArSamples::HistoryIterator::pos ( ) const

inline

Definition at line 30 of file HistoryIterator.h.

{ return m_pos; }

Member Data Documentation

m_adcMaxMin

double LArSamples::HistoryIterator::m_adcMaxMin

private

Definition at line 45 of file HistoryIterator.h.

m_eMin

double LArSamples::HistoryIterator::m_eMin

private

Definition at line 45 of file HistoryIterator.h.

m_interface

const Interface* LArSamples::HistoryIterator::m_interface

private

Definition at line 42 of file HistoryIterator.h.

m_pos

unsigned int LArSamples::HistoryIterator::m_pos

private

Definition at line 43 of file HistoryIterator.h.

---

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

• HistoryIterator.h
• HistoryIterator.cxx