#include <InternalOfflineMap.h>
Definition at line 20 of file InternalOfflineMap.h.
◆ hashPair
◆ InternalConstItr
◆ InternalOfflineMap()
InternalOfflineMap::InternalOfflineMap |
( |
size_t |
max | ) |
|
◆ ~InternalOfflineMap()
virtual EventContainers::InternalOfflineMap::~InternalOfflineMap |
( |
| ) |
|
|
virtualdefault |
◆ addLock()
◆ cbegin()
◆ cend()
◆ cleanUp()
void InternalOfflineMap::cleanUp |
( |
deleter_f * |
deleter | ) |
|
|
overridevirtualnoexcept |
◆ destructor()
void InternalOfflineMap::destructor |
( |
deleter_f * |
deleter | ) |
|
|
overridevirtualnoexcept |
◆ fetchOrCreate() [1/2]
◆ fetchOrCreate() [2/2]
◆ findIndexPtr()
◆ fullSize()
virtual size_t EventContainers::InternalOfflineMap::fullSize |
( |
| ) |
const |
|
inlineoverridevirtualnoexcept |
◆ getAllCurrentHashes()
std::vector< IdentifierHash > InternalOfflineMap::getAllCurrentHashes |
( |
| ) |
const |
|
overridevirtual |
◆ getAllHashPtrPair()
◆ indexFind()
◆ insert()
◆ numberOfCollections()
size_t InternalOfflineMap::numberOfCollections |
( |
| ) |
const |
|
overridevirtual |
◆ removeCollection()
◆ tryAddFromCache() [1/2]
◆ tryAddFromCache() [2/2]
◆ wait()
void InternalOfflineMap::wait |
( |
| ) |
const |
|
overridevirtual |
Implements EventContainers::I_InternalIDC.
Definition at line 24 of file InternalOfflineMap.cxx.
25 std::scoped_lock lock (m_waitMutex);
26 if(m_needsupdate.load(std::memory_order_acquire) ==
false)
return;
30 m_map.emplace_back(pair.first, pair.second);
33 m_needsupdate.store(
false, std::memory_order_release);
◆ ATLAS_THREAD_SAFE [1/3]
◆ ATLAS_THREAD_SAFE [2/3]
std::mutex m_waitMutex EventContainers::InternalOfflineMap::ATLAS_THREAD_SAFE |
|
mutableprivate |
◆ ATLAS_THREAD_SAFE [3/3]
std::atomic<bool> m_needsupdate EventContainers::InternalOfflineMap::ATLAS_THREAD_SAFE |
|
mutableprivate |
◆ m_fullMap
◆ m_maxsize
const size_t EventContainers::InternalOfflineMap::m_maxsize |
|
private |
The documentation for this class was generated from the following files:
void search(TDirectory *td, const std::string &s, std::string cwd, node *n)
recursive directory search for TH1 and TH2 and TProfiles
void sort(typename std::reverse_iterator< DataModel_detail::iterator< DVL > > beg, typename std::reverse_iterator< DataModel_detail::iterator< DVL > > end, const Compare &comp)
Specialization of sort for DataVector/List.