#include <TrigTrackCountsCollection.h>

Inheritance diagram for TrigTrackCountsCollection:

Collaboration diagram for TrigTrackCountsCollection:

Public Types
typedef BASE	DataVector_BASE

typedef BASE	DVL_BASE

typedef BASE::PtrVector	PtrVector
	This is the type of the underlying `std::vector` (what `stdcont` returns). More...

typedef BASE::PtrVector	BaseContainer

typedef TrigTrackCounts *&	reference

typedef TrigTrackCounts *const &	const_reference

typedef BASE::size_type	size_type

typedef BASE::difference_type	difference_type

typedef TrigTrackCounts *	value_type

typedef BASE::allocator_type	allocator_type

typedef TrigTrackCounts **	pointer

typedef TrigTrackCounts const	const_pointer

typedef const TrigTrackCounts *	const_value_type

typedef TrigTrackCounts	base_value_type
	The `T` value used as the template parameter. More...

typedef std::unique_ptr< base_value_type >	unique_type
	Type of a unique_ptr that can be used to insert elements into this container. More...

typedef DataModel_detail::ElementProxy< DataVector >	ElementProxy
	This type is used to proxy lvalue accesses to `DataVector` elements, in order to handle ownership. More...

typedef DataModel_detail::const_iterator< DataVector >	const_iterator
	Standard `const_iterator`. More...

typedef DataModel_detail::iterator< DataVector >	iterator
	Standard `iterator`. More...

typedef std::reverse_iterator< const_iterator >	const_reverse_iterator
	Standard `const_reverse_iterator`. More...

typedef std::reverse_iterator< iterator >	reverse_iterator
	Standard `reverse_iterator`. More...

typedef DataVector	base_data_vector

using	Deleter = typename BASE::Deleter

typedef DataVector< TrigTrackCounts, BASE >	self
	A helper typedef. More...

Public Member Functions
Size and capacity.
size_type	size () const noexcept
	Returns the number of elements in the collection. More...

void	resize (size_type sz)
	Resizes the collection to the specified number of elements. More...

void	reserve (size_type n)
	Attempt to preallocate enough memory for a specified number of elements. More...

Element access.
Change the vector capacity to match the current size. Note: this does not affect auxiliary data.
const TrigTrackCounts *	operator[] (size_type n) const
	Access an element, as an rvalue. More...

ElementProxy	operator[] (size_type n)
	Access an element, as an lvalue. More...

const TrigTrackCounts *	get (size_type n) const
	Access an element, as an rvalue. More...

const TrigTrackCounts *	at (size_type n) const
	Access an element, as an rvalue. More...

ElementProxy	at (size_type n)
	Access an element, as an lvalue. More...

const TrigTrackCounts *	front () const
	Access the first element in the collection as an rvalue. More...

ElementProxy	front ()
	Access the first element in the collection as an lvalue. More...

const TrigTrackCounts *	back () const
	Access the last element in the collection as an rvalue. More...

ElementProxy	back ()
	Access the last element in the collection as an lvalue. More...

Iterator creation.
const_iterator	begin () const noexcept
	Return a `const_iterator` pointing at the beginning of the collection. More...

iterator	begin () noexcept
	Return an `iterator` pointing at the beginning of the collection. More...

const_iterator	end () const noexcept
	Return a `const_iterator` pointing past the end of the collection. More...

iterator	end () noexcept
	Return an `iterator` pointing past the end of the collection. More...

const_reverse_iterator	rbegin () const noexcept
	Return a `const_reverse_iterator` pointing past the end of the collection. More...

reverse_iterator	rbegin () noexcept
	Return a `reverse_iterator` pointing past the end of the collection. More...

const_reverse_iterator	rend () const noexcept
	Return a `const_reverse_iterator` pointing at the beginning of the collection. More...

reverse_iterator	rend () noexcept
	Return a `reverse_iterator` pointing at the beginning of the collection. More...

