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

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

(** [hashmap_main::hashmap::hash_key] *)
let hashmap_hash_key_fwd (k : usize) (st : state) : result (state & usize) =
  Return (st, k)

(** [hashmap_main::hashmap::HashMap::{0}::allocate_slots] *)
let rec hashmap_hash_map_allocate_slots_fwd
  (t : Type0) (slots : vec (hashmap_list_t t)) (n : usize) (st : state) :
  Tot (result (state & (vec (hashmap_list_t t))))
  (decreases (hashmap_hash_map_allocate_slots_decreases t slots n st))
  =
  begin match n with
  | 0 -> Return (st, slots)
  | _ ->
    begin match vec_push_back (hashmap_list_t t) slots HashmapListNil with
    | Fail -> Fail
    | Return slots0 ->
      begin match usize_sub n 1 with
      | Fail -> Fail
      | Return i ->
        begin match hashmap_hash_map_allocate_slots_fwd t slots0 i st with
        | Fail -> Fail
        | Return (st0, v) -> Return (st0, v)
        end
      end
    end
  end

(** [hashmap_main::hashmap::HashMap::{0}::new_with_capacity] *)
let hashmap_hash_map_new_with_capacity_fwd
  (t : Type0) (capacity : usize) (max_load_dividend : usize)
  (max_load_divisor : usize) (st : state) :
  result (state & (hashmap_hash_map_t t))
  =
  let v = vec_new (hashmap_list_t t) in
  begin match hashmap_hash_map_allocate_slots_fwd t v capacity st with
  | Fail -> Fail
  | Return (st0, slots) ->
    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 (st0, Mkhashmap_hash_map_t 0 (max_load_dividend,
          max_load_divisor) i0 slots)
      end
    end
  end

(** [hashmap_main::hashmap::HashMap::{0}::new] *)
let hashmap_hash_map_new_fwd
  (t : Type0) (st : state) : result (state & (hashmap_hash_map_t t)) =
  begin match hashmap_hash_map_new_with_capacity_fwd t 32 4 5 st with
  | Fail -> Fail
  | Return (st0, hm) -> Return (st0, hm)
  end

(** [hashmap_main::hashmap::HashMap::{0}::clear_slots] *)
let rec hashmap_hash_map_clear_slots_fwd
  (t : Type0) (slots : vec (hashmap_list_t t)) (i : usize) (st : state) :
  Tot (result (state & unit))
  (decreases (hashmap_hash_map_clear_slots_decreases t slots i st))
  =
  let i0 = vec_len (hashmap_list_t t) slots in
  if i < i0
  then
    begin match vec_index_mut_back (hashmap_list_t t) slots i HashmapListNil
      with
    | Fail -> Fail
    | Return slots0 ->
      begin match usize_add i 1 with
      | Fail -> Fail
      | Return i1 ->
        begin match hashmap_hash_map_clear_slots_fwd t slots0 i1 st with
        | Fail -> Fail
        | Return (st0, _) -> Return (st0, ())
        end
      end
    end
  else Return (st, ())

(** [hashmap_main::hashmap::HashMap::{0}::clear_slots] *)
let rec hashmap_hash_map_clear_slots_back
  (t : Type0) (slots : vec (hashmap_list_t t)) (i : usize) (st : state) :
  Tot (result (state & (vec (hashmap_list_t t))))
  (decreases (hashmap_hash_map_clear_slots_decreases t slots i st))
  =
  let i0 = vec_len (hashmap_list_t t) slots in
  if i < i0
  then
    begin match vec_index_mut_back (hashmap_list_t t) slots i HashmapListNil
      with
    | Fail -> Fail
    | Return slots0 ->
      begin match usize_add i 1 with
      | Fail -> Fail
      | Return i1 ->
        begin match hashmap_hash_map_clear_slots_back t slots0 i1 st with
        | Fail -> Fail
        | Return (st0, slots1) -> Return (st0, slots1)
        end
      end
    end
  else Return (st, slots)

(** [hashmap_main::hashmap::HashMap::{0}::clear] *)
let hashmap_hash_map_clear_fwd
  (t : Type0) (self : hashmap_hash_map_t t) (st : state) :
  result (state & unit)
  =
  begin match
    hashmap_hash_map_clear_slots_fwd t self.hashmap_hash_map_slots 0 st with
  | Fail -> Fail
  | Return (st0, _) -> Return (st0, ())
  end

