summaryrefslogtreecommitdiff
path: root/tests/hashmap/Hashmap.Funs.fst
blob: d3d09765dc0469f507eb8ad0bf008c0e19064557 (plain)
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
(** THIS FILE WAS AUTOMATICALLY GENERATED BY AENEAS *)
(** [hashmap]: function definitions *)
module Hashmap.Funs
open Primitives
include Hashmap.Types
include Hashmap.Clauses

#set-options "--z3rlimit 50 --fuel 0 --ifuel 1"

(** [hashmap::hash_key] *)
let hash_key_fwd (k : usize) : result usize = Return k

(** [hashmap::HashMap::allocate_slots] *)
let rec hash_map_allocate_slots_fwd
  (t : Type0) (slots : vec (list_t t)) (n : usize) :
  Tot (result (vec (list_t t)))
  (decreases (hash_map_allocate_slots_decreases t slots n))
  =
  begin match n with
  | 0 -> Return slots
  | _ ->
    begin match vec_push_back (list_t t) slots ListNil with
    | Fail -> Fail
    | Return v ->
      begin match usize_sub n 1 with
      | Fail -> Fail
      | Return i ->
        begin match hash_map_allocate_slots_fwd t v i with
        | Fail -> Fail
        | Return v0 -> Return v0
        end
      end
    end
  end

(** [hashmap::HashMap::new_with_capacity] *)
let hash_map_new_with_capacity_fwd
  (t : Type0) (capacity : usize) (max_load_dividend : usize)
  (max_load_divisor : usize) :
  result (hash_map_t t)
  =
  let v = vec_new (list_t t) in
  begin match hash_map_allocate_slots_fwd t v capacity with
  | Fail -> Fail
  | Return v0 ->
    begin match usize_mul capacity max_load_dividend with
    | Fail -> Fail
    | Return i ->
      begin match usize_div i max_load_divisor with
      | Fail -> Fail
      | Return i0 ->
        Return (Mkhash_map_t 0 (max_load_dividend, max_load_divisor) i0 v0)
      end
    end
  end

(** [hashmap::HashMap::new] *)
let hash_map_new_fwd (t : Type0) : result (hash_map_t t) =
  begin match hash_map_new_with_capacity_fwd t 32 4 5 with
  | Fail -> Fail
  | Return h -> Return h
  end

(** [hashmap::HashMap::clear_slots] *)
let rec hash_map_clear_slots_fwd_back
  (t : Type0) (slots : vec (list_t t)) (i : usize) :
  Tot (result (vec (list_t t)))
  (decreases (hash_map_clear_slots_decreases t slots i))
  =
  let i0 = vec_len (list_t t) slots in
  let b = i < i0 in
  if b
  then
    begin match vec_index_mut_back (list_t t) slots i ListNil with
    | Fail -> Fail
    | Return v ->
      begin match usize_add i 1 with
      | Fail -> Fail
      | Return i1 ->
        begin match hash_map_clear_slots_fwd_back t v i1 with
        | Fail -> Fail
        | Return v0 -> Return v0
        end
      end
    end
  else Return slots

(** [hashmap::HashMap::clear] *)
let hash_map_clear_fwd_back
  (t : Type0) (self : hash_map_t t) : result (hash_map_t t) =
  let p = self.hash_map_max_load_factor in
  let i = self.hash_map_max_load in
  let v = self.hash_map_slots in
  begin match hash_map_clear_slots_fwd_back t v 0 with
  | Fail -> Fail
  | Return v0 -> let self0 = Mkhash_map_t 0 p i v0 in Return self0
  end

(** [hashmap::HashMap::len] *)
let hash_map_len_fwd (t : Type0) (self : hash_map_t t) : result usize =
  let i = self.hash_map_num_entries in Return i

