GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/smallhash.h
Date: 2026-01-11 02:35:46
Exec Total Coverage
Lines: 259 263 98.5%
Branches: 88 110 80.0%
Line Branch Exec Source
1 /**
2 * This file is part of the CernVM File System.
3 */
4
5 #ifndef CVMFS_SMALLHASH_H_
6 #define CVMFS_SMALLHASH_H_
7
8 #ifndef __STDC_FORMAT_MACROS
9 // NOLINTNEXTLINE
10 #define __STDC_FORMAT_MACROS
11 #endif
12
13 #include "duplex_testing.h"
14 #include <inttypes.h>
15 #include <pthread.h>
16 #include <stdint.h>
17
18 #include <algorithm>
19 #include <cassert>
20 #include <cstdlib>
21 #include <new>
22
23 #include "util/atomic.h"
24 #include "util/murmur.hxx"
25 #include "util/prng.h"
26 #include "util/smalloc.h"
27
28 /**
29 * Hash table with linear probing as collision resolution. Works only for
30 * a fixed (maximum) number of elements, i.e. no resizing. Load factor fixed
31 * to 0.7.
32 */
33 template<class Key, class Value, class Derived>
34 class SmallHashBase {
35 FRIEND_TEST(T_Smallhash, InsertAndCopyMd5Slow);
36
37 public:
38 static const double kLoadFactor; // mainly useless for the dynamic version
39 static const double kThresholdGrow; // only used for resizable version
40 static const double kThresholdShrink; // only used for resizable version
41
42 127759 SmallHashBase() {
43 127759 keys_ = NULL;
44 127759 values_ = NULL;
45 127759 hasher_ = NULL;
46 127759 bytes_allocated_ = 0;
47 127759 num_collisions_ = 0;
48 127759 max_collisions_ = 0;
49
50 // Properly initialized by Init()
51 127759 capacity_ = 0;
52 127759 initial_capacity_ = 0;
53 127759 size_ = 0;
54 127759 }
55
56 127621 ~SmallHashBase() { DeallocMemory(keys_, values_, capacity_); }
57
58 127699 void Init(uint32_t expected_size, Key empty,
59 uint32_t (*hasher)(const Key &key)) {
60 127699 hasher_ = hasher;
61 127699 empty_key_ = empty;
62 127699 capacity_ = static_cast<uint32_t>(static_cast<double>(expected_size)
63 127699 / kLoadFactor);
64 127699 initial_capacity_ = capacity_;
65 127699 static_cast<Derived *>(this)->SetThresholds(); // No-op for fixed size
66 127699 AllocMemory();
67 127699 this->DoClear(false);
68 127699 }
69
70 67899109 bool Lookup(const Key &key, Value *value) const {
71 uint32_t bucket;
72 uint32_t collisions;
73
1/2
✓ Branch 1 taken 67774342 times.
✗ Branch 2 not taken.
 67899109 const bool found = DoLookup(key, &bucket, &collisions);
74
2/2
✓ Branch 0 taken 65143168 times.
✓ Branch 1 taken 2631174 times.
 67916224 if (found)
75
1/2
✓ Branch 1 taken 6763 times.
✗ Branch 2 not taken.
 65191034 *value = values_[bucket];
76 67916224 return found;
77 }
78
79 /**
80 * Returns both the key and the value. That is useful if Key's equality
81 * operator implements an equivalence relation on Key. In this case, LookupEx
82 * returns the key representing the equivalence class that has been used
83 * during Insert().
84 * Used to return a glue::InodeEx element when looking for an inode.
85 */
86 580 bool LookupEx(Key *key, Value *value) const {
87 580 uint32_t bucket = ScaleHash(*key);
88
2/2
✓ Branch 1 taken 194 times.
✓ Branch 2 taken 96 times.
 580 while (!(keys_[bucket] == empty_key_)) {
89
1/2
✓ Branch 1 taken 194 times.
✗ Branch 2 not taken.
 388 if (keys_[bucket] == *key) {
90 388 *key = keys_[bucket];
91 388 *value = values_[bucket];
92 388 return true;
93 }
94 ✗ bucket = (bucket + 1) % capacity_;
95 }
96 192 return false;
97 }
98
99 5076510 bool Contains(const Key &key) const {
100 uint32_t bucket;
101 uint32_t collisions;
102
1/2
✓ Branch 1 taken 5075710 times.
✗ Branch 2 not taken.
 5076510 const bool found = DoLookup(key, &bucket, &collisions);
103 5076510 return found;
104 }
105
106 1775567525 void Insert(const Key &key, const Value &value) {
107 1775567525 static_cast<Derived *>(this)->Grow(); // No-op if fixed-size
108 1768438520 const bool overwritten = DoInsert(key, value, true);
109 1774731915 size_ += !overwritten; // size + 1 if the key was not yet in the map
110 1774731915 }
111
112 99243743 bool Erase(const Key &key) {
113 uint32_t bucket;
114 uint32_t collisions;
115
1/2
✓ Branch 1 taken 95735143 times.
✗ Branch 2 not taken.
 99243743 const bool found = DoLookup(key, &bucket, &collisions);
116
1/2
✓ Branch 0 taken 95747485 times.
✗ Branch 1 not taken.
 95737873 if (found) {
117 95749936 keys_[bucket] = empty_key_;
118 95749936 size_--;
119 95749936 bucket = (bucket + 1) % capacity_;
120
3/3
✓ Branch 0 taken 143070243 times.
✓ Branch 1 taken 82979671 times.
✓ Branch 2 taken 14002106 times.
 240054475 while (!(keys_[bucket] == empty_key_)) {
121 145484499 Key rehash = keys_[bucket];
122 145484499 keys_[bucket] = empty_key_;
123
1/2
✓ Branch 1 taken 144304535 times.
✗ Branch 2 not taken.
 145484499 DoInsert(rehash, values_[bucket], false);
124 144304539 bucket = (bucket + 1) % capacity_;
125 }
126
1/2
✓ Branch 1 taken 96090960 times.
✗ Branch 2 not taken.
 94569976 static_cast<Derived *>(this)->Shrink(); // No-op if fixed-size
127 }
128 96089358 return found;
129 }
130
131 1393 void Clear() { DoClear(true); }
132
133 4673 uint64_t bytes_allocated() const { return bytes_allocated_; }
134 1284 static double GetEntrySize() {
135 2568 const double unit = sizeof(Key) + sizeof(Value);
136 2568 return unit / kLoadFactor;
137 }
138
139 void GetCollisionStats(uint64_t *num_collisions,
140 uint32_t *max_collisions) const {
141 *num_collisions = num_collisions_;
142 *max_collisions = max_collisions_;
143 }
144
145 // Careful with the direct access TODO: iterator
146 uint32_t capacity() const { return capacity_; }
147 265672 Key empty_key() const { return empty_key_; }
148 552872 Key *keys() const { return keys_; }
149 698 Value *values() const { return values_; }
150
151 // Only needed by compat
152 ✗ void SetHasher(uint32_t (*hasher)(const Key &key)) { hasher_ = hasher; }
153
154 protected:
155 2360331433 uint32_t ScaleHash(const Key &key) const {
156 2360331433 const double bucket = (static_cast<double>(hasher_(key))
157 2353336448 * static_cast<double>(capacity_)
158 / static_cast<double>(static_cast<uint32_t>(-1)));
159 2353336448 return static_cast<uint32_t>(bucket) % capacity_;
160 }
161
162 264223 void AllocMemory() {
163 264223 keys_ = static_cast<Key *>(smmap(capacity_ * sizeof(Key)));
164 264283 values_ = static_cast<Value *>(smmap(capacity_ * sizeof(Value)));
165
2/2
✓ Branch 0 taken 1392880324 times.
✓ Branch 1 taken 133267 times.
 2779850712 for (uint32_t i = 0; i < capacity_; ++i) {
166 2779586429 /*keys_[i] =*/new (keys_ + i) Key();
167 }
168
2/2
✓ Branch 0 taken 1397291314 times.
✓ Branch 1 taken 114607 times.
 2788635372 for (uint32_t i = 0; i < capacity_; ++i) {
169 2788408409 /*values_[i] =*/new (values_ + i) Value();
170 }
171 226963 bytes_allocated_ = (sizeof(Key) + sizeof(Value)) * capacity_;
172 226963 }
173
174 264205 void DeallocMemory(Key *k, Value *v, uint32_t c) {
175
2/2
✓ Branch 0 taken 1402101436 times.
✓ Branch 1 taken 133227 times.
 2798295588 for (uint32_t i = 0; i < c; ++i) {
176 2798031383 k[i].~Key();
177 }
178
2/2
✓ Branch 0 taken 1406053396 times.
✓ Branch 1 taken 133227 times.
 2806199508 for (uint32_t i = 0; i < c; ++i) {
179 2805935303 v[i].~Value();
180 }
181
2/2
✓ Branch 0 taken 133197 times.
✓ Branch 1 taken 30 times.
 264205 if (k)
182 264145 smunmap(k);
183
2/2
✓ Branch 0 taken 133197 times.
✓ Branch 1 taken 30 times.
 264205 if (v)
184 264145 smunmap(v);
185 264205 k = NULL;
186 264205 v = NULL;
187 264205 }
188
189 // Returns true iff the key is overwritten
190 2053062024 bool DoInsert(const Key &key, const Value &value,
191 const bool count_collisions) {
192 uint32_t bucket;
193 uint32_t collisions;
194
1/2
✓ Branch 1 taken 1030008226 times.
✗ Branch 2 not taken.
 2053062024 const bool overwritten = DoLookup(key, &bucket, &collisions);
195
2/2
✓ Branch 0 taken 886192366 times.
✓ Branch 1 taken 143815860 times.
 2050865889 if (count_collisions) {
196 1766571555 num_collisions_ += collisions;
197 1766571555 max_collisions_ = std::max(collisions, max_collisions_);
198 }
199 2060424324 keys_[bucket] = key;
200
1/2
✓ Branch 1 taken 3129096 times.
✗ Branch 2 not taken.
 2060424324 values_[bucket] = value;
201 2060424324 return overwritten;
202 }
203
204 2362225358 bool DoLookup(const Key &key, uint32_t *bucket, uint32_t *collisions) const {
205 2362225358 *bucket = ScaleHash(key);
206 2352471558 *collisions = 0;
207
3/3
✓ Branch 0 taken 2749522177 times.
✓ Branch 1 taken 937397910 times.
✓ Branch 2 taken 238775123 times.
 6203992576 while (!(keys_[*bucket] == empty_key_)) {
208
3/3
✓ Branch 0 taken 147878926 times.
✓ Branch 1 taken 2623153801 times.
✓ Branch 2 taken 138204838 times.
 4179418779 if (keys_[*bucket] == key)
209 327897761 return true;
210 3851521018 *bucket = (*bucket + 1) % capacity_;
211 3851521018 (*collisions)++;
212 }
213 2024573797 return false;
214 }
215
216 264289 void DoClear(const bool reset_capacity) {
217
2/2
✓ Branch 0 taken 1393 times.
✓ Branch 1 taken 131880 times.
 264289 if (reset_capacity)
218 2729 static_cast<Derived *>(this)->ResetCapacity(); // No-op if fixed-size
219
2/2
✓ Branch 0 taken 1402417384 times.
✓ Branch 1 taken 133273 times.
 2798916648 for (uint32_t i = 0; i < capacity_; ++i)
220 2798652359 keys_[i] = empty_key_;
221 264289 size_ = 0;
222 264289 }
223
224 // Methods for resizable version
225 void SetThresholds() { }
226 void Grow() { }
227 void Shrink() { }
228 void ResetCapacity() { }
229
230 // Separate key and value arrays for better locality
231 Key *keys_;
232 Value *values_;
233 uint32_t capacity_;
234 uint32_t initial_capacity_;
235 uint32_t size_;
236 uint32_t (*hasher_)(const Key &key);
237 uint64_t bytes_allocated_;
238 uint64_t num_collisions_;
239 uint32_t max_collisions_; /**< maximum collisions for a single insert */
240 Key empty_key_;
241 };
242
243
244 template<class Key, class Value>
245 class SmallHashFixed
246 : public SmallHashBase<Key, Value, SmallHashFixed<Key, Value> > {
247 friend class SmallHashBase<Key, Value, SmallHashFixed<Key, Value> >;
248
249 protected:
250 // No-ops
251 4667 void SetThresholds() { }
252 815789 void Grow() { }
253 8010 void Shrink() { }
254 6 void ResetCapacity() { }
255 };
256
257
258 template<class Key, class Value>
259 class SmallHashDynamic
260 : public SmallHashBase<Key, Value, SmallHashDynamic<Key, Value> > {
261 friend class SmallHashBase<Key, Value, SmallHashDynamic<Key, Value> >;
262
263 public:
264 typedef SmallHashBase<Key, Value, SmallHashDynamic<Key, Value> > Base;
265 static const double kThresholdGrow;
266 static const double kThresholdShrink;
267
268 123092 SmallHashDynamic() : Base() {
269 123092 num_migrates_ = 0;
270
271 // Properly set by Init
272 123092 threshold_grow_ = 0;
273 123092 threshold_shrink_ = 0;
274 123092 }
275
276 SmallHashDynamic(const SmallHashDynamic<Key, Value> &other) : Base() {
277 num_migrates_ = 0;
278 CopyFrom(other);
279 }
280
281 294 SmallHashDynamic<Key, Value> &operator=(
282 const SmallHashDynamic<Key, Value> &other) {
283
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 162 times.
 294 if (&other == this)
284 ✗ return *this;
285
286 294 CopyFrom(other);
287 294 return *this;
288 }
289
290 34295259 uint32_t capacity() const { return Base::capacity_; }
291 997616244 uint32_t size() const { return Base::size_; }
292 uint32_t num_migrates() const { return num_migrates_; }
293
294 protected:
295 259556 void SetThresholds() {
296 259556 threshold_grow_ = static_cast<uint32_t>(static_cast<double>(capacity())
297 259556 * kThresholdGrow);
298 259556 threshold_shrink_ = static_cast<uint32_t>(static_cast<double>(capacity())
299 259556 * kThresholdShrink);
300 259556 }
301
302 1771266142 void Grow() {
303
2/2
✓ Branch 1 taken 46206 times.
✓ Branch 2 taken 886615246 times.
 1771266142 if (size() > threshold_grow_)
304 92412 Migrate(capacity() * 2);
305 1768331177 }
306
307 95863721 void Shrink() {
308
2/2
✓ Branch 1 taken 16387765 times.
✓ Branch 2 taken 79654480 times.
 95863721 if (size() < threshold_shrink_) {
309 16390216 const uint32_t target_capacity = capacity() / 2;
310
2/2
✓ Branch 0 taken 20640 times.
✓ Branch 1 taken 16366950 times.
 16390041 if (target_capacity >= Base::initial_capacity_)
311 20640 Migrate(target_capacity);
312 }
313 96044521 }
314
315 2723 void ResetCapacity() {
316 2723 Base::DeallocMemory(Base::keys_, Base::values_, Base::capacity_);
317 2723 Base::capacity_ = Base::initial_capacity_;
318 2723 Base::AllocMemory();
319 2723 SetThresholds();
320 2723 }
321
322 private:
323 // Returns a random permutation of indices [0..N-1] that is allocated
324 // by smmap (Knuth's shuffle algorithm)
325 41604 uint32_t *ShuffleIndices(const uint32_t N) {
326 41604 uint32_t *shuffled = static_cast<uint32_t *>(smmap(N * sizeof(uint32_t)));
327 // Init with identity
328
2/2
✓ Branch 0 taken 336534972 times.
✓ Branch 1 taken 20802 times.
 673111548 for (unsigned i = 0; i < N; ++i)
329 673069944 shuffled[i] = i;
330 // Shuffle (no shuffling for the last element)
331
1/2
✓ Branch 0 taken 318846900 times.
✗ Branch 1 not taken.
 636779004 for (unsigned i = 0; i < N - 1; ++i) {
332 637693800 const uint32_t swap_idx = i + g_prng.Next(N - i);
333 636737400 const uint32_t tmp = shuffled[i];
334 636737400 shuffled[i] = shuffled[swap_idx];
335 636737400 shuffled[swap_idx] = tmp;
336 }
337 294 return shuffled;
338 }
339
340 133692 void Migrate(const uint32_t new_capacity) {
341 133692 Key *old_keys = Base::keys_;
342 133692 Value *old_values = Base::values_;
343 133692 const uint32_t old_capacity = capacity();
344 133692 const uint32_t old_size = size();
345
346 133752 Base::capacity_ = new_capacity;
347 133752 SetThresholds();
348 133752 Base::AllocMemory();
349 133812 Base::DoClear(false);
350
2/2
✓ Branch 0 taken 20640 times.
✓ Branch 1 taken 46266 times.
 133812 if (new_capacity < old_capacity) {
351 41280 uint32_t *shuffled_indices = ShuffleIndices(old_capacity);
352
1/2
✓ Branch 0 taken 293305560 times.
✗ Branch 1 not taken.
 586602780 for (uint32_t i = 0; i < old_capacity; ++i) {
353
2/3
✓ Branch 0 taken 73385910 times.
✓ Branch 1 taken 219919650 times.
✗ Branch 2 not taken.
 586611120 if (old_keys[shuffled_indices[i]] != Base::empty_key_) {
354 146771820 Base::Insert(old_keys[shuffled_indices[i]],
355 146771820 old_values[shuffled_indices[i]]);
356 }
357 }
358 ✗ smunmap(shuffled_indices);
359 } else {
360
2/2
✓ Branch 0 taken 570651891 times.
✓ Branch 1 taken 36966 times.
 1141377714 for (uint32_t i = 0; i < old_capacity; ++i) {
361
3/3
✓ Branch 0 taken 315035018 times.
✓ Branch 1 taken 217938758 times.
✓ Branch 2 taken 37678115 times.
 1141303782 if (old_keys[i] != Base::empty_key_)
362 856161246 Base::Insert(old_keys[i], old_values[i]);
363 }
364 }
365
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 66906 times.
 115212 assert(size() == old_size);
366
367 133812 Base::DeallocMemory(old_keys, old_values, old_capacity);
368 133812 num_migrates_++;
369 133812 }
370
371 294 void CopyFrom(const SmallHashDynamic<Key, Value> &other) {
372 294 uint32_t *shuffled_indices = ShuffleIndices(other.capacity_);
373
2/2
✓ Branch 0 taken 41290452 times.
✓ Branch 1 taken 162 times.
 41293518 for (uint32_t i = 0; i < other.capacity_; ++i) {
374
2/3
✗ Branch 0 not taken.
✓ Branch 1 taken 30001386 times.
✓ Branch 2 taken 11289066 times.
 41293224 if (other.keys_[shuffled_indices[i]] != other.empty_key_) {
375 30000000 this->Insert(other.keys_[shuffled_indices[i]],
376 30000000 other.values_[shuffled_indices[i]]);
377 }
378 }
379 294 smunmap(shuffled_indices);
380 294 }
381
382 uint32_t num_migrates_;
383 uint32_t threshold_grow_;
384 uint32_t threshold_shrink_;
385 static Prng g_prng;
386 };
387
388
389 /**
390 * Distributes the key-value pairs over $n$ dynamic hash maps with individual
391 * mutexes. Hence low mutex contention, and benefits from multiple processors.
392 */
393 template<class Key, class Value>
394 class MultiHash {
395 public:
396 300 MultiHash() {
397 300 num_hashmaps_ = 0;
398 300 hashmaps_ = NULL;
399 300 locks_ = NULL;
400 300 }
401
402 300 void Init(const uint8_t num_hashmaps, const Key &empty_key,
403 uint32_t (*hasher)(const Key &key)) {
404
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 300 times.
 300 assert(num_hashmaps > 0);
405 300 const uint8_t N = num_hashmaps;
406 300 num_hashmaps_ = N;
407
3/4
✓ Branch 2 taken 12600 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 12600 times.
✓ Branch 5 taken 300 times.
 12900 hashmaps_ = new SmallHashDynamic<Key, Value>[N]();
408 300 locks_ = static_cast<pthread_mutex_t *>(
409 300 smalloc(N * sizeof(pthread_mutex_t)));
410
2/2
✓ Branch 0 taken 12600 times.
✓ Branch 1 taken 300 times.
 12900 for (uint8_t i = 0; i < N; ++i) {
411 12600 int retval = pthread_mutex_init(&locks_[i], NULL);
412
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 12600 times.
 12600 assert(retval == 0);
413 12600 hashmaps_[i].Init(128, empty_key, hasher);
414 }
415 300 }
416
417 300 ~MultiHash() {
418
2/2
✓ Branch 0 taken 12600 times.
✓ Branch 1 taken 300 times.
 12900 for (uint8_t i = 0; i < num_hashmaps_; ++i) {
419 12600 pthread_mutex_destroy(&locks_[i]);
420 }
421 300 free(locks_);
422
3/4
✓ Branch 0 taken 300 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 12600 times.
✓ Branch 3 taken 300 times.
 12900 delete[] hashmaps_;
423 300 }
424
425 30000000 bool Lookup(const Key &key, Value *value) {
426 30000000 uint8_t target = SelectHashmap(key);
427 30000000 Lock(target);
428 30000000 const bool result = hashmaps_[target].Lookup(key, value);
429 30000000 Unlock(target);
430 30000000 return result;
431 }
432
433 112718010 void Insert(const Key &key, const Value &value) {
434 112718010 uint8_t target = SelectHashmap(key);
435 109192710 Lock(target);
436 112803090 hashmaps_[target].Insert(key, value);
437 109238520 Unlock(target);
438 114544470 }
439
440 54201000 void Erase(const Key &key) {
441 54201000 uint8_t target = SelectHashmap(key);
442 51574710 Lock(target);
443 54971340 hashmaps_[target].Erase(key);
444 49671660 Unlock(target);
445 55934910 }
446
447 30 void Clear() {
448
2/2
✓ Branch 0 taken 1260 times.
✓ Branch 1 taken 30 times.
 1290 for (uint8_t i = 0; i < num_hashmaps_; ++i)
449 1260 Lock(i);
450
2/2
✓ Branch 0 taken 1260 times.
✓ Branch 1 taken 30 times.
 1290 for (uint8_t i = 0; i < num_hashmaps_; ++i)
451 1260 hashmaps_[i].Clear();
452
2/2
✓ Branch 0 taken 1260 times.
✓ Branch 1 taken 30 times.
 1290 for (uint8_t i = 0; i < num_hashmaps_; ++i)
453 1260 Unlock(i);
454 30 }
455
456 300 uint8_t num_hashmaps() const { return num_hashmaps_; }
457
458 240 void GetSizes(uint32_t *sizes) {
459
2/2
✓ Branch 0 taken 10080 times.
✓ Branch 1 taken 240 times.
 10320 for (uint8_t i = 0; i < num_hashmaps_; ++i) {
460 10080 Lock(i);
461 10080 sizes[i] = hashmaps_[i].size();
462 10080 Unlock(i);
463 }
464 240 }
465
466 void GetCollisionStats(uint64_t *num_collisions, uint32_t *max_collisions) {
467 for (uint8_t i = 0; i < num_hashmaps_; ++i) {
468 Lock(i);
469 hashmaps_[i].GetCollisionStats(&num_collisions[i], &max_collisions[i]);
470 Unlock(i);
471 }
472 }
473
474 private:
475 195731370 inline uint8_t SelectHashmap(const Key &key) {
476 195731370 uint32_t hash = MurmurHash2(&key, sizeof(key), 0x37);
477 191901630 double bucket = static_cast<double>(hash)
478 191901630 * static_cast<double>(num_hashmaps_)
479 / static_cast<double>(static_cast<uint32_t>(-1));
480 191901630 return static_cast<uint32_t>(bucket) % num_hashmaps_;
481 }
482
483 190074330 inline void Lock(const uint8_t target) {
484 190074330 int retval = pthread_mutex_lock(&locks_[target]);
485
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 205294710 times.
 205294710 assert(retval == 0);
486 205294710 }
487
488 188652810 inline void Unlock(const uint8_t target) {
489 188652810 int retval = pthread_mutex_unlock(&locks_[target]);
490
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 206785560 times.
 206785560 assert(retval == 0);
491 206785560 }
492
493 uint8_t num_hashmaps_;
494 SmallHashDynamic<Key, Value> *hashmaps_;
495 pthread_mutex_t *locks_;
496 };
497
498
499 // initialize the static fields
500 template<class Key, class Value>
501 Prng SmallHashDynamic<Key, Value>::g_prng;
502
503 template<class Key, class Value, class Derived>
504 const double SmallHashBase<Key, Value, Derived>::kLoadFactor = 0.75;
505
506 template<class Key, class Value>
507 const double SmallHashDynamic<Key, Value>::kThresholdGrow = 0.75;
508
509 template<class Key, class Value>
510 const double SmallHashDynamic<Key, Value>::kThresholdShrink = 0.25;
511
512 #endif // CVMFS_SMALLHASH_H_
513