(** [hashmap_main::hashmap::HashMap::{0}::clear] *)
let hashmap_hash_map_clear_back
  (t : Type0) (self : hashmap_hash_map_t t) (st : state) :
  result (state & (hashmap_hash_map_t t))
  =
  begin match
    hashmap_hash_map_clear_slots_back t self.hashmap_hash_map_slots 0 st with
  | Fail -> Fail
  | Return (st0, v) ->
    Return (st0, Mkhashmap_hash_map_t 0 self.hashmap_hash_map_max_load_factor
      self.hashmap_hash_map_max_load v)
  end

(** [hashmap_main::hashmap::HashMap::{0}::len] *)
let hashmap_hash_map_len_fwd
  (t : Type0) (self : hashmap_hash_map_t t) (st : state) :
  result (state & usize)
  =
  Return (st, self.hashmap_hash_map_num_entries)

(** [hashmap_main::hashmap::HashMap::{0}::insert_in_list] *)
let rec hashmap_hash_map_insert_in_list_fwd
  (t : Type0) (key : usize) (value : t) (ls : hashmap_list_t t) (st : state) :
  Tot (result (state & bool))
  (decreases (hashmap_hash_map_insert_in_list_decreases t key value ls st))
  =
  begin match ls with
  | HashmapListCons ckey cvalue ls0 ->
    if ckey = key
    then Return (st, false)
    else
      begin match hashmap_hash_map_insert_in_list_fwd t key value ls0 st with
      | Fail -> Fail
      | Return (st0, b) -> Return (st0, b)
      end
  | HashmapListNil -> Return (st, true)
  end

(** [hashmap_main::hashmap::HashMap::{0}::insert_in_list] *)
let rec hashmap_hash_map_insert_in_list_back
  (t : Type0) (key : usize) (value : t) (ls : hashmap_list_t t) (st : state) :
  Tot (result (state & (hashmap_list_t t)))
  (decreases (hashmap_hash_map_insert_in_list_decreases t key value ls st))
  =
  begin match ls with
  | HashmapListCons ckey cvalue ls0 ->
    if ckey = key
    then Return (st, HashmapListCons ckey value ls0)
    else
      begin match hashmap_hash_map_insert_in_list_back t key value ls0 st with
      | Fail -> Fail
      | Return (st0, ls1) -> Return (st0, HashmapListCons ckey cvalue ls1)
      end
  | HashmapListNil ->
    let l = HashmapListNil in Return (st, HashmapListCons key value l)
  end

(** [hashmap_main::hashmap::HashMap::{0}::insert_no_resize] *)
let hashmap_hash_map_insert_no_resize_fwd
  (t : Type0) (self : hashmap_hash_map_t t) (key : usize) (value : t)
  (st : state) :
  result (state & unit)
  =
  begin match hashmap_hash_key_fwd key st with
  | Fail -> Fail
  | Return (st0, hash) ->
    let i = vec_len (hashmap_list_t t) self.hashmap_hash_map_slots in
    begin match usize_rem hash i with
    | Fail -> Fail
    | Return hash_mod ->
      begin match
        vec_index_mut_fwd (hashmap_list_t t) self.hashmap_hash_map_slots
          hash_mod with
      | Fail -> Fail
      | Return l ->
        begin match hashmap_hash_map_insert_in_list_fwd t key value l st0 with
        | Fail -> Fail
        | Return (st1, inserted) ->
          if inserted
          then
            begin match usize_add self.hashmap_hash_map_num_entries 1 with
            | Fail -> Fail
            | Return _ -> Return (st1, ())
            end
          else Return (st1, ())
        end
      end
    end
  end