(** [hashmap::HashMap::insert_in_list] *)
let rec hash_map_insert_in_list_fwd
  (t : Type0) (key : usize) (value : t) (ls : list_t t) :
  Tot (result bool)
  (decreases (hash_map_insert_in_list_decreases t key value ls))
  =
  begin match ls with
  | ListCons ckey cvalue ls0 ->
    let b = ckey = key in
    if b
    then Return false
    else
      begin match hash_map_insert_in_list_fwd t key value ls0 with
      | Fail -> Fail
      | Return b0 -> Return b0
      end
  | ListNil -> Return true
  end

(** [hashmap::HashMap::insert_in_list] *)
let rec hash_map_insert_in_list_back
  (t : Type0) (key : usize) (value : t) (ls : list_t t) :
  Tot (result (list_t t))
  (decreases (hash_map_insert_in_list_decreases t key value ls))
  =
  begin match ls with
  | ListCons ckey cvalue ls0 ->
    let b = ckey = key in
    if b
    then let ls1 = ListCons ckey value ls0 in Return ls1
    else
      begin match hash_map_insert_in_list_back t key value ls0 with
      | Fail -> Fail
      | Return l -> let ls1 = ListCons ckey cvalue l in Return ls1
      end
  | ListNil -> let l = ListNil in let ls0 = ListCons key value l in Return ls0
  end

(** [hashmap::HashMap::insert_no_resize] *)
let hash_map_insert_no_resize_fwd_back
  (t : Type0) (self : hash_map_t t) (key : usize) (value : t) :
  result (hash_map_t t)
  =
  begin match hash_key_fwd key with
  | Fail -> Fail
  | Return i ->
    let i0 = self.hash_map_num_entries in
    let p = self.hash_map_max_load_factor in
    let i1 = self.hash_map_max_load in
    let v = self.hash_map_slots in
    let i2 = vec_len (list_t t) v in
    begin match usize_rem i i2 with
    | Fail -> Fail
    | Return hash_mod ->
      begin match vec_index_mut_fwd (list_t t) v hash_mod with
      | Fail -> Fail
      | Return l ->
        begin match hash_map_insert_in_list_fwd t key value l with
        | Fail -> Fail
        | Return b ->
          if b
          then
            begin match usize_add i0 1 with
            | Fail -> Fail
            | Return i3 ->
              begin match hash_map_insert_in_list_back t key value l with
              | Fail -> Fail
              | Return l0 ->
                begin match vec_index_mut_back (list_t t) v hash_mod l0 with
                | Fail -> Fail
                | Return v0 ->
                  let self0 = Mkhash_map_t i3 p i1 v0 in Return self0
                end
              end
            end
          else
            begin match hash_map_insert_in_list_back t key value l with
            | Fail -> Fail
            | Return l0 ->
              begin match vec_index_mut_back (list_t t) v hash_mod l0 with
              | Fail -> Fail
              | Return v0 ->
                let self0 = Mkhash_map_t i0 p i1 v0 in Return self0
              end
            end
        end
      end
    end
  end

(** [hashmap::HashMap::move_elements_from_list] *)
let rec hash_map_move_elements_from_list_fwd_back
  (t : Type0) (ntable : hash_map_t t) (ls : list_t t) :
  Tot (result (hash_map_t t))
  (decreases (hash_map_move_elements_from_list_decreases t ntable ls))
  =
  begin match ls with
  | ListCons k v tl ->
    begin match hash_map_insert_no_resize_fwd_back t ntable k v with
    | Fail -> Fail
    | Return h ->
      begin match hash_map_move_elements_from_list_fwd_back t h tl with
      | Fail -> Fail
      | Return h0 -> Return h0
      end
    end
  | ListNil -> Return ntable
  end

