ATLAS Offline Software
Public Types | Public Member Functions | Static Public Member Functions | Public Attributes | Static Public Attributes | Private Member Functions | Private Attributes | Static Private Attributes | List of all members
TRTCond::StrawT0MultChanContainer Class Reference

#include <StrawT0MultChanContainer.h>

Inheritance diagram for TRTCond::StrawT0MultChanContainer:
Collaboration diagram for TRTCond::StrawT0MultChanContainer:

Public Types

typedef StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL >::FlatContainer FlatContainer
 typedefs More...
 
typedef std::pair< const StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > *, const typename DaughterContainer::value_type * > ContainerWithValue
 get a value with the corresponding container. More...
 
typedef unsigned int ChanNum
 
typedef std::vector< ChanNum > ChanVec
 
typedef std::vector< IOVRange > IOVVec
 
typedef ChanVec::const_iterator chan_const_iterator
 
typedef ChanVec::iterator chan_iterator
 
typedef ChanVec::size_type chan_size_type
 
typedef IOVVec::const_iterator iov_const_iterator
 
typedef IOVVec::iterator iov_iterator
 
typedef IOVVec::size_type iov_size_type
 
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 StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > *& reference
 
typedef StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > *const & const_reference
 
typedef BASE::size_type size_type
 
typedef BASE::difference_type difference_type
 
typedef StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * value_type
 
typedef BASE::allocator_type allocator_type
 
typedef StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > ** pointer
 
typedef StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > *const * const_pointer
 
typedef const StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * const_value_type
 
typedef StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL >, BASE > self
 A helper typedef. More...
 

Public Member Functions

 StrawT0MultChanContainer ()
 constructor More...
 
virtual ~StrawT0MultChanContainer ()
 destructor More...
 
float getT0 (const ExpandedIdentifier &id) const
 access to unpacked t0 More...
 
float getT0Err (const ExpandedIdentifier &id) const
 access to unpacked t0 error More...
 
void setT0 (const ExpandedIdentifier &id, float t0, float t0err)
 set t0 More...
 
void unpack (const ExpandedIdentifier &id, const StrawT0 &sd, float &t0, float &t0err) const
 public method to unpack a StrawT0 object More...
 
void setPackingLimits (float t0min, float t0max, float t0errmin, float t0errmax)
 change the packing limits. NOTE: this only works for channels that already exist! More...
 
StatusCode initialize ()
 Initialization done after creation or read back - derived classes may augment the functionality. More...
 
size_t channelId (const ExpandedIdentifier &x) const
 calculate the channel for a given TRT identifier More...
 
size_t layerwheelindex (size_t channelid) const
 calculate layer or wheel index from a channel id More...
 
size_t barrelecindex (size_t channelid) const
 calculate the barrel-ec index from a channel id. More...
 
StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * findContainer (const ExpandedIdentifier &id)
 find a layercontainer from an identifier. More...
 
StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * findContainer (size_t chanid)
 
const StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * getContainer (size_t chanid) const
 get a layercontainer from a channel id. More...
 
void set (const ExpandedIdentifier &id, const typename DaughterContainer::value_type &t)
 set a value More...
 
const DaughterContainer::value_type & get (const ExpandedIdentifier &id) const
 get a value More...
 
const DaughterContainer::value_type & get (const ExpandedIdentifier &id, size_t &resolvelevel) const
 resolve the nesting level More...
 
ContainerWithValue getWithContainer (const ExpandedIdentifier &id) const
 for retrieving t0 values, we need also the container to 'unpack' the t0 More...
 
void clear ()
 clear all layercontainers More...
 
size_t footprint () const
 return the memory allocated by the layercontainers. More...
 
void crunch ()
 crunch the layercontainers. More...
 
void print () const
 dump to standard output More...
 
size_t numObjects () const
 total number of valid calibration objects More...
 
void getall (typename DaughterContainer::FlatContainer &entries) const
 get a flat vector with all values. More...
 
chan_const_iterator chan_begin () const
 Access to Channel numbers via iterators. More...
 
chan_const_iterator chan_end () const
 
chan_size_type chan_size () const
 number of channels More...
 
iov_const_iterator iov_begin () const
 Access to IOVs via iterators. More...
 
iov_const_iterator iov_end () const
 
iov_size_type iov_size () const
 number of IOVs More...
 
IOVRange minRange () const
 Current minimal IOVRange. More...
 
bool hasUniqueIOV () const
 Check whether there is a unique IOV for all channels. More...
 
void add (ChanNum chanNum)
 Adding in channel numbers. More...
 
void add (const IOVRange &range)
 Adding in iov ranges. More...
 
void addNewStop (const IOVTime &stop)
 Add new stop time to minRange - make sure that stop is <= to new stop
More...
 
void resetChannelNumbers ()
 Reset channel numbers - needed to allow sorting. More...
 
CondMultChanCollImpl * implementation ()
 Get implementation. 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 StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * 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 StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * get (size_type n) const
 Access an element, as an rvalue. More...
 
const StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * 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 StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * 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 StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * 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...
 
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 StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * 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 StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * get (size_type n) const
 Access an element, as an rvalue. More...
 
const StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * 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 StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * 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 StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * 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...
 
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 StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * 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 StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * get (size_type n) const
 Access an element, as an rvalue. More...
 
const StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * 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 StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * 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 StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * 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...
 
Element access.

Change the vector capacity to match the current size.

Note: this does not affect auxiliary data.

const StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * get (size_type n) const
 Access an element, as an rvalue. More...
 
const StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * 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 StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * 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 StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * 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 StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * 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...
 
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...
 
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...
 

Static Public Member Functions

static const char * classname ()
 classname used to talk to iovservice 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...
 

Private Member Functions

const DaughterContainer::value_type & dummyVal () const
 dummy value to return when DaughterContainer is empty More...
 

Private Attributes

std::vector< const StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * > m_channelmap
 cached table for fast access from channel to layercontainer More...
 
CondMultChanCollImpl m_impl
 

Static Private Attributes

static const size_t m_defaultschannelid
 now need various forwarding calls for CondMultChanCollection functionality 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 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 resize (size_type sz)
 