(** [hashmap_main::hashmap::HashMap::{0}::insert_no_resize] *)
let hashmap_hash_map_insert_no_resize_back
  (t : Type0) (self : hashmap_hash_map_t t) (key : usize) (value : t)
  (st : state) :
  result (state & (hashmap_hash_map_t t))
  =
  begin match hashmap_hash_key_fwd key st with
  | Fail -> Fail
  | Return (st0, hash) ->
    let i = vec_len (hashmap_list_t t) self.hashmap_hash_map_slots in
    begin match usize_rem hash i with
    | Fail -> Fail
    | Return hash_mod ->
      begin match
        vec_index_mut_fwd (hashmap_list_t t) self.hashmap_hash_map_slots
          hash_mod with
      | Fail -> Fail
      | Return l ->
        begin match hashmap_hash_map_insert_in_list_fwd t key value l st0 with
        | Fail -> Fail
        | Return (st1, inserted) ->
          if inserted
          then
            begin match usize_add self.hashmap_hash_map_num_entries 1 with
            | Fail -> Fail
            | Return i0 ->
              begin match
                hashmap_hash_map_insert_in_list_back t key value l st1 with
              | Fail -> Fail
              | Return (st2, l0) ->
                begin match
                  vec_index_mut_back (hashmap_list_t t)
                    self.hashmap_hash_map_slots hash_mod l0 with
                | Fail -> Fail
                | Return v ->
                  Return (st2, Mkhashmap_hash_map_t i0
                    self.hashmap_hash_map_max_load_factor
                    self.hashmap_hash_map_max_load v)
                end
              end
            end
          else
            begin match hashmap_hash_map_insert_in_list_back t key value l st1
              with
            | Fail -> Fail
            | Return (st2, l0) ->
              begin match
                vec_index_mut_back (hashmap_list_t t)
                  self.hashmap_hash_map_slots hash_mod l0 with
              | Fail -> Fail
              | Return v ->
                Return (st2, Mkhashmap_hash_map_t
                  self.hashmap_hash_map_num_entries
                  self.hashmap_hash_map_max_load_factor
                  self.hashmap_hash_map_max_load v)
              end
            end
        end
      end
    end
  end

(** [hashmap_main::hashmap::HashMap::{0}::move_elements_from_list] *)
let rec hashmap_hash_map_move_elements_from_list_fwd
  (t : Type0) (ntable : hashmap_hash_map_t t) (ls : hashmap_list_t t)
  (st : state) :
  Tot (result (state & unit))
  (decreases (hashmap_hash_map_move_elements_from_list_decreases t ntable ls
  st))
  =
  begin match ls with
  | HashmapListCons k v tl ->
    begin match hashmap_hash_map_insert_no_resize_back t ntable k v st with
    | Fail -> Fail
    | Return (st0, ntable0) ->
      begin match hashmap_hash_map_move_elements_from_list_fwd t ntable0 tl st0
        with
      | Fail -> Fail
      | Return (st1, _) -> Return (st1, ())
      end
    end
  | HashmapListNil -> Return (st, ())
  end

(** [hashmap_main::hashmap::HashMap::{0}::move_elements_from_list] *)
let rec hashmap_hash_map_move_elements_from_list_back
  (t : Type0) (ntable : hashmap_hash_map_t t) (ls : hashmap_list_t t)
  (st : state) :
  Tot (result (state & (hashmap_hash_map_t t)))
  (decreases (hashmap_hash_map_move_elements_from_list_decreases t ntable ls
  st))
  =
  begin match ls with
  | HashmapListCons k v tl ->
    begin match hashmap_hash_map_insert_no_resize_back t ntable k v st with
    | Fail -> Fail
    | Return (st0, ntable0) ->
      begin match
        hashmap_hash_map_move_elements_from_list_back t ntable0 tl st0 with
      | Fail -> Fail
      | Return (st1, ntable1) -> Return (st1, ntable1)
      end
    end
  | HashmapListNil -> Return (st, ntable)
  end

(** [hashmap_main::hashmap::HashMap::{0}::move_elements] *)
let rec hashmap_hash_map_move_elements_fwd
  (t : Type0) (ntable : hashmap_hash_map_t t) (slots : vec (hashmap_list_t t))
  (i : usize) (st : state) :
  Tot (result (state & unit))
  (decreases (hashmap_hash_map_move_elements_decreases t ntable slots i st))
  =
  let i0 = vec_len (hashmap_list_t t) slots in
  if i < i0
  then
    begin match vec_index_mut_fwd (hashmap_list_t t) slots i with
    | Fail -> Fail
    | Return l ->
      let ls = mem_replace_fwd (hashmap_list_t t) l HashmapListNil in
      begin match hashmap_hash_map_move_elements_from_list_back t ntable ls st
        with
      | Fail -> Fail
      | Return (st0, ntable0) ->
        let l0 = mem_replace_back (hashmap_list_t t) l HashmapListNil in
        begin match vec_index_mut_back (hashmap_list_t t) slots i l0 with
        | Fail -> Fail
        | Return slots0 ->
          begin match usize_add i 1 with
          | Fail -> Fail
          | Return i1 ->
            begin match
              hashmap_hash_map_move_elements_fwd t ntable0 slots0 i1 st0 with
            | Fail -> Fail
            | Return (st1, _) -> Return (st1, ())
            end
          end
        end
      end
    end
  else Return (st, ())

