 |
ATLAS Offline Software
|
|
ATLAS Offline Software
|
#include <StrawT0MultChanContainer.h>
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... | |
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::Meta::Selection::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... | |
A COOL Multichannel container for StrawT0 objects
Definition at line 30 of file StrawT0MultChanContainer.h.
|
inherited |
Definition at line 816 of file DataVector.h.
| inherited |
Definition at line 853 of file DataVector.h.
| 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.
|
inherited |
Definition at line 806 of file DataVector.h.
|
inherited |
Definition at line 58 of file CondMultChanCollection.h.
|
inherited |
Definition at line 59 of file CondMultChanCollection.h.
|
inherited |
Definition at line 60 of file CondMultChanCollection.h.
|
inherited |
Definition at line 55 of file CondMultChanCollection.h.
|
inherited |
Definition at line 56 of file CondMultChanCollection.h.
| inherited |
Standard const_iterator.
Definition at line 837 of file DataVector.h.
| inherited |
Definition at line 818 of file DataVector.h.
| inherited |
Definition at line 812 of file DataVector.h.
|
inherited |
Standard const_reverse_iterator.
Definition at line 846 of file DataVector.h.
| inherited |
Definition at line 820 of file DataVector.h.
|
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.
|
inherited |
Definition at line 796 of file DataVector.h.
|
inherited |
Definition at line 856 of file DataVector.h.
|
inherited |
Definition at line 814 of file DataVector.h.
|
inherited |
Definition at line 797 of file DataVector.h.
| 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.
| typedef StrawT0ContainerTemplate<ExpandedIdentifier::LAYERWHEEL>::FlatContainer TRTCond::StrawT0MultChanContainer::FlatContainer |
typedefs
Definition at line 34 of file StrawT0MultChanContainer.h.
|
inherited |
Definition at line 61 of file CondMultChanCollection.h.
|
inherited |
Definition at line 62 of file CondMultChanCollection.h.
|
inherited |
Definition at line 63 of file CondMultChanCollection.h.
|
inherited |
Definition at line 57 of file CondMultChanCollection.h.
| inherited |
Standard iterator.
Note that lvalue references here will yield an ElementProxy, not a reference.
Definition at line 841 of file DataVector.h.
| inherited |
Definition at line 817 of file DataVector.h.
|
inherited |
This is the type of the underlying std::vector (what stdcont returns).
Definition at line 805 of file DataVector.h.
| inherited |
Definition at line 811 of file DataVector.h.
|
inherited |
Standard reverse_iterator.
Note that lvalue references here will yield an ElementProxy, not a reference.
Definition at line 851 of file DataVector.h.
| privateinherited |
Definition at line 2042 of file DataVector.h.
|
inherited |
Definition at line 813 of file DataVector.h.
|
inherited |
Type of a unique_ptr that can be used to insert elements into this container.
Definition at line 828 of file DataVector.h.
| inherited |
Definition at line 815 of file DataVector.h.
|
inline |
|
inlinevirtual |
|
inlineinherited |
Adding in channel numbers.
Definition at line 89 of file CondMultChanCollection.h.
|
inlineinherited |
Adding in iov ranges.
Definition at line 92 of file CondMultChanCollection.h.
|
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.
|
inherited |
Assign from iterators.
| first | The start of the range to put in the container. |
| last | The end of the range to put in the container. |
Any existing owned elements will be released. The DataVector's ownership policy determines whether it will take ownership of the new elements.
|
inherited |
| l | An initializer list. |
Any existing owned elements will be released. The DataVector's ownership policy determines whether it will take ownership of the new elements.
|
privateinherited |
Handle element assignment from a base pointer.
| pos | Position in the container to assign. |
| newElem | The new element to assign. |
The old element is freed if this container owns elements. Auxiliary data are copied if appropriate.
|
privateinherited |
Handle element assignment.
| pos | Position in the container to assign. |
| newElem | The new element to assign. |
The container must own its elements. Auxiliary data are copied if appropriate.
|
privateinherited |
Handle element assignment.
| pos | Position in the container to assign. |
| newElem | The new element to assign. |
The old element is freed if this container owns elements. Auxiliary data are copied if appropriate.
|
inherited |
Access an element, as an lvalue.
| n | Array index to access. |
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.
|
inherited |
Access an element, as an rvalue.
| n | Array index to access. |
Will raise std::out_of_range if the index is out-of-bounds. Note that we return a const T* rather than a reference.
|
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.
|
inherited |
Access the last element in the collection as an lvalue.
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.
| inherited |
Access the last element in the collection as an rvalue.
No checking is done to ensure that the container is not empty. Note that we return a const T* rather than a reference.
|
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.
|
staticinherited |
Return the offset of a base DataVector class.
| ti | std::type_info of the desired class. |
If ti represents a DataVector base class of this one, then return the offset of that base class. Otherwise, return -1.
This function is here due to limitations of root 6, which can't calculate these offsets correctly from the dictionary if virtual derivation is used.
|
staticinherited |
Helper for baseOffset.
| p | Pointer to the start of the top-level object. |
| dv | Reference to the DataVector object. |
| ti | std::type_info of the desired class. |
If ti represents a DataVector base class of this one, then return the offset of that base class. Otherwise, return -1.
|
noexceptinherited |
Return a const_iterator pointing at the beginning of the collection.
const_iterator.Note that dereferencing the iterator will yield a const T* rather than a reference.
|
noexceptinherited |
Return an iterator pointing at the beginning of the collection.
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.
|
noexceptinherited |
Returns the total number of elements that the collection can hold before needing to allocate more memory.
|
noexceptinherited |
Return a const_iterator pointing at the beginning of the collection.
const_iterator.Note that dereferencing the iterator will yield a const T* rather than a reference.
|
noexceptinherited |
Return a const_iterator pointing past the end of the collection.
const_iterator.Note that dereferencing the iterator will yield a const T* rather than a reference.
| inlineinherited |
Access to Channel numbers via iterators.
Definition at line 69 of file CondMultChanCollection.h.
| inlineinherited |
Definition at line 70 of file CondMultChanCollection.h.
|
inlineinherited |
number of channels
Definition at line 73 of file CondMultChanCollection.h.
|
inlineinherited |
|
inlinestatic |
classname used to talk to iovservice
Definition at line 80 of file StrawT0MultChanContainer.h.
|
inlineinherited |
clear all layercontainers
Definition at line 86 of file MultChanContainer.h.
|
inherited |
Erase all the elements in the collection, and reset the ownership mode.
| ownPolicy | The new ownership policy of the container. |
If the container owns its elements, then the removed elements will be deleted. Any duplicates will be removed in this process, but don't rely on this.
|
inherited |
|
inherited |
Erase all the elements in the collection, and change how elements are to be deleted.
| deleter | Object to be used to delete object. Passing nullptr will change back to the default. |
If the container owns its elements, then the removed elements will be deleted. Any duplicates will be removed in this process, but don't rely on this. After the current elements are deleted, the Deleter object is changed.
|
protectedinherited |
Clear m_isMostDerived for this instance and for all bases.
Called from the constructor after setting m_isMostDerived.
|
noexceptinherited |
Return a const_reverse_iterator pointing past the end of the collection.
const_reverse_iterator.Note that dereferencing the iterator will yield a const T* rather than a reference.
|
noexceptinherited |
Return a const_reverse_iterator pointing at the beginning of the collection.
const_reverse_iterator.Note that dereferencing the iterator will yield a const T* rather than a reference.
|
inlineinherited |
crunch the layercontainers.
Definition at line 92 of file MultChanContainer.h.
|
staticinherited |
Helper to shorten calls to DataModel_detail::DVLCast.
| p | The value to convert. |
const T*.The conversion will be done with static_cast if possible, with dynamic_cast otherwise.
|
staticinherited |
Helper to shorten calls to DataModel_detail::DVLCast.
| p | The value to convert. |
T*.The conversion will be done with static_cast if possible, with dynamic_cast otherwise.
|
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.
|
privatevirtualinherited |
Find the most-derived DataVector class in the hierarchy.
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.
|
staticinherited |
Return the DV/DL info struct for this class.
This can be used to make sure that it's instantiated.
|
virtualinherited |
Return the DV/DL info struct for this class.
This can be used to make sure that it's instantiated.
|
inherited |
Add a new element to the collection.
| position | Iterator before which the element will be added. |
| pElem | The element to add to the collection. |
The container's ownership policy will determine if it takes ownership of the new element.
Note: this method may only be called using the most derived DataVector in the hierarchy.
For DataVector, this is just the same as insert. It's included just for interface compatibility with std::vector.
|
inherited |
Add an element to the end of the collection.
| pElem | The element to add to the collection. |
The container's ownership policy will determine if it takes ownership of the new element.
Note: this method may only be called using the most derived DataVector in the hierarchy.
For DataVector, this is like the same as push_back, and it returns the pushed element. It's included just for interface compatibility with std::vector.
|
noexceptinherited |
Returns true if the collection is empty.
|
noexceptinherited |
Return a const_iterator pointing past the end of the collection.
const_iterator.Note that dereferencing the iterator will yield a const T* rather than a reference.
|
noexceptinherited |
Return an iterator pointing past the end of the collection.
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.
|
inherited |
Remove a range of elements.
| first | Iterator pointing to the first element to be removed. |
| last | Iterator pointing one past the last element to be removed. |
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.
|
inherited |
Remove element at a given position.
| position | Iterator pointing to the element to be removed. |
end()).If the container owns its elements, then the pointed-to element will be deleted.
|
inlineinherited |
find a layercontainer from an identifier.
create it if it does not exist
Definition at line 66 of file MultChanContainer.h.
|
inlineinherited |
Definition at line 67 of file MultChanContainer.h.
|
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.
|
inherited |
Access the first element in the collection as an lvalue.
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.
| inherited |
Access the first element in the collection as an rvalue.
No checking is done to ensure that the container is not empty. Note that we return a const T* rather than a reference.
|
inlineinherited |
|
inlineinherited |
|
inherited |
Access an element, as an rvalue.
| n | Array index to access. |
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).
|
inlineinherited |
get a flat vector with all values.
used for storing constants in a txtfile.
Definition at line 101 of file MultChanContainer.h.
|
inlineinherited |
get a layercontainer from a channel id.
uses cache for fast access.
Definition at line 70 of file MultChanContainer.h.
|
inline |
access to unpacked t0
Definition at line 43 of file StrawT0MultChanContainer.h.
|
inline |
access to unpacked t0 error
Definition at line 49 of file StrawT0MultChanContainer.h.
|
inlineinherited |
for retrieving t0 values, we need also the container to 'unpack' the t0
Definition at line 83 of file MultChanContainer.h.
|
inlineinherited |
Check whether there is a unique IOV for all channels.
Definition at line 86 of file CondMultChanCollection.h.
|
inlineinherited |
Get implementation.
Definition at line 106 of file CondMultChanCollection.h.
|
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.
|
inherited |
Add a group of new elements to the collection.
| position | Iterator before which the element will be added. |
| first | The start of the range to put in the container. |
| last | The end of the range to put in the container. |
The container's ownership policy will determine if it takes ownership of the new element.
Note: this method may only be called using the most derived DataVector in the hierarchy.
This overload is for the case where the iterator value type is convertible to T*.
|
inherited |
Add a group of new elements to the collection.
| position | Iterator before which the element will be added. |
| first | The start of the range to put in the container. |
| last | The end of the range to put in the container. |
The container's ownership policy will determine if it takes ownership of the new element.
Note: this method may only be called using the most derived DataVector in the hierarchy.
This overload is for the case where the iterator value type is convertible to unique_ptr<T>.
|
inherited |
Add a group of new elements to the collection.
| position | Iterator before which the element will be added. |
| l | An initializer list. |
The container's ownership policy will determine if it takes ownership of the new element.
Note: this method may only be called using the most derived DataVector in the hierarchy.
|
inherited |
Add a new element to the collection.
| position | Iterator before which the element will be added. |
| pElem | The element to add to the collection. |
The container must be an owning container.
Note: this method may only be called using the most derived DataVector in the hierarchy.
|
inherited |
Add a new element to the collection.
| position | Iterator before which the element will be added. |
| pElem | The element to add to the collection. |
The container's ownership policy will determine if it takes ownership of the new element.
Note: this method may only be called using the most derived DataVector in the hierarchy.
|
inherited |
Insert the contents of another DataVector, with auxiliary data copied via move semantics.
| position | Iterator before which the new elements will be added. |
| other | The vector to add. |
The ownership mode of this vector must be the same as other; otherwise, an exception will be thrown.
If both vectors are view vectors, then this is the same as insert (position, other.begin(), other.end()) .
Otherwise, the elements from other will be inserted into this vector. This vector will take ownership of the elements, and the ownership mode of other will be changed to VIEW_ELEMENTS. Auxiliary data for these elements will be transferred, using move semantics if possible. (Thus, the auxiliary store for other may be modified and must not be locked.) Finally, the auxiliary store pointer for other will be cleared (but the store itself will not be deleted since it's not owned by the vector).
Note: this method may only be called using the most derived DataVector in the hierarchy.
| inlineinherited |
Access to IOVs via iterators.
Definition at line 76 of file CondMultChanCollection.h.
|
inlineinherited |
Definition at line 77 of file CondMultChanCollection.h.
|
inlineinherited |
|
staticinherited |
Swap the referents of two DataVector iterators.
| a | The first iterator for the swap. |
| b | The second iterator for the swap. |
|
inlineinherited |
calculate layer or wheel index from a channel id
Definition at line 60 of file MultChanContainer.h.
|
noexceptinherited |
Returns the size() of the largest possible collection.
|
inlineinherited |
Current minimal IOVRange.
Definition at line 83 of file CondMultChanCollection.h.
|
inherited |
total number of valid calibration objects
Definition at line 98 of file MultChanContainer.h.
|
inherited |
Access an element, as an lvalue.
| n | Array index to access. |
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.
|
inherited |
Access an element, as an rvalue.
| n | Array index to access. |
No bounds checking is done. Note that we return a const T* rather than a reference.
|
inherited |
Return the ownership policy setting for this container.
|
inherited |
Remove the last element from the collection.
If the container owns its elements, then the removed element will be deleted.
|
inherited |
|
inlineinherited |
dump to standard output
Definition at line 95 of file MultChanContainer.h.
|
inherited |
Add an element to the end of the collection.
| pElem | The element to add to the collection. |
The container must be an owning container.
Note: this method may only be called using the most derived DataVector in the hierarchy.
Returns the pushed pointer.
|
inherited |
Add an element to the end of the collection.
| pElem | The element to add to the collection. |
The container's ownership policy will determine if it takes ownership of the new element.
Note: this method may only be called using the most derived DataVector in the hierarchy.
Returns the pushed pointer.
|
noexceptinherited |
Return a const_reverse_iterator pointing past the end of the collection.
const_reverse_iterator.Note that dereferencing the iterator will yield a const T* rather than a reference.
|
noexceptinherited |
Return a reverse_iterator pointing past the end of the collection.
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.
|
noexceptinherited |
Return a const_reverse_iterator pointing at the beginning of the collection.
const_reverse_iterator.Note that dereferencing the iterator will yield a const T* rather than a reference.
|
noexceptinherited |
Return a reverse_iterator pointing at the beginning of the collection.
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.
|
inherited |
Attempt to preallocate enough memory for a specified number of elements.
| n | Number of elements required. |
|
inlineinherited |
Reset channel numbers - needed to allow sorting.
Definition at line 103 of file CondMultChanCollection.h.
|
inherited |
Resizes the collection to the specified number of elements.
| sz | The new size of the collection. |
Note that this function differs from the standard in that it does not allow specifying the value of any inserted elements. They will always be 0.
If the container is shrunk, elements will be deleted as with erase().
|
inherited |
|
inherited |
Reset indices / reorder aux data after elements have been permuted.
| beg | Start of the range of elements to process. |
| end | End of the range of elements to process. |
Call this after some operation that has permuted the elements in the container (such as sort). The index information in the elements will be used to permute all auxiliary data in the same way. Finally, all the indices will be reset in the correct order.
|
inlineinherited |
|
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.
|
inline |
change the packing limits. NOTE: this only works for channels that already exist!
Definition at line 83 of file StrawT0MultChanContainer.h.
|
inline |
|
privateinherited |
Shift the auxiliary elements of the container.
| pos | The starting index for the shift. |
| offs | The (signed) amount of the shift. |
The elements in the container should have already been shifted; this operation will then adjust the element indices and also shift the elements in the vectors for all aux data items. offs may be either positive or negative.
If offs is positive, then the container is growing. The container size should be increased by offs, the element at pos moved to pos + offs, and similarly for following elements. The elements between pos and pos + offs should be default-initialized.
If offs is negative, then the container is shrinking. The element at pos should be moved to pos + offs, and similarly for following elements. The container should then be shrunk by -offs elements (running destructors as appropriate).
|
inherited |
|
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.
|
inherited |
Sort the container.
This just sorts by pointer value, so it's probably not very useful.
|
inherited |
Sort the container with a user-specified comparison operator.
| comp | Functional to compare two values. |
|
inherited |
Return the underlying std::vector of the container.
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.
|
inherited |
Swap this collection with another.
| rhs | The collection with which to swap. |
Ownership is swapped along with the collection content.
Note: this method may only be called using the most-derived DataVector in the hierarchy. The rhs must also be referenced using the most-derived DataVector.
|
inherited |
Swap one element out of the container.
| pos | The element in the container to swap. |
| newElem | New element to put in the container. May be 0. |
| oldElem | Reference to receive the element removed from the container. |
Reference oldElem is initialized with element pos of the collection (no bounds checking). Then element index is set to newElem.
The collection must own its elements to use its interface. The collection will take ownership of newElem and will return ownership of oldElem.
Note: this method may only be called using the most derived DataList in the hierarchy.
|
inherited |
Swap one element out of the container.
| pos | The element in the container to swap. |
| newElem | New element to put in the container. May be 0. |
| oldElem | Reference to receive the element removed from the container. |
Reference oldElem is initialized with element pos of the collection (no bounds checking). Then element index is set to newElem. If the collection owns its elements, then it will take ownership of newElem and release (without deleting) the element returned through oldElem.
Note: this method may only be called using the most derived DataList in the hierarchy.
|
inherited |
Swap one element out of the container.
| index | Index of the element in the container to swap. |
| newElem | New element to put in the container. May be 0. |
| oldElem | Reference to receive the element removed from the container. |
Reference oldElem is initialized with element index of the collection (no bounds checking). Then element index is set to newElem.
The collection must own its elements to use its interface. The collection will take ownership of newElem and will return ownership of oldElem.
Note: this method may only be called using the most derived DataVector in the hierarchy.
|
inherited |
Swap one element out of the container.
| index | Index of the element in the container to swap. |
| newElem | New element to put in the container. May be 0. |
| oldElem | Reference to receive the element removed from the container. |
Reference oldElem is initialized with element index of the collection (no bounds checking). Then element index is set to newElem. If the collection owns its elements, then it will take ownership of newElem and release (without deleting) the element returned through oldElem.
Note: this method may only be called using the most derived DataVector in the hierarchy.
|
inherited |
Test if we can insert; raise an exception if not.
| op | Description of the attempted operation. |
In order to maintain type-safety, we can only allow insertions using the most-derived instance of DataVector. This checks this by testing the m_isMostDerived, which is set by the constructors to true only for the most-derived instance. If the test fails, we call to potentially out-of-line code to continue.
|
inherited |
Test if we can insert; raise an exception if not.
| op | Description of the attempted operation. |
This continues the test of testInsert. There is one case where m_isMostDerived may not be set correctly. If this container was made via copy construction, then all the m_isMostDerived flags will be false. So we call setMostDerived to set the flags correctly and test again. If the test fails again, then we raise an exception.
|
inline |
|
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.
|
privateinherited |
cached table for fast access from channel to layercontainer
Definition at line 109 of file MultChanContainer.h.
|
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.
|
privateinherited |
Definition at line 110 of file CondMultChanCollection.h.
|
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.
|
staticconstexprinherited |
If true, then this type must own its contents.
Definition at line 859 of file DataVector.h.
1.8.18