void pop_back ()
 
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.

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 StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * do_cast (const typename PtrVector::value_type p)
 Helper to shorten calls to DataModel_detail::DVLCast. More...
 
static StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * do_cast_nc (typename PtrVector::value_type p)
 Helper to shorten calls to DataModel_detail::DVLCast. More...
 
SG::IsMostDerivedFlag m_isMostDerived
 This flag is true if this DV instance is the most-derived one. 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...
 
typedef ROOT_SELECTION_NS::DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL >, DataVector_BASE >::self self
 
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

A COOL Multichannel container for StrawT0 objects

Definition at line 30 of file StrawT0MultChanContainer.h.

Member Typedef Documentation

◆ allocator_type

typedef BASE::allocator_type DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::allocator_type
inherited

Definition at line 816 of file DataVector.h.

◆ base_data_vector

typedef DataVector DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::base_data_vector
inherited

Definition at line 853 of file DataVector.h.

◆ base_value_type

typedef StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::BaseContainer
inherited

Definition at line 806 of file DataVector.h.

◆ chan_const_iterator

typedef ChanVec::const_iterator CondMultChanCollection< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::chan_const_iterator
inherited

Definition at line 58 of file CondMultChanCollection.h.

◆ chan_iterator

typedef ChanVec::iterator CondMultChanCollection< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::chan_iterator
inherited

Definition at line 59 of file CondMultChanCollection.h.

◆ chan_size_type

typedef ChanVec::size_type CondMultChanCollection< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::chan_size_type
inherited

Definition at line 60 of file CondMultChanCollection.h.

◆ ChanNum

typedef unsigned int CondMultChanCollection< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::ChanNum
inherited

Definition at line 55 of file CondMultChanCollection.h.

◆ ChanVec

typedef std::vector<ChanNum> CondMultChanCollection< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::ChanVec
inherited

Definition at line 56 of file CondMultChanCollection.h.

◆ const_iterator

typedef DataModel_detail::const_iterator<DataVector> DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::const_iterator
inherited

Standard const_iterator.

Definition at line 837 of file DataVector.h.

◆ const_pointer

typedef StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * const* DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::const_pointer
inherited

Definition at line 818 of file DataVector.h.

◆ const_reference

typedef StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * const& DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::const_reference
inherited

Definition at line 812 of file DataVector.h.

◆ const_reverse_iterator

typedef std::reverse_iterator<const_iterator> DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::const_reverse_iterator
inherited

Standard const_reverse_iterator.

Definition at line 846 of file DataVector.h.

◆ const_value_type

typedef const StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::const_value_type
inherited

Definition at line 820 of file DataVector.h.

◆ ContainerWithValue

typedef std::pair< const StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > *, const typename DaughterContainer::value_type*> TRTCond::MultChanContainer< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::ContainerWithValue
inherited

get a value with the corresponding container.

the container is needed to unpack the stored class.

Definition at line 82 of file MultChanContainer.h.

◆ DataVector_BASE

typedef BASE DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::DataVector_BASE
inherited

Definition at line 796 of file DataVector.h.

◆ Deleter

using DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::Deleter = typename BASE::Deleter
inherited

Definition at line 856 of file DataVector.h.

◆ difference_type

typedef BASE::difference_type DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::difference_type
inherited

Definition at line 814 of file DataVector.h.

◆ DVL_BASE

typedef BASE DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::DVL_BASE
inherited

Definition at line 797 of file DataVector.h.

◆ ElementProxy

typedef DataModel_detail::ElementProxy<DataVector> DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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.

◆ FlatContainer

typedef StrawT0ContainerTemplate<ExpandedIdentifier::LAYERWHEEL>::FlatContainer TRTCond::StrawT0MultChanContainer::FlatContainer

typedefs

Definition at line 34 of file StrawT0MultChanContainer.h.

◆ iov_const_iterator

typedef IOVVec::const_iterator CondMultChanCollection< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::iov_const_iterator
inherited

Definition at line 61 of file CondMultChanCollection.h.

◆ iov_iterator

typedef IOVVec::iterator CondMultChanCollection< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::iov_iterator
inherited

Definition at line 62 of file CondMultChanCollection.h.

◆ iov_size_type

typedef IOVVec::size_type CondMultChanCollection< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::iov_size_type
inherited

Definition at line 63 of file CondMultChanCollection.h.

◆ IOVVec

typedef std::vector<IOVRange> CondMultChanCollection< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::IOVVec
inherited

Definition at line 57 of file CondMultChanCollection.h.

◆ iterator

typedef DataModel_detail::iterator<DataVector> DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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 StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > ** DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::pointer
inherited

Definition at line 817 of file DataVector.h.

◆ PtrVector

typedef BASE::PtrVector DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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 StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > *& DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::reference
inherited

Definition at line 811 of file DataVector.h.

◆ reverse_iterator

typedef std::reverse_iterator<iterator> DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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<StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , DataVector_BASE>::self DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::self
privateinherited

Definition at line 2042 of file DataVector.h.

◆ self [2/2]

typedef DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE > DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::self
inherited

A helper typedef.

Definition at line 3428 of file DataVector.h.

◆ size_type

typedef BASE::size_type DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::size_type
inherited

Definition at line 813 of file DataVector.h.

◆ unique_type

typedef std::unique_ptr<base_value_type> DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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 StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::value_type
inherited

Definition at line 815 of file DataVector.h.

Constructor & Destructor Documentation

◆ StrawT0MultChanContainer()

TRTCond::StrawT0MultChanContainer::StrawT0MultChanContainer ( )
inline

constructor

Definition at line 37 of file StrawT0MultChanContainer.h.

37 {}

◆ ~StrawT0MultChanContainer()

virtual TRTCond::StrawT0MultChanContainer::~StrawT0MultChanContainer ( )
inlinevirtual

destructor

Definition at line 40 of file StrawT0MultChanContainer.h.

40 {}

Member Function Documentation

◆ add() [1/2]

void CondMultChanCollection< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::add ( ChanNum  chanNum)
inlineinherited

Adding in channel numbers.

Definition at line 89 of file CondMultChanCollection.h.

200 {
201  m_impl.add(chanNum);
202 }