(** [hashmap_main::hashmap::HashMap::{0}::move_elements] *)
let rec hashmap_hash_map_move_elements_back
  (t : Type0) (ntable : hashmap_hash_map_t t) (slots : vec (hashmap_list_t t))
  (i : usize) (st : state) :
  Tot (result (state & ((hashmap_hash_map_t t) & (vec (hashmap_list_t t)))))
  (decreases (hashmap_hash_map_move_elements_decreases t ntable slots i st))
  =
  let i0 = vec_len (hashmap_list_t t) slots in
  if i < i0
  then
    begin match vec_index_mut_fwd (hashmap_list_t t) slots i with
    | Fail -> Fail
    | Return l ->
      let ls = mem_replace_fwd (hashmap_list_t t) l HashmapListNil in
      begin match hashmap_hash_map_move_elements_from_list_back t ntable ls st
        with
      | Fail -> Fail
      | Return (st0, ntable0) ->
        let l0 = mem_replace_back (hashmap_list_t t) l HashmapListNil in
        begin match vec_index_mut_back (hashmap_list_t t) slots i l0 with
        | Fail -> Fail
        | Return slots0 ->
          begin match usize_add i 1 with
          | Fail -> Fail
          | Return i1 ->
            begin match
              hashmap_hash_map_move_elements_back t ntable0 slots0 i1 st0 with
            | Fail -> Fail
            | Return (st1, (ntable1, slots1)) ->
              Return (st1, (ntable1, slots1))
            end
          end
        end
      end
    end
  else Return (st, (ntable, slots))

(** [hashmap_main::hashmap::HashMap::{0}::try_resize] *)
let hashmap_hash_map_try_resize_fwd
  (t : Type0) (self : hashmap_hash_map_t t) (st : state) :
  result (state & unit)
  =
  let capacity = vec_len (hashmap_list_t t) self.hashmap_hash_map_slots in
  begin match usize_div 4294967295 2 with
  | Fail -> Fail
  | Return n1 ->
    let (i, i0) = self.hashmap_hash_map_max_load_factor in
    begin match usize_div n1 i with
    | Fail -> Fail
    | Return i1 ->
      if capacity <= i1
      then
        begin match usize_mul capacity 2 with
        | Fail -> Fail
        | Return i2 ->
          begin match hashmap_hash_map_new_with_capacity_fwd t i2 i i0 st with
          | Fail -> Fail
          | Return (st0, ntable) ->
            begin match
              hashmap_hash_map_move_elements_back t ntable
                self.hashmap_hash_map_slots 0 st0 with
            | Fail -> Fail
            | Return (st1, (_, _)) -> Return (st1, ())
            end
          end
        end
      else Return (st, ())
    end
  end

(** [hashmap_main::hashmap::HashMap::{0}::try_resize] *)
let hashmap_hash_map_try_resize_back
  (t : Type0) (self : hashmap_hash_map_t t) (st : state) :
  result (state & (hashmap_hash_map_t t))
  =
  let capacity = vec_len (hashmap_list_t t) self.hashmap_hash_map_slots in
  begin match usize_div 4294967295 2 with
  | Fail -> Fail
  | Return n1 ->
    let (i, i0) = self.hashmap_hash_map_max_load_factor in
    begin match usize_div n1 i with
    | Fail -> Fail
    | Return i1 ->
      if capacity <= i1
      then
        begin match usize_mul capacity 2 with
        | Fail -> Fail
        | Return i2 ->
          begin match hashmap_hash_map_new_with_capacity_fwd t i2 i i0 st with
          | Fail -> Fail
          | Return (st0, ntable) ->
            begin match
              hashmap_hash_map_move_elements_back t ntable
                self.hashmap_hash_map_slots 0 st0 with
            | Fail -> Fail
            | Return (st1, (ntable0, _)) ->
              Return (st1, Mkhashmap_hash_map_t
                self.hashmap_hash_map_num_entries (i, i0)
                ntable0.hashmap_hash_map_max_load
                ntable0.hashmap_hash_map_slots)
            end
          end
        end
      else
        Return (st, Mkhashmap_hash_map_t self.hashmap_hash_map_num_entries (
          i, i0) self.hashmap_hash_map_max_load self.hashmap_hash_map_slots)
    end
  end

