GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/smallhash.h
Date: 2026-04-05 02:35:23
Exec Total Coverage
Lines: 259 263 98.5%
Branches: 86 110 78.2%
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 103015 SmallHashBase() {
43 103015 keys_ = NULL;
44 103015 values_ = NULL;
45 103015 hasher_ = NULL;
46 103015 bytes_allocated_ = 0;
47 103015 num_collisions_ = 0;
48 103015 max_collisions_ = 0;
49
50 // Properly initialized by Init()
51 103015 capacity_ = 0;
52 103015 initial_capacity_ = 0;
53 103015 size_ = 0;
54 103015 }
55
56 102877 ~SmallHashBase() { DeallocMemory(keys_, values_, capacity_); }
57
58 103009 void Init(uint32_t expected_size, Key empty,
59 uint32_t (*hasher)(const Key &key)) {
60 103009 hasher_ = hasher;
61 103009 empty_key_ = empty;
62 103009 capacity_ = static_cast<uint32_t>(static_cast<double>(expected_size)
63 103009 / kLoadFactor);
64 103009 initial_capacity_ = capacity_;
65 103009 static_cast<Derived *>(this)->SetThresholds(); // No-op for fixed size
66 103009 AllocMemory();
67 103009 this->DoClear(false);
68 103009 }
69
70 13053767 bool Lookup(const Key &key, Value *value) const {
71 uint32_t bucket;
72 uint32_t collisions;
73
1/2
✓ Branch 1 taken 12997970 times.
✗ Branch 2 not taken.
 13053767 const bool found = DoLookup(key, &bucket, &collisions);
74
2/2
✓ Branch 0 taken 10825381 times.
✓ Branch 1 taken 2172589 times.
 13070307 if (found)
75
1/2
✓ Branch 1 taken 49599 times.
✗ Branch 2 not taken.
 10849436 *value = values_[bucket];
76 13070307 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 352 bool LookupEx(Key *key, Value *value) const {
87 352 uint32_t bucket = ScaleHash(*key);
88
2/2
✓ Branch 1 taken 118 times.
✓ Branch 2 taken 58 times.
 352 while (!(keys_[bucket] == empty_key_)) {
89
1/2
✓ Branch 1 taken 118 times.
✗ Branch 2 not taken.
 236 if (keys_[bucket] == *key) {
90 236 *key = keys_[bucket];
91 236 *value = values_[bucket];
92 236 return true;
93 }
94 ✗ bucket = (bucket + 1) % capacity_;
95 }
96 116 return false;
97 }
98
99 49066918 bool Contains(const Key &key) const {
100 uint32_t bucket;
101 uint32_t collisions;
102
1/2
✓ Branch 1 taken 49066199 times.
✗ Branch 2 not taken.
 49066918 const bool found = DoLookup(key, &bucket, &collisions);
103 49066918 return found;
104 }
105
106 392983441 void Insert(const Key &key, const Value &value) {
107 392983441 static_cast<Derived *>(this)->Grow(); // No-op if fixed-size
108 392484621 const bool overwritten = DoInsert(key, value, true);
109 392574577 size_ += !overwritten; // size + 1 if the key was not yet in the map
110 392574577 }
111
112 28371814 bool Erase(const Key &key) {
113 uint32_t bucket;
114 uint32_t collisions;
115
1/2
✓ Branch 1 taken 28033745 times.
✗ Branch 2 not taken.
 28371814 const bool found = DoLookup(key, &bucket, &collisions);
116
1/2
✓ Branch 0 taken 28033935 times.
✗ Branch 1 not taken.
 28037442 if (found) {
117 28037439 keys_[bucket] = empty_key_;
118 28037439 size_--;
119 28037439 bucket = (bucket + 1) % capacity_;
120
3/3
✓ Branch 0 taken 38118829 times.
✓ Branch 1 taken 12640828 times.
✓ Branch 2 taken 18051962 times.
 68815123 while (!(keys_[bucket] == empty_key_)) {
121 40739641 Key rehash = keys_[bucket];
122 40739641 keys_[bucket] = empty_key_;
123
1/2
✓ Branch 1 taken 40777684 times.
✗ Branch 2 not taken.
 40739641 DoInsert(rehash, values_[bucket], false);
124 40777684 bucket = (bucket + 1) % capacity_;
125 }
126
1/2
✓ Branch 1 taken 28163849 times.
✗ Branch 2 not taken.
 28075482 static_cast<Derived *>(this)->Shrink(); // No-op if fixed-size
127 }
128 28193454 return found;
129 }
130
131 615 void Clear() { DoClear(true); }
132
133 6636 uint64_t bytes_allocated() const { return bytes_allocated_; }
134 1869 static double GetEntrySize() {
135 3738 const double unit = sizeof(Key) + sizeof(Value);
136 3738 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 123728 Key empty_key() const { return empty_key_; }
148 313384 Key *keys() const { return keys_; }
149 567 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 618963928 uint32_t ScaleHash(const Key &key) const {
156 618963928 const double bucket = (static_cast<double>(hasher_(key))
157 619336442 * static_cast<double>(capacity_)
158 / static_cast<double>(static_cast<uint32_t>(-1)));
159 619336442 return static_cast<uint32_t>(bucket) % capacity_;
160 }
161
162 119794 void AllocMemory() {
163 119794 keys_ = static_cast<Key *>(smmap(capacity_ * sizeof(Key)));
164 119794 values_ = static_cast<Value *>(smmap(capacity_ * sizeof(Value)));
165
2/2
✓ Branch 0 taken 874186842 times.
✓ Branch 1 taken 61687 times.
 1736970158 for (uint32_t i = 0; i < capacity_; ++i) {
166 1736850364 /*keys_[i] =*/new (keys_ + i) Key();
167 }
168
2/2
✓ Branch 0 taken 874352685 times.
✓ Branch 1 taken 64843 times.
 1737308156 for (uint32_t i = 0; i < capacity_; ++i) {
169 1737182050 /*values_[i] =*/new (values_ + i) Value();
170 }
171 126106 bytes_allocated_ = (sizeof(Key) + sizeof(Value)) * capacity_;
172 126106 }
173
174 119656 void DeallocMemory(Key *k, Value *v, uint32_t c) {
175
2/2
✓ Branch 0 taken 874625484 times.
✓ Branch 1 taken 61617 times.
 1737850034 for (uint32_t i = 0; i < c; ++i) {
176 1737730378 k[i].~Key();
177 }
178
2/2
✓ Branch 0 taken 874707948 times.
✓ Branch 1 taken 61617 times.
 1738014962 for (uint32_t i = 0; i < c; ++i) {
179 1737895306 v[i].~Value();
180 }
181
1/2
✓ Branch 0 taken 61617 times.
✗ Branch 1 not taken.
 119656 if (k)
182 119656 smunmap(k);
183
1/2
✓ Branch 0 taken 61617 times.
✗ Branch 1 not taken.
 119656 if (v)
184 119656 smunmap(v);
185 119656 k = NULL;
186 119656 v = NULL;
187 119656 }
188
189 // Returns true iff the key is overwritten
190 449697550 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 239553014 times.
✗ Branch 2 not taken.
 449697550 const bool overwritten = DoLookup(key, &bucket, &collisions);
195
2/2
✓ Branch 0 taken 198813093 times.
✓ Branch 1 taken 40739921 times.
 450176364 if (count_collisions) {
196 392658553 num_collisions_ += collisions;
197 392658553 max_collisions_ = std::max(collisions, max_collisions_);
198 }
199 450153942 keys_[bucket] = key;
200
1/2
✓ Branch 1 taken 23956114 times.
✗ Branch 2 not taken.
 450153942 values_[bucket] = value;
201 450153942 return overwritten;
202 }
203
204 619215536 bool DoLookup(const Key &key, uint32_t *bucket, uint32_t *collisions) const {
205 619215536 *bucket = ScaleHash(key);
206 619052924 *collisions = 0;
207
3/3
✓ Branch 0 taken 12515512241 times.
✓ Branch 1 taken 363637344 times.
✓ Branch 2 taken 131936651 times.
 13584472774 while (!(keys_[*bucket] == empty_key_)) {
208
3/3
✓ Branch 0 taken 20391841 times.
✓ Branch 1 taken 12565512636 times.
✓ Branch 2 taken 187529135 times.
 13137301489 if (keys_[*bucket] == key)
209 171881639 return true;
210 12965419850 *bucket = (*bucket + 1) % capacity_;
211 12965419850 (*collisions)++;
212 }
213 447171285 return false;
214 }
215
216 119840 void DoClear(const bool reset_capacity) {
217
2/2
✓ Branch 0 taken 615 times.
✓ Branch 1 taken 61118 times.
 119840 if (reset_capacity)
218 793 static_cast<Derived *>(this)->ResetCapacity(); // No-op if fixed-size
219
2/2
✓ Branch 0 taken 875000628 times.
✓ Branch 1 taken 61733 times.
 1738534986 for (uint32_t i = 0; i < capacity_; ++i)
220 1738415146 keys_[i] = empty_key_;
221 119840 size_ = 0;
222 119840 }
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 6590 void SetThresholds() { }
252 1181179 void Grow() { }
253 26098 void Shrink() { }
254 46 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 96425 SmallHashDynamic() : Base() {
269 96425 num_migrates_ = 0;
270
271 // Properly set by Init
272 96425 threshold_grow_ = 0;
273 96425 threshold_shrink_ = 0;
274 96425 }
275
276 SmallHashDynamic(const SmallHashDynamic<Key, Value> &other) : Base() {
277 num_migrates_ = 0;
278 CopyFrom(other);
279 }
280
281 187 SmallHashDynamic<Key, Value> &operator=(
282 const SmallHashDynamic<Key, Value> &other) {
283
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 95 times.
 187 if (&other == this)
284 ✗ return *this;
285
286 187 CopyFrom(other);
287 187 return *this;
288 }
289
290 40760967 uint32_t capacity() const { return Base::capacity_; }
291 243825189 uint32_t size() const { return Base::size_; }
292 uint32_t num_migrates() const { return num_migrates_; }
293
294 protected:
295 113198 void SetThresholds() {
296 113198 threshold_grow_ = static_cast<uint32_t>(static_cast<double>(capacity())
297 113198 * kThresholdGrow);
298 113198 threshold_shrink_ = static_cast<uint32_t>(static_cast<double>(capacity())
299 113204 * kThresholdShrink);
300 113204 }
301
302 391538475 void Grow() {
303
2/2
✓ Branch 1 taken 5937 times.
✓ Branch 2 taken 197552428 times.
 391538475 if (size() > threshold_grow_)
304 11874 Migrate(capacity() * 2);
305 391335245 }
306
307 28160314 void Shrink() {
308
2/2
✓ Branch 1 taken 20044550 times.
✓ Branch 2 taken 8116219 times.
 28160314 if (size() < threshold_shrink_) {
309 20048054 const uint32_t target_capacity = capacity() / 2;
310
2/2
✓ Branch 0 taken 2064 times.
✓ Branch 1 taken 20041438 times.
 20047006 if (target_capacity >= Base::initial_capacity_)
311 2064 Migrate(target_capacity);
312 }
313 28163225 }
314
315 747 void ResetCapacity() {
316 747 Base::DeallocMemory(Base::keys_, Base::values_, Base::capacity_);
317 747 Base::capacity_ = Base::initial_capacity_;
318 747 Base::AllocMemory();
319 747 SetThresholds();
320 747 }
321
322 private:
323 // Returns a random permutation of indices [0..N-1] that is allocated
324 // by smmap (Knuth's shuffle algorithm)
325 4318 uint32_t *ShuffleIndices(const uint32_t N) {
326 4318 uint32_t *shuffled = static_cast<uint32_t *>(smmap(N * sizeof(uint32_t)));
327 // Init with identity
328
2/2
✓ Branch 0 taken 33639795 times.
✓ Branch 1 taken 2159 times.
 67283908 for (unsigned i = 0; i < N; ++i)
329 67279590 shuffled[i] = i;
330 // Shuffle (no shuffling for the last element)
331
1/2
✓ Branch 0 taken 31893844 times.
✗ Branch 1 not taken.
 63725052 for (unsigned i = 0; i < N - 1; ++i) {
332 63787688 const uint32_t swap_idx = i + g_prng.Next(N - i);
333 63720734 const uint32_t tmp = shuffled[i];
334 63720734 shuffled[i] = shuffled[swap_idx];
335 63720734 shuffled[swap_idx] = tmp;
336 }
337 187 return shuffled;
338 }
339
340 16008 void Migrate(const uint32_t new_capacity) {
341 16008 Key *old_keys = Base::keys_;
342 16008 Value *old_values = Base::values_;
343 16008 const uint32_t old_capacity = capacity();
344 16008 const uint32_t old_size = size();
345
346 16008 Base::capacity_ = new_capacity;
347 16008 SetThresholds();
348 16008 Base::AllocMemory();
349 16002 Base::DoClear(false);
350
2/2
✓ Branch 0 taken 2064 times.
✓ Branch 1 taken 5940 times.
 16008 if (new_capacity < old_capacity) {
351 4128 uint32_t *shuffled_indices = ShuffleIndices(old_capacity);
352
1/2
✓ Branch 0 taken 28965888 times.
✗ Branch 1 not taken.
 57930852 for (uint32_t i = 0; i < old_capacity; ++i) {
353
2/3
✓ Branch 0 taken 7260129 times.
✓ Branch 1 taken 21705759 times.
✗ Branch 2 not taken.
 57931776 if (old_keys[shuffled_indices[i]] != Base::empty_key_) {
354 14520258 Base::Insert(old_keys[shuffled_indices[i]],
355 14520258 old_values[shuffled_indices[i]]);
356 }
357 }
358 ✗ smunmap(shuffled_indices);
359 } else {
360
2/2
✓ Branch 0 taken 88661868 times.
✓ Branch 1 taken 2661 times.
 177329058 for (uint32_t i = 0; i < old_capacity; ++i) {
361
3/3
✓ Branch 0 taken 31482790 times.
✓ Branch 1 taken 45506066 times.
✓ Branch 2 taken 11673012 times.
 177323736 if (old_keys[i] != Base::empty_key_)
362 133013906 Base::Insert(old_keys[i], old_values[i]);
363 }
364 }
365
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 8001 times.
 9450 assert(size() == old_size);
366
367 16002 Base::DeallocMemory(old_keys, old_values, old_capacity);
368 16008 num_migrates_++;
369 16008 }
370
371 187 void CopyFrom(const SmallHashDynamic<Key, Value> &other) {
372 187 uint32_t *shuffled_indices = ShuffleIndices(other.capacity_);
373
2/2
✓ Branch 0 taken 4130700 times.
✓ Branch 1 taken 95 times.
 4132819 for (uint32_t i = 0; i < other.capacity_; ++i) {
374
2/3
✗ Branch 0 not taken.
✓ Branch 1 taken 3000966 times.
✓ Branch 2 taken 1129734 times.
 4132632 if (other.keys_[shuffled_indices[i]] != other.empty_key_) {
375 3000000 this->Insert(other.keys_[shuffled_indices[i]],
376 3000000 other.values_[shuffled_indices[i]]);
377 }
378 }
379 187 smunmap(shuffled_indices);
380 187 }
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 30 MultiHash() {
397 30 num_hashmaps_ = 0;
398 30 hashmaps_ = NULL;
399 30 locks_ = NULL;
400 30 }
401
402 30 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 30 times.
 30 assert(num_hashmaps > 0);
405 30 const uint8_t N = num_hashmaps;
406 30 num_hashmaps_ = N;
407
3/4
✓ Branch 2 taken 1260 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 1260 times.
✓ Branch 5 taken 30 times.
 1290 hashmaps_ = new SmallHashDynamic<Key, Value>[N]();
408 30 locks_ = static_cast<pthread_mutex_t *>(
409 30 smalloc(N * sizeof(pthread_mutex_t)));
410
2/2
✓ Branch 0 taken 1260 times.
✓ Branch 1 taken 30 times.
 1290 for (uint8_t i = 0; i < N; ++i) {
411 1260 int retval = pthread_mutex_init(&locks_[i], NULL);
412
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 1260 times.
 1260 assert(retval == 0);
413 1260 hashmaps_[i].Init(128, empty_key, hasher);
414 }
415 30 }
416
417 30 ~MultiHash() {
418
2/2
✓ Branch 0 taken 1260 times.
✓ Branch 1 taken 30 times.
 1290 for (uint8_t i = 0; i < num_hashmaps_; ++i) {
419 1260 pthread_mutex_destroy(&locks_[i]);
420 }
421 30 free(locks_);
422
3/4
✓ Branch 0 taken 30 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 1260 times.
✓ Branch 3 taken 30 times.
 1290 delete[] hashmaps_;
423 30 }
424
425 3000000 bool Lookup(const Key &key, Value *value) {
426 3000000 uint8_t target = SelectHashmap(key);
427 3000000 Lock(target);
428 3000000 const bool result = hashmaps_[target].Lookup(key, value);
429 3000000 Unlock(target);
430 3000000 return result;
431 }
432
433 11209467 void Insert(const Key &key, const Value &value) {
434 11209467 uint8_t target = SelectHashmap(key);
435 10897815 Lock(target);
436 11285973 hashmaps_[target].Insert(key, value);
437 10810455 Unlock(target);
438 11504418 }
439
440 5459436 void Erase(const Key &key) {
441 5459436 uint8_t target = SelectHashmap(key);
442 5205702 Lock(target);
443 5529918 hashmaps_[target].Erase(key);
444 5109957 Unlock(target);
445 5598750 }
446
447 3 void Clear() {
448
2/2
✓ Branch 0 taken 126 times.
✓ Branch 1 taken 3 times.
 129 for (uint8_t i = 0; i < num_hashmaps_; ++i)
449 126 Lock(i);
450
2/2
✓ Branch 0 taken 126 times.
✓ Branch 1 taken 3 times.
 129 for (uint8_t i = 0; i < num_hashmaps_; ++i)
451 126 hashmaps_[i].Clear();
452
2/2
✓ Branch 0 taken 126 times.
✓ Branch 1 taken 3 times.
 129 for (uint8_t i = 0; i < num_hashmaps_; ++i)
453 126 Unlock(i);
454 3 }
455
456 30 uint8_t num_hashmaps() const { return num_hashmaps_; }
457
458 24 void GetSizes(uint32_t *sizes) {
459
2/2
✓ Branch 0 taken 1008 times.
✓ Branch 1 taken 24 times.
 1032 for (uint8_t i = 0; i < num_hashmaps_; ++i) {
460 1008 Lock(i);
461 1008 sizes[i] = hashmaps_[i].size();
462 1008 Unlock(i);
463 }
464 24 }
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 19570953 inline uint8_t SelectHashmap(const Key &key) {
476 19570953 uint32_t hash = MurmurHash2(&key, sizeof(key), 0x37);
477 19206171 double bucket = static_cast<double>(hash)
478 19206171 * static_cast<double>(num_hashmaps_)
479 / static_cast<double>(static_cast<uint32_t>(-1));
480 19206171 return static_cast<uint32_t>(bucket) % num_hashmaps_;
481 }
482
483 19027581 inline void Lock(const uint8_t target) {
484 19027581 int retval = pthread_mutex_lock(&locks_[target]);
485
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 20565477 times.
 20565477 assert(retval == 0);
486 20565477 }
487
488 18914808 inline void Unlock(const uint8_t target) {
489 18914808 int retval = pthread_mutex_unlock(&locks_[target]);
490
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 20693970 times.
 20693970 assert(retval == 0);
491 20693970 }
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