CMS 3D CMS Logo

List of all members | Classes | Public Types | Public Member Functions | Private Types | Private Member Functions | Private Attributes
cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc > Class Template Reference

#include <OtherHashMaps.h>

Classes

class  item_iterator
 
struct  KeyItem
 
struct  ValueItem
 

Public Types

typedef Hasher hasher
 
typedef SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc > map_type
 
typedef item_iterator< ValueItemvalue_iterator
 
typedef std::conditional< std::is_pointer< V >::value, V, V const & >::type value_ref
 

Public Member Functions

void clear (size_t newBucketSize=0)
 
void dump ()
 
bool empty () const
 
void freeRows ()
 
void insert (K const &key, value_ref value)
 
 SimpleAllocHashMultiMap (size_t buckets, size_t keyRowSize, size_t valueRowSize, size_t maxRows=50)
 
value_iterator values (K const &key)
 
 ~SimpleAllocHashMultiMap ()
 

Private Types

using AllocTraits = std::allocator_traits< Alloc >
 
using KeyItemAllocator = typename AllocTraits::template rebind_alloc< KeyItem >
 
using KeyItemPtrAllocator = typename AllocTraits::template rebind_alloc< KeyItem * >
 
using ValueItemAllocator = typename AllocTraits::template rebind_alloc< ValueItem >
 

Private Member Functions

KeyItemfind_or_insert_ (K const &key)
 
KeyItempush_back_ (K const &key, KeyItem *next)
 
ValueItempush_back_ (value_ref value, ValueItem *next)
 

Private Attributes

size_t bucketCapacity_
 
KeyItem ** buckets_
 
size_t bucketSize_
 
std::list< KeyItem * >::iterator currentKeyRow_
 
std::list< ValueItem * >::iterator currentValueRow_
 
Equals eq_
 
Hasher hasher_
 
KeyItemAllocator keyAlloc_
 
KeyItemkeyEndMarker_
 
std::list< KeyItem * > keyRows_
 
size_t keyRowSize_
 
size_t maxRows_
 
KeyItemnextKeyItem_
 
ValueItemnextValueItem_
 
KeyItemPtrAllocator ptrAlloc_
 
ValueItemAllocator valueAlloc_
 
ValueItemvalueEndMarker_
 
std::list< ValueItem * > valueRows_
 
size_t valueRowSize_
 

Detailed Description

template<typename K, typename V, typename Hasher = std::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
class cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >

Definition at line 29 of file OtherHashMaps.h.

Member Typedef Documentation

◆ AllocTraits

template<typename K , typename V , typename Hasher = std::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
using cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::AllocTraits = std::allocator_traits<Alloc>
private

Definition at line 116 of file OtherHashMaps.h.

◆ hasher

template<typename K , typename V , typename Hasher = std::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
typedef Hasher cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::hasher

Definition at line 31 of file OtherHashMaps.h.

◆ KeyItemAllocator

template<typename K , typename V , typename Hasher = std::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
using cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::KeyItemAllocator = typename AllocTraits::template rebind_alloc<KeyItem>
private

Definition at line 117 of file OtherHashMaps.h.

◆ KeyItemPtrAllocator

template<typename K , typename V , typename Hasher = std::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
using cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::KeyItemPtrAllocator = typename AllocTraits::template rebind_alloc<KeyItem *>
private

Definition at line 118 of file OtherHashMaps.h.

◆ map_type

template<typename K , typename V , typename Hasher = std::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
typedef SimpleAllocHashMultiMap<K, V, Hasher, Equals, Alloc> cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::map_type

Definition at line 35 of file OtherHashMaps.h.

◆ value_iterator

template<typename K , typename V , typename Hasher = std::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
typedef item_iterator<ValueItem> cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::value_iterator

Definition at line 111 of file OtherHashMaps.h.

◆ value_ref

template<typename K , typename V , typename Hasher = std::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
typedef std::conditional<std::is_pointer<V>::value, V, V const &>::type cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::value_ref