const_iterator	cbegin () const noexcept
	Return a `const_iterator` pointing at the beginning of the collection. More...

const_iterator	cend () const noexcept
	Return a `const_iterator` pointing past the end of the collection. More...

const_reverse_iterator	crbegin () const noexcept
	Return a `const_reverse_iterator` pointing past the end of the collection. More...

const_reverse_iterator	crend () const noexcept
	Return a `const_reverse_iterator` pointing at the beginning of the collection. More...

Insertion operations.
value_type	push_back (value_type pElem)
	Add an element to the end of the collection. More...

value_type	push_back (std::unique_ptr< base_value_type > pElem)
	Add an element to the end of the collection. More...

value_type	emplace_back (value_type pElem)
	Add an element to the end of the collection. More...

iterator	insert (iterator position, value_type pElem)
	Add a new element to the collection. More...

iterator	insert (iterator position, std::unique_ptr< base_value_type > pElem)
	Add a new element to the collection. More...

void	insert (iterator position, InputIterator first, InputIterator last)
	Add a group of new elements to the collection. More...

void	insert (iterator position, InputIterator first, InputIterator last)
	Add a group of new elements to the collection. More...

void	insert (iterator position, std::initializer_list< value_type > l)
	Add a group of new elements to the collection. More...

iterator	emplace (iterator position, value_type pElem)
	Add a new element to the collection. More...

void	insertMove (iterator position, DataVector &other)
	Insert the contents of another `DataVector`, with auxiliary data copied via move semantics. More...

Erasure operations.
iterator	erase (iterator position)
	Remove element at a given position. More...

iterator	erase (iterator first, iterator last)
	Remove a range of elements. More...

void	pop_back ()
	Remove the last element from the collection. More...

void	clear ()
	Erase all the elements in the collection. More...

Constructors, destructors, assignment.
void	assign (InputIterator first, InputIterator last)
	Assign from iterators. More...

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

Size and capacity.
size_type	size () const noexcept
	Returns the number of elements in the collection. More...

void	resize (size_type sz)
	Resizes the collection to the specified number of elements. More...

void	reserve (size_type n)
	Attempt to preallocate enough memory for a specified number of elements. More...

Element access.
Change the vector capacity to match the current size. Note: this does not affect auxiliary data.
const TrigTrackCounts *	operator[] (size_type n) const
	Access an element, as an rvalue. More...

ElementProxy	operator[] (size_type n)
	Access an element, as an lvalue. More...

const TrigTrackCounts *	get (size_type n) const
	Access an element, as an rvalue. More...

const TrigTrackCounts *	at (size_type n) const
	Access an element, as an rvalue. More...

ElementProxy	at (size_type n)
	Access an element, as an lvalue. More...

const TrigTrackCounts *	front () const
	Access the first element in the collection as an rvalue. More...

ElementProxy	front ()
	Access the first element in the collection as an lvalue. More...

const TrigTrackCounts *	back () const
	Access the last element in the collection as an rvalue. More...

ElementProxy	back ()
	Access the last element in the collection as an lvalue. More...

Iterator creation.
const_iterator	begin () const noexcept
	Return a `const_iterator` pointing at the beginning of the collection. More...

iterator	begin () noexcept
	Return an `iterator` pointing at the beginning of the collection. More...

const_iterator	end () const noexcept
	Return a `const_iterator` pointing past the end of the collection. More...

iterator	end () noexcept
	Return an `iterator` pointing past the end of the collection. More...

const_reverse_iterator	rbegin () const noexcept
	Return a `const_reverse_iterator` pointing past the end of the collection. More...

reverse_iterator	rbegin () noexcept
	Return a `reverse_iterator` pointing past the end of the collection. More...

const_reverse_iterator	rend () const noexcept
	Return a `const_reverse_iterator` pointing at the beginning of the collection. More...

