ATLAS Offline Software
Loading...
Searching...
No Matches
ConcurrentMap.h
Go to the documentation of this file.
1// This file's extension implies that it's C, but it's really -*- C++ -*-.
2/*
3 * Copyright (C) 2002-2025 CERN for the benefit of the ATLAS collaboration.
4 */
11
12
13#ifndef CXXUTILS_CONCURRENTMAP_H
14#define CXXUTILS_CONCURRENTMAP_H
15
16
18#include "CxxUtils/UIntConv.h"
19#include "CxxUtils/concepts.h"
20#include "CxxUtils/IsUpdater.h"
22#include "boost/iterator/iterator_facade.hpp"
23#include <type_traits>
24#include <stdexcept>
25
26
27namespace CxxUtils {
28
29
89template <class KEY, class VALUE, template <class> class UPDATER,
90 class HASHER = std::hash<KEY>,
91 class MATCHER = std::equal_to<KEY>,
93 detail::ConcurrentHashmapVal_t TOMBSTONE = NULLVAL>
99class ConcurrentMap
100{
101private:
104
105 // Translate between the Hasher/Matcher provided (which take KEY arguments)
106 // and what we need to give to the underlying implementation
107 // (which takes a uintptr_t).
108 struct Hasher
109 {
110 size_t operator() (val_t k) const {
111 return m_h (keyAsKey (k));
112 }
113 HASHER m_h;
114 };
115 struct Matcher
116 {
117 bool operator() (val_t a, val_t b) const {
118 return m_m (keyAsKey (a), keyAsKey (b));
119 }
120 MATCHER m_m;
121 };
122
124 using Impl_t = typename detail::ConcurrentHashmapImpl<UPDATER,
125 Hasher,
126 Matcher,
127 NULLVAL,
128 TOMBSTONE>;
129
130
131public:
133 using key_type = KEY;
134 using mapped_type = VALUE;
135 using size_type = size_t;
137 using Updater_t = typename Impl_t::Updater_t;
139 using Context_t = typename Updater_t::Context_t;
141 using Lock_t = typename Impl_t::Lock_t;
142
144 static_assert( sizeof(typename Impl_t::val_t) >= sizeof(key_type) );
145 static_assert( sizeof(typename Impl_t::val_t) >= sizeof(mapped_type) );
146
147
157 size_type capacity = 64,
158 const Context_t& ctx = Updater_t::defaultContext());
159
172 size_t capacity = 64,
173 const Context_t& ctx = Updater_t::defaultContext());
174
175
188 template <class InputIterator>
189 ConcurrentMap (InputIterator f,
190 InputIterator l,
192 size_type capacity = 64,
193 const Context_t& ctx = Updater_t::defaultContext());
194
195
197 ConcurrentMap (const ConcurrentMap& other) = delete;
198 ConcurrentMap (ConcurrentMap&& other) = delete;
199 ConcurrentMap& operator= (const ConcurrentMap& other) = delete;
201
202
206 ~ConcurrentMap() = default;
207
208
212 size_type size() const;
213
214
218 bool empty() const;
219
220
224 size_t capacity() const;
225
226
230 size_t erased() const;
231
232
236 using const_iterator_value = std::pair<const key_type, mapped_type>;
237
238
248 class const_iterator
249 : public boost::iterator_facade<const_iterator,
250 const const_iterator_value,
251 std::bidirectional_iterator_tag,
252 const const_iterator_value>
253 {
254 public:
259 const_iterator (typename Impl_t::const_iterator it);
260
261
267 bool valid() const;
268
269
270 private:
273
274
278 void increment();
279
280
284 void decrement();
285
286
290 bool equal (const const_iterator& other) const;
291
292
297
298
300 typename Impl_t::const_iterator m_impl;
301 };
302
303
306
307
312
313
317 const_iterator begin() const;
318
319
323 const_iterator end() const;
324
325
330
331
336
337
342 bool contains (key_type key) const;
343
344
351 size_type count (key_type key) const;
352
353
360 const_iterator find (key_type key) const;
361
362
370 mapped_type at (key_type key) const;
371
372
380 std::pair<const_iterator, const_iterator>
381 equal_range (key_type key) const;
382
383
392 Lock_t lock();
393
394
406 std::pair<const_iterator, bool>
407 emplace (key_type key, mapped_type val,
408 const Context_t& ctx = Updater_t::defaultContext());
409
410
423 std::pair<const_iterator, bool>
424 emplace (const Lock_t& lock,
425 key_type key, mapped_type val,
426 const Context_t& ctx = Updater_t::defaultContext());
427
428
440 std::pair<const_iterator, bool>
441 insert_or_assign (key_type key, mapped_type val,
442 const Context_t& ctx = Updater_t::defaultContext());
443
444
458 std::pair<const_iterator, bool>
459 insert_or_assign (const Lock_t& lock,
460 key_type key, mapped_type val,
461 const Context_t& ctx = Updater_t::defaultContext());
462
463
477 template <class PAIR>
478 std::pair<const_iterator, bool> insert (const PAIR& p);
479
480
489 template <class InputIterator>
490 void insert (InputIterator first, InputIterator last);
491
492
505 bool erase (key_type key);
506
507
521 bool erase (const Lock_t& lock, key_type key);
522
523
532 void reserve (size_type capacity,
533 const Context_t& ctx = Updater_t::defaultContext());
534
535
543 void rehash (size_type capacity);
544
545
551 void clear (size_t capacity,
552 const Context_t& ctx = Updater_t::defaultContext());
553
554
559 void clear (const Context_t& ctx = Updater_t::defaultContext());
560
561
571
572
578 void quiescent (const Context_t& ctx);
579
580
592 void swap (ConcurrentMap& other);
593
594
599
600
601private:
606 static key_type keyAsKey (val_t val);
607
608
613 static val_t keyAsVal (key_type k);
614
615
620 static mapped_type mappedAsMapped (val_t val);
621
622
627 static val_t mappedAsVal (mapped_type val);
628
629
637 typename Impl_t::const_iterator get (key_type key) const;
638
639
651 std::pair<const_iterator, bool>
652 put (key_type key,
653 mapped_type val,
654 bool overwrite = true,
655 const Context_t& ctx = Updater_t::defaultContext());
656
657
670 std::pair<const_iterator, bool>
671 put (const Lock_t& lock,
672 key_type key,
673 mapped_type val,
674 bool overwrite = true,
675 const Context_t& ctx = Updater_t::defaultContext());
676
677
679 Impl_t m_impl;
680};
681
682
683} // namespace CxxUtils
684
685
687
688
689#endif // not CXXUTILS_CONCURRENTMAP_H
Hash table allowing concurrent, lockless reads.
Concept check for Updater class used by concurrent classes.
static Double_t a
void operator()(T1)
Helpers for converting between uintptr_t and a pointer or integer.
Simple range from a pair of iterators.
Concept for a value that can be saved in a concurrent hash map.
Concept check for Updater class used by concurrent classes.
Definition IsUpdater.h:51
A couple standard-library related concepts.
#define VALUE(TESTED)
Definition expect.h:59
Simple range from a pair of iterators.
typename Updater_t::Context_t Context_t
uintptr_t ConcurrentHashmapVal_t
Type used for keys and values — an unsigned big enough to hold a pointer.
ConcurrentHashmapImpl(Updater_t &&updater, size_t capacity_in, const Hasher_t &hasher, const Matcher_t &matcher, const typename Updater_t::Context_t &ctx)
Constructor.
void forceClear()
Erase the table in-place.
~ConcurrentMap()=default
Destructor.
CxxUtils::iterator_range< const_iterator > const_iterator_range
A range defined by two iterators.
size_t erased() const
The number of erased elements in the current table.
const_iterator cend() const
Iterator at the end of the map.
Updater_t & updater()
Access the Updater instance.
const_iterator begin() const
Return a begin iterator.
std::pair< const key_type, mapped_type > const_iterator_value
Value structure for iterators.
std::pair< const_iterator, const_iterator > equal_range(key_type key) const
Return a range of iterators with entries matching key.
const_iterator find(bit_t bit) const
If bit bit is set, return an iterator pointing to it.
std::pair< const_iterator, bool > put(key_type key, mapped_type val, bool overwrite=true, const Context_t &ctx=Updater_t::defaultContext())
Insert / overwrite an entry in the table.
bool empty() const
Return true if there are no 1 bits in the set.
void quiescent(const Context_t &ctx)
Called when this thread is no longer referencing anything from this container.
void rehash(size_type capacity)
Increase the table capacity.
bit_t size() const
Count the number of 1 bits in the set.
bool contains(key_type key) const
Test if a key is in the container.
ConcurrentBitset & erase(bit_t bit)
Turn off one bit.
bit_t capacity() const
The number of bits that this container can hold.
ConcurrentBitset & operator=(const ConcurrentBitset &other)
Assignment.
const_iterator_range range() const
Return an iterator range covering the entire map.
static mapped_type mappedAsMapped(val_t val)
Convert an underlying mapped value to this type's mapped value.
void swap(ClassName &other)
Swap this expression with another one.
std::pair< const_iterator, bool > insert_or_assign(key_type key, mapped_type val, const Context_t &ctx=Updater_t::defaultContext())
Add an element to the map, or overwrite an existing one.
UPDATER< Impl > Updater_t
ConcurrentBitset & clear()
Clear all bits in the set.
const_iterator end() const
Return an end iterator.
mapped_type at(key_type key) const
Look up an element in the map.
ConcurrentMap(Updater_t &&updater, size_type capacity=64, const Context_t &ctx=Updater_t::defaultContext())
Hash map from integers/pointers allowing concurrent, lockless reads.
ConcurrentBitset & insert(bit_t bit, bit_t new_nbits=0)
Set a bit to 1.
static key_type keyAsKey(val_t val)
Convert an underlying key value to this type's key value.
static val_t keyAsVal(key_type k)
Convert this type's key value to an underlying key value.
std::atomic< Impl * > m_impl
The current implementation object.
const_iterator cbegin() const
Iterator at the start of the map.
bit_t count() const
Count the number of 1 bits in the set.
std::pair< const_iterator, bool > emplace(key_type key, mapped_type val, const Context_t &ctx=Updater_t::defaultContext())
Add an element to the map.
void reserve(size_type capacity, const Context_t &ctx=Updater_t::defaultContext())
Increase the table capacity.
static val_t mappedAsVal(mapped_type val)
Convert this type's mapped value to an underlying mapped value.
Impl_t::const_iterator get(key_type key) const
Do a lookup in the table.
Lock_t lock()
Take a lock on the container.
Iterator over all 1 bits in the set.
bool valid() const
Test if this iterator is valid.
void decrement()
iterator_facade requirement: Decrement the iterator.
void increment()
iterator_facade requirement: Increment the iterator.
const_iterator(Block_t cache, bit_t bit, const std::atomic< Block_t > *data, const std::atomic< Block_t > *end)
Constructor.
bool equal(const const_iterator &other) const
iterator_facade requirement: Equality test.
friend class boost::iterator_core_access
Required by iterator_facade.
const const_iterator_value dereference() const
iterator_facade requirement: Dereference the iterator.
const_iterator(typename Impl_t::const_iterator it)
Constructor.
Impl_t::const_iterator m_impl
The iterator on the underlying table.