Definition at line 37 of file OtherHashMaps.h.

◆ ValueItemAllocator

template<typename K , typename V , typename Hasher = std::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
using cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::ValueItemAllocator = typename AllocTraits::template rebind_alloc<ValueItem>
private

Definition at line 119 of file OtherHashMaps.h.

Constructor & Destructor Documentation

◆ SimpleAllocHashMultiMap()

template<typename K , typename V , typename Hasher , typename Equals , typename Alloc >
cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::SimpleAllocHashMultiMap ( size_t  buckets,
size_t  keyRowSize,
size_t  valueRowSize,
size_t  maxRows = 50 
)

Definition at line 202 of file OtherHashMaps.h.

References cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::bucketCapacity_, cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::buckets_, cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::clear(), cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::keyAlloc_, cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::keyRows_, cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::keyRowSize_, cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::ptrAlloc_, cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::valueAlloc_, cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::valueRows_, and cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::valueRowSize_.

206  : bucketSize_(buckets),
208  keyRowSize_(keyRowSize),
209  valueRowSize_(valueRowSize),
210  maxRows_(maxRows) {
211  buckets_ = ptrAlloc_.allocate(bucketCapacity_);
212  keyRows_.push_back(keyAlloc_.allocate(keyRowSize_));
213  valueRows_.push_back(valueAlloc_.allocate(valueRowSize_));
214  clear();
215  }
std::list< ValueItem * > valueRows_
void clear(size_t newBucketSize=0)
Definition: OtherHashMaps.h:43
std::list< KeyItem * > keyRows_

◆ ~SimpleAllocHashMultiMap()

template<typename K , typename V , typename Hasher , typename Equals , typename Alloc >
cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::~SimpleAllocHashMultiMap ( )

Definition at line 217 of file OtherHashMaps.h.

References ALPAKA_ACCELERATOR_NAMESPACE::vertexFinder::it, and dqmdumpme::last.

217  {
218  for (typename std::list<KeyItem *>::iterator it = keyRows_.begin(), last = keyRows_.end(); it != last; ++it) {
219  keyAlloc_.deallocate(*it, keyRowSize_);
220  }
221  for (typename std::list<ValueItem *>::iterator it = valueRows_.begin(), last = valueRows_.end(); it != last; ++it) {
222  valueAlloc_.deallocate(*it, valueRowSize_);
223  }
224  ptrAlloc_.deallocate(buckets_, bucketCapacity_);
225  }
std::list< ValueItem * > valueRows_
std::list< KeyItem * > keyRows_

Member Function Documentation

◆ clear()

template<typename K , typename V , typename Hasher = std::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
void cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::clear ( size_t  newBucketSize = 0)
inline

Definition at line 43 of file OtherHashMaps.h.

References cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::bucketCapacity_, cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::buckets_, cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::bucketSize_, cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::currentKeyRow_, cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::currentValueRow_, cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::freeRows(), cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::keyEndMarker_, cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::keyRows_, cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::keyRowSize_, cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::maxRows_, cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::nextKeyItem_, cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::nextValueItem_, cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::ptrAlloc_, cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::valueEndMarker_, cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::valueRows_, and cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::valueRowSize_.

Referenced by cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::SimpleAllocHashMultiMap().

43  {
44  if (newBucketSize != 0) {
45  if (newBucketSize > bucketCapacity_) {
46  ptrAlloc_.deallocate(buckets_, bucketCapacity_);
47  bucketCapacity_ = newBucketSize;
49  }
50  bucketSize_ = newBucketSize;
51  }
52  memset(buckets_, 0, bucketSize_ * sizeof(KeyItem *));
53  currentKeyRow_ = keyRows_.begin();
54  nextKeyItem_ = keyRows_.front();
56  currentValueRow_ = valueRows_.begin();
57  nextValueItem_ = valueRows_.front();
59  if ((keyRows_.size() > maxRows_) || (valueRows_.size() > maxRows_))
60  freeRows();
61  }
std::list< ValueItem * > valueRows_
std::list< ValueItem * >::iterator currentValueRow_
std::list< KeyItem * > keyRows_
std::list< KeyItem * >::iterator currentKeyRow_