reverse_iterator	rend () noexcept
	Return a `reverse_iterator` pointing at the beginning of the collection. More...

const_iterator	cbegin () const noexcept
	Return a `const_iterator` pointing at the beginning of the collection. More...

const_iterator	cend () const noexcept
	Return a `const_iterator` pointing past the end of the collection. More...

const_reverse_iterator	crbegin () const noexcept
	Return a `const_reverse_iterator` pointing past the end of the collection. More...

const_reverse_iterator	crend () const noexcept
	Return a `const_reverse_iterator` pointing at the beginning of the collection. More...

Insertion operations.
value_type	push_back (value_type pElem)
	Add an element to the end of the collection. More...

value_type	push_back (std::unique_ptr< base_value_type > pElem)
	Add an element to the end of the collection. More...

value_type	emplace_back (value_type pElem)
	Add an element to the end of the collection. More...

iterator	insert (iterator position, value_type pElem)
	Add a new element to the collection. More...

iterator	insert (iterator position, std::unique_ptr< base_value_type > pElem)
	Add a new element to the collection. More...

void	insert (iterator position, InputIterator first, InputIterator last)
	Add a group of new elements to the collection. More...

void	insert (iterator position, InputIterator first, InputIterator last)
	Add a group of new elements to the collection. More...

void	insert (iterator position, std::initializer_list< value_type > l)
	Add a group of new elements to the collection. More...

iterator	emplace (iterator position, value_type pElem)
	Add a new element to the collection. More...

void	insertMove (iterator position, DataVector &other)
	Insert the contents of another `DataVector`, with auxiliary data copied via move semantics. More...

Erasure operations.
iterator	erase (iterator position)
	Remove element at a given position. More...

iterator	erase (iterator first, iterator last)
	Remove a range of elements. More...

void	pop_back ()
	Remove the last element from the collection. More...

void	clear ()
	Erase all the elements in the collection. More...

Public Attributes
ROOT_SELECTION_NS::MemberAttributes< kTransient >	m_isMostDerived
	Automatically generate dictionary for contained vector. More...

ROOT_SELECTION_NS::MemberAttributes< kTransient >	m_deleter

ROOT_SELECTION_NS::MemberAttributes< kTransient >	m_ownPolicy
	We do not want to save this. More...

Static Public Attributes
static const bool	has_virtual
	This is true for any `DataVector` class if we need to use virtual derivation to get to the base `DataVector` class. More...

static constexpr bool	must_own
	If true, then this type must own its contents. More...

Swap and sort.
void	swap (DataVector &rhs)
	Swap this collection with another. More...

void	sort ()
	Sort the container. More...

void	sort (COMPARE comp)
	Sort the container with a user-specified comparison operator. More...

static void	iter_swap (iterator a, iterator b)
	Swap the referents of two `DataVector` iterators. More...

Non-standard operations.
void	resize (size_type sz)

void	pop_back ()

void	clear (SG::OwnershipPolicy ownPolicy)
	Erase all the elements in the collection, and reset the ownership mode. More...

void	clear (SG::OwnershipPolicy ownPolicy, SG::IndexTrackingPolicy trackIndices)

void	clear (std::unique_ptr< Deleter > deleter)
	Erase all the elements in the collection, and change how elements are to be deleted. More...

void	clear ()

void	clear (SG::OwnershipPolicy ownPolicy, SG::IndexTrackingPolicy trackIndices=SG::DEFAULT_TRACK_INDICES)

void	swapElement (size_type index, value_type newElem, reference oldElem)
	Swap one element out of the container. More...

void	swapElement (iterator pos, value_type newElem, reference oldElem)
	Swap one element out of the container. More...

void	swapElement (size_type index, std::unique_ptr< base_value_type > newElem, std::unique_ptr< base_value_type > &oldElem)
	Swap one element out of the container. More...

void	swapElement (iterator pos, std::unique_ptr< base_value_type > newElem, std::unique_ptr< base_value_type > &oldElem)
	Swap one element out of the container. More...

