CaloCellContainer that can accept const cell pointers. More...

#include <CaloConstCellContainer.h>

Inheritance diagram for CaloConstCellContainer:

Collaboration diagram for CaloConstCellContainer:

Public Types
typedef CaloCellContainer::size_type	size_type
	Basic types, forwarded from the base.
typedef CaloCellContainer::difference_type	difference_type
typedef CaloCellContainer::allocator_type	allocator_type
typedef CaloCellContainer::base_value_type	base_value_type
typedef CaloCellContainer::BaseContainer	BaseContainer
typedef CaloCellContainer::DVL_BASE	DVL_BASE
typedef CaloCellContainer::const_iterator	const_iterator
typedef CaloCellContainer::const_reverse_iterator	const_reverse_iterator
typedef DataVector< base_value_type >	base_data_vector
typedef CaloCellContainer::const_value_type	value_type
	These types get modified so that the base's `const_value_type` becomes our `value_type`.
typedef CaloCellContainer::const_value_type	const_value_type
typedef CaloCellContainer::const_value_type &	reference
typedef CaloCellContainer::const_value_type const &	const_reference
typedef CaloCellContainer::const_value_type *	pointer
typedef CaloCellContainer::const_value_type const *	const_pointer
typedef std::unique_ptr< const base_value_type >	unique_type
	Type of a unique_ptr that can be used to insert elements into this container.
typedef DataModel_detail::ElementProxy< ConstDataVector >	ElementProxy
	This type is used to proxy lvalue accesses to `DataVector` elements, in order to handle ownership.
typedef DataModel_detail::iterator< ConstDataVector >	iterator
	The iterator for this type.
typedef std::reverse_iterator< iterator >	reverse_iterator
	Standard `reverse_iterator`.
typedef std::true_type	isSequence

Public Member Functions
	CaloConstCellContainer (SG::OwnershipPolicy ownPolicy=SG::OWN_ELEMENTS)
	Constructor.
::CaloCellContainer::const_iterator	beginConstCalo (CaloCell_ID::SUBCALO caloNum) const
	get const begin iterator on cell of just one calo
::CaloCellContainer::const_iterator	endConstCalo (CaloCell_ID::SUBCALO caloNum) const
	get const begin iterator on cell of just one calo