(** [hashmap::HashMap::move_elements] *)
let rec hash_map_move_elements_fwd_back
  (t : Type0) (ntable : hash_map_t t) (slots : vec (list_t t)) (i : usize) :
  Tot (result ((hash_map_t t) & (vec (list_t t))))
  (decreases (hash_map_move_elements_decreases t ntable slots i))
  =
  let i0 = vec_len (list_t t) slots in
  let b = i < i0 in
  if b
  then
    begin match vec_index_mut_fwd (list_t t) slots i with
    | Fail -> Fail
    | Return l ->
      let l0 = mem_replace_fwd (list_t t) l ListNil in
      begin match hash_map_move_elements_from_list_fwd_back t ntable l0 with
      | Fail -> Fail
      | Return h ->
        let l1 = mem_replace_back (list_t t) l ListNil in
        begin match vec_index_mut_back (list_t t) slots i l1 with
        | Fail -> Fail
        | Return v ->
          begin match usize_add i 1 with
          | Fail -> Fail
          | Return i1 ->
            begin match hash_map_move_elements_fwd_back t h v i1 with
            | Fail -> Fail
            | Return (h0, v0) -> Return (h0, v0)
            end
          end
        end
      end
    end
  else Return (ntable, slots)

(** [hashmap::HashMap::try_resize] *)
let hash_map_try_resize_fwd_back
  (t : Type0) (self : hash_map_t t) : result (hash_map_t t) =
  let i = self.hash_map_num_entries in
  let p = self.hash_map_max_load_factor in
  let i0 = self.hash_map_max_load in
  let v = self.hash_map_slots in
  let i1 = vec_len (list_t t) v in
  begin match usize_div 4294967295 2 with
  | Fail -> Fail
  | Return n1 ->
    let (i2, i3) = p in
    begin match usize_div n1 i2 with
    | Fail -> Fail
    | Return i4 ->
      let b = i1 <= i4 in
      if b
      then
        begin match usize_mul i1 2 with
        | Fail -> Fail
        | Return i5 ->
          begin match hash_map_new_with_capacity_fwd t i5 i2 i3 with
          | Fail -> Fail
          | Return h ->
            begin match hash_map_move_elements_fwd_back t h v 0 with
            | Fail -> Fail
            | Return (h0, v0) ->
              let i6 = h0.hash_map_max_load in
              let v1 = h0.hash_map_slots in
              let v2 = mem_replace_back (vec (list_t t)) v0 v1 in
              let self0 = Mkhash_map_t i (i2, i3) i6 v2 in
              Return
              self0
            end
          end
        end
      else let self0 = Mkhash_map_t i (i2, i3) i0 v in Return self0
    end
  end

(** [hashmap::HashMap::insert] *)
let hash_map_insert_fwd_back
  (t : Type0) (self : hash_map_t t) (key : usize) (value : t) :
  result (hash_map_t t)
  =
  begin match hash_map_insert_no_resize_fwd_back t self key value with
  | Fail -> Fail
  | Return h ->
    begin match hash_map_len_fwd t h with
    | Fail -> Fail
    | Return i ->
      let i0 = h.hash_map_num_entries in
      let p = h.hash_map_max_load_factor in
      let i1 = h.hash_map_max_load in
      let v = h.hash_map_slots in
      let b = i > i1 in
      if b
      then
        begin match hash_map_try_resize_fwd_back t (Mkhash_map_t i0 p i1 v)
          with
        | Fail -> Fail
        | Return h0 -> Return h0
        end
      else let self0 = Mkhash_map_t i0 p i1 v in Return self0
    end
  end

(** [hashmap::HashMap::contains_key_in_list] *)
let rec hash_map_contains_key_in_list_fwd
  (t : Type0) (key : usize) (ls : list_t t) :
  Tot (result bool)
  (decreases (hash_map_contains_key_in_list_decreases t key ls))
  =
  begin match ls with
  | ListCons ckey x ls0 ->
    let b = ckey = key in
    if b
    then Return true
    else
      begin match hash_map_contains_key_in_list_fwd t key ls0 with
      | Fail -> Fail
      | Return b0 -> Return b0
      end
  | ListNil -> Return false
  end