virtual const DataModel_detail::DVLInfoBase &	dvlinfo_v () const
	Return the DV/DL info struct for this class. More...

const SG::AuxVectorBase &	auxbase () const
	Convert to `AuxVectorBase`. More...

size_type	max_size () const noexcept
	Returns the `size()` of the largest possible collection. More...

size_type	capacity () const noexcept
	Returns the total number of elements that the collection can hold before needing to allocate more memory. More...

bool	empty () const noexcept
	Returns `true` if the collection is empty. More...

void	shrink_to_fit ()

const PtrVector &	stdcont () const
	Return the underlying `std::vector` of the container. More...

SG::OwnershipPolicy	ownPolicy () const
	Return the ownership policy setting for this container. More...

static const DataModel_detail::DVLInfoBase &	dvlinfo ()
	Return the DV/DL info struct for this class. More...

static int	baseOffset (const std::type_info &ti)
	Return the offset of a base `DataVector` class. More...

Internal operations.
typedef ROOT_SELECTION_NS::DataVector< TrigTrackCounts, DataVector_BASE >::self	self

SG::IsMostDerivedFlag	m_isMostDerived
	This flag is true if this DV instance is the most-derived one. More...

void	resortAux (iterator beg, iterator end)
	Reset indices / reorder aux data after elements have been permuted. More...

void	testInsert (const char *op)
	Test if we can insert; raise an exception if not. More...

void	testInsertOol (const char *op)
	Test if we can insert; raise an exception if not. More...

static int	baseOffset1 (const char *p, const DataVector &dv, const std::type_info &ti)
	Helper for `baseOffset`. More...

static const TrigTrackCounts *	do_cast (const typename PtrVector::value_type p)
	Helper to shorten calls to `DataModel_detail::DVLCast`. More...

static TrigTrackCounts *	do_cast_nc (typename PtrVector::value_type p)
	Helper to shorten calls to `DataModel_detail::DVLCast`. More...

void	assignElement (typename BaseContainer::iterator pos, value_type newElem)
	Handle element assignment. More...

void	assignElement (typename BaseContainer::iterator pos, std::unique_ptr< base_value_type > newElem)
	Handle element assignment. More...

void	assignBaseElement (typename BaseContainer::iterator pos, typename BaseContainer::value_type newElem)
	Handle element assignment from a base pointer. More...

void	shift (size_t pos, ptrdiff_t offs)
	Shift the auxiliary elements of the container. More...

virtual const std::type_info &	dv_typeid () const
	Find the most-derived `DataVector` class in the hierarchy. More...

void	clearMostDerived ()
	Clear `m_isMostDerived` for this instance and for all bases. More...

virtual void	setMostDerived ()
	Set `m_isMostDerived` for this instance and clear it for all bases. More...

Detailed Description

Definition at line 13 of file TrigTrackCountsCollection.h.

Member Typedef Documentation

◆ allocator_type

typedef BASE::allocator_type DataVector< TrigTrackCounts , BASE >::allocator_type

inherited

Definition at line 816 of file DataVector.h.

◆ base_data_vector

typedef DataVector DataVector< TrigTrackCounts , BASE >::base_data_vector

inherited

Definition at line 853 of file DataVector.h.

◆ base_value_type

typedef TrigTrackCounts DataVector< TrigTrackCounts , BASE >::base_value_type

inherited

The T value used as the template parameter.

