CMS 3D CMS Logo

 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Pages
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 boost::mpl::if_
< typename boost::is_pointer
< V >, 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

typedef Alloc::template rebind
< KeyItem >::other 
KeyItemAllocator
 
typedef Alloc::template rebind
< KeyItem * >::other 
KeyItemPtrAllocator
 
typedef Alloc::template rebind
< ValueItem >::other 
ValueItemAllocator
 

Private Member Functions

 BOOST_MPL_ASSERT ((boost::mpl::and_< boost::has_trivial_destructor< K >, boost::has_trivial_destructor< V > >))
 
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 = boost::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
class cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >

Definition at line 31 of file OtherHashMaps.h.

Member Typedef Documentation

template<typename K , typename V , typename Hasher = boost::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 35 of file OtherHashMaps.h.

template<typename K , typename V , typename Hasher = boost::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
typedef Alloc::template rebind<KeyItem>::other cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::KeyItemAllocator
private

Definition at line 111 of file OtherHashMaps.h.

template<typename K , typename V , typename Hasher = boost::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
typedef Alloc::template rebind<KeyItem *>::other cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::KeyItemPtrAllocator
private

Definition at line 112 of file OtherHashMaps.h.

template<typename K , typename V , typename Hasher = boost::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 36 of file OtherHashMaps.h.

template<typename K , typename V , typename Hasher = boost::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 106 of file OtherHashMaps.h.

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

Definition at line 37 of file OtherHashMaps.h.

template<typename K , typename V , typename Hasher = boost::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
typedef Alloc::template rebind<ValueItem>::other cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::ValueItemAllocator
private

Definition at line 113 of file OtherHashMaps.h.

Constructor & Destructor Documentation

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 183 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_.

183  :
185  keyRowSize_(keyRowSize),
186  valueRowSize_(valueRowSize),
187  maxRows_(maxRows)
188 {
189  buckets_ = ptrAlloc_.allocate(bucketCapacity_);
190  keyRows_.push_back(keyAlloc_.allocate(keyRowSize_));
191  valueRows_.push_back(valueAlloc_.allocate(valueRowSize_));
192  clear();
193 }
std::list< ValueItem * > valueRows_
void clear(size_t newBucketSize=0)
Definition: OtherHashMaps.h:43
std::list< KeyItem * > keyRows_
template<typename K , typename V , typename Hasher , typename Equals , typename Alloc >
cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::~SimpleAllocHashMultiMap ( )

Definition at line 195 of file OtherHashMaps.h.

References prof2calltree::last.

196 {
197  for (typename std::list<KeyItem *>::iterator it = keyRows_.begin(), last = keyRows_.end(); it != last; ++it) {
198  keyAlloc_.deallocate(*it, keyRowSize_);
199  }
200  for (typename std::list<ValueItem *>::iterator it = valueRows_.begin(), last = valueRows_.end(); it != last; ++it) {
201  valueAlloc_.deallocate(*it, valueRowSize_);
202  }
203  ptrAlloc_.deallocate(buckets_, bucketCapacity_);
204 }
std::list< ValueItem * > valueRows_
std::list< KeyItem * > keyRows_

Member Function Documentation

template<typename K , typename V , typename Hasher = boost::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::BOOST_MPL_ASSERT ( (boost::mpl::and_< boost::has_trivial_destructor< K >, boost::has_trivial_destructor< V > >)  )
private
template<typename K , typename V , typename Hasher = boost::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();
55  currentValueRow_ = valueRows_.begin();
57  if ((keyRows_.size() > maxRows_) || (valueRows_.size() > maxRows_)) freeRows();
58  }
std::list< ValueItem * > valueRows_
std::list< ValueItem * >::iterator currentValueRow_
std::list< KeyItem * > keyRows_
std::list< KeyItem * >::iterator currentKeyRow_
template<typename K , typename V , typename Hasher = boost::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 140 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_25ns14e33_v1_cff::distance, cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::keyRows_, cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::keyRowSize_, prof2calltree::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_.