◆ add() [2/2]

void CondMultChanCollection< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::add ( const IOVRange &  range)
inlineinherited

Adding in iov ranges.

Definition at line 92 of file CondMultChanCollection.h.

209 {
210  m_impl.add(range);
211 }

◆ addNewStop()

void CondMultChanCollection< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::addNewStop ( const IOVTime &  stop)
inlineinherited

Add new stop time to minRange - make sure that stop is <= to new stop

Add new stop time to minRange - make sure that stop is <= to new stop.

Definition at line 96 of file CondMultChanCollection.h.

219 {
220  m_impl.addNewStop(stop);
221 }

◆ assign() [1/2]

void DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::assign ( InputIterator  first,
InputIterator  last 
)
inherited

Assign from iterators.

Parameters
firstThe start of the range to put in the container.
lastThe 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::assign ( std::initializer_list< value_type >  l)
inherited
Parameters
lAn 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::assignBaseElement ( typename BaseContainer::iterator  pos,
typename BaseContainer::value_type  newElem 
)
privateinherited

Handle element assignment from a base pointer.

Parameters
posPosition in the container to assign.
newElemThe 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::assignElement ( typename BaseContainer::iterator  pos,
std::unique_ptr< base_value_type >  newElem 
)
privateinherited

Handle element assignment.

Parameters
posPosition in the container to assign.
newElemThe new element to assign.

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

◆ assignElement() [2/2]

void DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::assignElement ( typename BaseContainer::iterator  pos,
value_type  newElem 
)
privateinherited

Handle element assignment.

Parameters
posPosition in the container to assign.
newElemThe 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::at ( size_type  n)
inherited

Access an element, as an lvalue.

Parameters
nArray 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 StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::at ( size_type  n) const
inherited

Access an element, as an rvalue.

Parameters
nArray 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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 StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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.

◆ barrelecindex()

size_t TRTCond::MultChanContainer< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::barrelecindex ( size_t  channelid) const
inlineinherited

calculate the barrel-ec index from a channel id.

(note that this returns 0-3, so not the barrel-ec-ID.)

Definition at line 63 of file MultChanContainer.h.

170  {
171  return channelid!=m_defaultschannelid ? (channelid-1)%4 : 99 ;
172  }

◆ baseOffset()

static int DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::baseOffset ( const std::type_info &  ti)
staticinherited

Return the offset of a base DataVector class.

Parameters
tistd::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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::baseOffset1 ( const char *  p,
const DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > > &  dv,
const std::type_info &  ti 
)
staticinherited

Helper for baseOffset.

Parameters
pPointer to the start of the top-level object.
dvReference to the DataVector object.
tistd::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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::capacity
noexceptinherited

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

◆ cbegin()

const_iterator DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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.

◆ chan_begin()

CondMultChanCollection< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::chan_const_iterator CondMultChanCollection< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::chan_begin
inlineinherited

Access to Channel numbers via iterators.

Definition at line 69 of file CondMultChanCollection.h.

129 {
130  return (m_impl.chan_begin());
131 }

◆ chan_end()

CondMultChanCollection< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::chan_const_iterator CondMultChanCollection< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::chan_end
inlineinherited

Definition at line 70 of file CondMultChanCollection.h.

137 {
138  return (m_impl.chan_end());
139 }

◆ chan_size()

CondMultChanCollection< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::chan_size_type CondMultChanCollection< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::chan_size
inlineinherited

number of channels

Definition at line 73 of file CondMultChanCollection.h.

146 {
147  return (m_impl.chan_size());
148 }

◆ channelId()

size_t TRTCond::MultChanContainer< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::channelId ( const ExpandedIdentifier &  x) const
inlineinherited

calculate the channel for a given TRT identifier

Definition at line 57 of file MultChanContainer.h.

152  {
153  return x.level() >=ExpandedIdentifier::LAYERWHEEL ?
154  1 + x.index(ExpandedIdentifier::BARRELEC) + 4 * x.index(ExpandedIdentifier::LAYERWHEEL) :
155  m_defaultschannelid ;
156  }

◆ classname()

static const char* TRTCond::StrawT0MultChanContainer::classname ( )
inlinestatic

classname used to talk to iovservice

Definition at line 80 of file StrawT0MultChanContainer.h.

80 { return "TRTCond::StrawT0MultChanContainer" ; }

◆ clear() [1/4]

void TRTCond::MultChanContainer< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::clear
inlineinherited

clear all layercontainers

Definition at line 86 of file MultChanContainer.h.

304  {
305  for( typename CondMultChanCollection<DaughterContainer>::iterator it = this->begin() ;
306  it != this->end(); ++it) (*it)->clear() ;
307  }

◆ clear() [2/4]

void DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::clear ( SG::OwnershipPolicy  ownPolicy)
inherited

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

Parameters
ownPolicyThe 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/4]

void DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::clear ( SG::OwnershipPolicy  ownPolicy,
SG::IndexTrackingPolicy  trackIndices 
)
inherited

◆ clear() [4/4]

void DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::clear ( std::unique_ptr< Deleter >  deleter)
inherited

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

Parameters
deleterObject 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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.

◆ crunch()

void TRTCond::MultChanContainer< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::crunch
inlineinherited

crunch the layercontainers.

Definition at line 92 of file MultChanContainer.h.

320  {
321  for( typename CondMultChanCollection<DaughterContainer>::iterator it = this->begin() ;
322  it != this->end(); ++it) (*it)->crunch() ;
323  }

◆ do_cast()

static const StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::do_cast ( const typename PtrVector::value_type  p)
staticinherited

Helper to shorten calls to DataModel_detail::DVLCast.

Parameters
pThe 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 StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::do_cast_nc ( typename PtrVector::value_type  p)
staticinherited

Helper to shorten calls to DataModel_detail::DVLCast.

Parameters
pThe value to convert.
Returns
The value as a T*.

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

◆ dummyVal()

const DaughterContainer::value_type & TRTCond::MultChanContainer< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::dummyVal
inlineprivateinherited

dummy value to return when DaughterContainer is empty

This is a somewhat crazy workaround to handle returning a default value for a templated class.