Note that this is different from value_type (that's T*).

Definition at line 824 of file DataVector.h.

◆ BaseContainer

typedef BASE::PtrVector DataVector< TrigTrackCounts , BASE >::BaseContainer

inherited

Definition at line 806 of file DataVector.h.

◆ const_iterator

typedef DataModel_detail::const_iterator<DataVector> DataVector< TrigTrackCounts , BASE >::const_iterator

inherited

Standard const_iterator.

Definition at line 837 of file DataVector.h.

◆ const_pointer

typedef TrigTrackCounts * const* DataVector< TrigTrackCounts , BASE >::const_pointer

inherited

Definition at line 818 of file DataVector.h.

◆ const_reference

typedef TrigTrackCounts * const& DataVector< TrigTrackCounts , BASE >::const_reference

inherited

Definition at line 812 of file DataVector.h.

◆ const_reverse_iterator

typedef std::reverse_iterator<const_iterator> DataVector< TrigTrackCounts , BASE >::const_reverse_iterator

inherited

Standard const_reverse_iterator.

Definition at line 846 of file DataVector.h.

◆ const_value_type

typedef const TrigTrackCounts * DataVector< TrigTrackCounts , BASE >::const_value_type

inherited

Definition at line 820 of file DataVector.h.

◆ DataVector_BASE

typedef BASE DataVector< TrigTrackCounts , BASE >::DataVector_BASE

inherited

Definition at line 796 of file DataVector.h.

◆ Deleter

using DataVector< TrigTrackCounts , BASE >::Deleter = typename BASE::Deleter

inherited

Definition at line 856 of file DataVector.h.

◆ difference_type

typedef BASE::difference_type DataVector< TrigTrackCounts , BASE >::difference_type

inherited

Definition at line 814 of file DataVector.h.

◆ DVL_BASE

typedef BASE DataVector< TrigTrackCounts , BASE >::DVL_BASE

inherited

Definition at line 797 of file DataVector.h.

◆ ElementProxy

typedef DataModel_detail::ElementProxy<DataVector> DataVector< TrigTrackCounts , BASE >::ElementProxy

inherited

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

Definition at line 832 of file DataVector.h.

◆ iterator

typedef DataModel_detail::iterator<DataVector> DataVector< TrigTrackCounts , BASE >::iterator

inherited

Standard iterator.

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

Definition at line 841 of file DataVector.h.

◆ pointer

typedef TrigTrackCounts ** DataVector< TrigTrackCounts , BASE >::pointer

inherited

Definition at line 817 of file DataVector.h.

◆ PtrVector

typedef BASE::PtrVector DataVector< TrigTrackCounts , BASE >::PtrVector

inherited

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

Definition at line 805 of file DataVector.h.

◆ reference

typedef TrigTrackCounts *& DataVector< TrigTrackCounts , BASE >::reference

inherited

Definition at line 811 of file DataVector.h.

◆ reverse_iterator

typedef std::reverse_iterator<iterator> DataVector< TrigTrackCounts , BASE >::reverse_iterator

inherited

Standard reverse_iterator.

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

Definition at line 851 of file DataVector.h.

◆ self [1/2]

typedef ROOT_SELECTION_NS::DataVector<TrigTrackCounts , DataVector_BASE>::self DataVector< TrigTrackCounts , BASE >::self

privateinherited

Definition at line 2042 of file DataVector.h.

◆ self [2/2]

typedef DataVector< TrigTrackCounts , BASE > DataVector< TrigTrackCounts , BASE >::self

inherited

A helper typedef.

Definition at line 3428 of file DataVector.h.

◆ size_type

typedef BASE::size_type DataVector< TrigTrackCounts , BASE >::size_type

inherited

Definition at line 813 of file DataVector.h.

◆ unique_type

typedef std::unique_ptr<base_value_type> DataVector< TrigTrackCounts , BASE >::unique_type

inherited

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

Definition at line 828 of file DataVector.h.

◆ value_type

typedef TrigTrackCounts * DataVector< TrigTrackCounts , BASE >::value_type

inherited

Definition at line 815 of file DataVector.h.

Member Function Documentation

◆ assign() [1/2]

void DataVector< TrigTrackCounts , BASE >::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() [2/2]

void DataVector< TrigTrackCounts , BASE >::assign ( std::initializer_list< value_type > l )

inherited

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 DataVector< TrigTrackCounts , BASE >::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 DataVector< TrigTrackCounts , BASE >::assignElement	(	typename BaseContainer::iterator	pos,
		std::unique_ptr< 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 DataVector< TrigTrackCounts , BASE >::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 DataVector< TrigTrackCounts , BASE >::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 TrigTrackCounts * DataVector< TrigTrackCounts , 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& DataVector< TrigTrackCounts , BASE >::auxbase

inherited

Convert to AuxVectorBase.

Needed to get AuxVectorBase from a ConstDataVector. Present in DataVector as well for consistency. We only really need it in the base class; however, root6 fails constructing a TMethodCall for this if there is virtual derivation. A workaround is to redeclare this in the derived classes too.

◆ back() [1/2]

ElementProxy DataVector< TrigTrackCounts , BASE >::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 TrigTrackCounts * DataVector< TrigTrackCounts , BASE >::back

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.

◆ baseOffset()

static int DataVector< TrigTrackCounts , 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()

static int DataVector< TrigTrackCounts , BASE >::baseOffset1	(	const char *	p,
		const DataVector< TrigTrackCounts > &	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]

const_iterator DataVector< TrigTrackCounts , BASE >::begin

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.

◆ begin() [2/2]

iterator DataVector< TrigTrackCounts , BASE >::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.

◆ capacity()

size_type DataVector< TrigTrackCounts , BASE >::capacity

noexceptinherited

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

◆ cbegin()

const_iterator DataVector< TrigTrackCounts , BASE >::cbegin

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< TrigTrackCounts , BASE >::cend

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.

◆ clear() [1/6]

void DataVector< TrigTrackCounts , BASE >::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/6]

void DataVector< TrigTrackCounts , BASE >::clear

inherited

◆ clear() [3/6]

void DataVector< TrigTrackCounts , BASE >::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() [4/6]

void DataVector< TrigTrackCounts , BASE >::clear	(	SG::OwnershipPolicy	ownPolicy,
		SG::IndexTrackingPolicy	trackIndices
	)

inherited

◆ clear() [5/6]

void DataVector< TrigTrackCounts , BASE >::clear	(	SG::OwnershipPolicy	ownPolicy,
		SG::IndexTrackingPolicy	trackIndices = `SG::DEFAULT_TRACK_INDICES`
	)

inherited

◆ clear() [6/6]

void DataVector< TrigTrackCounts , BASE >::clear ( std::unique_ptr< Deleter > deleter )

inherited

Erase all the elements in the collection, and change how elements are to be deleted.

Parameters

deleter Object to be used to delete object. Passing nullptr will change back to the default.

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. After the current elements are deleted, the Deleter object is changed.

◆ clearMostDerived()

void DataVector< TrigTrackCounts , 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< TrigTrackCounts , BASE >::crbegin

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< TrigTrackCounts , BASE >::crend

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()

static const TrigTrackCounts * DataVector< TrigTrackCounts , 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()

static TrigTrackCounts * DataVector< TrigTrackCounts , 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< TrigTrackCounts , BASE >::dv_typeid

privatevirtualinherited

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()

static const DataModel_detail::DVLInfoBase& DataVector< TrigTrackCounts , 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< TrigTrackCounts , BASE >::dvlinfo_v

virtualinherited

Return the DV/DL info struct for this class.

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

◆ emplace()

iterator DataVector< TrigTrackCounts , 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 DataVector< TrigTrackCounts , BASE >::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< TrigTrackCounts , BASE >::empty

noexceptinherited

Returns true if the collection is empty.

◆ end() [1/2]

const_iterator DataVector< TrigTrackCounts , BASE >::end

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.

◆ end() [2/2]

iterator DataVector< TrigTrackCounts , BASE >::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.

◆ erase() [1/2]

iterator DataVector< TrigTrackCounts , BASE >::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/2]