140  {
141  std::cout << "Dumping HASH MULTIMAP" << std::endl;
142  std::cout << " Key items: " << (std::distance(keyRows_.begin(), currentKeyRow_) * keyRowSize_ + (nextKeyItem_ - *currentKeyRow_)) << std::endl;
143  std::cout << " Value items: " << (std::distance(valueRows_.begin(), currentValueRow_) * valueRowSize_ + (nextValueItem_ - *currentValueRow_)) << std::endl;
144  size_t row = 0;
145  std::cout << " Buckets (size " << bucketSize_ << ", capacity " << bucketCapacity_ << ")";
146  for (KeyItem **p = buckets_; p != buckets_ + bucketSize_; ++p, ++row) {
147  std::cout << " ["<<row<<"] " << *p << std::endl;
148  }
149  row = 0;
150  std::cout << " Key Items " << std::endl;
151  for (typename std::list<KeyItem *>::iterator it = keyRows_.begin(), last = keyRows_.end(); it != last; ++it, ++row) {
152  KeyItem *lastI = *it + keyRowSize_;
153  std::cout << " Key Row " << row << " (of size " << keyRowSize_ << ")" << std::endl;
154  for (KeyItem *p = *it; p != lastI; ++p) {
155  std::cout << " @ " << p << " [" << p->key << ", @" << p->value <<"], next = " << p->next << std::endl;
156  if ((it == currentKeyRow_) && (p == nextKeyItem_ - 1)) {
157  std::cout << " ^^^ this was the last valid item." << std::endl;
158  last = 0; break;
159  }
160  }
161  if (lastI == 0) break;
162  }
163  row = 0;
164  std::cout << " Value Items " << std::endl;
165  for (typename std::list<ValueItem *>::iterator it = valueRows_.begin(), last = valueRows_.end(); it != last; ++it, ++row) {
166  ValueItem *lastI = *it + valueRowSize_;
167  std::cout << " Value Row " << row << " (of size " << valueRowSize_ << ")" << std::endl;
168  for (ValueItem *p = *it; p != lastI; ++p) {
169  std::cout << " @ " << p << " [" << p->value <<"], next = " << p->next << std::endl;
170  if ((it == currentValueRow_) && (p == nextValueItem_ - 1)) {
171  std::cout << " ^^^ this was the last valid item." << std::endl;
172  last = 0; break;
173  }
174  }
175  if (lastI == 0) break;
176  }
177  std::cout << " End of dump" << std::endl;
178 
179  }
std::list< ValueItem * > valueRows_
std::list< ValueItem * >::iterator currentValueRow_
tuple cout
Definition: gather_cfg.py:121
std::list< KeyItem * > keyRows_
std::list< KeyItem * >::iterator currentKeyRow_
template<typename K , typename V , typename Hasher = boost::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
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 262 of file OtherHashMaps.h.

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

262  {
263  //std::cout << "Find or insert for key " << key << std::endl;
264  size_t hash = hasher_(key);
265  KeyItem * & buck = buckets_[hash % bucketSize_];
266  KeyItem * curr = buck;
267  while (curr) {
268  if (eq_(curr->key, key)) {
269  //std::cout << " Key " << key << " was found." << std::endl;
270  return *curr;
271  }
272  curr = curr->next;
273  }
274  buck = push_back_(key, buck);
275  return *buck;
276 }
KeyItem * push_back_(K const &key, KeyItem *next)
string key
FastSim: produces sample of signal events, overlayed with premixed minbias events.
template<typename K , typename V , typename Hasher , typename Equals , typename Alloc >
void cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::freeRows ( )

Definition at line 208 of file OtherHashMaps.h.

References prof2calltree::last.

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

208  {
209  if (keyRows_.size() > maxRows_) {
210  //std::cerr << "Freeing key rows, current size is " << keyRows_.size() << std::endl;
211  typename std::list<KeyItem *>::iterator it = keyRows_.begin(), last = keyRows_.end();
212  for (std::advance(it, maxRows_); it != last; ++it) {
213  keyAlloc_.deallocate(*it, keyRowSize_);
214  }
215  keyRows_.resize(maxRows_);
216  }
217  if (valueRows_.size() > maxRows_) {
218  //std::cerr << "Freeing value rows, current size is " << valueRows_.size() << std::endl;
219  typename std::list<ValueItem *>::iterator it = valueRows_.begin(), last = valueRows_.end();
220  for (std::advance(it, maxRows_); it != last; ++it) {
221  valueAlloc_.deallocate(*it, valueRowSize_);
222  }
223  valueRows_.resize(maxRows_);
224  }
225 }
std::list< ValueItem * > valueRows_
std::list< KeyItem * > keyRows_
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 279 of file OtherHashMaps.h.

References relval_steps::k, and cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::KeyItem::value.