◆ dump()

template<typename K , typename V , typename Hasher = std::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
void cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::dump ( void  )
inline

Definition at line 149 of file OtherHashMaps.h.

References cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::bucketCapacity_, cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::buckets_, cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::bucketSize_, gather_cfg::cout, cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::currentKeyRow_, cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::currentValueRow_, HLT_2024v13_cff::distance, ALPAKA_ACCELERATOR_NAMESPACE::vertexFinder::it, cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::keyRows_, cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::keyRowSize_, dqmdumpme::last, cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::nextKeyItem_, cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::nextValueItem_, AlCaHLTBitMon_ParallelJobs::p, cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::valueRows_, and cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::valueRowSize_.

149  {
150  std::cout << "Dumping HASH MULTIMAP" << std::endl;
151  std::cout << " Key items: "
153  << std::endl;
154  std::cout << " Value items: "
157  << std::endl;
158  size_t row = 0;
159  std::cout << " Buckets (size " << bucketSize_ << ", capacity " << bucketCapacity_ << ")";
160  for (KeyItem **p = buckets_; p != buckets_ + bucketSize_; ++p, ++row) {
161  std::cout << " [" << row << "] " << *p << std::endl;
162  }
163  row = 0;
164  std::cout << " Key Items " << std::endl;
165  for (typename std::list<KeyItem *>::iterator it = keyRows_.begin(), last = keyRows_.end(); it != last;
166  ++it, ++row) {
167  KeyItem *lastI = *it + keyRowSize_;
168  std::cout << " Key Row " << row << " (of size " << keyRowSize_ << ")" << std::endl;
169  for (KeyItem *p = *it; p != lastI; ++p) {
170  std::cout << " @ " << p << " [" << p->key << ", @" << p->value << "], next = " << p->next << std::endl;
171  if ((it == currentKeyRow_) && (p == nextKeyItem_ - 1)) {
172  std::cout << " ^^^ this was the last valid item." << std::endl;
173  last = 0;
174  break;
175  }
176  }
177  if (lastI == 0)
178  break;
179  }
180  row = 0;
181  std::cout << " Value Items " << std::endl;
182  for (typename std::list<ValueItem *>::iterator it = valueRows_.begin(), last = valueRows_.end(); it != last;
183  ++it, ++row) {
184  ValueItem *lastI = *it + valueRowSize_;
185  std::cout << " Value Row " << row << " (of size " << valueRowSize_ << ")" << std::endl;
186  for (ValueItem *p = *it; p != lastI; ++p) {
187  std::cout << " @ " << p << " [" << p->value << "], next = " << p->next << std::endl;
188  if ((it == currentValueRow_) && (p == nextValueItem_ - 1)) {
189  std::cout << " ^^^ this was the last valid item." << std::endl;
190  last = 0;
191  break;
192  }
193  }
194  if (lastI == 0)
195  break;
196  }
197  std::cout << " End of dump" << std::endl;
198  }
std::list< ValueItem * > valueRows_
std::list< ValueItem * >::iterator currentValueRow_
std::list< KeyItem * > keyRows_
std::list< KeyItem * >::iterator currentKeyRow_

◆ empty()

template<typename K , typename V , typename Hasher = std::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
bool cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::empty ( void  ) const
inline

◆ find_or_insert_()

template<typename K , typename V , typename Hasher , typename Equals , typename Alloc >
SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::KeyItem & cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::find_or_insert_ ( K const &  key)
private

Definition at line 284 of file OtherHashMaps.h.

References cond::hash, cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::KeyItem::key, submitPVResolutionJobs::key, and cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::KeyItem::next.