(** [hashmap::HashMap::contains_key] *)
let hash_map_contains_key_fwd
  (t : Type0) (self : hash_map_t t) (key : usize) : result bool =
  begin match hash_key_fwd key with
  | Fail -> Fail
  | Return i ->
    let v = self.hash_map_slots in
    let i0 = vec_len (list_t t) v in
    begin match usize_rem i i0 with
    | Fail -> Fail
    | Return hash_mod ->
      begin match vec_index_fwd (list_t t) v hash_mod with
      | Fail -> Fail
      | Return l ->
        begin match hash_map_contains_key_in_list_fwd t key l with
        | Fail -> Fail
        | Return b -> Return b
        end
      end
    end
  end

(** [hashmap::HashMap::get_in_list] *)
let rec hash_map_get_in_list_fwd
  (t : Type0) (key : usize) (ls : list_t t) :
  Tot (result t) (decreases (hash_map_get_in_list_decreases t key ls))
  =
  begin match ls with
  | ListCons ckey cvalue ls0 ->
    let b = ckey = key in
    if b
    then Return cvalue
    else
      begin match hash_map_get_in_list_fwd t key ls0 with
      | Fail -> Fail
      | Return x -> Return x
      end
  | ListNil -> Fail
  end

(** [hashmap::HashMap::get] *)
let hash_map_get_fwd
  (t : Type0) (self : hash_map_t t) (key : usize) : result t =
  begin match hash_key_fwd key with
  | Fail -> Fail
  | Return i ->
    let v = self.hash_map_slots in
    let i0 = vec_len (list_t t) v in
    begin match usize_rem i i0 with
    | Fail -> Fail
    | Return hash_mod ->
      begin match vec_index_fwd (list_t t) v hash_mod with
      | Fail -> Fail
      | Return l ->
        begin match hash_map_get_in_list_fwd t key l with
        | Fail -> Fail
        | Return x -> Return x
        end
      end
    end
  end

(** [hashmap::HashMap::get_mut_in_list] *)
let rec hash_map_get_mut_in_list_fwd
  (t : Type0) (key : usize) (ls : list_t t) :
  Tot (result t) (decreases (hash_map_get_mut_in_list_decreases t key ls))
  =
  begin match ls with
  | ListCons ckey cvalue ls0 ->
    let b = ckey = key in
    if b
    then Return cvalue
    else
      begin match hash_map_get_mut_in_list_fwd t key ls0 with
      | Fail -> Fail
      | Return x -> Return x
      end
  | ListNil -> Fail
  end

(** [hashmap::HashMap::get_mut_in_list] *)
let rec hash_map_get_mut_in_list_back
  (t : Type0) (key : usize) (ls : list_t t) (ret : t) :
  Tot (result (list_t t))
  (decreases (hash_map_get_mut_in_list_decreases t key ls))
  =
  begin match ls with
  | ListCons ckey cvalue ls0 ->
    let b = ckey = key in
    if b
    then let ls1 = ListCons ckey ret ls0 in Return ls1
    else
      begin match hash_map_get_mut_in_list_back t key ls0 ret with
      | Fail -> Fail
      | Return l -> let ls1 = ListCons ckey cvalue l in Return ls1
      end
  | ListNil -> Fail
  end

(** [hashmap::HashMap::get_mut] *)
let hash_map_get_mut_fwd
  (t : Type0) (self : hash_map_t t) (key : usize) : result t =
  begin match hash_key_fwd key with
  | Fail -> Fail
  | Return i ->
    let v = self.hash_map_slots in
    let i0 = vec_len (list_t t) v in
    begin match usize_rem i i0 with
    | Fail -> Fail
    | Return hash_mod ->
      begin match vec_index_mut_fwd (list_t t) v hash_mod with
      | Fail -> Fail
      | Return l ->
        begin match hash_map_get_mut_in_list_fwd t key l with
        | Fail -> Fail
        | Return x -> Return x
        end
      end
    end
  end