Definition at line 111 of file MultChanContainer.h.

123  {
124  static typename DaughterContainer::value_type dummyVal;
125  return dummyVal;
126  }

◆ dv_typeid()

virtual const std::type_info& DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::emplace ( iterator  position,
value_type  pElem 
)
inherited

Add a new element to the collection.

Parameters
positionIterator before which the element will be added.
pElemThe 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::emplace_back ( value_type  pElem)
inherited

Add an element to the end of the collection.

Parameters
pElemThe 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::empty
noexceptinherited

Returns true if the collection is empty.

◆ end() [1/2]

const_iterator DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::erase ( iterator  first,
iterator  last 
)
inherited

Remove a range of elements.

Parameters
firstIterator pointing to the first element to be removed.
lastIterator 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::erase ( iterator  position)
inherited

Remove element at a given position.

Parameters
positionIterator 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.

◆ findContainer() [1/2]

StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * TRTCond::MultChanContainer< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::findContainer ( const ExpandedIdentifier &  id)
inlineinherited

find a layercontainer from an identifier.

create it if it does not exist

Definition at line 66 of file MultChanContainer.h.

177  {
178  // on the first call, we insert a container for the default. the default is always the first container.
179  if( id.level()==ExpandedIdentifier::BARRELEC ) {
180  MsgStream log(Athena::getMessageSvc(),"TRTCond::MultChanContainer");
181  log << MSG::WARNING << "Sorry: cannot store containers at BARREL_EC granularity" << endmsg ;
182  }
183  return findContainer( channelId( id ) ) ;
184  }

◆ findContainer() [2/2]

StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * TRTCond::MultChanContainer< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::findContainer ( size_t  chanid)
inlineinherited

Definition at line 67 of file MultChanContainer.h.

189  {
190  // on the first call, we insert a container for the default. the default is always the first container.
191  if(this->size()==0) {
192  this->push_back( new DaughterContainer() ) ;
193  this->add(m_defaultschannelid);
194  }
195  typename CondMultChanCollection<DaughterContainer>::chan_const_iterator chanit =
196  std::find( this->chan_begin(), this->chan_end(), chanid ) ;
197  size_t chanindex = std::distance(this->chan_begin(),chanit) ;
198  if(chanit==this->chan_end()) {
199  // add a new container
200  this->push_back( new DaughterContainer() ) ;
201  this->add(chanid);
202  chanindex = this->size()-1 ; //std::distance(chan_begin(),chan_end())-1 ;
203  // make sure to clear the cache
204  m_channelmap.clear() ;
205  }
206  return this->operator[]( chanindex ) ;
207  }

◆ footprint()

size_t TRTCond::MultChanContainer< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::footprint
inlineinherited

return the memory allocated by the layercontainers.

It does not add the footprint of the CondMultChanCollection itself.

Definition at line 89 of file MultChanContainer.h.

311  {
312  size_t total=0; //= Trait::footprint(m_default) ;
313  for( typename CondMultChanCollection<DaughterContainer>::const_iterator it = this->begin() ;
314  it != this->end(); ++it) total += (*it)->footprint() ;
315  return total ;
316  }

◆ front() [1/2]

ElementProxy DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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 StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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() [1/3]

const DaughterContainer::value_type & TRTCond::MultChanContainer< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::get ( const ExpandedIdentifier &  id) const
inlineinherited

get a value

Definition at line 76 of file MultChanContainer.h.

235  {
236  if( id.level() >= ExpandedIdentifier::LAYERWHEEL ) {
237  const DaughterContainer* container = getContainer( channelId(id) ) ;
238  if( container ) {
239  const typename DaughterContainer::value_type& rc = container->get( id ) ;
240  if( DaughterContainer::trait_type::isvalid(rc) ) return rc ;
241  }
242  }
243  // Throw error if the container is empty.
244  if ( this->size() == 0 ) {
245  size_t len;
246  int s;
247  char* tmp = abi::__cxa_demangle(typeid(this).name(),0,&len,&s);
248  std::string error = std::string(tmp) + std::string(" is empty!!");
249  throw std::runtime_error( error );
250  }
251  return this->front()->get() ;
252  //return operator[]( 0 )->set( t ) ;// m_default ;
253  }

◆ get() [2/3]

const DaughterContainer::value_type & TRTCond::MultChanContainer< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::get ( const ExpandedIdentifier &  id,
size_t &  resolvelevel 
) const
inlineinherited

resolve the nesting level

Definition at line 79 of file MultChanContainer.h.

258  {
259  if( id.level() >= ExpandedIdentifier::LAYERWHEEL ) {
260  const DaughterContainer* container = getContainer( channelId(id) ) ;
261  if( container ) {
262  const typename DaughterContainer::value_type& rc = container->get( id , resolvelevel) ;
263  if( DaughterContainer::trait_type::isvalid(rc) ) return rc ;
264  }
265  }
266  // Throw error if the container is empty.
267  if ( this->size() == 0 ) {
268  size_t len;
269  int s;
270  char* tmp = abi::__cxa_demangle(typeid(this).name(),0,&len,&s);
271  std::string error = std::string(tmp) + std::string(" is empty!!");
272  throw std::runtime_error( error );
273  return dummyVal();
274  }
275  return this->front()->get(id,resolvelevel) ;
276  }

◆ get() [3/3]

const StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::get ( size_type  n) const
inherited

Access an element, as an rvalue.

Parameters
nArray 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).

◆ getall()

void TRTCond::MultChanContainer< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::getall ( typename DaughterContainer::FlatContainer &  entries) const
inlineinherited

get a flat vector with all values.

used for storing constants in a txtfile.

Definition at line 101 of file MultChanContainer.h.