bool	checkOrderedAndComplete () const
	verify one by one the container is complete (i.e.
void	setIsOrderedAndComplete (bool ordered)
	indicate that the container is complete and in order
bool	isOrderedAndComplete () const
	tell wether container is complete and in order
bool	checkOrdered () const
	verify one by one the container is ordered
void	setIsOrdered (bool ordered)
	indicates that the container is ordered
bool	isOrdered () const
	tell wether container is ordered
bool	hasTotalSize () const
	tell wether container has total hash id size
bool	hasCalo (const CaloCell_ID::SUBCALO caloNum) const
	tell whether it has been filled with cells (maybe none) of a given calo
int	indexFirstCellCalo (const CaloCell_ID::SUBCALO caloNum) const
	index of first cell of given calorimeter (-1 if none).
int	indexLastCellCalo (const CaloCell_ID::SUBCALO caloNum) const
	index of last cell of given calorimeter (-2 if none) Note that it is normally more efficient to use iterators.
int	nCellsCalo (const CaloCell_ID::SUBCALO caloNum) const
	get number of cels of given calorimeter
void	setHasCalo (CaloCell_ID::SUBCALO caloNum)
	set which calo has been filled.
void	updateCaloIterators ()
	fill calo iterators and the index of first and last cell IT IS THE RESPONSABILITY OF THE PRODUCER TO CALL THIS METHOD ONCE THE FILLING IS FINISHED Please use CaloCellContainerFinalizerTool to make sure the container is properly finalised.
void	updateCaloBeginIterators (int ic, int ind)
	fills calo iterators and the index of first cell for a given subcalo
void	updateCaloEndIterators (int ic, int ind)
	fills calo iterators and the index of last cell for a given subcalo
const CaloCell *	findCell (IdentifierHash theHash) const
	fast find method given identifier hash.
int	findIndex (IdentifierHash theHash) const
	Return index of the cell with a given hash.
void	findCellVector (const std::vector< IdentifierHash > &theVectorHash, ::CaloCellContainer::CellVector &theCellVector) const
	fast find method given vector of identifier hash.
void	order ()
	order container
void	push_back_fast (const CaloCell *cell)
	reimplementation of push_back to gain speed in readin
void	push_back_fast (std::unique_ptr< const CaloCell > cell)
	reimplementation of push_back to gain speed in readin (UP version)
void	resetLookUpTable ()
	reset look up table
void	push_back_fast (CaloCell *)
	reimplementation of push_back to gain speed in readin
CaloCell *	findCell (const IdentifierHash theHash)
	fast find method given identifier hash.
void	findCellVector (const std::vector< IdentifierHash > &theVectorHash, CellVector &theCellVector) const
	fast find method given vector of identifier hash.
void	findCellVector (const std::vector< IdentifierHash > &theVectorHash, MutableCellVector &theCellVector)
	fast find method given vector of identifier hash.
Constructors, destructors, assignment.
void	assign (InputIterator first, InputIterator last)
	Assign from iterators.
void	assign (std::initializer_list< value_type > l)
	Assign from an initializer list.
void	assign (const std::vector< ElementLink< CONTAINER > > &v)
	Assign from a vector of ElementLinks.
Element access.
ElementProxy	operator[] (size_type n)
	Access an element, as an lvalue.
ElementProxy	at (size_type n)
	Access an element, as an lvalue.
ElementProxy	front ()
	Access the first element in the collection as an lvalue.
ElementProxy	back ()
	Access the last element in the collection as an lvalue.
Iterator creation.
iterator	begin () noexcept
	Return an `iterator` pointing at the beginning of the collection.
iterator	end () noexcept
	Return an `iterator` pointing past the end of the collection.
reverse_iterator	rbegin () noexcept
	Return a `reverse_iterator` pointing past the end of the collection.
reverse_iterator	rend () noexcept
	Return a `reverse_iterator` pointing at the beginning of the collection.
Insertion operations.
value_type	push_back (value_type pElem)
	Add an element to the end of the collection.
value_type	push_back (std::unique_ptr< const base_value_type > pElem)
	Add an element to the end of the collection.
value_type	emplace_back (value_type pElem)
	Add an element to the end of the collection.
iterator	insert (iterator position, value_type pElem)
	Add a new element to the collection.
void	insert (iterator position, InputIterator first, InputIterator last)
	Add a group of new elements to the collection.
iterator	insert (iterator position, std::unique_ptr< const base_value_type > pElem)
	Add a new element to the collection.
void	insert (iterator position, std::initializer_list< value_type > l)
	Add a group of new elements to the collection.
iterator	emplace (iterator position, value_type pElem)
	Add a new element to the collection.
Erasure operations.
iterator	erase (iterator position)
	Remove element at a given position.
iterator	erase (iterator first, iterator last)
	Remove a range of elements.
void	clear ()
	Erase all the elements in the collection.
Relational operators.
bool	operator< (const ConstDataVector &b) const
	Vector ordering relation.
bool	operator> (const ConstDataVector &b) const
	Based on operator<.
bool	operator<= (const ConstDataVector &b) const
	Based on operator<.
bool	operator>= (const ConstDataVector &b) const
	Based on operator<.
bool	operator== (const ConstDataVector &b) const
	Vector equality comparison.
bool	operator!= (const ConstDataVector &b) const
	Based on operator==.

Static Public Attributes
static const bool	has_virtual
	This needs to be forwarded from the base as well.
static constexpr bool	must_own
	If true, then this type must own its contents.

Private Types
typedef std::vector< const CaloCell * >	CellVector
	type to be used for the internal lookup table, and to return list of cells
typedef std::vector< CaloCell * >	MutableCellVector
	Return from non-const findCellVector.
typedef typename DataVectorBase< CaloCell >::Base	DataVector_BASE
typedef typename DataVectorBase< CaloCell >::Base::PtrVector	PtrVector
	This is the type of the underlying `std::vector` (what `stdcont` returns).
using	Deleter

Private Member Functions
void	setHasTotalSize (bool flag)
	If @ flag is true, then the container size equals the maximum hash.
::CaloCellContainer *	baseContainer ()
	Return a non-const pointer to the base container.
void	push_back (CaloCell *)
	reimplementation of const push_back
CaloCellContainer::iterator	beginCalo (CaloCell_ID::SUBCALO caloNum)
	get non const iterators on cell of just one calo
CaloCellContainer::iterator	endCalo (CaloCell_ID::SUBCALO caloNum)
void	initializeLookUpTable ()
	initialize look up table.
IMessageSvc *	msgSvc () const
	get message service
void	updateCaloIteratorsOrdered (CaloCellContainer::iterator beg, CaloCellContainer::iterator end)
	Recursively find division points between subcalos in the container.
void	orderWhenIncomplete ()
	order when container is incomplete
void	orderWhenComplete ()
	order when container is complete
const CxxUtils::PackedArray &	getLookUpTable () const
	Retrieve an initialized lookup table.
Element access.
Change the vector capacity to match the current size. Note: this does not affect auxiliary data.
const CaloCell *	operator[] (size_type n) const
	Access an element, as an rvalue.
const CaloCell *	at (size_type n) const
	Access an element, as an rvalue.
const CaloCell *	front () const
	Access the first element in the collection as an rvalue.
const CaloCell *	back () const
	Access the last element in the collection as an rvalue.
const CaloCell *	get (size_type n) const
	Access an element, as an rvalue.
Iterator creation.
const_iterator	begin () const noexcept
	Return a `const_iterator` pointing at the beginning of the collection.
const_iterator	end () const noexcept
	Return a `const_iterator` pointing past the end of the collection.
const_reverse_iterator	rbegin () const noexcept
	Return a `const_reverse_iterator` pointing past the end of the collection.
const_reverse_iterator	rend () const noexcept
	Return a `const_reverse_iterator` pointing at the beginning of the collection.
const_iterator	cbegin () const noexcept
	Return a `const_iterator` pointing at the beginning of the collection.
const_iterator	cend () const noexcept
	Return a `const_iterator` pointing past the end of the collection.
const_reverse_iterator	crbegin () const noexcept
	Return a `const_reverse_iterator` pointing past the end of the collection.
const_reverse_iterator	crend () const noexcept
	Return a `const_reverse_iterator` pointing at the beginning of the collection.
Insertion operations.
iterator	insert (iterator position, value_type pElem)
	Add a new element to the collection.
iterator	emplace (iterator position, value_type pElem)
	Add a new element to the collection.
size_type	push_new (size_type n, F alloc)
	Create and add a number of new elements to the end of the container.
void	insertMove (iterator position, DataVector &other)
	Insert the contents of another `DataVector`, with auxiliary data copied via move semantics.
Erasure operations.
iterator	erase (iterator position)
	Remove element at a given position.
void	pop_back ()
	Remove the last element from the collection.
Size and capacity.
size_type	size () const noexcept
	Returns the number of elements in the collection.
void	resize (size_type sz)
	Resizes the collection to the specified number of elements.
void	reserve (size_type n)
	Attempt to preallocate enough memory for a specified number of elements.

Static Private Member Functions
static void	print ()
	dump (obsolete)
template<class CONT, class VECT>
static void	findCellVectorT (CONT &cont, const std::vector< IdentifierHash > &theVectorHash, VECT &theCellVector)
	Look up a group of cells by IdentifierHash.

Private Attributes
CxxUtils::CachedValue< CxxUtils::PackedArray >	m_lookUpTable
	look up table of size HashIdentifiermax.
bool	m_hasTotalSize
	true if size correspond to maximum hash.
bool	m_isOrdered
	true if ordered
bool	m_isOrderedAndComplete
	true if complete and in right order
std::vector< bool >	m_hasCalo
	true if given cell from given calo has been filled (even if none)
std::vector< int >	m_indexFirstCellCalo
	index of first cell of given calo (-1 if none)
std::vector< int >	m_indexLastCellCalo
	index of first cell of given calo (-2 if none)
std::vector< CaloCellContainer::const_iterator >	m_beginConstCalo
	const iterators for the different calorimeters
std::vector< CaloCellContainer::const_iterator >	m_endConstCalo
std::vector< CaloCellContainer::iterator >	m_beginCalo
	non const iterators for the different calorimeters
std::vector< CaloCellContainer::iterator >	m_endCalo

Friends
class	CaloCellContainerFinalizerTool

Non-standard operations.
void	clear (SG::OwnershipPolicy ownPolicy)
	Erase all the elements in the collection, and reset the ownership mode.
void	clear (SG::OwnershipPolicy ownPolicy, SG::IndexTrackingPolicy trackIndices)
void	swapElement (size_type index, value_type newElem, reference oldElem)
	Swap one element out of the container.
void	swapElement (iterator pos, value_type newElem, reference oldElem)
	Swap one element out of the container.
void	swapElement (size_type index, std::unique_ptr< const base_value_type > newElem, std::unique_ptr< const base_value_type > &oldElem)
	Swap one element out of the container.
void	swapElement (iterator pos, std::unique_ptr< const base_value_type > newElem, std::unique_ptr< const base_value_type > &oldElem)
	Swap one element out of the container.
const CaloCellContainer *	asDataVector () const
	Return a pointer to this object, as a const `DataVector`.
void	resortAux (iterator, iterator)
	Reset indices / reorder aux data after elements have been permuted.
const SG::AuxVectorBase &	auxbase () const
	Convert to `AuxVectorBase`.
static const ConstDataVector *	fromDataVector (const CaloCellContainer *dv)
	Cast from a `DataVector` to a `ConstDataVector`.

Swap and sort.
void	swap (ConstDataVector &rhs)
	Swap this collection with another.
static void	iter_swap (iterator a, iterator b)
	Swap the referents of two `DataVector` iterators.

Swap and sort.
void	swap (DataVector &rhs)
	Swap this collection with another.
void	sort ()
	Sort the container.
static void	iter_swap (iterator a, iterator b)
	Swap the referents of two `DataVector` iterators.

Internal operations.
void	resortAux (iterator beg, iterator end)
	Reset indices / reorder aux data after elements have been permuted.
void	testInsert (const char *op)
	Test if we can insert; raise an exception if not.
void	testInsertOol (const char *op)
	Test if we can insert; raise an exception if not.
void	shift (size_t pos, ptrdiff_t offs)
	Shift the auxiliary elements of the container.
virtual const std::type_info &	dv_typeid () const override
	Find the most-derived `DataVector` class in the hierarchy.
void	clearMostDerived ()
	Clear `m_isMostDerived` for this instance and for all bases.
virtual void	setMostDerived () override
	Set `m_isMostDerived` for this instance and clear it for all bases.
static int	baseOffset1 (const char *p, const DataVector &dv, const std::type_info &ti)
	Helper for `baseOffset`.
static const CaloCell *	do_cast (const typename PtrVector::value_type p)
	Helper to shorten calls to `DataModel_detail::DVLCast`.
static CaloCell *	do_cast_nc (typename PtrVector::value_type p)
	Helper to shorten calls to `DataModel_detail::DVLCast`.
typedef ROOT::Meta::Selection::DataVector< CaloCell, DataVector_BASE >::self	self
SG::IsMostDerivedFlag	m_isMostDerived
	This flag is true if this DV instance is the most-derived one.

Private helpers.
void	assignElement (typename BaseContainer::iterator pos, value_type newElem)
	Handle element assignment.
void	assignElement (typename BaseContainer::iterator pos, std::unique_ptr< const base_value_type > newElem)
	Handle element assignment.
void	assignBaseElement (typename BaseContainer::iterator pos, typename BaseContainer::value_type newElem)
	Handle element assignment from a base pointer.
iterator	to_my_iterator (typename CaloCellContainer::iterator it)
	Convert an iterator of the base `DataVector` to a `ConstDataVector::iterator`.
ElementProxy	to_element_proxy (typename BaseContainer::iterator i)
	Convert an iterator of the base `vector` to an `ElementProxy` for the `ConstDataVector`.
static CaloCellContainer::iterator	to_base_iterator (iterator it)
	Convert a `ConstDataVector::iterator` to an iterator of the base `DataVector`.

Non-standard operations.
virtual const DataModel_detail::DVLInfoBase &	dvlinfo_v () const override
	Return the DV/DL info struct for this class.
size_type	max_size () const noexcept
	Returns the `size()` of the largest possible collection.
size_type	capacity () const noexcept
	Returns the total number of elements that the collection can hold before needing to allocate more memory.
bool	empty () const noexcept
	Returns `true` if the collection is empty.
void	shrink_to_fit ()
const PtrVector &	stdcont () const
	Return the underlying `std::vector` of the container.
SG::OwnershipPolicy	ownPolicy () const
	Return the ownership policy setting for this container.
static const DataModel_detail::DVLInfoBase &	dvlinfo ()
	Return the DV/DL info struct for this class.
static int	baseOffset (const std::type_info &ti)
	Return the offset of a base `DataVector` class.

Detailed Description

CaloCellContainer that can accept const cell pointers.

For more details about what's going on here, see AthContainers/ConstDataVector.h.

In brief, CaloCellContainer acts as a container of (non-const) CaloCell*, and thus you can't put a const CaloCell* into it. CaloConstCellContainer derives privately from CaloCellContainer. It overrides all accessor methods so that they only return const CaloCell*, and overrides the insertion methods so that they can take const pointers. There are two ways to convert this to a const CaloCellContainer. The first is by calling asDataVector. The second is by recording it in StoreGate and then retrieving it as a CaloCellContainer. When the object is recorded, it will automatically be locked.

Here, we declare only the methods from CaloCellContainer that we want to make visible. The DataVector methods are overridden in ConstDataVector.

Definition at line 43 of file CaloConstCellContainer.h.

Member Typedef Documentation

◆ allocator_type

typedef CaloCellContainer::allocator_type ConstDataVector< CaloCellContainer >::allocator_type

inherited

Definition at line 81 of file ConstDataVector.h.

◆ base_data_vector

typedef DataVector<base_value_type> ConstDataVector< CaloCellContainer >::base_data_vector

inherited

Definition at line 89 of file ConstDataVector.h.

◆ base_value_type

typedef CaloCellContainer::base_value_type ConstDataVector< CaloCellContainer >::base_value_type

inherited

Definition at line 82 of file ConstDataVector.h.

◆ BaseContainer

typedef CaloCellContainer::BaseContainer ConstDataVector< CaloCellContainer >::BaseContainer

inherited

Definition at line 83 of file ConstDataVector.h.

◆ CellVector

typedef std::vector<const CaloCell*> CaloCellContainer::CellVector

inherited

type to be used for the internal lookup table, and to return list of cells

Definition at line 72 of file CaloCellContainer.h.

◆ const_iterator

typedef CaloCellContainer::const_iterator ConstDataVector< CaloCellContainer >::const_iterator

inherited

Definition at line 85 of file ConstDataVector.h.

◆ const_pointer

typedef CaloCellContainer::const_value_type const* ConstDataVector< CaloCellContainer >::const_pointer

inherited

Definition at line 98 of file ConstDataVector.h.

◆ const_reference

typedef CaloCellContainer::const_value_type const& ConstDataVector< CaloCellContainer >::const_reference

inherited

Definition at line 96 of file ConstDataVector.h.

◆ const_reverse_iterator

typedef CaloCellContainer::const_reverse_iterator ConstDataVector< CaloCellContainer >::const_reverse_iterator

inherited

Definition at line 86 of file ConstDataVector.h.

◆ const_value_type

typedef CaloCellContainer::const_value_type ConstDataVector< CaloCellContainer >::const_value_type

inherited

Definition at line 94 of file ConstDataVector.h.

◆ DataVector_BASE

typedef typename DataVectorBase<CaloCell>::Base DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::DataVector_BASE

inherited

Definition at line 797 of file DataVector.h.

◆ Deleter

using DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::Deleter

inherited

Definition at line 857 of file DataVector.h.

◆ difference_type

typedef CaloCellContainer::difference_type ConstDataVector< CaloCellContainer >::difference_type

inherited

Definition at line 80 of file ConstDataVector.h.

◆ DVL_BASE

typedef CaloCellContainer::DVL_BASE ConstDataVector< CaloCellContainer >::DVL_BASE

inherited

Definition at line 84 of file ConstDataVector.h.

◆ ElementProxy

typedef DataModel_detail::ElementProxy<ConstDataVector> ConstDataVector< CaloCellContainer >::ElementProxy

inherited

This type is used to proxy lvalue accesses to DataVector elements, in order to handle ownership.

Definition at line 110 of file ConstDataVector.h.

◆ isSequence

typedef std::true_type ConstDataVector< CaloCellContainer >::isSequence

inherited

Definition at line 120 of file ConstDataVector.h.

◆ iterator

typedef DataModel_detail::iterator<ConstDataVector> ConstDataVector< CaloCellContainer >::iterator

inherited

The iterator for this type.

Definition at line 113 of file ConstDataVector.h.

◆ MutableCellVector

typedef std::vector<CaloCell*> CaloCellContainer::MutableCellVector

inherited

Return from non-const findCellVector.

Definition at line 75 of file CaloCellContainer.h.

◆ pointer

typedef CaloCellContainer::const_value_type* ConstDataVector< CaloCellContainer >::pointer

inherited

Definition at line 97 of file ConstDataVector.h.

◆ PtrVector

typedef typename DataVectorBase<CaloCell>::Base::PtrVector DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::PtrVector

inherited

This is the type of the underlying std::vector (what stdcont returns).

Definition at line 806 of file DataVector.h.

◆ reference

typedef CaloCellContainer::const_value_type& ConstDataVector< CaloCellContainer >::reference

inherited

Definition at line 95 of file ConstDataVector.h.

◆ reverse_iterator

typedef std::reverse_iterator<iterator> ConstDataVector< CaloCellContainer >::reverse_iterator

inherited

Standard reverse_iterator.

Note that lvalue references here will yield an ElementProxy, not a reference.

Definition at line 118 of file ConstDataVector.h.

◆ self

typedef ROOT::Meta::Selection::DataVector<CaloCell,DataVector_BASE>::self DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::self

privateinherited

Definition at line 2063 of file DataVector.h.

◆ size_type

typedef CaloCellContainer::size_type ConstDataVector< CaloCellContainer >::size_type

inherited

Basic types, forwarded from the base.

Definition at line 79 of file ConstDataVector.h.

◆ unique_type

typedef std::unique_ptr<const base_value_type> ConstDataVector< CaloCellContainer >::unique_type

inherited

Type of a unique_ptr that can be used to insert elements into this container.

Definition at line 106 of file ConstDataVector.h.

◆ value_type

typedef CaloCellContainer::const_value_type ConstDataVector< CaloCellContainer >::value_type

inherited

These types get modified so that the base's const_value_type becomes our value_type.

Definition at line 93 of file ConstDataVector.h.

Constructor & Destructor Documentation

◆ CaloConstCellContainer()

CaloConstCellContainer::CaloConstCellContainer ( SG::OwnershipPolicy ownPolicy = SG::OWN_ELEMENTS )

Constructor.

Member Function Documentation

◆ asDataVector()

const CaloCellContainer * ConstDataVector< CaloCellContainer >::asDataVector ( ) const

inherited

Return a pointer to this object, as a const DataVector.

◆ assign() [1/3]

void ConstDataVector< CaloCellContainer >::assign ( const std::vector< ElementLink< CONTAINER > > & v )

inherited

Assign from a vector of ElementLinks.

Parameters

v	The vector from which to initialize.

This will change the container to a view container.

◆ assign() [2/3]

void ConstDataVector< CaloCellContainer >::assign	(	InputIterator	first,
		InputIterator	last )

inherited

Assign from iterators.

Parameters

first	The start of the range to put in the container.
last	The end of the range to put in the container.

Any existing owned elements will be released. The DataVector's ownership policy determines whether it will take ownership of the new elements.

◆ assign() [3/3]

void ConstDataVector< CaloCellContainer >::assign ( std::initializer_list< value_type > l )

inherited

Assign from an initializer list.

Parameters

l	An initializer list.

Any existing owned elements will be released. The DataVector's ownership policy determines whether it will take ownership of the new elements.

◆ assignBaseElement()

void ConstDataVector< CaloCellContainer >::assignBaseElement	(	typename BaseContainer::iterator	pos,
		typename BaseContainer::value_type	newElem )

privateinherited

Handle element assignment from a base pointer.

Parameters

pos	Position in the container to assign.
newElem	The new element to assign.

The old element is freed if this container owns elements. Auxiliary data are copied if appropriate.

◆ assignElement() [1/2]

void ConstDataVector< CaloCellContainer >::assignElement	(	typename BaseContainer::iterator	pos,
		std::unique_ptr< const base_value_type >	newElem )

privateinherited

Handle element assignment.

Parameters

pos	Position in the container to assign.
newElem	The new element to assign.

The container must own its elements. Auxiliary data are copied if appropriate.

◆ assignElement() [2/2]

void ConstDataVector< CaloCellContainer >::assignElement	(	typename BaseContainer::iterator	pos,
		value_type	newElem )

privateinherited

Handle element assignment.

Parameters

pos	Position in the container to assign.
newElem	The new element to assign.

The old element is freed if this container owns elements. Auxiliary data are copied if appropriate.

◆ at() [1/2]

ElementProxy ConstDataVector< CaloCellContainer >::at ( size_type n )

inherited

Access an element, as an lvalue.

Parameters

n	Array index to access.

Returns: Proxy to the element at n.

Will raise std::out_of_range if the index is out-of-bounds. Note that we return a proxy object rather than a reference; the proxy will handle deleting an owned element if it's assigned to.

◆ at() [2/2]

const CaloCell * DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::at ( size_type n ) const

inherited

Access an element, as an rvalue.

Parameters

n	Array index to access.

Returns: The element at n.

Will raise std::out_of_range if the index is out-of-bounds. Note that we return a const T* rather than a reference.

◆ auxbase()

const SG::AuxVectorBase & ConstDataVector< CaloCellContainer >::auxbase ( ) const

inherited

Convert to AuxVectorBase.

Needed to get @x AuxVectorBase from a ConstDataVector. Present in DataVector as well for consistency.

◆ back() [1/2]

ElementProxy ConstDataVector< CaloCellContainer >::back ( )

inherited

Access the last element in the collection as an lvalue.

Returns: Proxy to the last element in the collection.

No checking is done to ensure that the container is not empty. Note that we return a proxy object rather than a reference; the proxy will handle deleting an owned element if it's assigned to.

◆ back() [2/2]

const CaloCell * DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::back ( ) const

inherited

Access the last element in the collection as an rvalue.

Returns: The last element in the collection.

No checking is done to ensure that the container is not empty. Note that we return a const T* rather than a reference.

◆ baseContainer()

::CaloCellContainer * CaloConstCellContainer::baseContainer ( )

private

Return a non-const pointer to the base container.

◆ baseOffset()

int DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::baseOffset ( const std::type_info & ti )

staticinherited

Return the offset of a base DataVector class.

Parameters

ti	`std::type_info` of the desired class.

If ti represents a DataVector base class of this one, then return the offset of that base class. Otherwise, return -1.

This function is here due to limitations of root 6, which can't calculate these offsets correctly from the dictionary if virtual derivation is used.

◆ baseOffset1()

int DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::baseOffset1	(	const char *	p,
		const DataVector< CaloCell > &	dv,
		const std::type_info &	ti )

staticinherited

Helper for baseOffset.

Parameters

p	Pointer to the start of the top-level object.
dv	Reference to the DataVector object.
ti	`std::type_info` of the desired class.

If ti represents a DataVector base class of this one, then return the offset of that base class. Otherwise, return -1.

◆ begin() [1/2]

iterator ConstDataVector< CaloCellContainer >::begin ( )

noexceptinherited

Return an iterator pointing at the beginning of the collection.

Returns: An iterator.

Note that dereferencing the iterator will yield a proxy rather than a reference; the proxy will handle deleting an owned element if it's assigned to.

◆ begin() [2/2]

const_iterator DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::begin ( ) const

noexceptinherited

Return a const_iterator pointing at the beginning of the collection.

Returns: A const_iterator.

Note that dereferencing the iterator will yield a const T* rather than a reference.

◆ beginCalo()

CaloCellContainer::iterator CaloCellContainer::beginCalo ( CaloCell_ID::SUBCALO caloNum )

inherited

get non const iterators on cell of just one calo

Definition at line 123 of file CaloCellContainer.cxx.

{
  return m_beginCalo[static_cast<int>(caloNum)];
}

◆ beginConstCalo()

::CaloCellContainer::const_iterator CaloConstCellContainer::beginConstCalo ( CaloCell_ID::SUBCALO caloNum ) const

get const begin iterator on cell of just one calo

◆ capacity()

size_type DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::capacity ( ) const

noexceptinherited

Returns the total number of elements that the collection can hold before needing to allocate more memory.

◆ cbegin()

const_iterator DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::cbegin ( ) const

noexceptinherited

Return a const_iterator pointing at the beginning of the collection.

Returns: A const_iterator.

Note that dereferencing the iterator will yield a const T* rather than a reference.

◆ cend()

const_iterator DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::cend ( ) const

noexceptinherited

Return a const_iterator pointing past the end of the collection.

Returns: A const_iterator.

Note that dereferencing the iterator will yield a const T* rather than a reference.

◆ checkOrdered()

bool CaloConstCellContainer::checkOrdered ( ) const

verify one by one the container is ordered

◆ checkOrderedAndComplete()

bool CaloConstCellContainer::checkOrderedAndComplete ( ) const

verify one by one the container is complete (i.e.

size is equal to the maximum of hash identifier) and in order

◆ clear() [1/3]

void ConstDataVector< CaloCellContainer >::clear ( )

inherited

Erase all the elements in the collection.

Erase all the elements in the collection, and reset the ownership mode.

If the container owns its elements, then the removed elements will be deleted. Any duplicates will be removed in this process, but don't rely on this.

Parameters

ownPolicy	The new ownership policy of the container.
trackIndices	The index tracking policy.

If the container owns its elements, then the removed elements will be deleted. Any duplicates will be removed in this process, but don't rely on this.

◆ clear() [2/3]

void ConstDataVector< CaloCellContainer >::clear ( SG::OwnershipPolicy ownPolicy )

inherited

Erase all the elements in the collection, and reset the ownership mode.

Parameters

ownPolicy The new ownership policy of the container.

If the container owns its elements, then the removed elements will be deleted. Any duplicates will be removed in this process, but don't rely on this.

◆ clear() [3/3]

void ConstDataVector< CaloCellContainer >::clear	(	SG::OwnershipPolicy	ownPolicy,
		SG::IndexTrackingPolicy	trackIndices )

inherited

◆ clearMostDerived()

void DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::clearMostDerived ( )

protectedinherited

Clear m_isMostDerived for this instance and for all bases.

Called from the constructor after setting m_isMostDerived.

◆ crbegin()

const_reverse_iterator DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::crbegin ( ) const

noexceptinherited

Return a const_reverse_iterator pointing past the end of the collection.

Returns: A const_reverse_iterator.

Note that dereferencing the iterator will yield a const T* rather than a reference.

◆ crend()

const_reverse_iterator DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::crend ( ) const

noexceptinherited

Return a const_reverse_iterator pointing at the beginning of the collection.

Returns: A const_reverse_iterator.

Note that dereferencing the iterator will yield a const T* rather than a reference.

◆ do_cast()

const CaloCell * DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::do_cast ( const typename PtrVector::value_type p )

staticinherited

Helper to shorten calls to DataModel_detail::DVLCast.

Parameters

p	The value to convert.

Returns: The value as a const T*.

The conversion will be done with static_cast if possible, with dynamic_cast otherwise.

◆ do_cast_nc()

CaloCell * DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::do_cast_nc ( typename PtrVector::value_type p )

staticinherited

Helper to shorten calls to DataModel_detail::DVLCast.

Parameters

p	The value to convert.

Returns: The value as a T*.

The conversion will be done with static_cast if possible, with dynamic_cast otherwise.

◆ dv_typeid()

virtual const std::type_info & DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::dv_typeid ( ) const

overrideprivatevirtualinherited

Find the most-derived DataVector class in the hierarchy.

Returns: The type_info for the class for which this method gets run.

This is used to generate a nice error message when the most-derived check for insertions fails. Every DataVector defines this virtual method, so when it's called, the one corresponding to the most-derived DataVector gets run.

◆ dvlinfo()

const DataModel_detail::DVLInfoBase & DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::dvlinfo ( )

staticinherited

Return the DV/DL info struct for this class.

This can be used to make sure that it's instantiated.

◆ dvlinfo_v()

virtual const DataModel_detail::DVLInfoBase & DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::dvlinfo_v ( ) const

overridevirtualinherited

Return the DV/DL info struct for this class.

This can be used to make sure that it's instantiated.

◆ emplace() [1/2]

iterator ConstDataVector< CaloCellContainer >::emplace	(	iterator	position,
		value_type	pElem )

inherited

Add a new element to the collection.

Parameters

position	Iterator before which the element will be added.
pElem	The element to add to the collection.

Returns: An iterator that points to the inserted data.

The container's ownership policy will determine if it takes ownership of the new element.

Note: this method may only be called using the most derived DataVector in the hierarchy.

For DataVector, this is just the same as insert. It's included just for interface compatibility with std::vector.

◆ emplace() [2/2]

iterator DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::emplace	(	iterator	position,
		value_type	pElem )

inherited

Add a new element to the collection.

Parameters

position	Iterator before which the element will be added.
pElem	The element to add to the collection.

Returns: An iterator that points to the inserted data.

The container's ownership policy will determine if it takes ownership of the new element.

Note: this method may only be called using the most derived DataVector in the hierarchy.

For DataVector, this is just the same as insert. It's included just for interface compatibility with std::vector.

◆ emplace_back()

value_type ConstDataVector< CaloCellContainer >::emplace_back ( value_type pElem )

inherited

Add an element to the end of the collection.

Parameters

pElem The element to add to the collection.

The container's ownership policy will determine if it takes ownership of the new element.

Note: this method may only be called using the most derived DataVector in the hierarchy.

For DataVector, this is like the same as push_back, and it returns the pushed element. It's included just for interface compatibility with std::vector.

◆ empty()

bool DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::empty ( ) const

nodiscardnoexceptinherited

Returns true if the collection is empty.

◆ end() [1/2]

iterator ConstDataVector< CaloCellContainer >::end ( )

noexceptinherited

Return an iterator pointing past the end of the collection.

Returns: An iterator.

Note that dereferencing the iterator will yield a proxy rather than a reference; the proxy will handle deleting an owned element if it's assigned to.

◆ end() [2/2]

const_iterator DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::end ( ) const

noexceptinherited

Return a const_iterator pointing past the end of the collection.

Returns: A const_iterator.

Note that dereferencing the iterator will yield a const T* rather than a reference.

◆ endCalo()

CaloCellContainer::iterator CaloCellContainer::endCalo ( CaloCell_ID::SUBCALO caloNum )

inherited

Definition at line 128 of file CaloCellContainer.cxx.

{
  return m_endCalo[static_cast<int>(caloNum)];
}

◆ endConstCalo()

::CaloCellContainer::const_iterator CaloConstCellContainer::endConstCalo ( CaloCell_ID::SUBCALO caloNum ) const

get const begin iterator on cell of just one calo

◆ erase() [1/3]

iterator ConstDataVector< CaloCellContainer >::erase	(	iterator	first,
		iterator	last )

inherited

Remove a range of elements.

Parameters

first	Iterator pointing to the first element to be removed.
last	Iterator pointing one past the last element to be removed.

Returns: An iterator pointing to the element pointed to by last prior to erasing (or end()).

If the container owns its elements, then the removed elements will be deleted. Any duplicates will be removed in this process, but don't rely on this.

◆ erase() [2/3]

iterator ConstDataVector< CaloCellContainer >::erase ( iterator position )

inherited

Remove element at a given position.

Parameters

position Iterator pointing to the element to be removed.

Returns: An iterator pointing to the next element (or end()).

If the container owns its elements, then the pointed-to element will be deleted.

◆ erase() [3/3]

iterator DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::erase ( iterator position )

inherited

Remove element at a given position.

Parameters

position Iterator pointing to the element to be removed.

Returns: An iterator pointing to the next element (or end()).

If the container owns its elements, then the pointed-to element will be deleted.

◆ findCell() [1/2]

CaloCell * CaloCellContainer::findCell ( const IdentifierHash theHash )

inherited

fast find method given identifier hash.

If the container is not ordered and complete a look up map is used, which is build the first time this method of findCellVector is used

Definition at line 354 of file CaloCellContainer.cxx.

{
  int ndx = findIndex (theHash);
  if (ndx >= 0)
    return (*this)[ndx];
  return nullptr;
}

◆ findCell() [2/2]

const CaloCell * CaloConstCellContainer::findCell ( IdentifierHash theHash ) const

fast find method given identifier hash.

If the container is not ordered and complete a look up map is used, which is build the first time this method of findCellVector is used

◆ findCellVector() [1/3]

void CaloCellContainer::findCellVector	(	const std::vector< IdentifierHash > &	theVectorHash,
		CellVector &	theCellVector ) const

inherited

fast find method given vector of identifier hash.

Be careful that the order of cell return may not match the order of the inputs, and that some cells may be missing

Definition at line 422 of file CaloCellContainer.cxx.

{
  findCellVectorT (*this, theVectorHash, theCellVector);
#if 0
  theCellVector.reserve (theCellVector.size() + theVectorHash.size());
  if (isOrderedAndComplete()) {
 
    for (IdentifierHash hash : theVectorHash) {
      theCellVector.push_back( (*this)[hash] );
    }
    return;
  }
 
  if (this->empty()) return ;
 
  const CxxUtils::PackedArray& lookUpTable = getLookUpTable();
 
  //look in look up table (do not put empty cells)
 
  size_t tbsize = lookUpTable.size();
  for (IdentifierHash hash : theVectorHash) {
    // careful that the look up table might be shorter than the maximum hash
    if (hash>=tbsize) continue ;
    int ndx = (int)lookUpTable[ hash ] - 1;
    if (ndx >= 0) {
      const CaloCell * theCell = (*this)[ndx];
      if (theCell!=0) {
        theCellVector.push_back( theCell);
      }
    }
    
  }
#endif
}

◆ findCellVector() [2/3]

void CaloCellContainer::findCellVector	(	const std::vector< IdentifierHash > &	theVectorHash,
		MutableCellVector &	theCellVector )

inherited

fast find method given vector of identifier hash.

Be careful that the order of cell return may not match the order of the inputs, and that some cells may be missing

Definition at line 457 of file CaloCellContainer.cxx.

{
  findCellVectorT (*this, theVectorHash, theCellVector);
}

◆ findCellVector() [3/3]

void CaloConstCellContainer::findCellVector	(	const std::vector< IdentifierHash > &	theVectorHash,
		::CaloCellContainer::CellVector &	theCellVector ) const

fast find method given vector of identifier hash.

Be careful that the order of cell return may not match the order of the inputs, and that some cells may be missing

◆ findCellVectorT()

template<class CONT, class VECT>

void CaloCellContainer::findCellVectorT	(	CONT &	cont,
		const std::vector< IdentifierHash > &	theVectorHash,
		VECT &	theCellVector )

staticprivateinherited

Look up a group of cells by IdentifierHash.

This is a templated version that can be instantiated for both const and non-const versions.

Parameters

cont	The container from which to fetch cells.
theVectorHash	Vector of desired IdentifierHash's.
theCellVector	Found cells will be appended to this vector.

Definition at line 389 of file CaloCellContainer.cxx.

{
  theCellVector.reserve (theCellVector.size() + theVectorHash.size());
  if (cont.isOrderedAndComplete()) {
 
    for (IdentifierHash hash : theVectorHash) {
      theCellVector.push_back( cont[hash] );
    }
    return;
  }
 
  if (cont.empty()) return ;
 
  const CxxUtils::PackedArray& lookUpTable = cont.getLookUpTable();
 
  //look in look up table (do not put empty cells)
 
  size_t tbsize = lookUpTable.size();
  for (IdentifierHash hash : theVectorHash) {
    // careful that the look up table might be shorter than the maximum hash
    if (hash>=tbsize) continue ;
    int ndx = (int)lookUpTable[ hash ] - 1;
    if (ndx >= 0) {
      auto theCell = cont[ndx];
      if (theCell!=nullptr) {
        theCellVector.push_back( theCell);
      }
    }
    
  }
}

◆ findIndex()

int CaloConstCellContainer::findIndex ( IdentifierHash theHash ) const

Return index of the cell with a given hash.

Returns -1 if the cell isn't found.

◆ fromDataVector()

const ConstDataVector * ConstDataVector< CaloCellContainer >::fromDataVector ( const CaloCellContainer * dv )

staticinherited

Cast from a DataVector to a ConstDataVector.

Parameters

dv	Pointer to object to cast.

Return DV cast to a ConstDataVector.

◆ front() [1/2]

ElementProxy ConstDataVector< CaloCellContainer >::front ( )

inherited

Access the first element in the collection as an lvalue.

Returns: Proxy to the first element in the collection.

No checking is done to ensure that the container is not empty. Note that we return a proxy object rather than a reference; the proxy will handle deleting an owned element if it's assigned to.

◆ front() [2/2]

const CaloCell * DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::front ( ) const

inherited

Access the first element in the collection as an rvalue.

Returns: The first element in the collection.

No checking is done to ensure that the container is not empty. Note that we return a const T* rather than a reference.

◆ get()

const CaloCell * DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::get ( size_type n ) const

inherited

Access an element, as an rvalue.

Parameters

n	Array index to access.

Returns: The element at n.

This is a synonym for operator[] const, to be used when calling from root (where we can't readily call just the const version of a method).

◆ getLookUpTable()

const CxxUtils::PackedArray & CaloCellContainer::getLookUpTable ( ) const

privateinherited

Retrieve an initialized lookup table.

Definition at line 586 of file CaloCellContainer.cxx.

{
  // FIXME should have an argument about duplicates
  // fill the look up table
  // note that if CaloCellContainer is not completely filled, there 
  // is no guarantee it has the correct size, hence the size should 
  // be checked at every call
  // (CaloCellContainer has no way to know the maximum size)
  // Now (30.07.2008) have it always max number of cells (hardcoded) to speed up.
 
  if (!m_lookUpTable.isValid()) {
 
    unsigned int theSize=0;
    size_t ncells = size();
    CxxUtils::PackedArray lookUpTable (std::max (1, ilog2 (ncells + 1)));
 
    if (ncells > 0) {
 
      // Set the size of the lookup table.
      // If the cells are sorted, we can look at the last cell to know
      // the maximum hash we're dealing with.  Otherwise, set it to the
      // maximum cell hash value.
      if (isOrdered()) {
        // Set LUT size from the hash of the last cell.
        theSize = back()->caloDDE()->calo_hash()+1;
      }
      else {
        // Find the maximum hash.
        const CaloDetDescriptor* desc = front()->caloDDE()->descriptor();
        IdentifierHash max_hash = desc->get_calo_helper()->calo_cell_hash_max();
        theSize = max_hash + 1;
      }
      lookUpTable.resize (theSize);
  
      for (size_t icell = 0; icell < ncells; icell++) {
 
        const CaloCell * theCell = (*this)[icell];
        const IdentifierHash theHash=theCell->caloDDE()->calo_hash();
 
        assert (theHash < theSize);
        
        if (nWarningsToBePrinted > 0) {
          // We may actually enter here nWarningsToBePrinted times
          // if multiple threads race here, but it doesn't matter.
          int nwarn = nWarningsToBePrinted--;
          int iold = (int)(lookUpTable[theHash])-1;
          if (iold >= 0) {
            if ((size_t)iold == icell) {
              REPORT_MESSAGE_WITH_CONTEXT (MSG::WARNING, "CaloCellContainer")
                << "Repeated cell. hash= " << theHash;
            }
            else if ((*this)[iold]->ID()==theCell->ID()) {
              REPORT_MESSAGE_WITH_CONTEXT (MSG::WARNING, "CaloCellContainer")
                << "Duplicated cell. hash=" 
                << theHash 
                << " E1=" << (*this)[iold]->e()
                << " E2=" << theCell->e();
              // should delete the cell?
            } else {
              REPORT_MESSAGE_WITH_CONTEXT (MSG::WARNING, "CaloCellContainer")
                << "Should be impossible ! Repeated cell. hash= " << theHash;
            }
            if (nwarn==0) {
              REPORT_MESSAGE_WITH_CONTEXT (MSG::INFO, "CaloCellContainer")
                << "No more WARNING will be printed";
            } 
          }
        } // end of print out
 
        lookUpTable[theHash]=icell+1;
      }
    }
    m_lookUpTable.set (std::move (lookUpTable));
  }
 
  return *m_lookUpTable.ptr();
}

◆ hasCalo()

bool CaloConstCellContainer::hasCalo ( const CaloCell_ID::SUBCALO caloNum ) const

tell whether it has been filled with cells (maybe none) of a given calo

◆ hasTotalSize()

bool CaloConstCellContainer::hasTotalSize ( ) const

tell wether container has total hash id size

◆ indexFirstCellCalo()

int CaloConstCellContainer::indexFirstCellCalo ( const CaloCell_ID::SUBCALO caloNum ) const

index of first cell of given calorimeter (-1 if none).

Note that it is normally more efficient to use iterators

◆ indexLastCellCalo()

int CaloConstCellContainer::indexLastCellCalo ( const CaloCell_ID::SUBCALO caloNum ) const

index of last cell of given calorimeter (-2 if none) Note that it is normally more efficient to use iterators.

◆ initializeLookUpTable()

void CaloCellContainer::initializeLookUpTable ( )

inherited

initialize look up table.

Note that the look up table is initialized the first time findcell is called. If new cells are added afterwards (should not be the case) the lookuptable need be reinitialized by hand

Definition at line 467 of file CaloCellContainer.cxx.

{
  this->resetLookUpTable();
  getLookUpTable();
}

◆ insert() [1/5]

void ConstDataVector< CaloCellContainer >::insert	(	iterator	position,
		InputIterator	first,
		InputIterator	last )

inherited

Add a group of new elements to the collection.

Parameters

position	Iterator before which the element will be added.
first	The start of the range to put in the container.
last	The end of the range to put in the container.

The container's ownership policy will determine if it takes ownership of the new element.

Note: this method may only be called using the most derived DataVector in the hierarchy.

◆ insert() [2/5]

void ConstDataVector< CaloCellContainer >::insert	(	iterator	position,
		std::initializer_list< value_type >	l )

inherited

Add a group of new elements to the collection.

Parameters

position	Iterator before which the element will be added.
l	An initializer list.

The container's ownership policy will determine if it takes ownership of the new element.

Note: this method may only be called using the most derived DataVector in the hierarchy.

◆ insert() [3/5]

iterator ConstDataVector< CaloCellContainer >::insert	(	iterator	position,
		std::unique_ptr< const base_value_type >	pElem )

inherited

Add a new element to the collection.

Parameters

position	Iterator before which the element will be added.
pElem	The element to add to the collection.

Returns: An iterator that points to the inserted data.

The container must be an owning container.

Note: this method may only be called using the most derived DataVector in the hierarchy.

◆ insert() [4/5]

iterator ConstDataVector< CaloCellContainer >::insert	(	iterator	position,
		value_type	pElem )

inherited

Add a new element to the collection.

Parameters

position	Iterator before which the element will be added.
pElem	The element to add to the collection.

Returns: An iterator that points to the inserted data.

The container's ownership policy will determine if it takes ownership of the new element.

Note: this method may only be called using the most derived DataVector in the hierarchy.

◆ insert() [5/5]

iterator DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::insert	(	iterator	position,
		value_type	pElem )

inherited

Add a new element to the collection.

Parameters

position	Iterator before which the element will be added.
pElem	The element to add to the collection.

Returns: An iterator that points to the inserted data.

The container's ownership policy will determine if it takes ownership of the new element.

Note: this method may only be called using the most derived DataVector in the hierarchy.

◆ insertMove()

void DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::insertMove	(	iterator	position,
		DataVector< CaloCell > &	other )

inherited

Insert the contents of another DataVector, with auxiliary data copied via move semantics.

Parameters

position	Iterator before which the new elements will be added.
other	The vector to add.

The ownership mode of this vector must be the same as other; otherwise, an exception will be thrown.

If both vectors are view vectors, then this is the same as insert (position, other.begin(), other.end()) .

Otherwise, the elements from other will be inserted into this vector. This vector will take ownership of the elements, and the ownership mode of other will be changed to VIEW_ELEMENTS. Auxiliary data for these elements will be transferred, using move semantics if possible. (Thus, the auxiliary store for other may be modified and must not be locked.) Finally, the auxiliary store pointer for other will be cleared (but the store itself will not be deleted since it's not owned by the vector).

Note: this method may only be called using the most derived DataVector in the hierarchy.

◆ isOrdered()

bool CaloConstCellContainer::isOrdered ( ) const

tell wether container is ordered

◆ isOrderedAndComplete()

bool CaloConstCellContainer::isOrderedAndComplete ( ) const

tell wether container is complete and in order

◆ iter_swap() [1/2]

void ConstDataVector< CaloCellContainer >::iter_swap	(	iterator	a,
		iterator	b )

staticinherited

Swap the referents of two DataVector iterators.

Parameters

a	The first iterator for the swap.
b	The second iterator for the swap.

◆ iter_swap() [2/2]

void DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::iter_swap	(	iterator	a,
		iterator	b )

staticinherited

Swap the referents of two DataVector iterators.

Parameters

a	The first iterator for the swap.
b	The second iterator for the swap.

◆ max_size()

size_type DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::max_size ( ) const

noexceptinherited

Returns the size() of the largest possible collection.

◆ msgSvc()

IMessageSvc * CaloCellContainer::msgSvc ( ) const

privateinherited

get message service

◆ nCellsCalo()

int CaloConstCellContainer::nCellsCalo ( const CaloCell_ID::SUBCALO caloNum ) const

get number of cels of given calorimeter

◆ operator!=()

bool ConstDataVector< CaloCellContainer >::operator!= ( const ConstDataVector< CaloCellContainer > & b ) const

inherited

Based on operator==.

◆ operator<()

bool ConstDataVector< CaloCellContainer >::operator< ( const ConstDataVector< CaloCellContainer > & b ) const

inherited

Vector ordering relation.

Parameters

b	A `ConstDataVector` of the same type as *this.

Returns: True iff *this is lexicographically less than b.

This is a total ordering relation. It is linear in the size of the vectors. Comparisons are done on the pointer values of the elements.

See std::lexicographical_compare() for how the determination is made.

◆ operator<=()

bool ConstDataVector< CaloCellContainer >::operator<= ( const ConstDataVector< CaloCellContainer > & b ) const

inherited

Based on operator<.

◆ operator==()

bool ConstDataVector< CaloCellContainer >::operator== ( const ConstDataVector< CaloCellContainer > & b ) const

inherited

Vector equality comparison.

Parameters

b	A `ConstDataVector` of the same type as *this.

Returns: True iff the size and elements of the vectors are equal.

This is an equivalence relation. It is linear in the size of the vectors. Vectors are considered equivalent if their sizes are equal, and if corresponding elements compare equal.

◆ operator>()

bool ConstDataVector< CaloCellContainer >::operator> ( const ConstDataVector< CaloCellContainer > & b ) const

inherited

Based on operator<.

◆ operator>=()

bool ConstDataVector< CaloCellContainer >::operator>= ( const ConstDataVector< CaloCellContainer > & b ) const

inherited

Based on operator<.

◆ operator[]() [1/2]

ElementProxy ConstDataVector< CaloCellContainer >::operator[] ( size_type n )

inherited

Access an element, as an lvalue.

Parameters

n	Array index to access.

Returns: Proxy to the element at n.

No bounds checking is done. Note that we return a proxy object rather than a reference; the proxy will handle deleting an owned element if it's assigned to.

◆ operator[]() [2/2]

const CaloCell * DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::operator[] ( size_type n ) const

inherited

Access an element, as an rvalue.

Parameters

n	Array index to access.

Returns: The element at n.

No bounds checking is done. Note that we return a const T* rather than a reference.

◆ order()

void CaloConstCellContainer::order ( )

order container

◆ orderWhenComplete()

void CaloCellContainer::orderWhenComplete ( )

privateinherited

order when container is complete

Definition at line 556 of file CaloCellContainer.cxx.

{
  DataVector<CaloCell> tmp (ownPolicy());
  tmp.swap (*this);
  reserve (tmp.size());
 
  DataVector<CaloCell>::iterator tmpend = tmp.end();
  for (DataVector<CaloCell>::iterator it = tmp.begin(); it != tmpend; ++it) {
    IdentifierHash hash = (*it)->caloDDE()->calo_hash();
 
    if (hash >= size())
      resize (hash + 1);
 
    if ((*this)[hash] != nullptr) {
      REPORT_MESSAGE_WITH_CONTEXT (MSG::ERROR, "CaloCellContainer")
        << "Duplicated cell: hash= " << hash;
    }
    else {
      using std::iter_swap;
      iter_swap (begin() + hash, it);
    }
  }
 
  // set the Ordered And Complete flag
  this->setIsOrderedAndComplete(true);
  
  // look up table is not necessary anymore
  this->resetLookUpTable();
}

◆ orderWhenIncomplete()

void CaloCellContainer::orderWhenIncomplete ( )

privateinherited

order when container is incomplete

Definition at line 485 of file CaloCellContainer.cxx.

{
  // If the number of cells is small compared to the maximum number
  // of cells, best to just use the STL sort and then remove duplicates.
  // Otherwise, sort by inserting into a table based on the hash code.
  // Break point chosen pretty much arbitrarily.  Could be further
  // tuned, but it probably doesn't really make much difference.
  if (size() < 500) {
    // Small number of cells.  Use STL sort.
    sort (orderWithCaloHash());
 
    // Nb. Need to convert to int --- otherwise, 0-1 will wrap around
    // to maxuint.
    for (int i = 0; i < static_cast<int>(size())-1; ) {
      if ((*this)[i]->caloDDE()->calo_hash() ==
          (*this)[i+1]->caloDDE()->calo_hash())
      {
        REPORT_MESSAGE_WITH_CONTEXT (MSG::ERROR, "CaloCellContainer")
          << "Duplicated cell: hash= " << (*this)[i]->caloDDE()->calo_hash();
        erase (begin() + i);
      }
      else
        ++i;
    }
  }
  else {
    // Sort for large container.
 
    // Find the maximum possible hash code.
    const CaloDetDescriptor* desc = front()->caloDDE()->descriptor();
    IdentifierHash max_hash = desc->get_calo_helper()->calo_cell_hash_max();
 
    // Make a temporary container that can hold all possible cells.
    DataVector<CaloCell> tmp (max_hash+1, ownPolicy());
 
    // Move cells into the temporary container, according to hashes.
    DataVector<CaloCell>::iterator itend = end();
    for (DataVector<CaloCell>::iterator it = begin(); it != itend; ++it) {
      IdentifierHash hash = (*it)->caloDDE()->calo_hash();  
      assert (hash < tmp.size());
    
      if (tmp[hash] != nullptr) {
        REPORT_MESSAGE_WITH_CONTEXT (MSG::ERROR, "CaloCellContainer")
          << "Duplicated cell: hash= " << hash;
      }
      else {
        using std::iter_swap;
        iter_swap (tmp.begin() + hash, it);
      }
    }
 
    // Now, move the cells back, eliminating spaces.
    itend = tmp.end();
    DataVector<CaloCell>::iterator itout = begin();
    for (DataVector<CaloCell>::iterator it = tmp.begin(); it != itend; ++it) {
      if (*it != nullptr) {
        using std::iter_swap;
        iter_swap (itout, it);
        ++itout;
      }
    }
 
    // May be less, if there were duplicates.
    // cppcheck-suppress assertWithSideEffect
    assert (itout <= end());
    resize (itout - begin());
  }
  initializeLookUpTable();
  setIsOrdered(true);
}

◆ ownPolicy()

SG::OwnershipPolicy DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::ownPolicy ( ) const

inherited

Return the ownership policy setting for this container.

◆ pop_back()

void DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::pop_back ( )

inherited

Remove the last element from the collection.

If the container owns its elements, then the removed element will be deleted.

◆ print()

void CaloCellContainer::print ( )

staticinherited

dump (obsolete)

Definition at line 112 of file CaloCellContainer.cxx.

                              {
  REPORT_MESSAGE_WITH_CONTEXT (MSG::WARNING, "CaloCellContainer")
    << "CaloCellContainer::print not implemented";
}

◆ push_back() [1/3]

void CaloCellContainer::push_back ( CaloCell * theCell )

inherited

reimplementation of const push_back

Definition at line 74 of file CaloCellContainer.cxx.

{
  resetLookUpTable();
 
  // only allow const push_back if view cells
  // if (ownPolicy()==SG::VIEW_ELEMENTS){
  //  std::cout << "ERROR Should not push_back non const cell in VIEW CaloCellContainer" << std::endl;
  // }
  
 
  this->setHasCalo(theCell->caloDDE()->getSubCalo()) ;
  
  DataVector<CaloCell>::push_back(theCell)  ;
 
}

◆ push_back() [2/3]

value_type ConstDataVector< CaloCellContainer >::push_back ( std::unique_ptr< const base_value_type > pElem )

inherited

Add an element to the end of the collection.

Parameters

pElem The element to add to the collection.

The container must be an owning container.

Note: this method may only be called using the most derived DataVector in the hierarchy.

Returns the pushed pointer.

◆ push_back() [3/3]

value_type ConstDataVector< CaloCellContainer >::push_back ( value_type pElem )

inherited

Add an element to the end of the collection.

Parameters

pElem The element to add to the collection.

The container's ownership policy will determine if it takes ownership of the new element.

Note: this method may only be called using the most derived DataVector in the hierarchy.

Returns the pushed pointer.

◆ push_back_fast() [1/3]

void CaloCellContainer::push_back_fast ( CaloCell * theCell )

inherited

reimplementation of push_back to gain speed in readin

Definition at line 102 of file CaloCellContainer.cxx.

{
   DataVector<CaloCell>::push_back(theCell);
}

◆ push_back_fast() [2/3]

void CaloConstCellContainer::push_back_fast ( const CaloCell * cell )

reimplementation of push_back to gain speed in readin

◆ push_back_fast() [3/3]

void CaloConstCellContainer::push_back_fast ( std::unique_ptr< const CaloCell > cell )

reimplementation of push_back to gain speed in readin (UP version)

◆ push_new()

size_type DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::push_new	(	size_type	n,
		F	alloc )

inherited

Create and add a number of new elements to the end of the container.

Parameters

n	The number of new elements to add.
alloc	Functional to call to allocate a new element to push. Should be callable like `T* = alloc();` For example: dv.push_new (n, [](){ return new Foo; }); Foo Definition FooBar.h:9 It may also be useful to allocate from a `DataPool`.

Note: this method may only be called using the most derived DataVector in the hierarchy.

Returns the original size of the vector.

◆ rbegin() [1/2]

reverse_iterator ConstDataVector< CaloCellContainer >::rbegin ( )

noexceptinherited

Return a reverse_iterator pointing past the end of the collection.

Returns: A reverse_iterator.

Note that dereferencing the iterator will yield a proxy rather than a reference; the proxy will handle deleting an owned element if it's assigned to.

◆ rbegin() [2/2]

const_reverse_iterator DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::rbegin ( ) const

noexceptinherited

Return a const_reverse_iterator pointing past the end of the collection.

Returns: A const_reverse_iterator.

Note that dereferencing the iterator will yield a const T* rather than a reference.

◆ rend() [1/2]

reverse_iterator ConstDataVector< CaloCellContainer >::rend ( )

noexceptinherited

Return a reverse_iterator pointing at the beginning of the collection.

Returns: A reverse_iterator.

Note that dereferencing the iterator will yield a proxy rather than a reference; the proxy will handle deleting an owned element if it's assigned to.

◆ rend() [2/2]

const_reverse_iterator DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::rend ( ) const

noexceptinherited

Return a const_reverse_iterator pointing at the beginning of the collection.

Returns: A const_reverse_iterator.

Note that dereferencing the iterator will yield a const T* rather than a reference.

◆ reserve()

void DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::reserve ( size_type n )

inherited

Attempt to preallocate enough memory for a specified number of elements.

Parameters

n	Number of elements required.

◆ resetLookUpTable()

void CaloConstCellContainer::resetLookUpTable ( )

reset look up table

◆ resize()

void DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::resize ( size_type sz )

inherited

Resizes the collection to the specified number of elements.

Parameters

sz	The new size of the collection.

Note that this function differs from the standard in that it does not allow specifying the value of any inserted elements. They will always be 0.

If the container is shrunk, elements will be deleted as with erase().

◆ resortAux() [1/2]

void ConstDataVector< CaloCellContainer >::resortAux	(	iterator	,
		iterator	)

inherited

Reset indices / reorder aux data after elements have been permuted.

Parameters

beg	Start of the range of elements to process.
end	End of the range of elements to process.

This is a no-op for ConstDataVector.

◆ resortAux() [2/2]

void DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::resortAux	(	iterator	beg,
		iterator	end )

inherited

Reset indices / reorder aux data after elements have been permuted.

Parameters

beg	Start of the range of elements to process.
end	End of the range of elements to process.

Call this after some operation that has permuted the elements in the container (such as sort). The index information in the elements will be used to permute all auxiliary data in the same way. Finally, all the indices will be reset in the correct order.

◆ setHasCalo()

void CaloConstCellContainer::setHasCalo ( CaloCell_ID::SUBCALO caloNum )

set which calo has been filled.

◆ setHasTotalSize()

void CaloConstCellContainer::setHasTotalSize ( bool flag )

private

If @ flag is true, then the container size equals the maximum hash.

Only CaloCellContainerFinalizer tool is allowed to set this.

◆ setIsOrdered()

void CaloConstCellContainer::setIsOrdered ( bool ordered )

indicates that the container is ordered

◆ setIsOrderedAndComplete()

void CaloConstCellContainer::setIsOrderedAndComplete ( bool ordered )

indicate that the container is complete and in order

◆ setMostDerived()

virtual void DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::setMostDerived ( )

overrideprotectedvirtualinherited

Set m_isMostDerived for this instance and clear it for all bases.

Called from testInsert if the test fails. The flag may not have been set if this container was made via copy construction, so set it appropriately now so we can test again.

◆ shift()

void DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::shift	(	size_t	pos,
		ptrdiff_t	offs )

privateinherited

Shift the auxiliary elements of the container.

Parameters

pos	The starting index for the shift.
offs	The (signed) amount of the shift.

The elements in the container should have already been shifted; this operation will then adjust the element indices and also shift the elements in the vectors for all aux data items. offs may be either positive or negative.

If offs is positive, then the container is growing. The container size should be increased by offs, the element at pos moved to pos + offs, and similarly for following elements. The elements between pos and pos + offs should be default-initialized.

If offs is negative, then the container is shrinking. The element at pos should be moved to pos + offs, and similarly for following elements. The container should then be shrunk by -offs elements (running destructors as appropriate).

◆ shrink_to_fit()

void DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::shrink_to_fit ( )

inherited

◆ size()

size_type DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::size ( ) const

noexceptinherited

Returns the number of elements in the collection.

Could in principle be inherited from the base class, but redeclared in the derived class to avoid root6 bugs.

◆ sort()

void DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::sort ( )

inherited

Sort the container.

This just sorts by pointer value, so it's probably not very useful.

◆ stdcont()

const PtrVector & DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::stdcont ( ) const

inherited

Return the underlying std::vector of the container.

Returns: Reference to the std::vector actually holding the collection.

Note that DataVector<T>::stdcont does not necessarily return a std::vector<T*> if DataVector inheritance is being used.

◆ swap() [1/2]

void ConstDataVector< CaloCellContainer >::swap ( ConstDataVector< CaloCellContainer > & rhs )

inherited

Swap this collection with another.

Parameters

rhs	The collection with which to swap.

Ownership is swapped along with the collection content.

Note: this method may only be called using the most-derived DataVector in the hierarchy. The rhs must also be referenced using the most-derived DataVector.

◆ swap() [2/2]

void DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::swap ( DataVector< CaloCell > & rhs )

inherited

Swap this collection with another.

Parameters

rhs	The collection with which to swap.

Ownership is swapped along with the collection content.

Note: this method may only be called using the most-derived DataVector in the hierarchy. The rhs must also be referenced using the most-derived DataVector.

◆ swapElement() [1/4]

void ConstDataVector< CaloCellContainer >::swapElement	(	iterator	pos,
		std::unique_ptr< const base_value_type >	newElem,
		std::unique_ptr< const base_value_type > &	oldElem )

inherited

Swap one element out of the container.

Parameters

pos	The element in the container to swap.
newElem	New element to put in the container. May be 0.
oldElem	Reference to receive the element removed from the container.

Reference oldElem is initialized with element pos of the collection (no bounds checking). Then element index is set to newElem.

The collection must own its elements to use its interface. The collection will take ownership of newElem and will return ownership of oldElem.

Note: this method may only be called using the most derived DataList in the hierarchy.

◆ swapElement() [2/4]

void ConstDataVector< CaloCellContainer >::swapElement	(	iterator	pos,
		value_type	newElem,
		reference	oldElem )

inherited

Swap one element out of the container.

Parameters

pos	The element in the container to swap.
newElem	New element to put in the container. May be 0.
oldElem	Reference to receive the element removed from the container.

Reference oldElem is initialized with element pos of the collection (no bounds checking). Then element index is set to newElem. If the collection owns its elements, then it will take ownership of newElem and release (without deleting) the element returned through oldElem.

Note: this method may only be called using the most derived DataList in the hierarchy.

◆ swapElement() [3/4]

void ConstDataVector< CaloCellContainer >::swapElement	(	size_type	index,
		std::unique_ptr< const base_value_type >	newElem,
		std::unique_ptr< const base_value_type > &	oldElem )

inherited

Swap one element out of the container.

Parameters

index	Index of the element in the container to swap.
newElem	New element to put in the container. May be 0.
oldElem	Reference to receive the element removed from the container.

Reference oldElem is initialized with element index of the collection (no bounds checking). Then element index is set to newElem.

The collection must own its elements to use its interface. The collection will take ownership of newElem and will return ownership of oldElem.

Note: this method may only be called using the most derived DataVector in the hierarchy.

◆ swapElement() [4/4]

void ConstDataVector< CaloCellContainer >::swapElement	(	size_type	index,
		value_type	newElem,
		reference	oldElem )

inherited

Swap one element out of the container.

Parameters

index	Index of the element in the container to swap.
newElem	New element to put in the container. May be 0.
oldElem	Reference to receive the element removed from the container.

Reference oldElem is initialized with element index of the collection (no bounds checking). Then element index is set to newElem. If the collection owns its elements, then it will take ownership of newElem and release (without deleting) the element returned through oldElem.

Note: this method may only be called using the most derived DataVector in the hierarchy.

◆ testInsert()

void DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::testInsert ( const char * op )

inherited

Test if we can insert; raise an exception if not.

Parameters

op	Description of the attempted operation.

In order to maintain type-safety, we can only allow insertions using the most-derived instance of DataVector. This checks this by testing the m_isMostDerived, which is set by the constructors to true only for the most-derived instance. If the test fails, we call to potentially out-of-line code to continue.

◆ testInsertOol()

void DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::testInsertOol ( const char * op )

inherited

Test if we can insert; raise an exception if not.

Parameters

op	Description of the attempted operation.

This continues the test of testInsert. There is one case where m_isMostDerived may not be set correctly. If this container was made via copy construction, then all the m_isMostDerived flags will be false. So we call setMostDerived to set the flags correctly and test again. If the test fails again, then we raise an exception.

◆ to_base_iterator()

CaloCellContainer::iterator ConstDataVector< CaloCellContainer >::to_base_iterator ( iterator it )

staticprivateinherited

Convert a ConstDataVector::iterator to an iterator of the base DataVector.

Parameters

it	The `ConstDataVector::iterator` to convert.

◆ to_element_proxy()

ElementProxy ConstDataVector< CaloCellContainer >::to_element_proxy ( typename BaseContainer::iterator i )

privateinherited

Convert an iterator of the base vector to an ElementProxy for the ConstDataVector.

Parameters

it	The base `vector` iterator to convert.

◆ to_my_iterator()

iterator ConstDataVector< CaloCellContainer >::to_my_iterator ( typename CaloCellContainer::iterator it )

privateinherited

Convert an iterator of the base DataVector to a ConstDataVector::iterator.

Parameters

it	The base `DataVector` iterator to convert.

◆ updateCaloBeginIterators()

void CaloConstCellContainer::updateCaloBeginIterators	(	int	ic,
		int	ind )

fills calo iterators and the index of first cell for a given subcalo

◆ updateCaloEndIterators()

void CaloConstCellContainer::updateCaloEndIterators	(	int	ic,
		int	ind )

fills calo iterators and the index of last cell for a given subcalo

◆ updateCaloIterators()

void CaloConstCellContainer::updateCaloIterators ( )

fill calo iterators and the index of first and last cell IT IS THE RESPONSABILITY OF THE PRODUCER TO CALL THIS METHOD ONCE THE FILLING IS FINISHED Please use CaloCellContainerFinalizerTool to make sure the container is properly finalised.

◆ updateCaloIteratorsOrdered()

void CaloCellContainer::updateCaloIteratorsOrdered	(	CaloCellContainer::iterator	beg,
		CaloCellContainer::iterator	end )

privateinherited

Recursively find division points between subcalos in the container.

Should run in ~ m log n time, where n is the number of cells and m is the number of subcalos.

The cells need to be sorted for this to work.

Definition at line 245 of file CaloCellContainer.cxx.

{
  if (beg == end) return;
  int beg_calo = (*beg)->caloDDE()->getSubCalo();
  int end_calo = (*(end-1))->caloDDE()->getSubCalo();
  if (beg_calo == end_calo) {
    m_beginCalo[beg_calo] = beg;
    m_endCalo[beg_calo] = end;
    m_beginConstCalo[beg_calo] = beg;
    m_endConstCalo[beg_calo] = end;
    m_indexFirstCellCalo[beg_calo] = beg - this->begin();
    m_indexLastCellCalo[beg_calo] = end - this->begin() - 1;
  }
  else {
    CaloCellContainer::iterator beg2 =
      std::partition_point (beg, end, is_calo (beg_calo));
    updateCaloIteratorsOrdered (beg, beg2);
    updateCaloIteratorsOrdered (beg2, end);
  }
}

◆ CaloCellContainerFinalizerTool

friend class CaloCellContainerFinalizerTool

friend

Definition at line 164 of file CaloConstCellContainer.h.

Member Data Documentation

◆ has_virtual

const bool ConstDataVector< CaloCellContainer >::has_virtual

staticinherited

This needs to be forwarded from the base as well.

Definition at line 102 of file ConstDataVector.h.

◆ m_beginCalo

std::vector< CaloCellContainer::iterator > CaloCellContainer::m_beginCalo

privateinherited

non const iterators for the different calorimeters

Definition at line 286 of file CaloCellContainer.h.

◆ m_beginConstCalo

std::vector< CaloCellContainer::const_iterator > CaloCellContainer::m_beginConstCalo

privateinherited

const iterators for the different calorimeters

Definition at line 284 of file CaloCellContainer.h.

◆ m_endCalo

std::vector< CaloCellContainer::iterator > CaloCellContainer::m_endCalo

privateinherited

Definition at line 286 of file CaloCellContainer.h.

◆ m_endConstCalo

std::vector< CaloCellContainer::const_iterator > CaloCellContainer::m_endConstCalo

privateinherited

Definition at line 284 of file CaloCellContainer.h.

◆ m_hasCalo

std::vector<bool> CaloCellContainer::m_hasCalo

privateinherited

true if given cell from given calo has been filled (even if none)

Definition at line 275 of file CaloCellContainer.h.

◆ m_hasTotalSize

bool CaloCellContainer::m_hasTotalSize

privateinherited

true if size correspond to maximum hash.

only CaloCellContainerFinalizer tool is allowed to set this

Definition at line 265 of file CaloCellContainer.h.

◆ m_indexFirstCellCalo

std::vector<int> CaloCellContainer::m_indexFirstCellCalo

privateinherited

index of first cell of given calo (-1 if none)

Definition at line 278 of file CaloCellContainer.h.

◆ m_indexLastCellCalo

std::vector<int> CaloCellContainer::m_indexLastCellCalo

privateinherited

index of first cell of given calo (-2 if none)

Definition at line 281 of file CaloCellContainer.h.

◆ m_isMostDerived

SG::IsMostDerivedFlag DataVector< CaloCell, typename DataVectorBase<CaloCell>::Base >::m_isMostDerived

privateinherited

This flag is true if this DV instance is the most-derived one.

We set this to true in the top-level constructor; the constructor then calls clearMostDerived on the base classes.

Definition at line 2059 of file DataVector.h.

◆ m_isOrdered

bool CaloCellContainer::m_isOrdered

privateinherited

true if ordered

Definition at line 269 of file CaloCellContainer.h.

◆ m_isOrderedAndComplete

bool CaloCellContainer::m_isOrderedAndComplete

privateinherited

true if complete and in right order

Definition at line 272 of file CaloCellContainer.h.

◆ m_lookUpTable

CxxUtils::CachedValue<CxxUtils::PackedArray> CaloCellContainer::m_lookUpTable

privateinherited

look up table of size HashIdentifiermax.

Definition at line 261 of file CaloCellContainer.h.

◆ must_own

bool ConstDataVector< CaloCellContainer >::must_own

staticconstexprinherited

If true, then this type must own its contents.

Definition at line 124 of file ConstDataVector.h.

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

CaloConstCellContainer.h

Public Types

Public Member Functions

Static Public Attributes

Private Types

Private Member Functions

Static Private Member Functions

Private Attributes

Friends

Non-standard operations.

Swap and sort.

Swap and sort.

Internal operations.

Private helpers.

Non-standard operations.

Detailed Description

Member Typedef Documentation

◆ allocator_type

◆ base_data_vector

◆ base_value_type

◆ BaseContainer

◆ CellVector

◆ const_iterator

◆ const_pointer

◆ const_reference

◆ const_reverse_iterator

◆ const_value_type

◆ DataVector_BASE

◆ Deleter

◆ difference_type

◆ DVL_BASE

◆ ElementProxy

◆ isSequence

◆ iterator

◆ MutableCellVector

◆ pointer

◆ PtrVector

◆ reference

◆ reverse_iterator

◆ self

◆ size_type

◆ unique_type

◆ value_type

Constructor & Destructor Documentation

◆ CaloConstCellContainer()

Member Function Documentation

◆ asDataVector()

◆ assign() [1/3]

◆ assign() [2/3]

◆ assign() [3/3]

◆ assignBaseElement()

◆ assignElement() [1/2]

◆ assignElement() [2/2]

◆ at() [1/2]

◆ at() [2/2]

◆ auxbase()

◆ back() [1/2]

◆ back() [2/2]

◆ baseContainer()

◆ baseOffset()

◆ baseOffset1()

◆ begin() [1/2]

◆ begin() [2/2]

◆ beginCalo()

◆ beginConstCalo()

◆ capacity()

◆ cbegin()

◆ cend()

◆ checkOrdered()

◆ checkOrderedAndComplete()

◆ clear() [1/3]

◆ clear() [2/3]

◆ clear() [3/3]

◆ clearMostDerived()

◆ crbegin()

◆ crend()

◆ do_cast()

◆ do_cast_nc()

◆ dv_typeid()

◆ dvlinfo()

◆ dvlinfo_v()