(** [hashmap::HashMap::get_mut] *)
let hash_map_get_mut_back
  (t : Type0) (self : hash_map_t t) (key : usize) (ret : t) :
  result (hash_map_t t)
  =
  begin match hash_key_fwd key with
  | Fail -> Fail
  | Return i ->
    let i0 = self.hash_map_num_entries in
    let p = self.hash_map_max_load_factor in
    let i1 = self.hash_map_max_load in
    let v = self.hash_map_slots in
    let i2 = vec_len (list_t t) v in
    begin match usize_rem i i2 with
    | Fail -> Fail
    | Return hash_mod ->
      begin match vec_index_mut_fwd (list_t t) v hash_mod with
      | Fail -> Fail
      | Return l ->
        begin match hash_map_get_mut_in_list_back t key l ret with
        | Fail -> Fail
        | Return l0 ->
          begin match vec_index_mut_back (list_t t) v hash_mod l0 with
          | Fail -> Fail
          | Return v0 -> let self0 = Mkhash_map_t i0 p i1 v0 in Return self0
          end
        end
      end
    end
  end

(** [hashmap::HashMap::remove_from_list] *)
let rec hash_map_remove_from_list_fwd
  (t : Type0) (key : usize) (ls : list_t t) :
  Tot (result (option t))
  (decreases (hash_map_remove_from_list_decreases t key ls))
  =
  begin match ls with
  | ListCons ckey x tl ->
    let b = ckey = key in
    if b
    then
      let mv_ls = mem_replace_fwd (list_t t) (ListCons ckey x tl) ListNil in
      begin match mv_ls with
      | ListCons i cvalue tl0 -> Return (Some cvalue)
      | ListNil -> Fail
      end
    else
      begin match hash_map_remove_from_list_fwd t key tl with
      | Fail -> Fail
      | Return opt -> Return opt
      end
  | ListNil -> Return None
  end

(** [hashmap::HashMap::remove_from_list] *)
let rec hash_map_remove_from_list_back
  (t : Type0) (key : usize) (ls : list_t t) :
  Tot (result (list_t t))
  (decreases (hash_map_remove_from_list_decreases t key ls))
  =
  begin match ls with
  | ListCons ckey x tl ->
    let b = ckey = key in
    if b
    then
      let mv_ls = mem_replace_fwd (list_t t) (ListCons ckey x tl) ListNil in
      begin match mv_ls with
      | ListCons i cvalue tl0 -> Return tl0
      | ListNil -> Fail
      end
    else
      begin match hash_map_remove_from_list_back t key tl with
      | Fail -> Fail
      | Return l -> let ls0 = ListCons ckey x l in Return ls0
      end
  | ListNil -> let ls0 = ListNil in Return ls0
  end

(** [hashmap::HashMap::remove] *)
let hash_map_remove_fwd
  (t : Type0) (self : hash_map_t t) (key : usize) : result (option t) =
  begin match hash_key_fwd key with
  | Fail -> Fail
  | Return i ->
    let i0 = self.hash_map_num_entries in
    let v = self.hash_map_slots in
    let i1 = vec_len (list_t t) v in
    begin match usize_rem i i1 with
    | Fail -> Fail
    | Return hash_mod ->
      begin match vec_index_mut_fwd (list_t t) v hash_mod with
      | Fail -> Fail
      | Return l ->
        begin match hash_map_remove_from_list_fwd t key l with
        | Fail -> Fail
        | Return x ->
          begin match x with
          | None -> Return None
          | Some x0 ->
            begin match usize_sub i0 1 with
            | Fail -> Fail
            | Return _ -> Return (Some x0)
            end
          end
        end
      end
    end
  end