iterator DataVector< TrigTrackCounts , 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.

◆ front() [1/2]

ElementProxy DataVector< TrigTrackCounts , BASE >::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 TrigTrackCounts * DataVector< TrigTrackCounts , BASE >::front

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 TrigTrackCounts * DataVector< TrigTrackCounts , 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).

◆ insert() [1/5]

void DataVector< TrigTrackCounts , BASE >::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.

This overload is for the case where the iterator value type is convertible to T*.

◆ insert() [2/5]

void DataVector< TrigTrackCounts , BASE >::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.

This overload is for the case where the iterator value type is convertible to unique_ptr<T>.

◆ insert() [3/5]

void DataVector< TrigTrackCounts , BASE >::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() [4/5]

iterator DataVector< TrigTrackCounts , BASE >::insert	(	iterator	position,
		std::unique_ptr< 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() [5/5]

iterator DataVector< TrigTrackCounts , 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< TrigTrackCounts , BASE >::insertMove	(	iterator	position,
		DataVector< TrigTrackCounts > &	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.

◆ iter_swap()

static void DataVector< TrigTrackCounts , 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< TrigTrackCounts , BASE >::max_size

noexceptinherited

Returns the size() of the largest possible collection.

◆ operator[]() [1/2]

ElementProxy DataVector< TrigTrackCounts , BASE >::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 TrigTrackCounts * DataVector< TrigTrackCounts , 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.

◆ ownPolicy()

SG::OwnershipPolicy DataVector< TrigTrackCounts , BASE >::ownPolicy

inherited

Return the ownership policy setting for this container.

◆ pop_back() [1/2]

void DataVector< TrigTrackCounts , BASE >::pop_back

inherited

Remove the last element from the collection.

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

◆ pop_back() [2/2]

void DataVector< TrigTrackCounts , BASE >::pop_back

inherited

◆ push_back() [1/2]

value_type DataVector< TrigTrackCounts , BASE >::push_back ( std::unique_ptr< 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() [2/2]

value_type DataVector< TrigTrackCounts , BASE >::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.

◆ rbegin() [1/2]

const_reverse_iterator DataVector< TrigTrackCounts , BASE >::rbegin

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.

◆ rbegin() [2/2]

reverse_iterator DataVector< TrigTrackCounts , BASE >::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.

◆ rend() [1/2]

const_reverse_iterator DataVector< TrigTrackCounts , BASE >::rend

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.

◆ rend() [2/2]

reverse_iterator DataVector< TrigTrackCounts , BASE >::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.

◆ reserve()

void DataVector< TrigTrackCounts , BASE >::reserve ( size_type n )

inherited

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

Parameters

n	Number of elements required.

◆ resize() [1/2]

void DataVector< TrigTrackCounts , 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().

◆ resize() [2/2]

void DataVector< TrigTrackCounts , BASE >::resize ( size_type sz )

inherited

◆ resortAux()

void DataVector< TrigTrackCounts , 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.

◆ setMostDerived()

virtual void DataVector< TrigTrackCounts , BASE >::setMostDerived

protectedvirtualinherited

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< TrigTrackCounts , 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< TrigTrackCounts , BASE >::shrink_to_fit

inherited

◆ size()

size_type DataVector< TrigTrackCounts , BASE >::size

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() [1/2]

void DataVector< TrigTrackCounts , BASE >::sort

inherited

Sort the container.

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

◆ sort() [2/2]

void DataVector< TrigTrackCounts , BASE >::sort ( COMPARE comp )

inherited

Sort the container with a user-specified comparison operator.

Parameters

comp	Functional to compare two values.

◆ stdcont()

const PtrVector & DataVector< TrigTrackCounts , BASE >::stdcont

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()

void DataVector< TrigTrackCounts , BASE >::swap ( DataVector< TrigTrackCounts > & 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 DataVector< TrigTrackCounts , BASE >::swapElement	(	iterator	pos,
		std::unique_ptr< base_value_type >	newElem,
		std::unique_ptr< 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 DataVector< TrigTrackCounts , BASE >::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 DataVector< TrigTrackCounts , BASE >::swapElement	(	size_type	index,
		std::unique_ptr< base_value_type >	newElem,
		std::unique_ptr< 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 DataVector< TrigTrackCounts , BASE >::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< TrigTrackCounts , 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< TrigTrackCounts , 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.

Member Data Documentation

◆ has_virtual

const bool DataVector< TrigTrackCounts , BASE >::has_virtual

staticinherited

This is true for any DataVector class if we need to use virtual derivation to get to the base DataVector class.

Definition at line 801 of file DataVector.h.

◆ m_deleter

ROOT_SELECTION_NS::MemberAttributes< kTransient > DataVector< TrigTrackCounts , BASE >::m_deleter

inherited

Definition at line 3436 of file DataVector.h.

◆ m_isMostDerived [1/2]

SG::IsMostDerivedFlag DataVector< TrigTrackCounts , 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 2038 of file DataVector.h.

◆ m_isMostDerived [2/2]

ROOT_SELECTION_NS::MemberAttributes< kTransient > DataVector< TrigTrackCounts , BASE >::m_isMostDerived

inherited

Automatically generate dictionary for contained vector.

Declare the automatically created variable transient

Definition at line 3435 of file DataVector.h.

◆ m_ownPolicy

ROOT_SELECTION_NS::MemberAttributes< kTransient > DataVector< TrigTrackCounts , BASE >::m_ownPolicy

inherited

We do not want to save this.

The P->T converter should decide the ownership mode.

Definition at line 3440 of file DataVector.h.

◆ must_own

constexpr bool DataVector< TrigTrackCounts , BASE >::must_own

staticconstexprinherited

If true, then this type must own its contents.

Definition at line 859 of file DataVector.h.

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

TrigTrackCountsCollection.h

Public Types

Public Member Functions

Public Attributes

Static Public Attributes

Swap and sort.

Non-standard operations.

Internal operations.

Detailed Description

Member Typedef Documentation

◆ allocator_type

◆ base_data_vector

◆ base_value_type

◆ BaseContainer

◆ const_iterator

◆ const_pointer

◆ const_reference

◆ const_reverse_iterator

◆ const_value_type

◆ DataVector_BASE

◆ Deleter

◆ difference_type

◆ DVL_BASE

◆ ElementProxy

◆ iterator

◆ pointer

◆ PtrVector

◆ reference

◆ reverse_iterator

◆ self [1/2]

◆ self [2/2]

◆ size_type

◆ unique_type

◆ value_type

Member Function Documentation

◆ assign() [1/2]

◆ assign() [2/2]

◆ assignBaseElement()

◆ assignElement() [1/2]

◆ assignElement() [2/2]

◆ at() [1/2]

◆ at() [2/2]

◆ auxbase()

◆ back() [1/2]

◆ back() [2/2]

◆ baseOffset()

◆ baseOffset1()

◆ begin() [1/2]

◆ begin() [2/2]

◆ capacity()

◆ cbegin()

◆ cend()

◆ clear() [1/6]

◆ clear() [2/6]

◆ clear() [3/6]

◆ clear() [4/6]

◆ clear() [5/6]

◆ clear() [6/6]

◆ clearMostDerived()

◆ crbegin()

◆ crend()

◆ do_cast()

◆ do_cast_nc()

◆ dv_typeid()

◆ dvlinfo()

◆ dvlinfo_v()

◆ emplace()

◆ emplace_back()

◆ empty()

◆ end() [1/2]

◆ end() [2/2]

◆ erase() [1/2]

◆ erase() [2/2]

◆ front() [1/2]

◆ front() [2/2]

◆ get()

◆ insert() [1/5]

◆ insert() [2/5]

◆ insert() [3/5]

◆ insert() [4/5]

◆ insert() [5/5]