(** [hashmap_main::hashmap::HashMap::{0}::insert] *)
let hashmap_hash_map_insert_fwd
  (t : Type0) (self : hashmap_hash_map_t t) (key : usize) (value : t)
  (st : state) :
  result (state & unit)
  =
  begin match hashmap_hash_map_insert_no_resize_back t self key value st with
  | Fail -> Fail
  | Return (st0, self0) ->
    begin match hashmap_hash_map_len_fwd t self0 st0 with
    | Fail -> Fail
    | Return (st1, i) ->
      if i > self0.hashmap_hash_map_max_load
      then
        begin match
          hashmap_hash_map_try_resize_fwd t (Mkhashmap_hash_map_t
            self0.hashmap_hash_map_num_entries
            self0.hashmap_hash_map_max_load_factor
            self0.hashmap_hash_map_max_load self0.hashmap_hash_map_slots) 
            st1 with
        | Fail -> Fail
        | Return (st2, _) -> Return (st2, ())
        end
      else Return (st1, ())
    end
  end

(** [hashmap_main::hashmap::HashMap::{0}::insert] *)
let hashmap_hash_map_insert_back
  (t : Type0) (self : hashmap_hash_map_t t) (key : usize) (value : t)
  (st : state) :
  result (state & (hashmap_hash_map_t t))
  =
  begin match hashmap_hash_map_insert_no_resize_back t self key value st with
  | Fail -> Fail
  | Return (st0, self0) ->
    begin match hashmap_hash_map_len_fwd t self0 st0 with
    | Fail -> Fail
    | Return (st1, i) ->
      if i > self0.hashmap_hash_map_max_load
      then
        begin match
          hashmap_hash_map_try_resize_back t (Mkhashmap_hash_map_t
            self0.hashmap_hash_map_num_entries
            self0.hashmap_hash_map_max_load_factor
            self0.hashmap_hash_map_max_load self0.hashmap_hash_map_slots) 
            st1 with
        | Fail -> Fail
        | Return (st2, self1) -> Return (st2, self1)
        end
      else
        Return (st1, Mkhashmap_hash_map_t self0.hashmap_hash_map_num_entries
          self0.hashmap_hash_map_max_load_factor
          self0.hashmap_hash_map_max_load self0.hashmap_hash_map_slots)
    end
  end

(** [hashmap_main::hashmap::HashMap::{0}::contains_key_in_list] *)
let rec hashmap_hash_map_contains_key_in_list_fwd
  (t : Type0) (key : usize) (ls : hashmap_list_t t) (st : state) :
  Tot (result (state & bool))
  (decreases (hashmap_hash_map_contains_key_in_list_decreases t key ls st))
  =
  begin match ls with
  | HashmapListCons ckey x ls0 ->
    if ckey = key
    then Return (st, true)
    else
      begin match hashmap_hash_map_contains_key_in_list_fwd t key ls0 st with
      | Fail -> Fail
      | Return (st0, b) -> Return (st0, b)
      end
  | HashmapListNil -> Return (st, false)
  end

(** [hashmap_main::hashmap::HashMap::{0}::contains_key] *)
let hashmap_hash_map_contains_key_fwd
  (t : Type0) (self : hashmap_hash_map_t t) (key : usize) (st : state) :
  result (state & bool)
  =
  begin match hashmap_hash_key_fwd key st with
  | Fail -> Fail
  | Return (st0, hash) ->
    let i = vec_len (hashmap_list_t t) self.hashmap_hash_map_slots in
    begin match usize_rem hash i with
    | Fail -> Fail
    | Return hash_mod ->
      begin match
        vec_index_fwd (hashmap_list_t t) self.hashmap_hash_map_slots hash_mod
        with
      | Fail -> Fail
      | Return l ->
        begin match hashmap_hash_map_contains_key_in_list_fwd t key l st0 with
        | Fail -> Fail
        | Return (st1, b) -> Return (st1, b)
        end
      end
    end
  end

(** [hashmap_main::hashmap::HashMap::{0}::get_in_list] *)
let rec hashmap_hash_map_get_in_list_fwd
  (t : Type0) (key : usize) (ls : hashmap_list_t t) (st : state) :
  Tot (result (state & t))
  (decreases (hashmap_hash_map_get_in_list_decreases t key ls st))
  =
  begin match ls with
  | HashmapListCons ckey cvalue ls0 ->
    if ckey = key
    then Return (st, cvalue)
    else
      begin match hashmap_hash_map_get_in_list_fwd t key ls0 st with
      | Fail -> Fail
      | Return (st0, x) -> Return (st0, x)
      end
  | HashmapListNil -> Fail
  end

