TileRodIdHash Class Reference

Table to convert ROB ID to fragment hash. More...

#include <TileRodIdHash.h>

Collaboration diagram for TileRodIdHash:

Public Types
typedef int	ID

Public Member Functions
	TileRodIdHash ()
virtual	~TileRodIdHash ()
void	initialize (int offset, int runnum)
	initialize
void	initialize (int offset, const std::vector< ID > &rmod)
	new initialize for the HLT
int	operator() (const ID &id) const
	Convert ID to int.
int	max () const
	return maximum number of IDs
ID	identifier (int i) const
	reverse conversion
int	offset () const
	return offset

Private Attributes
int	m_size
	total number of IDs
std::map< unsigned int, int >	m_lookup
	test beam flag
std::vector< ID >	m_int2id
	reverse look up
int	m_offset

Detailed Description

Table to convert ROB ID to fragment hash.

Author

Alexander Solodkov

Definition at line 19 of file TileRodIdHash.h.

Member Typedef Documentation

ID

typedef int TileRodIdHash::ID

Definition at line 23 of file TileRodIdHash.h.

Constructor & Destructor Documentation

TileRodIdHash()

TileRodIdHash::TileRodIdHash

(

)

Definition at line 15 of file TileRodIdHash.cxx.

  : m_size(0),
    m_offset(0)
{
 
}

~TileRodIdHash()

virtual TileRodIdHash::~TileRodIdHash ( )

inlinevirtual

Definition at line 25 of file TileRodIdHash.h.

{ };

Member Function Documentation

identifier()

TileRodIdHash::ID TileRodIdHash::identifier

(

int

i

)

const

reverse conversion

Definition at line 112 of file TileRodIdHash.cxx.

                                                         {
 
  return m_int2id[index] ; 
 
}

initialize() [1/2]

void TileRodIdHash::initialize	(	int	offset,
		const std::vector< ID > &	rmod )

new initialize for the HLT

Definition at line 87 of file TileRodIdHash.cxx.

                                                                       {
 
//
 
  m_offset = offset;
 
  std::vector<ID>::const_iterator
    it = rmod.begin();
  std::vector<ID>::const_iterator
    it_end = rmod.end() ;
 
  int n = 0;
  for (; it!=it_end;++it) {
    ID id = *it;
    unsigned int i = id;
    m_lookup[i] = n ;
    m_int2id.push_back(id);
    ++n;
  }
 
  m_size = n;
}

initialize() [2/2]

void TileRodIdHash::initialize	(	int	offset,
		int	runnum )

initialize

Definition at line 23 of file TileRodIdHash.cxx.

                                                        {
 
// 
 
  std::vector<ID>  rmod;
  rmod.reserve(256);
  if (runnum>318000) {
        // new frag->ROB mapping since March 2017
        // put 4 drawers in two subsequent RODs
        // odd drawers in odd ROD, even drawers in even ROD
    for(unsigned int i=0x510000;i<=0x51001f;i+=2){
        rmod.push_back(i);
        rmod.push_back(i+1);
        rmod.push_back(i);
        rmod.push_back(i+1);
    }
    for(unsigned int i=0x520000;i<=0x52001f;i+=2){
        rmod.push_back(i);
        rmod.push_back(i+1);
        rmod.push_back(i);
        rmod.push_back(i+1);
    }
    for(unsigned int i=0x530000;i<=0x53001f;i+=2){
        rmod.push_back(i);
        rmod.push_back(i+1);
        rmod.push_back(i);
        rmod.push_back(i+1);
    }
    for(unsigned int i=0x540000;i<=0x54001f;i+=2){
        rmod.push_back(i);
        rmod.push_back(i+1);
        rmod.push_back(i);
        rmod.push_back(i+1);
    }
  } else {
    for(unsigned int i=0x510000;i<=0x51000f;i++){
        rmod.push_back(i);
        rmod.push_back(i);
        rmod.push_back(i);
        rmod.push_back(i);
    }
    for(unsigned int i=0x520000;i<=0x52000f;i++){
        rmod.push_back(i);
        rmod.push_back(i);
        rmod.push_back(i);
        rmod.push_back(i);
    }
    for(unsigned int i=0x530000;i<=0x53000f;i++){
        rmod.push_back(i);
        rmod.push_back(i);
        rmod.push_back(i);
        rmod.push_back(i);
    }
    for(unsigned int i=0x540000;i<=0x54000f;i++){
        rmod.push_back(i);
        rmod.push_back(i);
        rmod.push_back(i);
        rmod.push_back(i);
    }
  }
  
  initialize(offset,rmod);
}

max()

int TileRodIdHash::max

(

)

const

return maximum number of IDs

Definition at line 129 of file TileRodIdHash.cxx.

                             {
 
return m_size; 
 
}

offset()

int TileRodIdHash::offset

(

)

const

return offset

Definition at line 135 of file TileRodIdHash.cxx.

                                {
 
return m_offset; 
 
}

operator()()

int TileRodIdHash::operator()

(

const ID &

id

)

const

Convert ID to int.

Definition at line 118 of file TileRodIdHash.cxx.

                                                 {
 
  unsigned int i = id  ; 
  std::map<unsigned int, int> ::const_iterator it= m_lookup.find(i); 
  if(it!=m_lookup.end()) return (*it).second; 
  std::cout <<" ERROR in TileRodIdHash :  invalid Rod number"
        <<std::endl;
  return -1; 
 
}

Member Data Documentation

m_int2id

std::vector<ID> TileRodIdHash::m_int2id

private

reverse look up

Definition at line 54 of file TileRodIdHash.h.

m_lookup

std::map<unsigned int, int> TileRodIdHash::m_lookup

private

test beam flag

Definition at line 51 of file TileRodIdHash.h.

m_offset

int TileRodIdHash::m_offset

private

Definition at line 56 of file TileRodIdHash.h.

m_size

int TileRodIdHash::m_size

private

total number of IDs

Definition at line 47 of file TileRodIdHash.h.

---

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

• TileRodIdHash.h
• TileRodIdHash.cxx