336  {
337  typename CondMultChanCollection<DaughterContainer>::chan_const_iterator chanit = this->chan_begin() ;
338  typename CondMultChanCollection<DaughterContainer>::const_iterator dauit = this->begin() ;
339  for( ; dauit != this->end(); ++dauit, ++chanit) {
340  // get the entries in this subcontainer
341  typename DaughterContainer::FlatContainer newentries ;
342  (*dauit)->getall(newentries) ;
343  // update the identifiers
344  if( dauit == this->begin() ) {
345  // deal with the default value
346  for( typename DaughterContainer::FlatContainer::iterator it = newentries.begin() ; it!= newentries.end(); ++it)
347  it->first= ExpandedIdentifier(0,0,0,0,0,ExpandedIdentifier::DETECTOR) ;
348  } else {
349  for( typename DaughterContainer::FlatContainer::iterator it = newentries.begin() ; it!= newentries.end(); ++it) {
350  it->first.index(ExpandedIdentifier::BARRELEC) = barrelecindex( *chanit) ;
351  it->first.index(ExpandedIdentifier::LAYERWHEEL) = layerwheelindex( *chanit) ;
352  }
353  }
354  entries.insert( entries.end(), newentries.begin(), newentries.end() ) ;
355  }
356  }

◆ getContainer()

const StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * TRTCond::MultChanContainer< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::getContainer ( size_t  chanid) const
inlineinherited

get a layercontainer from a channel id.

uses cache for fast access.

Definition at line 70 of file MultChanContainer.h.

212  {
213  //in the const-version to get the container we rely on the m_channelmap per-filled by initialize
214  //(to be thread-seafe)
215  return chanid < m_channelmap.size() ? m_channelmap[chanid] : nullptr ;
216  }

◆ getT0()

float TRTCond::StrawT0MultChanContainer::getT0 ( const ExpandedIdentifier &  id) const
inline

access to unpacked t0

Definition at line 43 of file StrawT0MultChanContainer.h.

43  {
44  ContainerWithValue valwithcontainer = getWithContainer( id ) ;
45  return StrawT0Trait::isvalid(*valwithcontainer.second) ? valwithcontainer.first->unpackT0( *valwithcontainer.second ) : 0 ;
46  }

◆ getT0Err()

float TRTCond::StrawT0MultChanContainer::getT0Err ( const ExpandedIdentifier &  id) const
inline

access to unpacked t0 error

Definition at line 49 of file StrawT0MultChanContainer.h.

49  {
50  ContainerWithValue valwithcontainer = getWithContainer( id ) ;
51  return StrawT0Trait::isvalid(*valwithcontainer.second) ? valwithcontainer.first->unpackT0Err( *valwithcontainer.second ) : 0 ;
52  }

◆ getWithContainer()

MultChanContainer< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::ContainerWithValue TRTCond::MultChanContainer< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::getWithContainer ( const ExpandedIdentifier &  id) const
inlineinherited

for retrieving t0 values, we need also the container to 'unpack' the t0

Definition at line 83 of file MultChanContainer.h.

282  {
283  if( id.level() >= ExpandedIdentifier::LAYERWHEEL ) {
284  const DaughterContainer* container = getContainer( channelId(id) ) ;
285  if( container ) {
286  const typename DaughterContainer::value_type& value = container->get( id ) ;
287  if( DaughterContainer::trait_type::isvalid(value) ) return ContainerWithValue(container,&value) ;
288  }
289  }
290  // Throw error if the container is empty.
291  if ( this->size() == 0 ) {
292  size_t len;
293  int s;
294  char* tmp = abi::__cxa_demangle(typeid(this).name(),0,&len,&s);
295  std::string error = std::string(tmp) + std::string(" is empty!!");
296  throw std::runtime_error( error );
297  }
298  return ContainerWithValue(this->front(),&(this->front()->get())) ;
299  }

◆ hasUniqueIOV()

bool CondMultChanCollection< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::hasUniqueIOV
inlineinherited

Check whether there is a unique IOV for all channels.

Definition at line 86 of file CondMultChanCollection.h.

191 {
192  return (m_impl.hasUniqueIOV());
193 }

◆ implementation()

CondMultChanCollImpl * CondMultChanCollection< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::implementation
inlineinherited

Get implementation.

Definition at line 106 of file CondMultChanCollection.h.

247 {
248  return &m_impl;
249 }

◆ initialize()

StatusCode TRTCond::MultChanContainer< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::initialize
virtualinherited

Initialization done after creation or read back - derived classes may augment the functionality.

Reimplemented from CondMultChanCollection< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >.

Definition at line 53 of file MultChanContainer.h.

372  {
373 
374  // sanity check to test we have added a default value
375  if( this->size()>0 && *(this->chan_begin()) != m_defaultschannelid ) {
376  MsgStream log(Athena::getMessageSvc(),"TRTCond::MultChanContainer");
377  log << MSG::ERROR << " first channel id is not defaults channel id!" << endmsg ;
378  }
379 
380  // first get the max channel id
381  auto maxchan=std::max_element(this->chan_begin(),this->chan_end());
382  const size_t maxchanid= maxchan==this->chan_end() ? 0 : *maxchan;
383 
384  // now allocate the map and fill it
385  m_channelmap.clear() ;
386  m_channelmap.resize( maxchanid + 1, nullptr ) ;
387  //typename CondMultChanCollection<DaughterContainer>::const_iterator dauit = this->begin() ;
388  auto dauit = this->begin() ;
389  for( auto chanit = this->chan_begin();chanit != this->chan_end(); ++chanit, ++dauit ) {
390  m_channelmap[*chanit] = *dauit ;
391  }
392  return StatusCode::SUCCESS;
393  }

◆ insert() [1/5]

void DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::insert ( iterator  position,
InputIterator  first,
InputIterator  last 
)
inherited

Add a group of new elements to the collection.

Parameters
positionIterator before which the element will be added.
firstThe start of the range to put in the container.
lastThe 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::insert ( iterator  position,
InputIterator  first,
InputIterator  last 
)
inherited

Add a group of new elements to the collection.

Parameters
positionIterator before which the element will be added.
firstThe start of the range to put in the container.
lastThe 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::insert ( iterator  position,
std::initializer_list< value_type >  l 
)
inherited

Add a group of new elements to the collection.

Parameters
positionIterator before which the element will be added.
lAn 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::insert ( iterator  position,
std::unique_ptr< base_value_type >  pElem 
)
inherited

Add a new element to the collection.

Parameters
positionIterator before which the element will be added.
pElemThe 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::insert ( iterator  position,
value_type  pElem 
)
inherited

