GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/smallhash.h
Date: 2026-02-01 02:35:56
Exec Total Coverage
Lines: 260 263 98.9%
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 191385 SmallHashBase() {
43 191385 keys_ = NULL;
44 191385 values_ = NULL;
45 191385 hasher_ = NULL;
46 191385 bytes_allocated_ = 0;
47 191385 num_collisions_ = 0;
48 191385 max_collisions_ = 0;
49
50 // Properly initialized by Init()
51 191385 capacity_ = 0;
52 191385 initial_capacity_ = 0;
53 191385 size_ = 0;
54 191385 }
55
56 191247 ~SmallHashBase() { DeallocMemory(keys_, values_, capacity_); }
57
58 191337 void Init(uint32_t expected_size, Key empty,
59 uint32_t (*hasher)(const Key &key)) {
60 191337 hasher_ = hasher;
61 191337 empty_key_ = empty;
62 191337 capacity_ = static_cast<uint32_t>(static_cast<double>(expected_size)
63 191337 / kLoadFactor);
64 191337 initial_capacity_ = capacity_;
65 191337 static_cast<Derived *>(this)->SetThresholds(); // No-op for fixed size
66 191337 AllocMemory();
67 191337 this->DoClear(false);
68 191337 }
69
70 95084991 bool Lookup(const Key &key, Value *value) const {
71 uint32_t bucket;
72 uint32_t collisions;
73
1/2
✓ Branch 1 taken 95131349 times.
✗ Branch 2 not taken.
 95084991 const bool found = DoLookup(key, &bucket, &collisions);
74
2/2
✓ Branch 0 taken 75473806 times.
✓ Branch 1 taken 19657543 times.
 95236662 if (found)
75
1/2
✓ Branch 1 taken 83620 times.
✗ Branch 2 not taken.
 75509172 *value = values_[bucket];
76 95236662 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 528 bool LookupEx(Key *key, Value *value) const {
87 528 uint32_t bucket = ScaleHash(*key);
88
2/2
✓ Branch 1 taken 176 times.
✓ Branch 2 taken 88 times.
 528 while (!(keys_[bucket] == empty_key_)) {
89
1/2
✓ Branch 1 taken 176 times.
✗ Branch 2 not taken.
 352 if (keys_[bucket] == *key) {
90 352 *key = keys_[bucket];
91 352 *value = values_[bucket];
92 352 return true;
93 }
94 ✗ bucket = (bucket + 1) % capacity_;
95 }
96 176 return false;
97 }
98
99 47073253 bool Contains(const Key &key) const {
100 uint32_t bucket;
101 uint32_t collisions;
102
1/2
✓ Branch 1 taken 47072450 times.
✗ Branch 2 not taken.
 47073253 const bool found = DoLookup(key, &bucket, &collisions);
103 47073253 return found;
104 }
105
106 1562772227 void Insert(const Key &key, const Value &value) {
107 1562772227 static_cast<Derived *>(this)->Grow(); // No-op if fixed-size
108 1556686268 const bool overwritten = DoInsert(key, value, true);
109 1559548901 size_ += !overwritten; // size + 1 if the key was not yet in the map
110 1559548901 }
111
112 99858845 bool Erase(const Key &key) {
113 uint32_t bucket;
114 uint32_t collisions;
115
1/2
✓ Branch 1 taken 97437415 times.
✗ Branch 2 not taken.
 99858845 const bool found = DoLookup(key, &bucket, &collisions);
116
1/2
✓ Branch 0 taken 97448649 times.
✗ Branch 1 not taken.
 97441622 if (found) {
117 97452504 keys_[bucket] = empty_key_;
118 97452504 size_--;
119 97452504 bucket = (bucket + 1) % capacity_;
120
3/3
✓ Branch 0 taken 152507978 times.
✓ Branch 1 taken 84499661 times.
✓ Branch 2 taken 14373094 times.
 251384590 while (!(keys_[bucket] == empty_key_)) {
121 154944622 Key rehash = keys_[bucket];
122 154944622 keys_[bucket] = empty_key_;
123
1/2
✓ Branch 1 taken 153932084 times.
✗ Branch 2 not taken.
 154944622 DoInsert(rehash, values_[bucket], false);
124 153932086 bucket = (bucket + 1) % capacity_;
125 }
126
1/2
✓ Branch 1 taken 97487596 times.
✗ Branch 2 not taken.
 96439968 static_cast<Derived *>(this)->Shrink(); // No-op if fixed-size
127 }
128 97523858 return found;
129 }
130
131 1599 void Clear() { DoClear(true); }
132
133 5945 uint64_t bytes_allocated() const { return bytes_allocated_; }
134 1455 static double GetEntrySize() {
135 2910 const double unit = sizeof(Key) + sizeof(Value);
136 2910 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 185644 Key empty_key() const { return empty_key_; }
148 411074 Key *keys() const { return keys_; }
149 695 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 2220184091 uint32_t ScaleHash(const Key &key) const {
156 2220184091 const double bucket = (static_cast<double>(hasher_(key))
157 2214684866 * static_cast<double>(capacity_)
158 / static_cast<double>(static_cast<uint32_t>(-1)));
159 2214684866 return static_cast<uint32_t>(bucket) % capacity_;
160 }
161
162 301025 void AllocMemory() {
163 301025 keys_ = static_cast<Key *>(smmap(capacity_ * sizeof(Key)));
164 301121 values_ = static_cast<Value *>(smmap(capacity_ * sizeof(Value)));
165
2/2
✓ Branch 0 taken 1685165644 times.
✓ Branch 1 taken 152499 times.
 3362925400 for (uint32_t i = 0; i < capacity_; ++i) {
166 3362624279 /*keys_[i] =*/new (keys_ + i) Key();
167 }
168
2/2
✓ Branch 0 taken 1688185564 times.
✓ Branch 1 taken 103251 times.
 3368866744 for (uint32_t i = 0; i < capacity_; ++i) {
169 3368664119 /*values_[i] =*/new (values_ + i) Value();
170 }
171 202625 bytes_allocated_ = (sizeof(Key) + sizeof(Value)) * capacity_;
172 202625 }
173
174 301031 void DeallocMemory(Key *k, Value *v, uint32_t c) {
175
2/2
✓ Branch 0 taken 1690667254 times.
✓ Branch 1 taken 152453 times.
 3373931260 for (uint32_t i = 0; i < c; ++i) {
176 3373630229 k[i].~Key();
177 }
178
2/2
✓ Branch 0 taken 1690100686 times.
✓ Branch 1 taken 152453 times.
 3372798124 for (uint32_t i = 0; i < c; ++i) {
179 3372497093 v[i].~Value();
180 }
181
2/2
✓ Branch 0 taken 152429 times.
✓ Branch 1 taken 24 times.
 301031 if (k)
182 300983 smunmap(k);
183
2/2
✓ Branch 0 taken 152429 times.
✓ Branch 1 taken 24 times.
 301031 if (v)
184 300983 smunmap(v);
185 301031 k = NULL;
186 301031 v = NULL;
187 301031 }
188
189 // Returns true iff the key is overwritten
190 1824227832 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 950366931 times.
✗ Branch 2 not taken.
 1824227832 const bool overwritten = DoLookup(key, &bucket, &collisions);
195
2/2
✓ Branch 0 taken 796789807 times.
✓ Branch 1 taken 153577124 times.
 1821837717 if (count_collisions) {
196 1555277867 num_collisions_ += collisions;
197 1555277867 max_collisions_ = std::max(collisions, max_collisions_);
198 }
199 1827539805 keys_[bucket] = key;
200
1/2
✓ Branch 1 taken 40620636 times.
✗ Branch 2 not taken.
 1827539805 values_[bucket] = value;
201 1827539805 return overwritten;
202 }
203
204 2221445225 bool DoLookup(const Key &key, uint32_t *bucket, uint32_t *collisions) const {
205 2221445225 *bucket = ScaleHash(key);
206 2214147200 *collisions = 0;
207
3/3
✓ Branch 0 taken 21980556382 times.
✓ Branch 1 taken 986102033 times.
✓ Branch 2 taken 245340036 times.
 25254378011 while (!(keys_[*bucket] == empty_key_)) {
208
3/3
✓ Branch 0 taken 174171775 times.
✓ Branch 1 taken 21870984786 times.
✓ Branch 2 taken 225997687 times.
 23452273916 if (keys_[*bucket] == key)
209 412043105 return true;
210 23040230811 *bucket = (*bucket + 1) % capacity_;
211 23040230811 (*collisions)++;
212 }
213 1802104095 return false;
214 }
215
216 301197 void DoClear(const bool reset_capacity) {
217
2/2
✓ Branch 0 taken 1599 times.
✓ Branch 1 taken 150976 times.
 301197 if (reset_capacity)
218 2680 static_cast<Derived *>(this)->ResetCapacity(); // No-op if fixed-size
219
2/2
✓ Branch 0 taken 1690117816 times.
✓ Branch 1 taken 152575 times.
 3372726080 for (uint32_t i = 0; i < capacity_; ++i)
220 3372424883 keys_[i] = empty_key_;
221 301197 size_ = 0;
222 301197 }
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 5869 void SetThresholds() { }
252 1204666 void Grow() { }
253 43289 void Shrink() { }
254 76 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 185516 SmallHashDynamic() : Base() {
269 185516 num_migrates_ = 0;
270
271 // Properly set by Init
272 185516 threshold_grow_ = 0;
273 185516 threshold_shrink_ = 0;
274 185516 }
275
276 SmallHashDynamic(const SmallHashDynamic<Key, Value> &other) : Base() {
277 num_migrates_ = 0;
278 CopyFrom(other);
279 }
280
281 376 SmallHashDynamic<Key, Value> &operator=(
282 const SmallHashDynamic<Key, Value> &other) {
283
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 200 times.
 376 if (&other == this)
284 ✗ return *this;
285
286 376 CopyFrom(other);
287 376 return *this;
288 }
289
290 68550972 uint32_t capacity() const { return Base::capacity_; }
291 909084552 uint32_t size() const { return Base::size_; }
292 uint32_t num_migrates() const { return num_migrates_; }
293
294 protected:
295 295108 void SetThresholds() {
296 295108 threshold_grow_ = static_cast<uint32_t>(static_cast<double>(capacity())
297 295156 * kThresholdGrow);
298 295156 threshold_shrink_ = static_cast<uint32_t>(static_cast<double>(capacity())
299 295156 * kThresholdShrink);
300 295156 }
301
302 1559747147 void Grow() {
303
2/2
✓ Branch 1 taken 37032 times.
✓ Branch 2 taken 796830309 times.
 1559747147 if (size() > threshold_grow_)
304 74064 Migrate(capacity() * 2);
305 1556679440 }
306
307 97362472 void Shrink() {
308
2/2
✓ Branch 1 taken 33625174 times.
✓ Branch 2 taken 63778665 times.
 97362472 if (size() < threshold_shrink_) {
309 33629029 const uint32_t target_capacity = capacity() / 2;
310
2/2
✓ Branch 0 taken 16464 times.
✓ Branch 1 taken 33589021 times.
 33609340 if (target_capacity >= Base::initial_capacity_)
311 16464 Migrate(target_capacity);
312 }
313 97388053 }
314
315 2604 void ResetCapacity() {
316 2604 Base::DeallocMemory(Base::keys_, Base::values_, Base::capacity_);
317 2604 Base::capacity_ = Base::initial_capacity_;
318 2604 Base::AllocMemory();
319 2604 SetThresholds();
320 2604 }
321
322 private:
323 // Returns a random permutation of indices [0..N-1] that is allocated
324 // by smmap (Knuth's shuffle algorithm)
325 33424 uint32_t *ShuffleIndices(const uint32_t N) {
326 33424 uint32_t *shuffled = static_cast<uint32_t *>(smmap(N * sizeof(uint32_t)));
327 // Init with identity
328
2/2
✓ Branch 0 taken 271708392 times.
✓ Branch 1 taken 16712 times.
 543450208 for (unsigned i = 0; i < N; ++i)
329 543416784 shuffled[i] = i;
330 // Shuffle (no shuffling for the last element)
331
1/2
✓ Branch 0 taken 258819880 times.
✗ Branch 1 not taken.
 517624560 for (unsigned i = 0; i < N - 1; ++i) {
332 517639760 const uint32_t swap_idx = i + g_prng.Next(N - i);
333 517591136 const uint32_t tmp = shuffled[i];
334 517591136 shuffled[i] = shuffled[swap_idx];
335 517591136 shuffled[swap_idx] = tmp;
336 }
337 376 return shuffled;
338 }
339
340 106992 void Migrate(const uint32_t new_capacity) {
341 106992 Key *old_keys = Base::keys_;
342 106992 Value *old_values = Base::values_;
343 106992 const uint32_t old_capacity = capacity();
344 106992 const uint32_t old_size = size();
345
346 106992 Base::capacity_ = new_capacity;
347 106992 SetThresholds();
348 107040 Base::AllocMemory();
349 107136 Base::DoClear(false);
350
2/2
✓ Branch 0 taken 16512 times.
✓ Branch 1 taken 37056 times.
 107136 if (new_capacity < old_capacity) {
351 33024 uint32_t *shuffled_indices = ShuffleIndices(old_capacity);
352
2/2
✓ Branch 0 taken 234139968 times.
✓ Branch 1 taken 6552 times.
 468293040 for (uint32_t i = 0; i < old_capacity; ++i) {
353
2/3
✓ Branch 0 taken 58712472 times.
✓ Branch 1 taken 175427496 times.
✗ Branch 2 not taken.
 468279936 if (old_keys[shuffled_indices[i]] != Base::empty_key_) {
354 117424944 Base::Insert(old_keys[shuffled_indices[i]],
355 117424944 old_values[shuffled_indices[i]]);
356 }
357 }
358 13104 smunmap(shuffled_indices);
359 } else {
360
1/2
✓ Branch 0 taken 462652734 times.
✗ Branch 1 not taken.
 924823116 for (uint32_t i = 0; i < old_capacity; ++i) {
361
3/3
✓ Branch 0 taken 252174756 times.
✓ Branch 1 taken 178846040 times.
✓ Branch 2 taken 31631938 times.
 925305468 if (old_keys[i] != Base::empty_key_)
362 694159660 Base::Insert(old_keys[i], old_values[i]);
363 }
364 }
365
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 53568 times.
 4608 assert(size() == old_size);
366
367 107136 Base::DeallocMemory(old_keys, old_values, old_capacity);
368 107136 num_migrates_++;
369 107136 }
370
371 376 void CopyFrom(const SmallHashDynamic<Key, Value> &other) {
372 376 uint32_t *shuffled_indices = ShuffleIndices(other.capacity_);
373
2/2
✓ Branch 0 taken 33033840 times.
✓ Branch 1 taken 200 times.
 33037912 for (uint32_t i = 0; i < other.capacity_; ++i) {
374
2/3
✗ Branch 0 not taken.
✓ Branch 1 taken 24001848 times.
✓ Branch 2 taken 9031992 times.
 33037536 if (other.keys_[shuffled_indices[i]] != other.empty_key_) {
375 24000000 this->Insert(other.keys_[shuffled_indices[i]],
376 24000000 other.values_[shuffled_indices[i]]);
377 }
378 }
379 376 smunmap(shuffled_indices);
380 376 }
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 240 MultiHash() {
397 240 num_hashmaps_ = 0;
398 240 hashmaps_ = NULL;
399 240 locks_ = NULL;
400 240 }
401
402 240 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 240 times.
 240 assert(num_hashmaps > 0);
405 240 const uint8_t N = num_hashmaps;
406 240 num_hashmaps_ = N;
407
3/4
✓ Branch 2 taken 10080 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 10080 times.
✓ Branch 5 taken 240 times.
 10320 hashmaps_ = new SmallHashDynamic<Key, Value>[N]();
408 240 locks_ = static_cast<pthread_mutex_t *>(
409 240 smalloc(N * sizeof(pthread_mutex_t)));
410
2/2
✓ Branch 0 taken 10080 times.
✓ Branch 1 taken 240 times.
 10320 for (uint8_t i = 0; i < N; ++i) {
411 10080 int retval = pthread_mutex_init(&locks_[i], NULL);
412
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 10080 times.
 10080 assert(retval == 0);
413 10080 hashmaps_[i].Init(128, empty_key, hasher);
414 }
415 240 }
416
417 240 ~MultiHash() {
418
2/2
✓ Branch 0 taken 10080 times.
✓ Branch 1 taken 240 times.
 10320 for (uint8_t i = 0; i < num_hashmaps_; ++i) {
419 10080 pthread_mutex_destroy(&locks_[i]);
420 }
421 240 free(locks_);
422
3/4
✓ Branch 0 taken 240 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 10080 times.
✓ Branch 3 taken 240 times.
 10320 delete[] hashmaps_;
423 240 }
424
425 24000000 bool Lookup(const Key &key, Value *value) {
426 24000000 uint8_t target = SelectHashmap(key);
427 24000000 Lock(target);
428 24000000 const bool result = hashmaps_[target].Lookup(key, value);
429 24000000 Unlock(target);
430 24000000 return result;
431 }
432
433 89732568 void Insert(const Key &key, const Value &value) {
434 89732568 uint8_t target = SelectHashmap(key);
435 87456936 Lock(target);
436 90674448 hashmaps_[target].Insert(key, value);
437 87063696 Unlock(target);
438 93296232 }
439
440 43223880 void Erase(const Key &key) {
441 43223880 uint8_t target = SelectHashmap(key);
442 41336016 Lock(target);
443 44173656 hashmaps_[target].Erase(key);
444 39616128 Unlock(target);
445 44941992 }
446
447 24 void Clear() {
448
2/2
✓ Branch 0 taken 1008 times.
✓ Branch 1 taken 24 times.
 1032 for (uint8_t i = 0; i < num_hashmaps_; ++i)
449 1008 Lock(i);
450
2/2
✓ Branch 0 taken 1008 times.
✓ Branch 1 taken 24 times.
 1032 for (uint8_t i = 0; i < num_hashmaps_; ++i)
451 1008 hashmaps_[i].Clear();
452
2/2
✓ Branch 0 taken 1008 times.
✓ Branch 1 taken 24 times.
 1032 for (uint8_t i = 0; i < num_hashmaps_; ++i)
453 1008 Unlock(i);
454 24 }
455
456 240 uint8_t num_hashmaps() const { return num_hashmaps_; }
457
458 192 void GetSizes(uint32_t *sizes) {
459
2/2
✓ Branch 0 taken 8064 times.
✓ Branch 1 taken 192 times.
 8256 for (uint8_t i = 0; i < num_hashmaps_; ++i) {
460 8064 Lock(i);
461 8064 sizes[i] = hashmaps_[i].size();
462 8064 Unlock(i);
463 }
464 192 }
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 155917008 inline uint8_t SelectHashmap(const Key &key) {
476 155917008 uint32_t hash = MurmurHash2(&key, sizeof(key), 0x37);
477 153412512 double bucket = static_cast<double>(hash)
478 153412512 * static_cast<double>(num_hashmaps_)
479 / static_cast<double>(static_cast<uint32_t>(-1));
480 153412512 return static_cast<uint32_t>(bucket) % num_hashmaps_;
481 }
482
483 152260272 inline void Lock(const uint8_t target) {
484 152260272 int retval = pthread_mutex_lock(&locks_[target]);
485
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 164240880 times.
 164240880 assert(retval == 0);
486 164240880 }
487
488 150590400 inline void Unlock(const uint8_t target) {
489 150590400 int retval = pthread_mutex_unlock(&locks_[target]);
490
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 165264120 times.
 165264120 assert(retval == 0);
491 165264120 }
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