(** [hashmap_main::hashmap::HashMap::{0}::get] *)
let hashmap_hash_map_get_fwd
  (t : Type0) (self : hashmap_hash_map_t t) (key : usize) (st : state) :
  result (state & t)
  =
  begin match hashmap_hash_key_fwd key st with
  | Fail -> Fail
  | Return (st0, hash) ->
    let i = vec_len (hashmap_list_t t) self.hashmap_hash_map_slots in
    begin match usize_rem hash i with
    | Fail -> Fail
    | Return hash_mod ->
      begin match
        vec_index_fwd (hashmap_list_t t) self.hashmap_hash_map_slots hash_mod
        with
      | Fail -> Fail
      | Return l ->
        begin match hashmap_hash_map_get_in_list_fwd t key l st0 with
        | Fail -> Fail
        | Return (st1, x) -> Return (st1, x)
        end
      end
    end
  end

(** [hashmap_main::hashmap::HashMap::{0}::get_mut_in_list] *)
let rec hashmap_hash_map_get_mut_in_list_fwd
  (t : Type0) (key : usize) (ls : hashmap_list_t t) (st : state) :
  Tot (result (state & t))
  (decreases (hashmap_hash_map_get_mut_in_list_decreases t key ls st))
  =
  begin match ls with
  | HashmapListCons ckey cvalue ls0 ->
    if ckey = key
    then Return (st, cvalue)
    else
      begin match hashmap_hash_map_get_mut_in_list_fwd t key ls0 st with
      | Fail -> Fail
      | Return (st0, x) -> Return (st0, x)
      end
  | HashmapListNil -> Fail
  end

(** [hashmap_main::hashmap::HashMap::{0}::get_mut_in_list] *)
let rec hashmap_hash_map_get_mut_in_list_back
  (t : Type0) (key : usize) (ls : hashmap_list_t t) (ret : t) (st : state) :
  Tot (result (state & (hashmap_list_t t)))
  (decreases (hashmap_hash_map_get_mut_in_list_decreases t key ls st))
  =
  begin match ls with
  | HashmapListCons ckey cvalue ls0 ->
    if ckey = key
    then Return (st, HashmapListCons ckey ret ls0)
    else
      begin match hashmap_hash_map_get_mut_in_list_back t key ls0 ret st with
      | Fail -> Fail
      | Return (st0, ls1) -> Return (st0, HashmapListCons ckey cvalue ls1)
      end
  | HashmapListNil -> Fail
  end

(** [hashmap_main::hashmap::HashMap::{0}::get_mut] *)
let hashmap_hash_map_get_mut_fwd
  (t : Type0) (self : hashmap_hash_map_t t) (key : usize) (st : state) :
  result (state & t)
  =
  begin match hashmap_hash_key_fwd key st with
  | Fail -> Fail
  | Return (st0, hash) ->
    let i = vec_len (hashmap_list_t t) self.hashmap_hash_map_slots in
    begin match usize_rem hash i with
    | Fail -> Fail
    | Return hash_mod ->
      begin match
        vec_index_mut_fwd (hashmap_list_t t) self.hashmap_hash_map_slots
          hash_mod with
      | Fail -> Fail
      | Return l ->
        begin match hashmap_hash_map_get_mut_in_list_fwd t key l st0 with
        | Fail -> Fail
        | Return (st1, x) -> Return (st1, x)
        end
      end
    end
  end

(** [hashmap_main::hashmap::HashMap::{0}::get_mut] *)
let hashmap_hash_map_get_mut_back
  (t : Type0) (self : hashmap_hash_map_t t) (key : usize) (ret : t)
  (st : state) :
  result (state & (hashmap_hash_map_t t))
  =
  begin match hashmap_hash_key_fwd key st with
  | Fail -> Fail
  | Return (st0, hash) ->
    let i = vec_len (hashmap_list_t t) self.hashmap_hash_map_slots in
    begin match usize_rem hash i with
    | Fail -> Fail
    | Return hash_mod ->
      begin match
        vec_index_mut_fwd (hashmap_list_t t) self.hashmap_hash_map_slots
          hash_mod with
      | Fail -> Fail
      | Return l ->
        begin match hashmap_hash_map_get_mut_in_list_back t key l ret st0 with
        | Fail -> Fail
        | Return (st1, l0) ->
          begin match
            vec_index_mut_back (hashmap_list_t t) self.hashmap_hash_map_slots
              hash_mod l0 with
          | Fail -> Fail
          | Return v ->
            Return (st1, Mkhashmap_hash_map_t self.hashmap_hash_map_num_entries
              self.hashmap_hash_map_max_load_factor
              self.hashmap_hash_map_max_load v)
          end
        end
      end
    end
  end

