HTofLookupSlot
class description - source file - inheritance tree (.pdf)
public:
HTofLookupSlot(Int_t numChannels = 1)
HTofLookupSlot(const HTofLookupSlot&)
~HTofLookupSlot()
static TClass* Class()
void clear()
void fill(Char_t, Int_t, Int_t, Int_t, Int_t, Char_t)
HTofLookupChan* getChannel(Int_t c)
Int_t getMaxSize()
Int_t getSize()
Char_t getType()
virtual TClass* IsA() const
HTofLookupSlot& operator=(const HTofLookupSlot&)
HTofLookupChan& operator[](Int_t i)
virtual void ShowMembers(TMemberInspector& insp, char* parent)
virtual void Streamer(TBuffer& b)
void StreamerNVirtual(TBuffer& b)
protected:
TObjArray* array pointer array containing HTofLookupChan objects
Char_t modType type of digital converter (A=ADC, T=TDC, U=undefined)
Int_t maxChannel actual maximum index of channel
Int_t nChannels maximum number of channels in a slot
HTofLookup
Container class for mapping Crate/TdcAdc/Channel to Module/Paddle
needed by the TOF unpacker
HTofLookupSlot(Int_t nChan)
constructor creates an array of nChan pointers of type HTofLookupChan
~HTofLookupSlot()
destructor
void clear()
sets the module type to 'U' (unknown) and clears the array
void fill(Char_t dcType, Int_t channel,
Int_t sector, Int_t module, Int_t cell, Char_t side)
Sets the module type and fills the HLookupChan objects with index channel
The array is automatically expanded to 32 channels.
Inline Functions
HTofLookupChan& operator[](Int_t i)
HTofLookupChan* getChannel(Int_t c)
Int_t getSize()
Int_t getMaxSize()
Char_t getType()
TClass* Class()
TClass* IsA() const
void ShowMembers(TMemberInspector& insp, char* parent)
void Streamer(TBuffer& b)
void StreamerNVirtual(TBuffer& b)
HTofLookupSlot HTofLookupSlot(const HTofLookupSlot&)
HTofLookupSlot& operator=(const HTofLookupSlot&)
Last update: Fri Jan 26 12:36:24 2007
ROOT page - Class index - Class Hierarchy - Top of the page
This page has been automatically generated. If you have any comments or suggestions about the page layout send a mail to ROOT support, or contact the developers with any questions or problems regarding ROOT.