GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/smallhash.h
Date: 2026-05-19 11:45:12
Exec Total Coverage
Lines: 259 263 98.5%
Branches: 87 110 79.1%
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 "duplex_testing.h"
9 #include <inttypes.h>
10 #include <pthread.h>
11 #include <stdint.h>
12
13 #include <algorithm>
14 #include <cassert>
15 #include <cstdlib>
16 #include <new>
17
18 #include "util/atomic.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 150913 SmallHashBase() {
38 150913 keys_ = NULL;
39 150913 values_ = NULL;
40 150913 hasher_ = NULL;
41 150913 bytes_allocated_ = 0;
42 150913 num_collisions_ = 0;
43 150913 max_collisions_ = 0;
44
45 // Properly initialized by Init()
46 150913 capacity_ = 0;
47 150913 initial_capacity_ = 0;
48 150913 size_ = 0;
49 150913 }
50
51 150775 ~SmallHashBase() { DeallocMemory(keys_, values_, capacity_); }
52
53 150909 void Init(uint32_t expected_size, Key empty,
54 uint32_t (*hasher)(const Key &key)) {
55 150909 hasher_ = hasher;
56 150909 empty_key_ = empty;
57 150909 capacity_ = static_cast<uint32_t>(static_cast<double>(expected_size)
58 150909 / kLoadFactor);
59 150909 initial_capacity_ = capacity_;
60 150909 static_cast<Derived *>(this)->SetThresholds(); // No-op for fixed size
61 150909 AllocMemory();
62 150909 this->DoClear(false);
63 150909 }
64
65 37705578 bool Lookup(const Key &key, Value *value) const {
66 uint32_t bucket;
67 uint32_t collisions;
68
1/2
✓ Branch 1 taken 37715602 times.
✗ Branch 2 not taken.
 37705578 const bool found = DoLookup(key, &bucket, &collisions);
69
2/2
✓ Branch 0 taken 23556503 times.
✓ Branch 1 taken 14159099 times.
 37829870 if (found)
70
1/2
✓ Branch 1 taken 60295 times.
✗ Branch 2 not taken.
 23593962 *value = values_[bucket];
71 37829870 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 48 bool LookupEx(Key *key, Value *value) const {
82 48 uint32_t bucket = ScaleHash(*key);
83
2/2
✓ Branch 1 taken 16 times.
✓ Branch 2 taken 8 times.
 48 while (!(keys_[bucket] == empty_key_)) {
84
1/2
✓ Branch 1 taken 16 times.
✗ Branch 2 not taken.
 32 if (keys_[bucket] == *key) {
85 32 *key = keys_[bucket];
86 32 *value = values_[bucket];
87 32 return true;
88 }
89 ✗ bucket = (bucket + 1) % capacity_;
90 }
91 16 return false;
92 }
93
94 30074706 bool Contains(const Key &key) const {
95 uint32_t bucket;
96 uint32_t collisions;
97
1/2
✓ Branch 1 taken 30074396 times.
✗ Branch 2 not taken.
 30074706 const bool found = DoLookup(key, &bucket, &collisions);
98 30074706 return found;
99 }
100
101 322336406 void Insert(const Key &key, const Value &value) {
102 322336406 static_cast<Derived *>(this)->Grow(); // No-op if fixed-size
103 322015202 const bool overwritten = DoInsert(key, value, true);
104 322089694 size_ += !overwritten; // size + 1 if the key was not yet in the map
105 322089694 }
106
107 37562613 bool Erase(const Key &key) {
108 uint32_t bucket;
109 uint32_t collisions;
110
1/2
✓ Branch 1 taken 37352009 times.
✗ Branch 2 not taken.
 37562613 const bool found = DoLookup(key, &bucket, &collisions);
111
2/2
✓ Branch 0 taken 37351655 times.
✓ Branch 1 taken 354 times.
 37356583 if (found) {
112 37355837 keys_[bucket] = empty_key_;
113 37355837 size_--;
114 37355837 bucket = (bucket + 1) % capacity_;
115
3/3
✓ Branch 0 taken 38397466 times.
✓ Branch 1 taken 22337341 times.
✓ Branch 2 taken 18052871 times.
 78791860 while (!(keys_[bucket] == empty_key_)) {
116 41522303 Key rehash = keys_[bucket];
117 41522303 keys_[bucket] = empty_key_;
118
1/2
✓ Branch 1 taken 41436023 times.
✗ Branch 2 not taken.
 41522303 DoInsert(rehash, values_[bucket], false);
119 41436023 bucket = (bucket + 1) % capacity_;
120 }
121
1/2
✓ Branch 1 taken 37327056 times.
✗ Branch 2 not taken.
 37269557 static_cast<Derived *>(this)->Shrink(); // No-op if fixed-size
122 }
123 37366001 return found;
124 }
125
126 678 void Clear() { DoClear(true); }
127
128 3407 uint64_t bytes_allocated() const { return bytes_allocated_; }
129 633 static double GetEntrySize() {
130 1266 const double unit = sizeof(Key) + sizeof(Value);
131 1266 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 203054 Key empty_key() const { return empty_key_; }
143 408622 Key *keys() const { return keys_; }
144 214 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 536587131 uint32_t ScaleHash(const Key &key) const {
151 536587131 const double bucket = (static_cast<double>(hasher_(key))
152 536902199 * static_cast<double>(capacity_)
153 / static_cast<double>(static_cast<uint32_t>(-1)));
154 536902199 return static_cast<uint32_t>(bucket) % capacity_;
155 }
156
157 163747 void AllocMemory() {
158 163747 keys_ = static_cast<Key *>(smmap(capacity_ * sizeof(Key)));
159 163751 values_ = static_cast<Value *>(smmap(capacity_ * sizeof(Value)));
160
2/2
✓ Branch 0 taken 561433874 times.
✓ Branch 1 taken 83265 times.
 1119793618 for (uint32_t i = 0; i < capacity_; ++i) {
161 1119629867 /*keys_[i] =*/new (keys_ + i) Key();
162 }
163
2/2
✓ Branch 0 taken 561607126 times.
✓ Branch 1 taken 78667 times.
 1120130926 for (uint32_t i = 0; i < capacity_; ++i) {
164 1119976371 /*values_[i] =*/new (values_ + i) Value();
165 }
166 154555 bytes_allocated_ = (sizeof(Key) + sizeof(Value)) * capacity_;
167 154555 }
168
169 163613 void DeallocMemory(Key *k, Value *v, uint32_t c) {
170
2/2
✓ Branch 0 taken 562287424 times.
✓ Branch 1 taken 83195 times.
 1121503310 for (uint32_t i = 0; i < c; ++i) {
171 1121339697 k[i].~Key();
172 }
173
2/2
✓ Branch 0 taken 562464432 times.
✓ Branch 1 taken 83195 times.
 1121857326 for (uint32_t i = 0; i < c; ++i) {
174 1121693713 v[i].~Value();
175 }
176
1/2
✓ Branch 0 taken 83195 times.
✗ Branch 1 not taken.
 163613 if (k)
177 163613 smunmap(k);
178
1/2
✓ Branch 0 taken 83195 times.
✗ Branch 1 not taken.
 163613 if (v)
179 163613 smunmap(v);
180 163613 k = NULL;
181 163613 v = NULL;
182 163613 }
183
184 // Returns true iff the key is overwritten
185 375605569 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 216319363 times.
✗ Branch 2 not taken.
 375605569 const bool overwritten = DoLookup(key, &bucket, &collisions);
190
2/2
✓ Branch 0 taken 174920048 times.
✓ Branch 1 taken 41399315 times.
 375880017 if (count_collisions) {
191 322366358 num_collisions_ += collisions;
192 322366358 max_collisions_ = std::max(collisions, max_collisions_);
193 }
194 375600801 keys_[bucket] = key;
195
1/2
✓ Branch 1 taken 29163956 times.
✗ Branch 2 not taken.
 375600801 values_[bucket] = value;
196 375600801 return overwritten;
197 }
198
199 536740383 bool DoLookup(const Key &key, uint32_t *bucket, uint32_t *collisions) const {
200 536740383 *bucket = ScaleHash(key);
201 536619403 *collisions = 0;
202
3/3
✓ Branch 0 taken 15211401959 times.
✓ Branch 1 taken 302384498 times.
✓ Branch 2 taken 107438204 times.
 16038698923 while (!(keys_[*bucket] == empty_key_)) {
203
3/3
✓ Branch 0 taken 54374456 times.
✓ Branch 1 taken 15206930479 times.
✓ Branch 2 taken 143835556 times.
 15663802116 if (keys_[*bucket] == key)
204 161722596 return true;
205 15502079520 *bucket = (*bucket + 1) % capacity_;
206 15502079520 (*collisions)++;
207 }
208 374896807 return false;
209 }
210
211 163807 void DoClear(const bool reset_capacity) {
212
2/2
✓ Branch 0 taken 678 times.
✓ Branch 1 taken 82643 times.
 163807 if (reset_capacity)
213 790 static_cast<Derived *>(this)->ResetCapacity(); // No-op if fixed-size
214
2/2
✓ Branch 0 taken 562035010 times.
✓ Branch 1 taken 83321 times.
 1120919506 for (uint32_t i = 0; i < capacity_; ++i)
215 1120755699 keys_[i] = empty_key_;
216 163807 size_ = 0;
217 163807 }
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 3351 void SetThresholds() { }
247 697374 void Grow() { }
248 34017 void Shrink() { }
249 56 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 147562 SmallHashDynamic() : Base() {
264 147562 num_migrates_ = 0;
265
266 // Properly set by Init
267 147562 threshold_grow_ = 0;
268 147562 threshold_shrink_ = 0;
269 147562 }
270
271 SmallHashDynamic(const SmallHashDynamic<Key, Value> &other) : Base() {
272 num_migrates_ = 0;
273 CopyFrom(other);
274 }
275
276 370 SmallHashDynamic<Key, Value> &operator=(
277 const SmallHashDynamic<Key, Value> &other) {
278
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 186 times.
 370 if (&other == this)
279 ✗ return *this;
280
281 370 CopyFrom(other);
282 370 return *this;
283 }
284
285 64527840 uint32_t capacity() const { return Base::capacity_; }
286 229408740 uint32_t size() const { return Base::size_; }
287 uint32_t num_migrates() const { return num_migrates_; }
288
289 protected:
290 160392 void SetThresholds() {
291 160392 threshold_grow_ = static_cast<uint32_t>(static_cast<double>(capacity())
292 160396 * kThresholdGrow);
293 160396 threshold_shrink_ = static_cast<uint32_t>(static_cast<double>(capacity())
294 160396 * kThresholdShrink);
295 160396 }
296
297 321445872 void Grow() {
298
2/2
✓ Branch 1 taken 4674 times.
✓ Branch 2 taken 174035186 times.
 321445872 if (size() > threshold_grow_)
299 9348 Migrate(capacity() * 2);
300 321331736 }
301
302 37334790 void Shrink() {
303
2/2
✓ Branch 1 taken 31807014 times.
✓ Branch 2 taken 5517360 times.
 37334790 if (size() < threshold_shrink_) {
304 31811196 const uint32_t target_capacity = capacity() / 2;
305
2/2
✓ Branch 0 taken 1372 times.
✓ Branch 1 taken 31805136 times.
 31810690 if (target_capacity >= Base::initial_capacity_)
306 1372 Migrate(target_capacity);
307 }
308 37328054 }
309
310 734 void ResetCapacity() {
311 734 Base::DeallocMemory(Base::keys_, Base::values_, Base::capacity_);
312 734 Base::capacity_ = Base::initial_capacity_;
313 734 Base::AllocMemory();
314 734 SetThresholds();
315 734 }
316
317 private:
318 // Returns a random permutation of indices [0..N-1] that is allocated
319 // by smmap (Knuth's shuffle algorithm)
320 3124 uint32_t *ShuffleIndices(const uint32_t N) {
321 3124 uint32_t *shuffled = static_cast<uint32_t *>(smmap(N * sizeof(uint32_t)));
322 // Init with identity
323
2/2
✓ Branch 0 taken 22485786 times.
✓ Branch 1 taken 1562 times.
 44974696 for (unsigned i = 0; i < N; ++i)
324 44971572 shuffled[i] = i;
325 // Shuffle (no shuffling for the last element)
326
1/2
✓ Branch 0 taken 21289366 times.
✗ Branch 1 not taken.
 42548448 for (unsigned i = 0; i < N - 1; ++i) {
327 42578732 const uint32_t swap_idx = i + g_prng.Next(N - i);
328 42545324 const uint32_t tmp = shuffled[i];
329 42545324 shuffled[i] = shuffled[swap_idx];
330 42545324 shuffled[swap_idx] = tmp;
331 }
332 370 return shuffled;
333 }
334
335 12092 void Migrate(const uint32_t new_capacity) {
336 12092 Key *old_keys = Base::keys_;
337 12092 Value *old_values = Base::values_;
338 12092 const uint32_t old_capacity = capacity();
339 12096 const uint32_t old_size = size();
340
341 12096 Base::capacity_ = new_capacity;
342 12096 SetThresholds();
343 12100 Base::AllocMemory();
344 12104 Base::DoClear(false);
345
2/2
✓ Branch 0 taken 1376 times.
✓ Branch 1 taken 4676 times.
 12104 if (new_capacity < old_capacity) {
346 2752 uint32_t *shuffled_indices = ShuffleIndices(old_capacity);
347
1/2
✓ Branch 0 taken 19350716 times.
✗ Branch 1 not taken.
 38700068 for (uint32_t i = 0; i < old_capacity; ++i) {
348
2/3
✓ Branch 0 taken 4852610 times.
✓ Branch 1 taken 14498106 times.
✗ Branch 2 not taken.
 38701432 if (old_keys[shuffled_indices[i]] != Base::empty_key_) {
349 9705220 Base::Insert(old_keys[shuffled_indices[i]],
350 9705220 old_values[shuffled_indices[i]]);
351 }
352 }
353 ✗ smunmap(shuffled_indices);
354 } else {
355
2/2
✓ Branch 0 taken 70608854 times.
✓ Branch 1 taken 3736 times.
 141225180 for (uint32_t i = 0; i < old_capacity; ++i) {
356
3/3
✓ Branch 0 taken 20986224 times.
✓ Branch 1 taken 38964447 times.
✓ Branch 2 taken 10658183 times.
 141217708 if (old_keys[i] != Base::empty_key_)
357 105932252 Base::Insert(old_keys[i], old_values[i]);
358 }
359 }
360
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 6050 times.
 10224 assert(size() == old_size);
361
362 12100 Base::DeallocMemory(old_keys, old_values, old_capacity);
363 12104 num_migrates_++;
364 12104 }
365
366 370 void CopyFrom(const SmallHashDynamic<Key, Value> &other) {
367 370 uint32_t *shuffled_indices = ShuffleIndices(other.capacity_);
368
2/2
✓ Branch 0 taken 2756376 times.
✓ Branch 1 taken 186 times.
 2760610 for (uint32_t i = 0; i < other.capacity_; ++i) {
369
2/3
✗ Branch 0 not taken.
✓ Branch 1 taken 2001932 times.
✓ Branch 2 taken 754444 times.
 2760240 if (other.keys_[shuffled_indices[i]] != other.empty_key_) {
370 2000000 this->Insert(other.keys_[shuffled_indices[i]],
371 2000000 other.values_[shuffled_indices[i]]);
372 }
373 }
374 370 smunmap(shuffled_indices);
375 370 }
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 20 MultiHash() {
392 20 num_hashmaps_ = 0;
393 20 hashmaps_ = NULL;
394 20 locks_ = NULL;
395 20 }
396
397 20 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 20 times.
 20 assert(num_hashmaps > 0);
400 20 const uint8_t N = num_hashmaps;
401 20 num_hashmaps_ = N;
402
3/4
✓ Branch 2 taken 840 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 840 times.
✓ Branch 5 taken 20 times.
 860 hashmaps_ = new SmallHashDynamic<Key, Value>[N]();
403 20 locks_ = static_cast<pthread_mutex_t *>(
404 20 smalloc(N * sizeof(pthread_mutex_t)));
405
2/2
✓ Branch 0 taken 840 times.
✓ Branch 1 taken 20 times.
 860 for (uint8_t i = 0; i < N; ++i) {
406 840 int retval = pthread_mutex_init(&locks_[i], NULL);
407
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 840 times.
 840 assert(retval == 0);
408 840 hashmaps_[i].Init(128, empty_key, hasher);
409 }
410 20 }
411
412 20 ~MultiHash() {
413
2/2
✓ Branch 0 taken 840 times.
✓ Branch 1 taken 20 times.
 860 for (uint8_t i = 0; i < num_hashmaps_; ++i) {
414 840 pthread_mutex_destroy(&locks_[i]);
415 }
416 20 free(locks_);
417
3/4
✓ Branch 0 taken 20 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 840 times.
✓ Branch 3 taken 20 times.
 860 delete[] hashmaps_;
418 20 }
419
420 2000000 bool Lookup(const Key &key, Value *value) {
421 2000000 uint8_t target = SelectHashmap(key);
422 2000000 Lock(target);
423 2000000 const bool result = hashmaps_[target].Lookup(key, value);
424 2000000 Unlock(target);
425 2000000 return result;
426 }
427
428 7486132 void Insert(const Key &key, const Value &value) {
429 7486132 uint8_t target = SelectHashmap(key);
430 7249798 Lock(target);
431 7516874 hashmaps_[target].Insert(key, value);
432 7221546 Unlock(target);
433 7625082 }
434
435 3610884 void Erase(const Key &key) {
436 3610884 uint8_t target = SelectHashmap(key);
437 3446498 Lock(target);
438 3665864 hashmaps_[target].Erase(key);
439 3320182 Unlock(target);
440 3712428 }
441
442 2 void Clear() {
443
2/2
✓ Branch 0 taken 84 times.
✓ Branch 1 taken 2 times.
 86 for (uint8_t i = 0; i < num_hashmaps_; ++i)
444 84 Lock(i);
445
2/2
✓ Branch 0 taken 84 times.
✓ Branch 1 taken 2 times.
 86 for (uint8_t i = 0; i < num_hashmaps_; ++i)
446 84 hashmaps_[i].Clear();
447
2/2
✓ Branch 0 taken 84 times.
✓ Branch 1 taken 2 times.
 86 for (uint8_t i = 0; i < num_hashmaps_; ++i)
448 84 Unlock(i);
449 2 }
450
451 20 uint8_t num_hashmaps() const { return num_hashmaps_; }
452
453 16 void GetSizes(uint32_t *sizes) {
454
2/2
✓ Branch 0 taken 672 times.
✓ Branch 1 taken 16 times.
 688 for (uint8_t i = 0; i < num_hashmaps_; ++i) {
455 672 Lock(i);
456 672 sizes[i] = hashmaps_[i].size();
457 672 Unlock(i);
458 }
459 16 }
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 13033382 inline uint8_t SelectHashmap(const Key &key) {
471 13033382 uint32_t hash = MurmurHash2(&key, sizeof(key), 0x37);
472 12784000 double bucket = static_cast<double>(hash)
473 12784000 * static_cast<double>(num_hashmaps_)
474 / static_cast<double>(static_cast<uint32_t>(-1));
475 12784000 return static_cast<uint32_t>(bucket) % num_hashmaps_;
476 }
477
478 12650724 inline void Lock(const uint8_t target) {
479 12650724 int retval = pthread_mutex_lock(&locks_[target]);
480
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 13685730 times.
 13685730 assert(retval == 0);
481 13685730 }
482
483 12541212 inline void Unlock(const uint8_t target) {
484 12541212 int retval = pthread_mutex_unlock(&locks_[target]);
485
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 13790948 times.
 13790948 assert(retval == 0);
486 13790948 }
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