(** [hashmap_main::hashmap::HashMap::{0}::remove_from_list] *)
let rec hashmap_hash_map_remove_from_list_fwd
  (t : Type0) (key : usize) (ls : hashmap_list_t t) (st : state) :
  Tot (result (state & (option t)))
  (decreases (hashmap_hash_map_remove_from_list_decreases t key ls st))
  =
  begin match ls with
  | HashmapListCons ckey x tl ->
    if ckey = key
    then
      let mv_ls =
        mem_replace_fwd (hashmap_list_t t) (HashmapListCons ckey x tl)
          HashmapListNil in
      begin match mv_ls with
      | HashmapListCons i cvalue tl0 -> Return (st, Some cvalue)
      | HashmapListNil -> Fail
      end
    else
      begin match hashmap_hash_map_remove_from_list_fwd t key tl st with
      | Fail -> Fail
      | Return (st0, opt) -> Return (st0, opt)
      end
  | HashmapListNil -> Return (st, None)
  end

(** [hashmap_main::hashmap::HashMap::{0}::remove_from_list] *)
let rec hashmap_hash_map_remove_from_list_back
  (t : Type0) (key : usize) (ls : hashmap_list_t t) (st : state) :
  Tot (result (state & (hashmap_list_t t)))
  (decreases (hashmap_hash_map_remove_from_list_decreases t key ls st))
  =
  begin match ls with
  | HashmapListCons ckey x tl ->
    if ckey = key
    then
      let mv_ls =
        mem_replace_fwd (hashmap_list_t t) (HashmapListCons ckey x tl)
          HashmapListNil in
      begin match mv_ls with
      | HashmapListCons i cvalue tl0 -> Return (st, tl0)
      | HashmapListNil -> Fail
      end
    else
      begin match hashmap_hash_map_remove_from_list_back t key tl st with
      | Fail -> Fail
      | Return (st0, tl0) -> Return (st0, HashmapListCons ckey x tl0)
      end
  | HashmapListNil -> Return (st, HashmapListNil)
  end

(** [hashmap_main::hashmap::HashMap::{0}::remove] *)
let hashmap_hash_map_remove_fwd
  (t : Type0) (self : hashmap_hash_map_t t) (key : usize) (st : state) :
  result (state & (option t))
  =
  begin match hashmap_hash_key_fwd key st with
  | Fail -> Fail
  | Return (st0, hash) ->
    let i = vec_len (hashmap_list_t t) self.hashmap_hash_map_slots in
    begin match usize_rem hash i with
    | Fail -> Fail
    | Return hash_mod ->
      begin match
        vec_index_mut_fwd (hashmap_list_t t) self.hashmap_hash_map_slots
          hash_mod with
      | Fail -> Fail
      | Return l ->
        begin match hashmap_hash_map_remove_from_list_fwd t key l st0 with
        | Fail -> Fail
        | Return (st1, x) ->
          begin match x with
          | None -> Return (st1, None)
          | Some x0 ->
            begin match usize_sub self.hashmap_hash_map_num_entries 1 with
            | Fail -> Fail
            | Return _ -> Return (st1, Some x0)
            end
          end
        end
      end
    end
  end

(** [hashmap_main::hashmap::HashMap::{0}::remove] *)
let hashmap_hash_map_remove_back
  (t : Type0) (self : hashmap_hash_map_t t) (key : usize) (st : state) :
  result (state & (hashmap_hash_map_t t))
  =
  begin match hashmap_hash_key_fwd key st with
  | Fail -> Fail
  | Return (st0, hash) ->
    let i = vec_len (hashmap_list_t t) self.hashmap_hash_map_slots in
    begin match usize_rem hash i with
    | Fail -> Fail
    | Return hash_mod ->
      begin match
        vec_index_mut_fwd (hashmap_list_t t) self.hashmap_hash_map_slots
          hash_mod with
      | Fail -> Fail
      | Return l ->
        begin match hashmap_hash_map_remove_from_list_fwd t key l st0 with
        | Fail -> Fail
        | Return (st1, x) ->
          begin match x with
          | None ->
            begin match hashmap_hash_map_remove_from_list_back t key l st1 with
            | Fail -> Fail
            | Return (st2, l0) ->
              begin match
                vec_index_mut_back (hashmap_list_t t)
                  self.hashmap_hash_map_slots hash_mod l0 with
              | Fail -> Fail
              | Return v ->
                Return (st2, Mkhashmap_hash_map_t
                  self.hashmap_hash_map_num_entries
                  self.hashmap_hash_map_max_load_factor
                  self.hashmap_hash_map_max_load v)
              end
            end
          | Some x0 ->
            begin match usize_sub self.hashmap_hash_map_num_entries 1 with
            | Fail -> Fail
            | Return i0 ->
              begin match hashmap_hash_map_remove_from_list_back t key l st1
                with
              | Fail -> Fail
              | Return (st2, l0) ->
                begin match
                  vec_index_mut_back (hashmap_list_t t)
                    self.hashmap_hash_map_slots hash_mod l0 with
                | Fail -> Fail
                | Return v ->
                  Return (st2, Mkhashmap_hash_map_t i0
                    self.hashmap_hash_map_max_load_factor
                    self.hashmap_hash_map_max_load v)
                end
              end
            end
          end
        end
      end
    end
  end

