GCC Code Coverage Report


Directory: cvmfs/
File: cvmfs/smallhash.h
Date: 2026-11-08 02:41:18
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 #include <inttypes.h>
9 #include <pthread.h>
10 #include <stdint.h>
11
12 #include <algorithm>
13 #include <atomic>
14 #include <cassert>
15 #include <cstdlib>
16 #include <new>
17
18 #include "duplex_testing.h"
19 #include "util/murmur.hxx"
20 #include "util/prng.h"
21 #include "util/smalloc.h"
22
23 /**
24 * Hash table with linear probing as collision resolution. Works only for
25 * a fixed (maximum) number of elements, i.e. no resizing. Load factor fixed
26 * to 0.7.
27 */
28 template<class Key, class Value, class Derived>
29 class SmallHashBase {
30 FRIEND_TEST(T_Smallhash, InsertAndCopyMd5Slow);
31
32 public:
33 static const double kLoadFactor; // mainly useless for the dynamic version
34 static const double kThresholdGrow; // only used for resizable version
35 static const double kThresholdShrink; // only used for resizable version
36
37 86920 SmallHashBase() {
38 86920 keys_ = NULL;
39 86920 values_ = NULL;
40 86920 hasher_ = NULL;
41 86920 bytes_allocated_ = 0;
42 86920 num_collisions_ = 0;
43 86920 max_collisions_ = 0;
44
45 // Properly initialized by Init()
46 86920 capacity_ = 0;
47 86920 initial_capacity_ = 0;
48 86920 size_ = 0;
49 86920 }
50
51 86782 ~SmallHashBase() { DeallocMemory(keys_, values_, capacity_); }
52
53 86884 void Init(uint32_t expected_size, Key empty,
54 uint32_t (*hasher)(const Key &key)) {
55 86884 hasher_ = hasher;
56 86884 empty_key_ = empty;
57 86884 capacity_ = static_cast<uint32_t>(static_cast<double>(expected_size)
58 86884 / kLoadFactor);
59 86884 initial_capacity_ = capacity_;
60 86884 static_cast<Derived *>(this)->SetThresholds(); // No-op for fixed size
61 86884 AllocMemory();
62 86884 this->DoClear(false);
63 86884 }
64
65 45344933 bool Lookup(const Key &key, Value *value) const {
66 uint32_t bucket;
67 uint32_t collisions;
68
1/2
✓ Branch 1 taken 45289566 times.
✗ Branch 2 not taken.
45344933 const bool found = DoLookup(key, &bucket, &collisions);
69
2/2
✓ Branch 0 taken 42174698 times.
✓ Branch 1 taken 3114868 times.
45348311 if (found)
70
1/2
✓ Branch 1 taken 30228 times.
✗ Branch 2 not taken.
42194450 *value = values_[bucket];
71 45348311 return found;
72 }
73
74 /**
75 * Returns both the key and the value. That is useful if Key's equality
76 * operator implements an equivalence relation on Key. In this case, LookupEx
77 * returns the key representing the equivalence class that has been used
78 * during Insert().
79 * Used to return a glue::InodeEx element when looking for an inode.
80 */
81 340 bool LookupEx(Key *key, Value *value) const {
82 340 uint32_t bucket = ScaleHash(*key);
83
2/2
✓ Branch 1 taken 114 times.
✓ Branch 2 taken 56 times.
340 while (!(keys_[bucket] == empty_key_)) {
84
1/2
✓ Branch 1 taken 114 times.
✗ Branch 2 not taken.
228 if (keys_[bucket] == *key) {
85 228 *key = keys_[bucket];
86 228 *value = values_[bucket];
87 228 return true;
88 }
89 ✗ bucket = (bucket + 1) % capacity_;
90 }
91 112 return false;
92 }
93
94 6029086 bool Contains(const Key &key) const {
95 uint32_t bucket;
96 uint32_t collisions;
97
1/2
✓ Branch 1 taken 6028637 times.
✗ Branch 2 not taken.
6029086 const bool found = DoLookup(key, &bucket, &collisions);
98 6029086 return found;
99 }
100
101 1052456860 void Insert(const Key &key, const Value &value) {
102 1052456860 static_cast<Derived *>(this)->Grow(); // No-op if fixed-size
103 1047974962 const bool overwritten = DoInsert(key, value, true);
104 1047857656 size_ += !overwritten; // size + 1 if the key was not yet in the map
105 1047857656 }
106
107 57750082 bool Erase(const Key &key) {
108 uint32_t bucket;
109 uint32_t collisions;
110
1/2
✓ Branch 1 taken 55984647 times.
✗ Branch 2 not taken.
57750082 const bool found = DoLookup(key, &bucket, &collisions);
111
1/2
✓ Branch 0 taken 55994742 times.
✗ Branch 1 not taken.
55986334 if (found) {
112 55996354 keys_[bucket] = empty_key_;
113 55996354 size_--;
114 55996354 bucket = (bucket + 1) % capacity_;
115
3/3
✓ Branch 0 taken 99550172 times.
✓ Branch 1 taken 50276143 times.
✓ Branch 2 taken 5524715 times.
155352642 while (!(keys_[bucket] == empty_key_)) {
116 100386122 Key rehash = keys_[bucket];
117 100386122 keys_[bucket] = empty_key_;
118
1/2
✓ Branch 1 taken 99356288 times.
✗ Branch 2 not taken.
100386122 DoInsert(rehash, values_[bucket], false);
119 99356288 bucket = (bucket + 1) % capacity_;
120 }
121
1/2
✓ Branch 1 taken 56132897 times.
✗ Branch 2 not taken.
54966520 static_cast<Derived *>(this)->Shrink(); // No-op if fixed-size
122 }
123 56140780 return found;
124 }
125
126 1097 void Clear() { DoClear(true); }
127
128 3807 uint64_t bytes_allocated() const { return bytes_allocated_; }
129 825 static double GetEntrySize() {
130 1650 const double unit = sizeof(Key) + sizeof(Value);
131 1650 return unit / kLoadFactor;
132 }
133
134 void GetCollisionStats(uint64_t *num_collisions,
135 uint32_t *max_collisions) const {
136 *num_collisions = num_collisions_;
137 *max_collisions = max_collisions_;
138 }
139
140 // Careful with the direct access TODO: iterator
141 uint32_t capacity() const { return capacity_; }
142 105252 Key empty_key() const { return empty_key_; }
143 241668 Key *keys() const { return keys_; }
144 391 Value *values() const { return values_; }
145
146 // Only needed by compat
147 ✗ void SetHasher(uint32_t (*hasher)(const Key &key)) { hasher_ = hasher; }
148
149 protected:
150 1424417161 uint32_t ScaleHash(const Key &key) const {
151 1424417161 const double bucket = (static_cast<double>(hasher_(key))
152 1419402391 * static_cast<double>(capacity_)
153 / static_cast<double>(static_cast<uint32_t>(-1)));
154 1419402391 return static_cast<uint32_t>(bucket) % capacity_;
155 }
156
157 168251 void AllocMemory() {
158 168251 keys_ = static_cast<Key *>(smmap(capacity_ * sizeof(Key)));
159 168323 values_ = static_cast<Value *>(smmap(capacity_ * sizeof(Value)));
160
2/2
✓ Branch 0 taken 872610391 times.
✓ Branch 1 taken 85408 times.
1740052966 for (uint32_t i = 0; i < capacity_; ++i) {
161 1739884643 /*keys_[i] =*/new (keys_ + i) Key();
162 }
163
2/2
✓ Branch 0 taken 873667603 times.
✓ Branch 1 taken 44116 times.
1742084806 for (uint32_t i = 0; i < capacity_; ++i) {
164 1741999067 /*values_[i] =*/new (values_ + i) Value();
165 }
166 85739 bytes_allocated_ = (sizeof(Key) + sizeof(Value)) * capacity_;
167 85739 }
168
169 168221 void DeallocMemory(Key *k, Value *v, uint32_t c) {
170
2/2
✓ Branch 0 taken 874592659 times.
✓ Branch 1 taken 85356 times.
1744020130 for (uint32_t i = 0; i < c; ++i) {
171 1743851909 k[i].~Key();
172 }
173
2/2
✓ Branch 0 taken 875146465 times.
✓ Branch 1 taken 85356 times.
1745127742 for (uint32_t i = 0; i < c; ++i) {
174 1744959521 v[i].~Value();
175 }
176
2/2
✓ Branch 0 taken 85302 times.
✓ Branch 1 taken 54 times.
168221 if (k)
177 168113 smunmap(k);
178
2/2
✓ Branch 0 taken 85338 times.
✓ Branch 1 taken 54 times.
168293 if (v)
179 168185 smunmap(v);
180 168293 k = NULL;
181 168293 v = NULL;
182 168293 }
183
184 // Returns true iff the key is overwritten
185 1231999062 bool DoInsert(const Key &key, const Value &value,
186 const bool count_collisions) {
187 uint32_t bucket;
188 uint32_t collisions;
189
1/2
✓ Branch 1 taken 626653275 times.
✗ Branch 2 not taken.
1231999062 const bool overwritten = DoLookup(key, &bucket, &collisions);
190
2/2
✓ Branch 0 taken 527555791 times.
✓ Branch 1 taken 99097484 times.
1230801858 if (count_collisions) {
191 1048196968 num_collisions_ += collisions;
192 1048196968 max_collisions_ = std::max(collisions, max_collisions_);
193 }
194 1230479658 keys_[bucket] = key;
195
1/2
✓ Branch 1 taken 15621433 times.
✗ Branch 2 not taken.
1230479658 values_[bucket] = value;
196 1230479658 return overwritten;
197 }
198
199 1424895723 bool DoLookup(const Key &key, uint32_t *bucket, uint32_t *collisions) const {
200 1424895723 *bucket = ScaleHash(key);
201 1419228651 *collisions = 0;
202
3/3
✓ Branch 0 taken 8764369688 times.
✓ Branch 1 taken 575344073 times.
✓ Branch 2 taken 135719000 times.
10833749659 while (!(keys_[*bucket] == empty_key_)) {
203
3/3
✓ Branch 0 taken 93423211 times.
✓ Branch 1 taken 8685773194 times.
✓ Branch 2 taken 77502039 times.
9618000087 if (keys_[*bucket] == key)
204 203479079 return true;
205 9414521008 *bucket = (*bucket + 1) % capacity_;
206 9414521008 (*collisions)++;
207 }
208 1215749572 return false;
209 }
210
211 168349 void DoClear(const bool reset_capacity) {
212
2/2
✓ Branch 0 taken 1097 times.
✓ Branch 1 taken 84337 times.
168349 if (reset_capacity)
213 1896 static_cast<Derived *>(this)->ResetCapacity(); // No-op if fixed-size
214
2/2
✓ Branch 0 taken 873837355 times.
✓ Branch 1 taken 85434 times.
1742471430 for (uint32_t i = 0; i < capacity_; ++i)
215 1742303081 keys_[i] = empty_key_;
216 168349 size_ = 0;
217 168349 }
218
219 // Methods for resizable version
220 void SetThresholds() { }
221 void Grow() { }
222 void Shrink() { }
223 void ResetCapacity() { }
224
225 // Separate key and value arrays for better locality
226 Key *keys_;
227 Value *values_;
228 uint32_t capacity_;
229 uint32_t initial_capacity_;
230 uint32_t size_;
231 uint32_t (*hasher_)(const Key &key);
232 uint64_t bytes_allocated_;
233 uint64_t num_collisions_;
234 uint32_t max_collisions_; /**< maximum collisions for a single insert */
235 Key empty_key_;
236 };
237
238
239 template<class Key, class Value>
240 class SmallHashFixed
241 : public SmallHashBase<Key, Value, SmallHashFixed<Key, Value> > {
242 friend class SmallHashBase<Key, Value, SmallHashFixed<Key, Value> >;
243
244 protected:
245 // No-ops
246 3781 void SetThresholds() { }
247 1144113 void Grow() { }
248 16291 void Shrink() { }
249 26 void ResetCapacity() { }
250 };
251
252
253 template<class Key, class Value>
254 class SmallHashDynamic
255 : public SmallHashBase<Key, Value, SmallHashDynamic<Key, Value> > {
256 friend class SmallHashBase<Key, Value, SmallHashDynamic<Key, Value> >;
257
258 public:
259 typedef SmallHashBase<Key, Value, SmallHashDynamic<Key, Value> > Base;
260 static const double kThresholdGrow;
261 static const double kThresholdShrink;
262
263 83139 SmallHashDynamic() : Base() {
264 83139 num_migrates_ = 0;
265
266 // Properly set by Init
267 83139 threshold_grow_ = 0;
268 83139 threshold_shrink_ = 0;
269 83139 }
270
271 SmallHashDynamic(const SmallHashDynamic<Key, Value> &other) : Base() {
272 num_migrates_ = 0;
273 CopyFrom(other);
274 }
275
276 90 SmallHashDynamic<Key, Value> &operator=(
277 const SmallHashDynamic<Key, Value> &other) {
278
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 54 times.
90 if (&other == this)
279 ✗ return *this;
280
281 90 CopyFrom(other);
282 90 return *this;
283 }
284
285 17945882 uint32_t capacity() const { return Base::capacity_; }
286 588497393 uint32_t size() const { return Base::size_; }
287 uint32_t num_migrates() const { return num_migrates_; }
288
289 protected:
290 164470 void SetThresholds() {
291 164470 threshold_grow_ = static_cast<uint32_t>(static_cast<double>(capacity())
292 164434 * kThresholdGrow);
293 164434 threshold_shrink_ = static_cast<uint32_t>(static_cast<double>(capacity())
294 164470 * kThresholdShrink);
295 164470 }
296
297 1049921303 void Grow() {
298
2/2
✓ Branch 1 taken 27350 times.
✓ Branch 2 taken 526720346 times.
1049921303 if (size() > threshold_grow_)
299 54700 Migrate(capacity() * 2);
300 1047728621 }
301
302 55867359 void Shrink() {
303
2/2
✓ Branch 1 taken 8576243 times.
✓ Branch 2 taken 47435904 times.
55867359 if (size() < threshold_shrink_) {
304 8577855 const uint32_t target_capacity = capacity() / 2;
305
2/2
✓ Branch 0 taken 12366 times.
✓ Branch 1 taken 8563115 times.
8577093 if (target_capacity >= Base::initial_capacity_)
306 12366 Migrate(target_capacity);
307 }
308 56013015 }
309
310 1870 void ResetCapacity() {
311 1870 Base::DeallocMemory(Base::keys_, Base::values_, Base::capacity_);
312 1870 Base::capacity_ = Base::initial_capacity_;
313 1870 Base::AllocMemory();
314 1870 SetThresholds();
315 1870 }
316
317 private:
318 // Returns a random permutation of indices [0..N-1] that is allocated
319 // by smmap (Knuth's shuffle algorithm)
320 24876 uint32_t *ShuffleIndices(const uint32_t N) {
321 24876 uint32_t *shuffled = static_cast<uint32_t *>(smmap(N * sizeof(uint32_t)));
322 // Init with identity
323
2/2
✓ Branch 0 taken 202914882 times.
✓ Branch 1 taken 12438 times.
405854640 for (unsigned i = 0; i < N; ++i)
324 405829764 shuffled[i] = i;
325 // Shuffle (no shuffling for the last element)
326
1/2
✓ Branch 0 taken 193896702 times.
✗ Branch 1 not taken.
387766836 for (unsigned i = 0; i < N - 1; ++i) {
327 387793404 const uint32_t swap_idx = i + g_prng.Next(N - i);
328 387741960 const uint32_t tmp = shuffled[i];
329 387741960 shuffled[i] = shuffled[swap_idx];
330 387741960 shuffled[swap_idx] = tmp;
331 }
332 90 return shuffled;
333 }
334
335 79396 void Migrate(const uint32_t new_capacity) {
336 79396 Key *old_keys = Base::keys_;
337 79396 Value *old_values = Base::values_;
338 79396 const uint32_t old_capacity = capacity();
339 79396 const uint32_t old_size = size();
340
341 79396 Base::capacity_ = new_capacity;
342 79396 SetThresholds();
343 79468 Base::AllocMemory();
344 79540 Base::DoClear(false);
345
2/2
✓ Branch 0 taken 12384 times.
✓ Branch 1 taken 27386 times.
79540 if (new_capacity < old_capacity) {
346 24768 uint32_t *shuffled_indices = ShuffleIndices(old_capacity);
347
1/2
✓ Branch 0 taken 173324556 times.
✗ Branch 1 not taken.
346635468 for (uint32_t i = 0; i < old_capacity; ++i) {
348
2/3
✓ Branch 0 taken 43506882 times.
✓ Branch 1 taken 129817674 times.
✗ Branch 2 not taken.
346649112 if (old_keys[shuffled_indices[i]] != Base::empty_key_) {
349 87013764 Base::Insert(old_keys[shuffled_indices[i]],
350 87013764 old_values[shuffled_indices[i]]);
351 }
352 }
353 ✗ smunmap(shuffled_indices);
354 } else {
355
2/2
✓ Branch 0 taken 335971347 times.
✓ Branch 1 taken 12896 times.
671968486 for (uint32_t i = 0; i < old_capacity; ++i) {
356
3/3
✓ Branch 0 taken 188364682 times.
✓ Branch 1 taken 126374764 times.
✓ Branch 2 taken 21231901 times.
671942694 if (old_keys[i] != Base::empty_key_)
357 504132210 Base::Insert(old_keys[i], old_values[i]);
358 }
359 }
360
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 39770 times.
50560 assert(size() == old_size);
361
362 79540 Base::DeallocMemory(old_keys, old_values, old_capacity);
363 79540 num_migrates_++;
364 79540 }
365
366 90 void CopyFrom(const SmallHashDynamic<Key, Value> &other) {
367 90 uint32_t *shuffled_indices = ShuffleIndices(other.capacity_);
368
2/2
✓ Branch 0 taken 24773364 times.
✓ Branch 1 taken 54 times.
24774210 for (uint32_t i = 0; i < other.capacity_; ++i) {
369
2/3
✗ Branch 0 not taken.
✓ Branch 1 taken 18000378 times.
✓ Branch 2 taken 6772986 times.
24774120 if (other.keys_[shuffled_indices[i]] != other.empty_key_) {
370 18000000 this->Insert(other.keys_[shuffled_indices[i]],
371 18000000 other.values_[shuffled_indices[i]]);
372 }
373 }
374 90 smunmap(shuffled_indices);
375 90 }
376
377 uint32_t num_migrates_;
378 uint32_t threshold_grow_;
379 uint32_t threshold_shrink_;
380 static Prng g_prng;
381 };
382
383
384 /**
385 * Distributes the key-value pairs over $n$ dynamic hash maps with individual
386 * mutexes. Hence low mutex contention, and benefits from multiple processors.
387 */
388 template<class Key, class Value>
389 class MultiHash {
390 public:
391 180 MultiHash() {
392 180 num_hashmaps_ = 0;
393 180 hashmaps_ = NULL;
394 180 locks_ = NULL;
395 180 }
396
397 180 void Init(const uint8_t num_hashmaps, const Key &empty_key,
398 uint32_t (*hasher)(const Key &key)) {
399
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 180 times.
180 assert(num_hashmaps > 0);
400 180 const uint8_t N = num_hashmaps;
401 180 num_hashmaps_ = N;
402
3/4
✓ Branch 2 taken 7560 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 7560 times.
✓ Branch 5 taken 180 times.
7740 hashmaps_ = new SmallHashDynamic<Key, Value>[N]();
403 180 locks_ = static_cast<pthread_mutex_t *>(
404 180 smalloc(N * sizeof(pthread_mutex_t)));
405
2/2
✓ Branch 0 taken 7560 times.
✓ Branch 1 taken 180 times.
7740 for (uint8_t i = 0; i < N; ++i) {
406 7560 int retval = pthread_mutex_init(&locks_[i], NULL);
407
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 7560 times.
7560 assert(retval == 0);
408 7560 hashmaps_[i].Init(128, empty_key, hasher);
409 }
410 180 }
411
412 180 ~MultiHash() {
413
2/2
✓ Branch 0 taken 7560 times.
✓ Branch 1 taken 180 times.
7740 for (uint8_t i = 0; i < num_hashmaps_; ++i) {
414 7560 pthread_mutex_destroy(&locks_[i]);
415 }
416 180 free(locks_);
417
3/4
✓ Branch 0 taken 180 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 7560 times.
✓ Branch 3 taken 180 times.
7740 delete[] hashmaps_;
418 180 }
419
420 18000000 bool Lookup(const Key &key, Value *value) {
421 18000000 uint8_t target = SelectHashmap(key);
422 18000000 Lock(target);
423 18000000 const bool result = hashmaps_[target].Lookup(key, value);
424 18000000 Unlock(target);
425 18000000 return result;
426 }
427
428 66755124 void Insert(const Key &key, const Value &value) {
429 66755124 uint8_t target = SelectHashmap(key);
430 65011860 Lock(target);
431 67796910 hashmaps_[target].Insert(key, value);
432 64001484 Unlock(target);
433 69904926 }
434
435 32110686 void Erase(const Key &key) {
436 32110686 uint8_t target = SelectHashmap(key);
437 30713040 Lock(target);
438 32907060 hashmaps_[target].Erase(key);
439 29576844 Unlock(target);
440 33490440 }
441
442 18 void Clear() {
443
2/2
✓ Branch 0 taken 756 times.
✓ Branch 1 taken 18 times.
774 for (uint8_t i = 0; i < num_hashmaps_; ++i)
444 756 Lock(i);
445
2/2
✓ Branch 0 taken 756 times.
✓ Branch 1 taken 18 times.
774 for (uint8_t i = 0; i < num_hashmaps_; ++i)
446 756 hashmaps_[i].Clear();
447
2/2
✓ Branch 0 taken 756 times.
✓ Branch 1 taken 18 times.
774 for (uint8_t i = 0; i < num_hashmaps_; ++i)
448 756 Unlock(i);
449 18 }
450
451 180 uint8_t num_hashmaps() const { return num_hashmaps_; }
452
453 144 void GetSizes(uint32_t *sizes) {
454
2/2
✓ Branch 0 taken 6048 times.
✓ Branch 1 taken 144 times.
6192 for (uint8_t i = 0; i < num_hashmaps_; ++i) {
455 6048 Lock(i);
456 6048 sizes[i] = hashmaps_[i].size();
457 6048 Unlock(i);
458 }
459 144 }
460
461 void GetCollisionStats(uint64_t *num_collisions, uint32_t *max_collisions) {
462 for (uint8_t i = 0; i < num_hashmaps_; ++i) {
463 Lock(i);
464 hashmaps_[i].GetCollisionStats(&num_collisions[i], &max_collisions[i]);
465 Unlock(i);
466 }
467 }
468
469 private:
470 116032428 inline uint8_t SelectHashmap(const Key &key) {
471 116032428 uint32_t hash = MurmurHash2(&key, sizeof(key), 0x37);
472 114307272 double bucket = static_cast<double>(hash)
473 114307272 * static_cast<double>(num_hashmaps_)
474 / static_cast<double>(static_cast<uint32_t>(-1));
475 114307272 return static_cast<uint32_t>(bucket) % num_hashmaps_;
476 }
477
478 113333796 inline void Lock(const uint8_t target) {
479 113333796 int retval = pthread_mutex_lock(&locks_[target]);
480
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 123080058 times.
123080058 assert(retval == 0);
481 123080058 }
482
483 111721770 inline void Unlock(const uint8_t target) {
484 111721770 int retval = pthread_mutex_unlock(&locks_[target]);
485
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 123849090 times.
123849090 assert(retval == 0);
486 123849090 }
487
488 uint8_t num_hashmaps_;
489 SmallHashDynamic<Key, Value> *hashmaps_;
490 pthread_mutex_t *locks_;
491 };
492
493
494 // initialize the static fields
495 template<class Key, class Value>
496 Prng SmallHashDynamic<Key, Value>::g_prng;
497
498 template<class Key, class Value, class Derived>
499 const double SmallHashBase<Key, Value, Derived>::kLoadFactor = 0.75;
500
501 template<class Key, class Value>
502 const double SmallHashDynamic<Key, Value>::kThresholdGrow = 0.75;
503
504 template<class Key, class Value>
505 const double SmallHashDynamic<Key, Value>::kThresholdShrink = 0.25;
506
507 #endif // CVMFS_SMALLHASH_H_
508