284  {
285  //std::cout << "Find or insert for key " << key << std::endl;
286  size_t hash = hasher_(key);
287  KeyItem *&buck = buckets_[hash % bucketSize_];
288  KeyItem *curr = buck;
289  while (curr) {
290  if (eq_(curr->key, key)) {
291  //std::cout << " Key " << key << " was found." << std::endl;
292  return *curr;
293  }
294  curr = curr->next;
295  }
296  buck = push_back_(key, buck);
297  return *buck;
298  }
KeyItem * push_back_(K const &key, KeyItem *next)
key
prepare the HTCondor submission files and eventually submit them

◆ freeRows()

template<typename K , typename V , typename Hasher , typename Equals , typename Alloc >
void cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::freeRows ( )

Definition at line 228 of file OtherHashMaps.h.

References ALPAKA_ACCELERATOR_NAMESPACE::vertexFinder::it, and dqmdumpme::last.

Referenced by cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::clear().

228  {
229  if (keyRows_.size() > maxRows_) {
230  //std::cerr << "Freeing key rows, current size is " << keyRows_.size() << std::endl;
231  typename std::list<KeyItem *>::iterator it = keyRows_.begin(), last = keyRows_.end();
232  for (std::advance(it, maxRows_); it != last; ++it) {
233  keyAlloc_.deallocate(*it, keyRowSize_);
234  }
235  keyRows_.resize(maxRows_);
236  }
237  if (valueRows_.size() > maxRows_) {
238  //std::cerr << "Freeing value rows, current size is " << valueRows_.size() << std::endl;
239  typename std::list<ValueItem *>::iterator it = valueRows_.begin(), last = valueRows_.end();
240  for (std::advance(it, maxRows_); it != last; ++it) {
241  valueAlloc_.deallocate(*it, valueRowSize_);
242  }
243  valueRows_.resize(maxRows_);
244  }
245  }
std::list< ValueItem * > valueRows_
std::list< KeyItem * > keyRows_

◆ insert()

template<typename K , typename V , typename Hasher , typename Equals , typename Alloc >
void cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::insert ( K const &  key,
value_ref  value 
)

Definition at line 301 of file OtherHashMaps.h.

References dqmdumpme::k, and submitPVResolutionJobs::key.

301  {
302  //std::cout << "Pushing back value " << value << " for key " << key << std::endl;
303  KeyItem &k = find_or_insert_(key);
304  //std::cout << "Key " << (k.value ? "exists" : " is new") << std::endl;
305  k.value = push_back_(value, k.value);
306  }
KeyItem & find_or_insert_(K const &key)
KeyItem * push_back_(K const &key, KeyItem *next)
key
prepare the HTCondor submission files and eventually submit them
Definition: value.py:1

◆ push_back_() [1/2]

template<typename K , typename V , typename Hasher , typename Equals , typename Alloc >
SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::KeyItem * cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::push_back_ ( K const &  key,
KeyItem next 
)
private

Definition at line 249 of file OtherHashMaps.h.

References DDDCmsTrackerContruction::construct(), submitPVResolutionJobs::key, and GetRecoTauVFromDQM_MC_cff::next.

249  {
250  if (nextKeyItem_ == keyEndMarker_) {
251  ++currentKeyRow_;
252  if (currentKeyRow_ == keyRows_.end()) {
253  keyRows_.push_back(keyAlloc_.allocate(keyRowSize_));
254  currentKeyRow_ = keyRows_.end();
255  --currentKeyRow_; // end - 1 doesn't work!
256  }
259  }
261  nextKeyItem_++;
262  return (nextKeyItem_ - 1);
263  }
key
prepare the HTCondor submission files and eventually submit them
std::unique_ptr< GeometricDet > construct(DDCompactView const &cpv, std::vector< int > const &detidShifts)
std::list< KeyItem * > keyRows_
std::list< KeyItem * >::iterator currentKeyRow_

◆ push_back_() [2/2]

template<typename K , typename V , typename Hasher , typename Equals , typename Alloc >
SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::ValueItem * cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::push_back_ ( value_ref  value,
ValueItem next 
)
private

Definition at line 266 of file OtherHashMaps.h.