(** [hashmap::HashMap::remove] *)
let hash_map_remove_back
  (t : Type0) (self : hash_map_t t) (key : usize) : result (hash_map_t t) =
  begin match hash_key_fwd key with
  | Fail -> Fail
  | Return i ->
    let i0 = self.hash_map_num_entries in
    let p = self.hash_map_max_load_factor in
    let i1 = self.hash_map_max_load in
    let v = self.hash_map_slots in
    let i2 = vec_len (list_t t) v in
    begin match usize_rem i i2 with
    | Fail -> Fail
    | Return hash_mod ->
      begin match vec_index_mut_fwd (list_t t) v hash_mod with
      | Fail -> Fail
      | Return l ->
        begin match hash_map_remove_from_list_fwd t key l with
        | Fail -> Fail
        | Return x ->
          begin match x with
          | None ->
            begin match hash_map_remove_from_list_back t key l with
            | Fail -> Fail
            | Return l0 ->
              begin match vec_index_mut_back (list_t t) v hash_mod l0 with
              | Fail -> Fail
              | Return v0 ->
                let self0 = Mkhash_map_t i0 p i1 v0 in Return self0
              end
            end
          | Some x0 ->
            begin match usize_sub i0 1 with
            | Fail -> Fail
            | Return i3 ->
              begin match hash_map_remove_from_list_back t key l with
              | Fail -> Fail
              | Return l0 ->
                begin match vec_index_mut_back (list_t t) v hash_mod l0 with
                | Fail -> Fail
                | Return v0 ->
                  let self0 = Mkhash_map_t i3 p i1 v0 in Return self0
                end
              end
            end
          end
        end
      end
    end
  end

(** [hashmap::test1] *)
let test1_fwd : result unit =
  begin match hash_map_new_fwd u64 with
  | Fail -> Fail
  | Return h ->
    begin match hash_map_insert_fwd_back u64 h 0 42 with
    | Fail -> Fail
    | Return h0 ->
      begin match hash_map_insert_fwd_back u64 h0 128 18 with
      | Fail -> Fail
      | Return h1 ->
        begin match hash_map_insert_fwd_back u64 h1 1024 138 with
        | Fail -> Fail
        | Return h2 ->
          begin match hash_map_insert_fwd_back u64 h2 1056 256 with
          | Fail -> Fail
          | Return h3 ->
            begin match hash_map_get_fwd u64 h3 128 with
            | Fail -> Fail
            | Return i ->
              let b = i = 18 in
              let b0 = not b in
              if b0
              then Fail
              else
                begin match hash_map_get_mut_back u64 h3 1024 56 with
                | Fail -> Fail
                | Return h4 ->
                  begin match hash_map_get_fwd u64 h4 1024 with
                  | Fail -> Fail
                  | Return i0 ->
                    let b1 = i0 = 56 in
                    let b2 = not b1 in
                    if b2
                    then Fail
                    else
                      begin match hash_map_remove_fwd u64 h4 1024 with
                      | Fail -> Fail
                      | Return x ->
                        begin match x with
                        | None -> Fail
                        | Some x0 ->
                          let b3 = x0 = 56 in
                          let b4 = not b3 in
                          if b4
                          then Fail
                          else
                            begin match hash_map_remove_back u64 h4 1024 with
                            | Fail -> Fail
                            | Return h5 ->
                              begin match hash_map_get_fwd u64 h5 0 with
                              | Fail -> Fail
                              | Return i1 ->
                                let b5 = i1 = 42 in
                                let b6 = not b5 in
                                if b6
                                then Fail
                                else
                                  begin match hash_map_get_fwd u64 h5 128 with
                                  | Fail -> Fail
                                  | Return i2 ->
                                    let b7 = i2 = 18 in
                                    let b8 = not b7 in
                                    if b8
                                    then Fail
                                    else
                                      begin match hash_map_get_fwd u64 h5 1056
                                        with
                                      | Fail -> Fail
                                      | Return i3 ->
                                        let b9 = i3 = 256 in
                                        let b10 = not b9 in
                                        if b10 then Fail else Return ()
                                      end
                                  end
                              end
                            end
                        end
                      end
                  end
                end
            end
          end
        end
      end
    end
  end

(** Unit test for [hashmap::test1] *)
let _ = assert_norm (test1_fwd = Return ())