(** [hashmap_main::hashmap::test1] *)
let hashmap_test1_fwd (st : state) : result (state & unit) =
  begin match hashmap_hash_map_new_fwd u64 st with
  | Fail -> Fail
  | Return (st0, hm) ->
    begin match hashmap_hash_map_insert_back u64 hm 0 42 st0 with
    | Fail -> Fail
    | Return (st1, hm0) ->
      begin match hashmap_hash_map_insert_back u64 hm0 128 18 st1 with
      | Fail -> Fail
      | Return (st2, hm1) ->
        begin match hashmap_hash_map_insert_back u64 hm1 1024 138 st2 with
        | Fail -> Fail
        | Return (st3, hm2) ->
          begin match hashmap_hash_map_insert_back u64 hm2 1056 256 st3 with
          | Fail -> Fail
          | Return (st4, hm3) ->
            begin match hashmap_hash_map_get_fwd u64 hm3 128 st4 with
            | Fail -> Fail
            | Return (st5, i) ->
              if not (i = 18)
              then Fail
              else
                begin match hashmap_hash_map_get_mut_back u64 hm3 1024 56 st5
                  with
                | Fail -> Fail
                | Return (st6, hm4) ->
                  begin match hashmap_hash_map_get_fwd u64 hm4 1024 st6 with
                  | Fail -> Fail
                  | Return (st7, i0) ->
                    if not (i0 = 56)
                    then Fail
                    else
                      begin match hashmap_hash_map_remove_fwd u64 hm4 1024 st7
                        with
                      | Fail -> Fail
                      | Return (st8, x) ->
                        begin match x with
                        | None -> Fail
                        | Some x0 ->
                          if not (x0 = 56)
                          then Fail
                          else
                            begin match
                              hashmap_hash_map_remove_back u64 hm4 1024 st8
                              with
                            | Fail -> Fail
                            | Return (st9, hm5) ->
                              begin match
                                hashmap_hash_map_get_fwd u64 hm5 0 st9 with
                              | Fail -> Fail
                              | Return (st10, i1) ->
                                if not (i1 = 42)
                                then Fail
                                else
                                  begin match
                                    hashmap_hash_map_get_fwd u64 hm5 128 st10
                                    with
                                  | Fail -> Fail
                                  | Return (st11, i2) ->
                                    if not (i2 = 18)
                                    then Fail
                                    else
                                      begin match
                                        hashmap_hash_map_get_fwd u64 
                                          hm5 1056 st11 with
                                      | Fail -> Fail
                                      | Return (st12, i3) ->
                                        if not (i3 = 256)
                                        then Fail
                                        else Return (st12, ())
                                      end
                                  end
                              end
                            end
                        end
                      end
                  end
                end
            end
          end
        end
      end
    end
  end

(** [hashmap_main::insert_on_disk] *)
let insert_on_disk_fwd
  (key : usize) (value : u64) (st : state) : result (state & unit) =
  begin match hashmap_utils_deserialize_fwd st with
  | Fail -> Fail
  | Return (st0, hm) ->
    begin match hashmap_hash_map_insert_back u64 hm key value st0 with
    | Fail -> Fail
    | Return (st1, hm0) ->
      begin match hashmap_utils_serialize_fwd hm0 st1 with
      | Fail -> Fail
      | Return (st2, _) -> Return (st2, ())
      end
    end
  end

(** [hashmap_main::main] *)
let main_fwd (st : state) : result (state & unit) = Return (st, ())