Add a new element to the collection.

Parameters
positionIterator before which the element will be added.
pElemThe 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::insertMove ( iterator  position,
DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > > &  other 
)
inherited

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

Parameters
positionIterator before which the new elements will be added.
otherThe 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.

◆ iov_begin()

CondMultChanCollection< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::iov_const_iterator CondMultChanCollection< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::iov_begin
inlineinherited

Access to IOVs via iterators.

Definition at line 76 of file CondMultChanCollection.h.

156 {
157  return (m_impl.iov_begin());
158 }

◆ iov_end()

CondMultChanCollection< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::iov_const_iterator CondMultChanCollection< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::iov_end
inlineinherited

Definition at line 77 of file CondMultChanCollection.h.

164 {
165  return (m_impl.iov_end());
166 }

◆ iov_size()

CondMultChanCollection< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::iov_size_type CondMultChanCollection< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::iov_size
inlineinherited

number of IOVs

number of iovs

Definition at line 80 of file CondMultChanCollection.h.

173 {
174  return (m_impl.iov_size());
175 }

◆ iter_swap()

static void DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::iter_swap ( iterator  a,
iterator  b 
)
staticinherited

Swap the referents of two DataVector iterators.

Parameters
aThe first iterator for the swap.
bThe second iterator for the swap.

◆ layerwheelindex()

size_t TRTCond::MultChanContainer< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::layerwheelindex ( size_t  channelid) const
inlineinherited

calculate layer or wheel index from a channel id

Definition at line 60 of file MultChanContainer.h.

162  {
163  return channelid!=m_defaultschannelid ? (channelid-1)/4 : 99 ;
164  }

◆ max_size()

size_type DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::max_size
noexceptinherited

Returns the size() of the largest possible collection.

◆ minRange()

IOVRange CondMultChanCollection< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::minRange
inlineinherited

Current minimal IOVRange.

Definition at line 83 of file CondMultChanCollection.h.

182 {
183  return (m_impl.minRange());
184 }

◆ numObjects()

size_t TRTCond::MultChanContainer< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::numObjects
inherited

total number of valid calibration objects

Definition at line 98 of file MultChanContainer.h.

327  {
328  size_t rc(0) ;
329  for( typename CondMultChanCollection<DaughterContainer>::const_iterator it = this->begin() ;
330  it != this->end(); ++it) rc += (*it)->numObjects() ;
331  return rc ;
332  }

◆ operator[]() [1/2]

ElementProxy DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::operator[] ( size_type  n)
inherited

Access an element, as an lvalue.

Parameters
nArray 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 StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::operator[] ( size_type  n) const
inherited

Access an element, as an rvalue.

Parameters
nArray 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::ownPolicy
inherited

Return the ownership policy setting for this container.

◆ pop_back() [1/2]

void DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::pop_back
inherited

◆ print()

void TRTCond::MultChanContainer< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::print
inlineinherited

dump to standard output

Definition at line 95 of file MultChanContainer.h.

360  {
361  typename CondMultChanCollection<DaughterContainer>::chan_const_iterator chanit = this->chan_begin() ;
362  typename CondMultChanCollection<DaughterContainer>::const_iterator dauit = this->begin() ;
363  for( ; dauit != this->end(); ++dauit, ++chanit) {
364  std::cout << "Now printing channel " << *chanit << " layer/becindex: " << layerwheelindex(*chanit) << " " << barrelecindex(*chanit) << std::endl ;
365  (*dauit)->print() ;
366  }
367  }

◆ push_back() [1/2]

value_type DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::push_back ( std::unique_ptr< base_value_type >  pElem)
inherited

Add an element to the end of the collection.

Parameters
pElemThe 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::push_back ( value_type  pElem)
inherited

Add an element to the end of the collection.

Parameters
pElemThe 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::reserve ( size_type  n)
inherited

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

Parameters
nNumber of elements required.

◆ resetChannelNumbers()

void CondMultChanCollection< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::resetChannelNumbers
inlineinherited

Reset channel numbers - needed to allow sorting.

Definition at line 103 of file CondMultChanCollection.h.

238 {
239  m_impl.resetChannelNumbers();
240 }

◆ resize() [1/2]

void DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::resize ( size_type  sz)
inherited

Resizes the collection to the specified number of elements.

Parameters
szThe 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::resize ( size_type  sz)
inherited

◆ resortAux()

void DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::resortAux ( iterator  beg,
iterator  end 
)
inherited

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

Parameters
begStart of the range of elements to process.
endEnd 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.

◆ set()

void TRTCond::MultChanContainer< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::set ( const ExpandedIdentifier &  id,
const typename DaughterContainer::value_type &  t 
)
inlineinherited

set a value

Definition at line 73 of file MultChanContainer.h.

220  {
221  if( id.level()==ExpandedIdentifier::DETECTOR ) {
222  // set the default value. don't use the id, since it will only confuse the container
223  findContainer(id)->set( t ) ;
224  } else if( id.level()==ExpandedIdentifier::BARRELEC ) {
225  MsgStream log(Athena::getMessageSvc(),"TRTCond::MultChanContainer");
226  log << MSG::WARNING << "Sorry: cannot store containers at BARREL_EC granularity" << endmsg;
227  } else {
228  findContainer(id)->set( id, t ) ;
229  }
230  }

◆ setMostDerived()

virtual void DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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.

◆ setPackingLimits()

void TRTCond::StrawT0MultChanContainer::setPackingLimits ( float  t0min,
float  t0max,
float  t0errmin,
float  t0errmax 
)
inline

change the packing limits. NOTE: this only works for channels that already exist!

Definition at line 83 of file StrawT0MultChanContainer.h.

84  {
85  CondMultChanCollection<StrawT0ContainerTemplate<ExpandedIdentifier::LAYERWHEEL> >::iterator dauit ;
86  for(dauit = this->begin() ; dauit != this->end(); ++dauit)
87  (*dauit)->setPackingLimits( t0min,t0max,t0errmin,t0errmax ) ;
88  }

◆ setT0()

void TRTCond::StrawT0MultChanContainer::setT0 ( const ExpandedIdentifier &  id,
float  t0,
float  t0err 
)
inline