References DDDCmsTrackerContruction::construct(), and GetRecoTauVFromDQM_MC_cff::next.

266  {
269  if (currentValueRow_ == valueRows_.end()) {
270  valueRows_.push_back(valueAlloc_.allocate(valueRowSize_));
272  --currentValueRow_; // end - 1 doesn't work!
273  }
276  }
278  nextValueItem_++;
279  return (nextValueItem_ - 1);
280  }
std::list< ValueItem * > valueRows_
std::list< ValueItem * >::iterator currentValueRow_
Definition: value.py:1
std::unique_ptr< GeometricDet > construct(DDCompactView const &cpv, std::vector< int > const &detidShifts)

◆ values()

template<typename K , typename V , typename Hasher , typename Equals , typename Alloc >
SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::value_iterator cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::values ( K const &  key)

Definition at line 310 of file OtherHashMaps.h.

References cond::hash, submitPVResolutionJobs::key, and cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::KeyItem::next.

310  {
311  //std::cout << "Gettinv values for key " << key << std::endl;
312  size_t hash = hasher_(key);
313  for (KeyItem *curr = buckets_[hash % bucketSize_]; curr; curr = curr->next) {
314  if (eq_(curr->key, key))
315  return value_iterator(curr->value);
316  }
317  return value_iterator();
318  }
item_iterator< ValueItem > value_iterator
key
prepare the HTCondor submission files and eventually submit them

Member Data Documentation

◆ bucketCapacity_

template<typename K , typename V , typename Hasher = std::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
size_t cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::bucketCapacity_
private

◆ buckets_

template<typename K , typename V , typename Hasher = std::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
KeyItem** cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::buckets_
private

◆ bucketSize_

template<typename K , typename V , typename Hasher = std::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
size_t cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::bucketSize_
private

◆ currentKeyRow_

template<typename K , typename V , typename Hasher = std::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
std::list<KeyItem *>::iterator cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::currentKeyRow_
private

◆ currentValueRow_

template<typename K , typename V , typename Hasher = std::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
std::list<ValueItem *>::iterator cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::currentValueRow_
private

◆ eq_

template<typename K , typename V , typename Hasher = std::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
Equals cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::eq_
private

Definition at line 139 of file OtherHashMaps.h.

◆ hasher_

template<typename K , typename V , typename Hasher = std::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
Hasher cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::hasher_
private

Definition at line 138 of file OtherHashMaps.h.

◆ keyAlloc_

template<typename K , typename V , typename Hasher = std::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
KeyItemAllocator cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::keyAlloc_
private

◆ keyEndMarker_

template<typename K , typename V , typename Hasher = std::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
KeyItem * cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::keyEndMarker_
private

◆ keyRows_

template<typename K , typename V , typename Hasher = std::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
std::list<KeyItem *> cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::keyRows_
private

◆ keyRowSize_

template<typename K , typename V , typename Hasher = std::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
size_t cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::keyRowSize_
private

◆ maxRows_

template<typename K , typename V , typename Hasher = std::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
size_t cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::maxRows_
private

◆ nextKeyItem_

template<typename K , typename V , typename Hasher = std::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
KeyItem* cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::nextKeyItem_
private

◆ nextValueItem_

template<typename K , typename V , typename Hasher = std::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
ValueItem* cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::nextValueItem_
private

◆ ptrAlloc_

template<typename K , typename V , typename Hasher = std::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
KeyItemPtrAllocator cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::ptrAlloc_
private

◆ valueAlloc_

template<typename K , typename V , typename Hasher = std::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
ValueItemAllocator cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::valueAlloc_
private

◆ valueEndMarker_

template<typename K , typename V , typename Hasher = std::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
ValueItem * cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::valueEndMarker_
private

◆ valueRows_

template<typename K , typename V , typename Hasher = std::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
std::list<ValueItem *> cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::valueRows_
private

◆ valueRowSize_

template<typename K , typename V , typename Hasher = std::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
size_t cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::valueRowSize_
private