-
-
Notifications
You must be signed in to change notification settings - Fork 1.6k
/
hash.cr
957 lines (867 loc) · 20.5 KB
/
hash.cr
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
# A `Hash` represents a mapping of keys to values.
#
# See the [official docs](http://crystal-lang.org/docs/syntax_and_semantics/literals/hash.html) for the basics.
class Hash(K, V)
include Enumerable({K, V})
getter size : Int32
@buckets_size : Int32
@first : Entry(K, V)?
@last : Entry(K, V)?
@block : (self, K -> V)?
def initialize(block : (Hash(K, V), K -> V)? = nil, initial_capacity = nil)
initial_capacity ||= 11
initial_capacity = 11 if initial_capacity < 11
initial_capacity = initial_capacity.to_i
@buckets = Pointer(Entry(K, V)?).malloc(initial_capacity)
@buckets_size = initial_capacity
@size = 0
@block = block
end
def self.new(initial_capacity = nil, &block : (Hash(K, V), K -> V))
new block, initial_capacity: initial_capacity
end
def self.new(default_value : V, initial_capacity = nil)
new(initial_capacity: initial_capacity) { default_value }
end
# Sets the value of *key* to the given *value*.
#
# ```
# h = {} of String => String
# h["foo"] = "bar"
# h["foo"] # => "bar"
# ```
def []=(key : K, value : V)
rehash if @size > 5 * @buckets_size
index = bucket_index key
entry = insert_in_bucket index, key, value
return value unless entry
@size += 1
if last = @last
last.fore = entry
entry.back = last
end
@last = entry
@first = entry unless @first
value
end
# See `Hash#fetch`
def [](key)
fetch(key)
end
# Returns the value for the key given by *key*.
# If not found, returns `nil`. This ignores the default value set by `Hash.new`.
#
# ```
# h = {"foo" => "bar"}
# h["foo"]? # => "bar"
# h["bar"]? # => nil
#
# h = Hash(String, String).new("bar")
# h["foo"]? # => nil
# ```
def []?(key)
fetch(key, nil)
end
# Returns `true` when key given by *key* exists, otherwise `false`.
#
# ```
# h = {"foo" => "bar"}
# h.has_key?("foo") # => true
# h.has_key?("bar") # => false
# ```
def has_key?(key)
!!find_entry(key)
end
# Returns `true` when value given by *value* exists, otherwise `false`.
#
# ```
# h = {"foo" => "bar"}
# h.has_value?("foo") # => false
# h.has_value?("bar") # => true
# ```
def has_value?(val)
each_value do |value|
return true if value == val
end
false
end
# Returns the value for the key given by *key*.
# If not found, returns the default value given by `Hash.new`, otherwise raises `KeyError`.
#
# ```
# h = {"foo" => "bar"}
# h["foo"] # => "bar"
#
# h = Hash(String, String).new("bar")
# h["foo"] # => "bar"
#
# h = Hash(String, String).new { "bar" }
# h["foo"] # => "bar"
#
# h = Hash(String, String).new
# h["foo"] # raises KeyError
# ```
def fetch(key)
fetch(key) do
if (block = @block) && key.is_a?(K)
block.call(self, key.as(K))
else
raise KeyError.new "Missing hash key: #{key.inspect}"
end
end
end
# Returns the value for the key given by *key*, or when not found the value given by *default*.
# This ignores the default value set by `Hash.new`.
#
# ```
# h = {"foo" => "bar"}
# h.fetch("foo", "foo") # => "bar"
# h.fetch("bar", "foo") # => "foo"
# ```
def fetch(key, default)
fetch(key) { default }
end
# Returns the value for the key given by *key*, or when not found calls the given block with the key.
#
# ```
# h = {"foo" => "bar"}
# h.fetch("foo") { |key| key.upcase } # => "bar"
# h.fetch("bar") { |key| key.upcase } # => "BAR"
# ```
def fetch(key)
entry = find_entry(key)
entry ? entry.value : yield key
end
# Returns a tuple populated with the elements at the given indexes.
# Raises if any index is invalid.
#
# ```
# {"a": 1, "b": 2, "c": 3, "d": 4}.values_at("a", "c") # => {1, 3}
# ```
def values_at(*indexes : K)
indexes.map { |index| self[index] }
end
# Returns the first key with the given *value*, else raises `KeyError`.
#
# ```
# hash = {"foo": "bar", "baz": "qux"}
# hash.key("bar") # => "foo"
# hash.key("qux") # => "baz"
# hash.key("foobar") # => Missing hash key for value: foobar (KeyError)
# ```
def key(value)
key(value) { raise KeyError.new "Missing hash key for value: #{value}" }
end
# Returns the first key with the given *value*, else `nil`.
#
# ```
# hash = {"foo": "bar", "baz": "qux"}
# hash.key?("bar") # => "foo"
# hash.key?("qux") # => "baz"
# hash.key?("foobar") # => nil
# ```
def key?(value)
key(value) { nil }
end
# Returns the first key with the given *value*, else yields *value* with the given block.
#
# ```
# hash = {"foo" => "bar"}
# hash.key("bar") { |value| value.upcase } # => "foo"
# hash.key("qux") { |value| value.upcase } # => "QUX"
# ```
def key(value)
each do |k, v|
return k if v == value
end
yield value
end
# Deletes the key-value pair and returns the value.
#
# ```
# h = {"foo" => "bar"}
# h.delete("foo") # => "bar"
# h.fetch("foo", nil) # => nil
# ```
def delete(key)
index = bucket_index(key)
entry = @buckets[index]
previous_entry = nil
while entry
if entry.key == key
back_entry = entry.back
fore_entry = entry.fore
if fore_entry
if back_entry
back_entry.fore = fore_entry
fore_entry.back = back_entry
else
@first = fore_entry
fore_entry.back = nil
end
else
if back_entry
back_entry.fore = nil
@last = back_entry
else
@first = nil
@last = nil
end
end
if previous_entry
previous_entry.next = entry.next
else
@buckets[index] = entry.next
end
@size -= 1
return entry.value
end
previous_entry = entry
entry = entry.next
end
nil
end
# Deletes each key-value pair for which the given block returns `true`.
#
# ```
# h = {"foo" => "bar", "fob" => "baz", "bar" => "qux"}
# h.delete_if { |key, value| key.starts_with?("fo") }
# h # => { "bar" => "qux" }
# ```
def delete_if
keys_to_delete = [] of K
each do |key, value|
keys_to_delete << key if yield(key, value)
end
keys_to_delete.each do |key|
delete(key)
end
self
end
# Returns `true` when hash contains no key-value pairs.
#
# ```
# h = Hash(String, String).new
# h.empty? # => true
#
# h = {"foo" => "bar"}
# h.empty? # => false
# ```
def empty?
@size == 0
end
# Calls the given block for each key-value pair and passes in the key and the value.
#
# ```
# h = {"foo" => "bar"}
#
# h.each do |key, value|
# key # => "foo"
# value # => "bar"
# end
#
# h.each do |key_and_value|
# key_and_value # => {"foo", "bar"}
# end
# ```
def each
current = @first
while current
yield({current.key, current.value})
current = current.fore
end
self
end
# Returns an iterator over the hash entries.
# Which behaves like an `Iterator` returning a `Tuple` consisting of the key and value types.
#
# ```
# hsh = {"foo" => "bar", "baz" => "qux"}
# iterator = hsh.each
#
# entry = iterator.next
# entry[0] # => "foo"
# entry[1] # => "bar"
#
# entry = iterator.next
# entry[0] # => "baz"
# entry[1] # => "qux"
# ```
def each
EntryIterator(K, V).new(self, @first)
end
# Calls the given block for each key-value pair and passes in the key.
#
# ```
# h = {"foo" => "bar"}
# h.each_key do |key|
# key # => "foo"
# end
# ```
def each_key
each do |key, value|
yield key
end
end
# Returns an iterator over the hash keys.
# Which behaves like an `Iterator` consisting of the key's types.
#
# ```
# hsh = {"foo" => "bar", "baz" => "qux"}
# iterator = hsh.each_key
#
# key = iterator.next
# key # => "foo"
#
# key = iterator.next
# key # => "baz"
# ```
def each_key
KeyIterator(K, V).new(self, @first)
end
# Calls the given block for each key-value pair and passes in the value.
#
# ```
# h = {"foo" => "bar"}
# h.each_value do |value|
# value # => "bar"
# end
# ```
def each_value
each do |key, value|
yield value
end
end
# Returns an iterator over the hash values.
# Which behaves like an `Iterator` consisting of the value's types.
#
# ```
# hsh = {"foo" => "bar", "baz" => "qux"}
# iterator = hsh.each_value
#
# value = iterator.next
# value # => "bar"
#
# value = iterator.next
# value # => "qux"
# ```
def each_value
ValueIterator(K, V).new(self, @first)
end
# Returns a new `Array` with all the keys.
#
# ```
# h = {"foo" => "bar", "baz" => "bar"}
# h.keys # => ["foo", "baz"]
# ```
def keys
keys = Array(K).new(@size)
each_key { |key| keys << key }
keys
end
# Returns only the values as an `Array`.
#
# ```
# h = {"foo" => "bar", "baz" => "qux"}
# h.values # => ["bar", "qux"]
# ```
def values
values = Array(V).new(@size)
each_value { |value| values << value }
values
end
# Returns the index of the given key, or `nil` when not found.
# The keys are ordered based on when they were inserted.
#
# ```
# h = {"foo" => "bar", "baz" => "qux"}
# h.key_index("foo") # => 0
# h.key_index("qux") # => nil
# ```
def key_index(key)
each_with_index do |(my_key, my_value), index|
return index if key == my_key
end
nil
end
# Returns a new `Hash` with the keys and values of this hash and *other* combined.
# A value in *other* takes precedence over the one in this hash.
#
# ```
# hash = {"foo" => "bar"}
# hash.merge({"baz": "qux"})
# # => {"foo" => "bar", "baz" => "qux"}
# hash
# # => {"foo" => "bar"}
# ```
def merge(other : Hash(L, W))
hash = Hash(K | L, V | W).new
hash.merge! self
hash.merge! other
hash
end
def merge(other : Hash(L, W), &block : K, V, W -> V | W)
hash = Hash(K | L, V | W).new
hash.merge! self
hash.merge!(other) { |k, v1, v2| yield k, v1, v2 }
hash
end
# Similar to `#merge`, but the receiver is modified.
#
# ```
# hash = {"foo" => "bar"}
# hash.merge!({"baz": "qux"})
# hash # => {"foo" => "bar", "baz" => "qux"}
# ```
def merge!(other : Hash)
other.each do |k, v|
self[k] = v
end
self
end
def merge!(other : Hash, &block)
other.each do |k, v|
if self.has_key?(k)
self[k] = yield k, self[k], v
else
self[k] = v
end
end
self
end
# Returns a new hash consisting of entries for which the block returns true.
# ```
# h = {"a" => 100, "b" => 200, "c" => 300}
# h.select { |k, v| k > "a" } # => {"b" => 200, "c" => 300}
# h.select { |k, v| v < 200 } # => {"a" => 100}
# ```
def select(&block : K, V -> U)
reject { |k, v| !yield(k, v) }
end
# Equivalent to `Hash#select` but makes modification on the current object rather that returning a new one. Returns nil if no changes were made
def select!(&block : K, V -> U)
reject! { |k, v| !yield(k, v) }
end
# Returns a new hash consisting of entries for which the block returns false.
# ```
# h = {"a" => 100, "b" => 200, "c" => 300}
# h.reject { |k, v| k > "a" } # => {"a" => 100}
# h.reject { |k, v| v < 200 } # => {"b" => 200, "c" => 300}
# ```
def reject(&block : K, V -> U)
each_with_object({} of K => V) do |(k, v), memo|
memo[k] = v unless yield k, v
end
end
# Equivalent to `Hash#reject`, but makes modification on the current object rather that returning a new one. Returns nil if no changes were made.
def reject!(&block : K, V -> U)
num_entries = size
each do |key, value|
delete(key) if yield(key, value)
end
num_entries == size ? nil : self
end
# Returns a new `Hash` without the given keys.
#
# ```
# {"a": 1, "b": 2, "c": 3, "d": 4}.reject("a", "c") # => {"b": 2, "d": 4}
# ```
def reject(*keys)
hash = self.dup
hash.reject!(*keys)
end
# Removes a list of keys out of hash.
#
# ```
# h = {"a": 1, "b": 2, "c": 3, "d": 4}.reject!("a", "c")
# h # => {"b": 2, "d": 4}
# ```
def reject!(keys : Array | Tuple)
keys.each { |k| delete(k) }
self
end
def reject!(*keys)
reject!(keys)
end
# Returns a new `Hash` with the given keys.
#
# ```
# {"a": 1, "b": 2, "c": 3, "d": 4}.select("a", "c") # => {"a": 1, "c": 3}
# ```
def select(keys : Array | Tuple)
hash = {} of K => V
keys.each { |k| hash[k] = self[k] if has_key?(k) }
hash
end
def select(*keys)
self.select(keys)
end
# Removes every element except the given ones.
#
# ```
# h = {"a": 1, "b": 2, "c": 3, "d": 4}.select!("a", "c")
# h # => {"a": 1, "c": 3}
# ```
def select!(keys : Array | Tuple)
each { |k, v| delete(k) unless keys.includes?(k) }
self
end
def select!(*keys)
select!(keys)
end
# Zips two arrays into a `Hash`, taking keys from *ary1* and values from *ary2*.
#
# ```
# Hash.zip(["key1", "key2", "key3"], ["value1", "value2", "value3"])
# # => {"key1" => "value1", "key2" => "value2", "key3" => "value3"}
# ```
def self.zip(ary1 : Array(K), ary2 : Array(V))
hash = {} of K => V
ary1.each_with_index do |key, i|
hash[key] = ary2[i]
end
hash
end
# Returns the first key in the hash.
def first_key
@first.not_nil!.key
end
# Returns the first key if it exists, or returns `nil`.
#
# ```
# hash = {"foo": "bar"}
# hash.first_key? # => "foo"
# hash.clear
# hash.first_key? # => nil
# ```
def first_key?
@first.try &.key
end
# Returns the first value in the hash.
def first_value
@first.not_nil!.value
end
# Similar to `#first_key?`, but returns its value.
def first_value?
@first.try &.value
end
# Deletes and returns the first key-value pair in the hash,
# or raises `IndexError` if the hash is empty.
#
# ```
# hash = {"foo" => "bar", "baz" => "qux"}
# hash.shift # => {"foo", "bar"}
# hash # => {"baz" => "qux"}
#
# hash = {} of String => String
# hash.shift # => Index out of bounds (IndexError)
# ```
def shift
shift { raise IndexError.new }
end
# Same as `#shift`, but returns nil if the hash is empty.
#
# ```
# hash = {"foo" => "bar", "baz" => "qux"}
# hash.shift? # => {"foo", "bar"}
# hash # => {"baz" => "qux"}
#
# hash = {} of String => String
# hash.shift? # => nil
# ```
def shift?
shift { nil }
end
# Deletes and returns the first key-value pair in the hash.
# Yields to the given block if the hash is empty.
#
# ```
# hash = {"foo" => "bar", "baz" => "qux"}
# hash.shift { true } # => {"foo", "bar"}
# hash # => {"baz" => "qux"}
#
# hash = {} of String => String
# hash.shift { true } # => true
# hash # => {}
# ```
def shift
first = @first
if first
delete first.key
{first.key, first.value}
else
yield
end
end
# Empties a `Hash` and returns it.
#
# ```
# hash = {"foo": "bar"}
# hash.clear # => {}
# ```
def clear
@buckets_size.times do |i|
@buckets[i] = nil
end
@size = 0
@first = nil
@last = nil
self
end
# Compares with *other*. Returns *true* if all key-value pairs are the same.
def ==(other : Hash)
return false unless size == other.size
each do |key, value|
entry = other.find_entry(key)
return false unless entry && entry.value == value
end
true
end
# See `Object#hash`.
#
# ```
# foo = {"foo" => "bar"}
# foo.hash # => 3247054
# ```
def hash
hash = size
each do |key, value|
hash += key.hash ^ value.hash
end
hash
end
# Duplicates a `Hash`.
#
# ```
# hash_a = {"foo": "bar"}
# hash_b = hash_a.dup
# hash_b.merge!({"baz": "qux"})
# hash_a # => {"foo": "bar"}
# ```
def dup
hash = Hash(K, V).new(initial_capacity: @buckets_size)
each do |key, value|
hash[key] = value
end
hash
end
# Similar to `#dup`, but duplicates the values as well.
#
# ```
# hash_a = {"foobar": {"foo": "bar"}}
# hash_b = hash_a.clone
# hash_b["foobar"]["foo"] = "baz"
# hash_a # => {"foobar": {"foo": "bar"}}
# ```
def clone
hash = Hash(K, V).new(initial_capacity: @buckets_size)
each do |key, value|
hash[key] = value.clone
end
hash
end
def inspect(io : IO)
to_s(io)
end
# Converts to a `String`.
#
# ```
# h = {"foo": "bar"}
# h.to_s # => "{\"foo\" => \"bar\"}"
# h.to_s.class # => String
# ```
def to_s(io : IO)
executed = exec_recursive(:to_s) do
io << "{"
found_one = false
each do |key, value|
io << ", " if found_one
key.inspect(io)
io << " => "
value.inspect(io)
found_one = true
end
io << "}"
end
io << "{...}" unless executed
end
# Returns self.
def to_h
self
end
def rehash
new_size = calculate_new_size(@size)
@buckets = @buckets.realloc(new_size)
new_size.times { |i| @buckets[i] = nil }
@buckets_size = new_size
entry = @first
while entry
entry.next = nil
index = bucket_index entry.key
insert_in_bucket_end index, entry
entry = entry.fore
end
end
# Inverts keys and values. If there are duplicated values, the last key becomes the new value.
#
# ```
# {"foo": "bar"}.invert # => {"bar": "foo"}
# {"foo": "bar", "baz": "bar"}.invert # => {"bar": "baz"}
# ```
def invert
hash = Hash(V, K).new(initial_capacity: @buckets_size)
self.each do |k, v|
hash[v] = k
end
hash
end
protected def find_entry(key)
index = bucket_index key
entry = @buckets[index]
find_entry_in_bucket entry, key
end
private def insert_in_bucket(index, key, value)
entry = @buckets[index]
if entry
while entry
if entry.key == key
entry.value = value
return nil
end
if entry.next
entry = entry.next
else
return entry.next = Entry(K, V).new(key, value)
end
end
else
return @buckets[index] = Entry(K, V).new(key, value)
end
end
private def insert_in_bucket_end(index, existing_entry)
entry = @buckets[index]
if entry
while entry
if entry.next
entry = entry.next
else
return entry.next = existing_entry
end
end
else
@buckets[index] = existing_entry
end
end
private def find_entry_in_bucket(entry, key)
while entry
if entry.key == key
return entry
end
entry = entry.next
end
nil
end
private def bucket_index(key)
key.hash.to_u32.remainder(@buckets_size).to_i
end
private def calculate_new_size(size)
new_size = 8
HASH_PRIMES.each do |hash_size|
return hash_size if new_size > size
new_size <<= 1
end
raise "Hash table too big"
end
# :nodoc:
class Entry(K, V)
getter key : K
property value : V
# Next in the linked list of each bucket
property next : self?
# Next in the ordered sense of hash
property fore : self?
# Previous in the ordered sense of hash
property back : self?
def initialize(@key : K, @value : V)
end
end
# :nodoc:
module BaseIterator
def initialize(@hash, @current)
end
def base_next
if current = @current
value = yield current
@current = current.fore
value
else
stop
end
end
def rewind
@current = @hash.@first
end
end
# :nodoc:
class EntryIterator(K, V)
include BaseIterator
include Iterator({K, V})
@hash : Hash(K, V)
@current : Hash::Entry(K, V)?
def next
base_next { |entry| {entry.key, entry.value} }
end
end
# :nodoc:
class KeyIterator(K, V)
include BaseIterator
include Iterator(K)
@hash : Hash(K, V)
@current : Hash::Entry(K, V)?
def next
base_next &.key
end
end
# :nodoc:
class ValueIterator(K, V)
include BaseIterator
include Iterator(V)
@hash : Hash(K, V)
@current : Hash::Entry(K, V)?
def next
base_next &.value
end
end
# :nodoc:
HASH_PRIMES = [
8 + 3,
16 + 3,
32 + 5,
64 + 3,
128 + 3,
256 + 27,
512 + 9,
1024 + 9,
2048 + 5,
4096 + 3,
8192 + 27,
16384 + 43,
32768 + 3,
65536 + 45,
131072 + 29,
262144 + 3,
524288 + 21,
1048576 + 7,
2097152 + 17,
4194304 + 15,
8388608 + 9,
16777216 + 43,
33554432 + 35,
67108864 + 15,
134217728 + 29,
268435456 + 3,
536870912 + 11,
1073741824 + 85,
0,
]
end