GCC Code Coverage Report

Directory: cvmfs/
File: cvmfs/smallhash.h
Date: 2026-05-24 02:35:55
Exec Total Coverage
Lines: 260 263 98.9%
Branches: 89 110 80.9%
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 123874 SmallHashBase() {
38 123874 keys_ = NULL;
39 123874 values_ = NULL;
40 123874 hasher_ = NULL;
41 123874 bytes_allocated_ = 0;
42 123874 num_collisions_ = 0;
43 123874 max_collisions_ = 0;
44
45 // Properly initialized by Init()
46 123874 capacity_ = 0;
47 123874 initial_capacity_ = 0;
48 123874 size_ = 0;
49 123874 }
50
51 123736 ~SmallHashBase() { DeallocMemory(keys_, values_, capacity_); }
52
53 123844 void Init(uint32_t expected_size, Key empty,
54 uint32_t (*hasher)(const Key &key)) {
55 123844 hasher_ = hasher;
56 123844 empty_key_ = empty;
57 123844 capacity_ = static_cast<uint32_t>(static_cast<double>(expected_size)
58 123844 / kLoadFactor);
59 123844 initial_capacity_ = capacity_;
60 123844 static_cast<Derived *>(this)->SetThresholds(); // No-op for fixed size
61 123844 AllocMemory();
62 123844 this->DoClear(false);
63 123844 }
64
65 41824416 bool Lookup(const Key &key, Value *value) const {
66 uint32_t bucket;
67 uint32_t collisions;
68
1/2
✓ Branch 1 taken 41822552 times.
✗ Branch 2 not taken.
 41824416 const bool found = DoLookup(key, &bucket, &collisions);
69
2/2
✓ Branch 0 taken 36672598 times.
✓ Branch 1 taken 5149954 times.
 41871796 if (found)
70
1/2
✓ Branch 1 taken 62306 times.
✗ Branch 2 not taken.
 36688587 *value = values_[bucket];
71 41871796 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 204 bool LookupEx(Key *key, Value *value) const {
82 204 uint32_t bucket = ScaleHash(*key);
83
2/2
✓ Branch 1 taken 68 times.
✓ Branch 2 taken 34 times.
 204 while (!(keys_[bucket] == empty_key_)) {
84
1/2
✓ Branch 1 taken 68 times.
✗ Branch 2 not taken.
 136 if (keys_[bucket] == *key) {
85 136 *key = keys_[bucket];
86 136 *value = values_[bucket];
87 136 return true;
88 }
89 ✗ bucket = (bucket + 1) % capacity_;
90 }
91 68 return false;
92 }
93
94 27032553 bool Contains(const Key &key) const {
95 uint32_t bucket;
96 uint32_t collisions;
97
1/2
✓ Branch 1 taken 27032341 times.
✗ Branch 2 not taken.
 27032553 const bool found = DoLookup(key, &bucket, &collisions);
98 27032553 return found;
99 }
100
101 919534688 void Insert(const Key &key, const Value &value) {
102 919534688 static_cast<Derived *>(this)->Grow(); // No-op if fixed-size
103 917021408 const bool overwritten = DoInsert(key, value, true);
104 917787938 size_ += !overwritten; // size + 1 if the key was not yet in the map
105 917787938 }
106
107 50036332 bool Erase(const Key &key) {
108 uint32_t bucket;
109 uint32_t collisions;
110
1/2
✓ Branch 1 taken 48357921 times.
✗ Branch 2 not taken.
 50036332 const bool found = DoLookup(key, &bucket, &collisions);
111
1/2
✓ Branch 0 taken 48362280 times.
✗ Branch 1 not taken.
 48360987 if (found) {
112 48365245 keys_[bucket] = empty_key_;
113 48365245 size_--;
114 48365245 bucket = (bucket + 1) % capacity_;
115
3/3
✓ Branch 0 taken 100082814 times.
✓ Branch 1 taken 44800960 times.
✓ Branch 2 taken 3696245 times.
 148582984 while (!(keys_[bucket] == empty_key_)) {
116 100821684 Key rehash = keys_[bucket];
117 100821684 keys_[bucket] = empty_key_;
118
1/2
✓ Branch 1 taken 100217739 times.
✗ Branch 2 not taken.
 100821684 DoInsert(rehash, values_[bucket], false);
119 100217739 bucket = (bucket + 1) % capacity_;
120 }
121
1/2
✓ Branch 1 taken 48544029 times.
✗ Branch 2 not taken.
 47761300 static_cast<Derived *>(this)->Shrink(); // No-op if fixed-size
122 }
123 48577562 return found;
124 }
125
126 1155 void Clear() { DoClear(true); }
127
128 4215 uint64_t bytes_allocated() const { return bytes_allocated_; }
129 1299 static double GetEntrySize() {
130 2598 const double unit = sizeof(Key) + sizeof(Value);
131 2598 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 80392 Key empty_key() const { return empty_key_; }
143 198554 Key *keys() const { return keys_; }
144 206 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 1294767972 uint32_t ScaleHash(const Key &key) const {
151 1294767972 const double bucket = (static_cast<double>(hasher_(key))
152 1295672332 * static_cast<double>(capacity_)
153 / static_cast<double>(static_cast<uint32_t>(-1)));
154 1295672332 return static_cast<uint32_t>(bucket) % capacity_;
155 }
156
157 191665 void AllocMemory() {
158 191665 keys_ = static_cast<Key *>(smmap(capacity_ * sizeof(Key)));
159 191665 values_ = static_cast<Value *>(smmap(capacity_ * sizeof(Value)));
160
2/2
✓ Branch 0 taken 1020187972 times.
✓ Branch 1 taken 96912 times.
 2033474692 for (uint32_t i = 0; i < capacity_; ++i) {
161 2033283027 /*keys_[i] =*/new (keys_ + i) Key();
162 }
163
2/2
✓ Branch 0 taken 1020562657 times.
✓ Branch 1 taken 76842 times.
 2034183922 for (uint32_t i = 0; i < capacity_; ++i) {
164 2034032397 /*values_[i] =*/new (values_ + i) Value();
165 }
166 151525 bytes_allocated_ = (sizeof(Key) + sizeof(Value)) * capacity_;
167 151525 }
168
169 191557 void DeallocMemory(Key *k, Value *v, uint32_t c) {
170
2/2
✓ Branch 0 taken 1022506264 times.
✓ Branch 1 taken 96857 times.
 2038113898 for (uint32_t i = 0; i < c; ++i) {
171 2037922341 k[i].~Key();
172 }
173
2/2
✓ Branch 0 taken 1021732729 times.
✓ Branch 1 taken 96857 times.
 2036566828 for (uint32_t i = 0; i < c; ++i) {
174 2036375271 v[i].~Value();
175 }
176
2/2
✓ Branch 0 taken 96842 times.
✓ Branch 1 taken 15 times.
 191557 if (k)
177 191527 smunmap(k);
178
2/2
✓ Branch 0 taken 96842 times.
✓ Branch 1 taken 15 times.
 191557 if (v)
179 191527 smunmap(v);
180 191557 k = NULL;
181 191557 v = NULL;
182 191557 }
183
184 // Returns true iff the key is overwritten
185 1086994982 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 564786061 times.
✗ Branch 2 not taken.
 1086994982 const bool overwritten = DoLookup(key, &bucket, &collisions);
190
2/2
✓ Branch 0 taken 464815222 times.
✓ Branch 1 taken 99970839 times.
 1089561572 if (count_collisions) {
191 919938938 num_collisions_ += collisions;
192 919938938 max_collisions_ = std::max(collisions, max_collisions_);
193 }
194 1087449182 keys_[bucket] = key;
195
1/2
✓ Branch 1 taken 30209442 times.
✗ Branch 2 not taken.
 1087449182 values_[bucket] = value;
196 1087449182 return overwritten;
197 }
198
199 1295706978 bool DoLookup(const Key &key, uint32_t *bucket, uint32_t *collisions) const {
200 1295706978 *bucket = ScaleHash(key);
201 1293853438 *collisions = 0;
202
3/3
✓ Branch 0 taken 16212840293 times.
✓ Branch 1 taken 581985481 times.
✓ Branch 2 taken 132011208 times.
 18155392724 while (!(keys_[*bucket] == empty_key_)) {
203
3/3
✓ Branch 0 taken 85756266 times.
✓ Branch 1 taken 16157972395 times.
✓ Branch 2 taken 124473595 times.
 17078602103 if (keys_[*bucket] == key)
204 217062817 return true;
205 16861539286 *bucket = (*bucket + 1) % capacity_;
206 16861539286 (*collisions)++;
207 }
208 1076790621 return false;
209 }
210
211 191723 void DoClear(const bool reset_capacity) {
212
2/2
✓ Branch 0 taken 1155 times.
✓ Branch 1 taken 95815 times.
 191723 if (reset_capacity)
213 1810 static_cast<Derived *>(this)->ResetCapacity(); // No-op if fixed-size
214
2/2
✓ Branch 0 taken 1022685352 times.
✓ Branch 1 taken 96970 times.
 2038390340 for (uint32_t i = 0; i < capacity_; ++i)
215 2038198617 keys_[i] = empty_key_;
216 191723 size_ = 0;
217 191723 }
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 4157 void SetThresholds() { }
247 172687 void Grow() { }
248 34826 void Shrink() { }
249 58 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 119717 SmallHashDynamic() : Base() {
264 119717 num_migrates_ = 0;
265
266 // Properly set by Init
267 119717 threshold_grow_ = 0;
268 119717 threshold_shrink_ = 0;
269 119717 }
270
271 SmallHashDynamic(const SmallHashDynamic<Key, Value> &other) : Base() {
272 num_migrates_ = 0;
273 CopyFrom(other);
274 }
275
276 95 SmallHashDynamic<Key, Value> &operator=(
277 const SmallHashDynamic<Key, Value> &other) {
278
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 55 times.
 95 if (&other == this)
279 ✗ return *this;
280
281 95 CopyFrom(other);
282 95 return *this;
283 }
284
285 18202834 uint32_t capacity() const { return Base::capacity_; }
286 515734008 uint32_t size() const { return Base::size_; }
287 uint32_t num_migrates() const { return num_migrates_; }
288
289 protected:
290 187508 void SetThresholds() {
291 187508 threshold_grow_ = static_cast<uint32_t>(static_cast<double>(capacity())
292 187508 * kThresholdGrow);
293 187508 threshold_shrink_ = static_cast<uint32_t>(static_cast<double>(capacity())
294 187508 * kThresholdShrink);
295 187508 }
296
297 917876505 void Grow() {
298
2/2
✓ Branch 1 taken 22691 times.
✓ Branch 2 taken 463239459 times.
 917876505 if (size() > threshold_grow_)
299 45382 Migrate(capacity() * 2);
300 917018015 }
301
302 48418854 void Shrink() {
303
2/2
✓ Branch 1 taken 8725519 times.
✓ Branch 2 taken 39807245 times.
 48418854 if (size() < threshold_shrink_) {
304 8728484 const uint32_t target_capacity = capacity() / 2;
305
2/2
✓ Branch 0 taken 10320 times.
✓ Branch 1 taken 8714779 times.
 8728064 if (target_capacity >= Base::initial_capacity_)
306 10320 Migrate(target_capacity);
307 }
308 48535309 }
309
310 1752 void ResetCapacity() {
311 1752 Base::DeallocMemory(Base::keys_, Base::values_, Base::capacity_);
312 1752 Base::capacity_ = Base::initial_capacity_;
313 1752 Base::AllocMemory();
314 1752 SetThresholds();
315 1752 }
316
317 private:
318 // Returns a random permutation of indices [0..N-1] that is allocated
319 // by smmap (Knuth's shuffle algorithm)
320 20750 uint32_t *ShuffleIndices(const uint32_t N) {
321 20750 uint32_t *shuffled = static_cast<uint32_t *>(smmap(N * sizeof(uint32_t)));
322 // Init with identity
323
2/2
✓ Branch 0 taken 169064070 times.
✓ Branch 1 taken 10375 times.
 338148890 for (unsigned i = 0; i < N; ++i)
324 338128140 shuffled[i] = i;
325 // Shuffle (no shuffling for the last element)
326
1/2
✓ Branch 0 taken 160089470 times.
✗ Branch 1 not taken.
 319817010 for (unsigned i = 0; i < N - 1; ++i) {
327 320178940 const uint32_t swap_idx = i + g_prng.Next(N - i);
328 319796260 const uint32_t tmp = shuffled[i];
329 319796260 shuffled[i] = shuffled[swap_idx];
330 319796260 shuffled[swap_idx] = tmp;
331 }
332 95 return shuffled;
333 }
334
335 66022 void Migrate(const uint32_t new_capacity) {
336 66022 Key *old_keys = Base::keys_;
337 66022 Value *old_values = Base::values_;
338 66022 const uint32_t old_capacity = capacity();
339 66022 const uint32_t old_size = size();
340
341 66052 Base::capacity_ = new_capacity;
342 66052 SetThresholds();
343 66052 Base::AllocMemory();
344 66052 Base::DoClear(false);
345
2/2
✓ Branch 0 taken 10320 times.
✓ Branch 1 taken 22706 times.
 66052 if (new_capacity < old_capacity) {
346 20640 uint32_t *shuffled_indices = ShuffleIndices(old_capacity);
347
2/2
✓ Branch 0 taken 145249980 times.
✓ Branch 1 taken 2325 times.
 290504610 for (uint32_t i = 0; i < old_capacity; ++i) {
348
2/3
✓ Branch 0 taken 36413055 times.
✓ Branch 1 taken 108836925 times.
✗ Branch 2 not taken.
 290499960 if (old_keys[shuffled_indices[i]] != Base::empty_key_) {
349 72826110 Base::Insert(old_keys[shuffled_indices[i]],
350 72826110 old_values[shuffled_indices[i]]);
351 }
352 }
353 4650 smunmap(shuffled_indices);
354 } else {
355
2/2
✓ Branch 0 taken 278345505 times.
✓ Branch 1 taken 15356 times.
 556721722 for (uint32_t i = 0; i < old_capacity; ++i) {
356
3/3
✓ Branch 0 taken 157092818 times.
✓ Branch 1 taken 103999146 times.
✓ Branch 2 taken 17253541 times.
 556691010 if (old_keys[i] != Base::empty_key_)
357 417715712 Base::Insert(old_keys[i], old_values[i]);
358 }
359 }
360
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 33026 times.
 51352 assert(size() == old_size);
361
362 66052 Base::DeallocMemory(old_keys, old_values, old_capacity);
363 66052 num_migrates_++;
364 66052 }
365
366 95 void CopyFrom(const SmallHashDynamic<Key, Value> &other) {
367 95 uint32_t *shuffled_indices = ShuffleIndices(other.capacity_);
368
2/2
✓ Branch 0 taken 20644680 times.
✓ Branch 1 taken 55 times.
 20645615 for (uint32_t i = 0; i < other.capacity_; ++i) {
369
2/3
✗ Branch 0 not taken.
✓ Branch 1 taken 15000420 times.
✓ Branch 2 taken 5644260 times.
 20645520 if (other.keys_[shuffled_indices[i]] != other.empty_key_) {
370 15000000 this->Insert(other.keys_[shuffled_indices[i]],
371 15000000 other.values_[shuffled_indices[i]]);
372 }
373 }
374 95 smunmap(shuffled_indices);
375 95 }
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 150 MultiHash() {
392 150 num_hashmaps_ = 0;
393 150 hashmaps_ = NULL;
394 150 locks_ = NULL;
395 150 }
396
397 150 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 150 times.
 150 assert(num_hashmaps > 0);
400 150 const uint8_t N = num_hashmaps;
401 150 num_hashmaps_ = N;
402
3/4
✓ Branch 2 taken 6300 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 6300 times.
✓ Branch 5 taken 150 times.
 6450 hashmaps_ = new SmallHashDynamic<Key, Value>[N]();
403 150 locks_ = static_cast<pthread_mutex_t *>(
404 150 smalloc(N * sizeof(pthread_mutex_t)));
405
2/2
✓ Branch 0 taken 6300 times.
✓ Branch 1 taken 150 times.
 6450 for (uint8_t i = 0; i < N; ++i) {
406 6300 int retval = pthread_mutex_init(&locks_[i], NULL);
407
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 6300 times.
 6300 assert(retval == 0);
408 6300 hashmaps_[i].Init(128, empty_key, hasher);
409 }
410 150 }
411
412 150 ~MultiHash() {
413
2/2
✓ Branch 0 taken 6300 times.
✓ Branch 1 taken 150 times.
 6450 for (uint8_t i = 0; i < num_hashmaps_; ++i) {
414 6300 pthread_mutex_destroy(&locks_[i]);
415 }
416 150 free(locks_);
417
3/4
✓ Branch 0 taken 150 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 6300 times.
✓ Branch 3 taken 150 times.
 6450 delete[] hashmaps_;
418 150 }
419
420 15000000 bool Lookup(const Key &key, Value *value) {
421 15000000 uint8_t target = SelectHashmap(key);
422 15000000 Lock(target);
423 15000000 const bool result = hashmaps_[target].Lookup(key, value);
424 15000000 Unlock(target);
425 15000000 return result;
426 }
427
428 56282025 void Insert(const Key &key, const Value &value) {
429 56282025 uint8_t target = SelectHashmap(key);
430 54485805 Lock(target);
431 56442195 hashmaps_[target].Insert(key, value);
432 54319800 Unlock(target);
433 57260115 }
434
435 27102870 void Erase(const Key &key) {
436 27102870 uint8_t target = SelectHashmap(key);
437 25783800 Lock(target);
438 27436905 hashmaps_[target].Erase(key);
439 24902340 Unlock(target);
440 27942915 }
441
442 15 void Clear() {
443
2/2
✓ Branch 0 taken 630 times.
✓ Branch 1 taken 15 times.
 645 for (uint8_t i = 0; i < num_hashmaps_; ++i)
444 630 Lock(i);
445
2/2
✓ Branch 0 taken 630 times.
✓ Branch 1 taken 15 times.
 645 for (uint8_t i = 0; i < num_hashmaps_; ++i)
446 630 hashmaps_[i].Clear();
447
2/2
✓ Branch 0 taken 630 times.
✓ Branch 1 taken 15 times.
 645 for (uint8_t i = 0; i < num_hashmaps_; ++i)
448 630 Unlock(i);
449 15 }
450
451 150 uint8_t num_hashmaps() const { return num_hashmaps_; }
452
453 120 void GetSizes(uint32_t *sizes) {
454
2/2
✓ Branch 0 taken 5040 times.
✓ Branch 1 taken 120 times.
 5160 for (uint8_t i = 0; i < num_hashmaps_; ++i) {
455 5040 Lock(i);
456 5040 sizes[i] = hashmaps_[i].size();
457 5040 Unlock(i);
458 }
459 120 }
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 97801035 inline uint8_t SelectHashmap(const Key &key) {
471 97801035 uint32_t hash = MurmurHash2(&key, sizeof(key), 0x37);
472 95855940 double bucket = static_cast<double>(hash)
473 95855940 * static_cast<double>(num_hashmaps_)
474 / static_cast<double>(static_cast<uint32_t>(-1));
475 95855940 return static_cast<uint32_t>(bucket) % num_hashmaps_;
476 }
477
478 94939065 inline void Lock(const uint8_t target) {
479 94939065 int retval = pthread_mutex_lock(&locks_[target]);
480
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 102705930 times.
 102705930 assert(retval == 0);
481 102705930 }
482
483 94177815 inline void Unlock(const uint8_t target) {
484 94177815 int retval = pthread_mutex_unlock(&locks_[target]);
485
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 103470615 times.
 103470615 assert(retval == 0);
486 103470615 }
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