Referenced by BeautifulSoup.PageElement::_invert().

279  {
280  //std::cout << "Pushing back value " << value << " for key " << key << std::endl;
281  KeyItem &k = find_or_insert_(key);
282  //std::cout << "Key " << (k.value ? "exists" : " is new") << std::endl;
283  k.value = push_back_(value, k.value);
284 }
KeyItem & find_or_insert_(K const &key)
KeyItem * push_back_(K const &key, KeyItem *next)
string key
FastSim: produces sample of signal events, overlayed with premixed minbias events.
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 229 of file OtherHashMaps.h.

229  {
230  if (nextKeyItem_ == keyEndMarker_) {
231  ++currentKeyRow_;
232  if (currentKeyRow_ == keyRows_.end()) {
233  keyRows_.push_back(keyAlloc_.allocate(keyRowSize_));
234  currentKeyRow_ = keyRows_.end(); --currentKeyRow_; // end - 1 doesn't work!
235  }
238  }
239  keyAlloc_.construct(nextKeyItem_, KeyItem(next, key, 0));
240  nextKeyItem_++;
241  return (nextKeyItem_-1);
242 }
string key
FastSim: produces sample of signal events, overlayed with premixed minbias events.
std::list< KeyItem * > keyRows_
std::list< KeyItem * >::iterator currentKeyRow_
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 245 of file OtherHashMaps.h.

245  {
247  ++currentValueRow_;
248  if (currentValueRow_ == valueRows_.end()) {
249  valueRows_.push_back(valueAlloc_.allocate(valueRowSize_));
250  currentValueRow_ = valueRows_.end(); --currentValueRow_; // end - 1 doesn't work!
251  }
254  }
255  valueAlloc_.construct(nextValueItem_, ValueItem(next, value));
256  nextValueItem_++;
257  return (nextValueItem_-1);
258 }
std::list< ValueItem * > valueRows_
std::list< ValueItem * >::iterator currentValueRow_
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 288 of file OtherHashMaps.h.

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

288  {
289  //std::cout << "Gettinv values for key " << key << std::endl;
290  size_t hash = hasher_(key);
291  for (KeyItem * curr = buckets_[hash % bucketSize_]; curr; curr = curr->next) {
292  if (eq_(curr->key, key)) return value_iterator(curr->value);
293  }
294  return value_iterator();
295 }
item_iterator< ValueItem > value_iterator
string key
FastSim: produces sample of signal events, overlayed with premixed minbias events.

Member Data Documentation

template<typename K , typename V , typename Hasher = boost::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
size_t cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::bucketCapacity_
private
template<typename K , typename V , typename Hasher = boost::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
KeyItem** cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::buckets_
private
template<typename K , typename V , typename Hasher = boost::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
size_t cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::bucketSize_
private
template<typename K , typename V , typename Hasher = boost::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
template<typename K , typename V , typename Hasher = boost::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
template<typename K , typename V , typename Hasher = boost::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 131 of file OtherHashMaps.h.

template<typename K , typename V , typename Hasher = boost::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 130 of file OtherHashMaps.h.

template<typename K , typename V , typename Hasher = boost::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
KeyItemAllocator cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::keyAlloc_
private
template<typename K , typename V , typename Hasher = boost::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
KeyItem * cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::keyEndMarker_
private
template<typename K , typename V , typename Hasher = boost::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
template<typename K , typename V , typename Hasher = boost::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
size_t cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::keyRowSize_
private
template<typename K , typename V , typename Hasher = boost::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
size_t cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::maxRows_
private
template<typename K , typename V , typename Hasher = boost::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
KeyItem* cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::nextKeyItem_
private
template<typename K , typename V , typename Hasher = boost::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
ValueItem* cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::nextValueItem_
private
template<typename K , typename V , typename Hasher = boost::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
KeyItemPtrAllocator cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::ptrAlloc_
private
template<typename K , typename V , typename Hasher = boost::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
ValueItemAllocator cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::valueAlloc_
private
template<typename K , typename V , typename Hasher = boost::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
ValueItem * cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::valueEndMarker_
private
template<typename K , typename V , typename Hasher = boost::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
template<typename K , typename V , typename Hasher = boost::hash<K>, typename Equals = std::equal_to<K>, typename Alloc = std::allocator<V>>
size_t cmsutil::SimpleAllocHashMultiMap< K, V, Hasher, Equals, Alloc >::valueRowSize_
private