set t0

Definition at line 55 of file StrawT0MultChanContainer.h.

55  {
56  if( id.level()==ExpandedIdentifier::DETECTOR ) {
57  findContainer(id)->setT0(t0,t0err) ;
58  } else if( id.level()==ExpandedIdentifier::BARRELEC ) {
59  MsgStream log(Athena::getMessageSvc(),"StrawT0MultChanContainer");
60  log << MSG::WARNING << "Sorry: cannot store containers at BARREL_EC granularity" << endmsg;
61  } else {
62  findContainer(id)->setT0( id, t0,t0err) ;
63  }
64  }

◆ shift()

void DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::shift ( size_t  pos,
ptrdiff_t  offs 
)
privateinherited

Shift the auxiliary elements of the container.

Parameters
posThe starting index for the shift.
offsThe (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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::shrink_to_fit
inherited

◆ size()

size_type DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::sort
inherited

Sort the container.

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

◆ sort() [2/2]

void DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::sort ( COMPARE  comp)
inherited

Sort the container with a user-specified comparison operator.

Parameters
compFunctional to compare two values.

◆ stdcont()

const PtrVector & DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::swap ( DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > > &  rhs)
inherited

Swap this collection with another.

Parameters
rhsThe 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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
posThe element in the container to swap.
newElemNew element to put in the container. May be 0.
oldElemReference 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::swapElement ( iterator  pos,
value_type  newElem,
reference  oldElem 
)
inherited

Swap one element out of the container.

Parameters
posThe element in the container to swap.
newElemNew element to put in the container. May be 0.
oldElemReference 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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
indexIndex of the element in the container to swap.
newElemNew element to put in the container. May be 0.
oldElemReference 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::swapElement ( size_type  index,
value_type  newElem,
reference  oldElem 
)
inherited

Swap one element out of the container.

Parameters
indexIndex of the element in the container to swap.
newElemNew element to put in the container. May be 0.
oldElemReference 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::testInsert ( const char *  op)
inherited

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

Parameters
opDescription 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::testInsertOol ( const char *  op)
inherited

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

Parameters
opDescription 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.

◆ unpack()

void TRTCond::StrawT0MultChanContainer::unpack ( const ExpandedIdentifier &  id,
const StrawT0 &  sd,
float &  t0,
float &  t0err 
) const
inline

public method to unpack a StrawT0 object

Definition at line 66 of file StrawT0MultChanContainer.h.

66  {
67  const StrawT0LayerContainer* container = getContainer(channelId(id)) ;
68  if(not container){
69  MsgStream log(Athena::getMessageSvc(),"StrawT0MultChanContainer");
70  log << MSG::ERROR << "cannot find container channel" << channelId(id) << endmsg ;
71  } else {
72  container->unpack( sd,t0,t0err ) ;
73  }
74  }

Member Data Documentation

◆ has_virtual

const bool DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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_channelmap

std::vector<const StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > *> TRTCond::MultChanContainer< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::m_channelmap
privateinherited

cached table for fast access from channel to layercontainer

Definition at line 109 of file MultChanContainer.h.

◆ m_defaultschannelid

const size_t TRTCond::MultChanContainer< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::m_defaultschannelid
staticprivateinherited

now need various forwarding calls for CondMultChanCollection functionality

channel identifier for the container with the 'default' value

Definition at line 107 of file MultChanContainer.h.

◆ m_deleter

ROOT_SELECTION_NS::MemberAttributes< kTransient > DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , BASE >::m_deleter
inherited

Definition at line 3436 of file DataVector.h.

◆ m_impl

CondMultChanCollImpl CondMultChanCollection< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::m_impl
privateinherited

Definition at line 110 of file CondMultChanCollection.h.

◆ m_isMostDerived [1/2]

SG::IsMostDerivedFlag DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > , 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:
xAOD::iterator
JetConstituentVector::iterator iterator
Definition: JetConstituentVector.cxx:68
python.SystemOfUnits.s
int s
Definition: SystemOfUnits.py:131
TRTCond::MultChanContainer< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::layerwheelindex
size_t layerwheelindex(size_t channelid) const
calculate layer or wheel index from a channel id
Definition: MultChanContainer.h:161
TRTCond::StrawT0LayerContainer
StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > StrawT0LayerContainer
Definition: StrawT0MultChanContainer.h:25
find
std::string find(const std::string &s)
return a remapped string
Definition: hcg.cxx:135
DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::iterator
DataModel_detail::iterator< DataVector > iterator
Standard iterator.
Definition: DataVector.h:841
CondMultChanCollection< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::chan_begin
chan_const_iterator chan_begin() const
Access to Channel numbers via iterators.
Definition: CondMultChanCollection.h:128
TRTCond::MultChanContainer< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::ContainerWithValue
std::pair< const StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > *, const typename DaughterContainer::value_type * > ContainerWithValue
get a value with the corresponding container.
Definition: MultChanContainer.h:82
CondMultChanCollImpl::minRange
const IOVRange & minRange() const
Current minimal IOVRange.
Definition: CondMultChanCollImpl.h:193
TRTCond::ExpandedIdentifier::BARRELEC
@ BARRELEC
Definition: InnerDetector/InDetConditions/TRT_ConditionsData/TRT_ConditionsData/ExpandedIdentifier.h:37
CondMultChanCollection
A CondMultChanCollection is a template class which can hold a collection of T* objects which are inte...
Definition: CondMultChanCollection.h:52
skel.it
it
Definition: skel.GENtoEVGEN.py:396
TRTCond::NestedContainerBase::set
void set(const ExpandedIdentifier &id, const T &t)
set a value.
Definition: NestedContainer.h:191
ExpandedIdentifier
Definition: DetectorDescription/Identifier/Identifier/ExpandedIdentifier.h:102
athena.value
value
Definition: athena.py:124
PixelModuleFeMask_create_db.stop
int stop
Definition: PixelModuleFeMask_create_db.py:76
TRTCond::MultChanContainer< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::getContainer
const StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * getContainer(size_t chanid) const
get a layercontainer from a channel id.
Definition: MultChanContainer.h:211
TRTCond::MultChanContainer< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::m_channelmap
std::vector< const StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * > m_channelmap
cached table for fast access from channel to layercontainer
Definition: MultChanContainer.h:109
TRTCond::MultChanContainer< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::getWithContainer
ContainerWithValue getWithContainer(const ExpandedIdentifier &id) const
for retrieving t0 values, we need also the container to 'unpack' the t0
Definition: MultChanContainer.h:281
read_hist_ntuple.t
t
Definition: read_hist_ntuple.py:5
TRTCond::MultChanContainer< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::m_defaultschannelid
static const size_t m_defaultschannelid
now need various forwarding calls for CondMultChanCollection functionality
Definition: MultChanContainer.h:107
x
#define x
Athena::getMessageSvc
IMessageSvc * getMessageSvc(bool quiet=false)
Definition: getMessageSvc.cxx:20
python.iconfTool.models.loaders.level
level
Definition: loaders.py:20
CondMultChanCollImpl::resetChannelNumbers
void resetChannelNumbers()
Reset channel numbers - needed to allow sorting.
Definition: CondMultChanCollImpl.h:308
python.selector.AtlRunQuerySelectorLhcOlc.sd
sd
Definition: AtlRunQuerySelectorLhcOlc.py:612
TRTCond::MultChanContainer< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::findContainer
StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * findContainer(const ExpandedIdentifier &id)
find a layercontainer from an identifier.
Definition: MultChanContainer.h:176
TRTCond::StrawT0Trait::isvalid
static bool isvalid(const StrawT0 &x)
Definition: StrawT0Container.h:33
CondMultChanCollection< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::chan_end
chan_const_iterator chan_end() const
Definition: CondMultChanCollection.h:136
checkCoolLatestUpdate.chanNum
chanNum
Definition: checkCoolLatestUpdate.py:27
TRTCond::NestedContainerBase::get
const T & get(const ExpandedIdentifier &id) const
get a value.
Definition: NestedContainer.h:205
endmsg
#define endmsg
Definition: AnalysisConfig_Ntuple.cxx:63
CondMultChanCollection< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::m_impl
CondMultChanCollImpl m_impl
Definition: CondMultChanCollection.h:110
TRTCond::MultChanContainer< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::dummyVal
const DaughterContainer::value_type & dummyVal() const
dummy value to return when DaughterContainer is empty
Definition: MultChanContainer.h:122
CondMultChanCollImpl::chan_begin
chan_const_iterator chan_begin() const
Access to Channel numbers via iterators.
Definition: CondMultChanCollImpl.h:146
CondMultChanCollImpl::chan_size
chan_size_type chan_size() const
number of channels
Definition: CondMultChanCollImpl.h:161
DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::front
const StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * front() const
Access the first element in the collection as an rvalue.
plotBeamSpotVxVal.range
range
Definition: plotBeamSpotVxVal.py:195
TRTCond::MultChanContainer< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::channelId
size_t channelId(const ExpandedIdentifier &x) const
calculate the channel for a given TRT identifier
Definition: MultChanContainer.h:151
TRTCond::ExpandedIdentifier::DETECTOR
@ DETECTOR
Definition: InnerDetector/InDetConditions/TRT_ConditionsData/TRT_ConditionsData/ExpandedIdentifier.h:37
CondMultChanCollImpl::chan_end
chan_const_iterator chan_end() const
Definition: CondMultChanCollImpl.h:153
DeMoUpdate.tmp
string tmp
Definition: DeMoUpdate.py:1167
DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::operator[]
const StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > * operator[](size_type n) const
Access an element, as an rvalue.
CondMultChanCollection< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::add
void add(ChanNum chanNum)
Adding in channel numbers.
Definition: CondMultChanCollection.h:199
name
std::string name
Definition: Control/AthContainers/Root/debug.cxx:221
CondMultChanCollImpl::hasUniqueIOV
bool hasUniqueIOV() const
Check whether there is a unique IOV for all channels.
Definition: CondMultChanCollImpl.h:201
DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::push_back
value_type push_back(value_type pElem)
Add an element to the end of the collection.
CondMultChanCollImpl::add
void add(ChanNum chanNum)
Adding in channel numbers.
Definition: CondMultChanCollImpl.h:232
DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::end
const_iterator end() const noexcept
Return a const_iterator pointing past the end of the collection.
CondMultChanCollImpl::addNewStop
void addNewStop(const IOVTime &stop)
Add new stop time to minRange - make sure that stop is <= to new stop
Definition: CondMultChanCollImpl.h:282
python.CaloCondTools.log
log
Definition: CaloCondTools.py:20
TRTCond::StrawT0ContainerTemplate::setT0
void setT0(const ExpandedIdentifier &id, float t0, float t0err)
set t0
Definition: StrawT0Container.h:70
entries
double entries
Definition: listroot.cxx:49
CondMultChanCollImpl::iov_end
iov_const_iterator iov_end() const
Definition: CondMultChanCollImpl.h:177
CondMultChanCollImpl::iov_begin
iov_const_iterator iov_begin() const
Access to IOVs via iterators.
Definition: CondMultChanCollImpl.h:170
CondMultChanCollImpl::iov_size
iov_size_type iov_size() const
number of IOVs
Definition: CondMultChanCollImpl.h:185
error
Definition: IImpactPoint3dEstimator.h:70
Amg::distance
float distance(const Amg::Vector3D &p1, const Amg::Vector3D &p2)
calculates the distance between two point in 3D space
Definition: GeoPrimitivesHelpers.h:54
DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::size
size_type size() const noexcept
Returns the number of elements in the collection.
python.trfValidateRootFile.rc
rc
Definition: trfValidateRootFile.py:349
DataVector< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::begin
const_iterator begin() const noexcept
Return a const_iterator pointing at the beginning of the collection.
TRTCond::MultChanContainer< StrawT0ContainerTemplate< ExpandedIdentifier::LAYERWHEEL > >::barrelecindex
size_t barrelecindex(size_t channelid) const
calculate the barrel-ec index from a channel id.
Definition: MultChanContainer.h:169
Generated on Thu Nov 7 2024 22:29:54 for ATLAS Offline Software by   doxygen 1.8.18