Collaboration diagram for TrigGlobalEfficiencyCorrectionTool::ToolKey:

Public Member Functions
bool	operator< (const ToolKey &rhs) const

bool	operator== (const ToolKey &rhs) const

	ToolKey (std::size_t leg, std::size_t tag, unsigned runNumber)

	ToolKey (std::size_t leg, std::size_t tag, std::pair< unsigned, unsigned > bounds)

	ToolKey (std::size_t leg=0, std::size_t tag=0)

Public Attributes
std::size_t	hash

std::pair< unsigned, unsigned >	boundaries

Detailed Description

Definition at line 118 of file TrigGlobalEfficiencyCorrectionTool.h.

Constructor & Destructor Documentation

◆ ToolKey() [1/3]

TrigGlobalEfficiencyCorrectionTool::ToolKey::ToolKey	(	std::size_t	leg,
		std::size_t	tag,
		unsigned	runNumber
	)

inline

Definition at line 131 of file TrigGlobalEfficiencyCorrectionTool.h.

132 : hash(leg ^ tag), boundaries(runNumber, runNumber) {}

◆ ToolKey() [2/3]

TrigGlobalEfficiencyCorrectionTool::ToolKey::ToolKey	(	std::size_t	leg,
		std::size_t	tag,
		std::pair< unsigned, unsigned >	bounds
	)

inline

Definition at line 135 of file TrigGlobalEfficiencyCorrectionTool.h.

137 : hash(leg ^ tag), boundaries(bounds) {}

◆ ToolKey() [3/3]

TrigGlobalEfficiencyCorrectionTool::ToolKey::ToolKey	(	std::size_t	leg = `0`,
		std::size_t	tag = `0`
	)

inline

Definition at line 140 of file TrigGlobalEfficiencyCorrectionTool.h.

141 : hash(leg ^ tag), boundaries(0, 999999) {}

Member Function Documentation

◆ operator<()

bool TrigGlobalEfficiencyCorrectionTool::ToolKey::operator< ( const ToolKey & rhs ) const

inline

Definition at line 121 of file TrigGlobalEfficiencyCorrectionTool.h.

                                              {
       return hash < rhs.hash ||
              (hash == rhs.hash && boundaries.second < rhs.boundaries.first);
     }

◆ operator==()

bool TrigGlobalEfficiencyCorrectionTool::ToolKey::operator== ( const ToolKey & rhs ) const

inline

Definition at line 125 of file TrigGlobalEfficiencyCorrectionTool.h.

                                               {
       return hash == rhs.hash && boundaries.second >= rhs.boundaries.first &&
              rhs.boundaries.second >= boundaries.first;
     }