summaryrefslogtreecommitdiff
path: root/tests/lean/hashmap/Hashmap/Funs.lean
blob: 77b1a157a5810559a0abe96c962065042fbee267 (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
-- THIS FILE WAS AUTOMATICALLY GENERATED BY AENEAS
-- [hashmap]: function definitions
import Base.Primitives
import Hashmap.Types
import Hashmap.Clauses.Clauses

/- [hashmap::hash_key] -/
def hash_key_fwd (k : Usize) : Result Usize :=
  Result.ret k

/- [hashmap::HashMap::{0}::allocate_slots] -/
def hash_map_allocate_slots_loop_fwd
  (T : Type) (slots : Vec (list_t T)) (n : Usize) :
  (Result (Vec (list_t T)))
  :=
  if h: n > (Usize.ofInt 0 (by intlit))
  then
    do
      let slots0  vec_push_back (list_t T) slots list_t.Nil
      let n0  n - (Usize.ofInt 1 (by intlit))
      hash_map_allocate_slots_loop_fwd T slots0 n0
  else Result.ret slots
termination_by hash_map_allocate_slots_loop_fwd slots n =>
  hash_map_allocate_slots_loop_terminates T slots n
decreasing_by hash_map_allocate_slots_loop_decreases slots n

/- [hashmap::HashMap::{0}::allocate_slots] -/
def hash_map_allocate_slots_fwd
  (T : Type) (slots : Vec (list_t T)) (n : Usize) : Result (Vec (list_t T)) :=
  hash_map_allocate_slots_loop_fwd T slots n

/- [hashmap::HashMap::{0}::new_with_capacity] -/
def hash_map_new_with_capacity_fwd
  (T : Type) (capacity : Usize) (max_load_dividend : Usize)
  (max_load_divisor : Usize) :
  Result (hash_map_t T)
  :=
  do
    let v := vec_new (list_t T)
    let slots  hash_map_allocate_slots_fwd T v capacity
    let i  capacity * max_load_dividend
    let i0  i / max_load_divisor
    Result.ret
      {
        hash_map_num_entries := (Usize.ofInt 0 (by intlit)),
        hash_map_max_load_factor := (max_load_dividend, max_load_divisor),
        hash_map_max_load := i0,
        hash_map_slots := slots
      }

/- [hashmap::HashMap::{0}::new] -/
def hash_map_new_fwd (T : Type) : Result (hash_map_t T) :=
  hash_map_new_with_capacity_fwd T (Usize.ofInt 32 (by intlit))
    (Usize.ofInt 4 (by intlit)) (Usize.ofInt 5 (by intlit))

/- [hashmap::HashMap::{0}::clear] -/
def hash_map_clear_loop_fwd_back
  (T : Type) (slots : Vec (list_t T)) (i : Usize) :
  (Result (Vec (list_t T)))
  :=
  let i0 := vec_len (list_t T) slots
  if h: i < i0
  then
    do
      let i1  i + (Usize.ofInt 1 (by intlit))
      let slots0  vec_index_mut_back (list_t T) slots i list_t.Nil
      hash_map_clear_loop_fwd_back T slots0 i1
  else Result.ret slots
termination_by hash_map_clear_loop_fwd_back slots i =>
  hash_map_clear_loop_terminates T slots i
decreasing_by hash_map_clear_loop_decreases slots i

/- [hashmap::HashMap::{0}::clear] -/
def hash_map_clear_fwd_back
  (T : Type) (self : hash_map_t T) : Result (hash_map_t T) :=
  do
    let v 
      hash_map_clear_loop_fwd_back T self.hash_map_slots
        (Usize.ofInt 0 (by intlit))
    Result.ret
      {
        self
          with
          hash_map_num_entries := (Usize.ofInt 0 (by intlit)),
          hash_map_slots := v
      }

/- [hashmap::HashMap::{0}::len] -/
def hash_map_len_fwd (T : Type) (self : hash_map_t T) : Result Usize :=
  Result.ret self.hash_map_num_entries

/- [hashmap::HashMap::{0}::insert_in_list] -/
def hash_map_insert_in_list_loop_fwd
  (T : Type) (key : Usize) (value : T) (ls : list_t T) : (Result Bool) :=
  match h: ls with
  | list_t.Cons ckey cvalue tl =>
    if h: ckey = key
    then Result.ret false
    else hash_map_insert_in_list_loop_fwd T key value tl
  | list_t.Nil => Result.ret true
termination_by hash_map_insert_in_list_loop_fwd key value ls =>
  hash_map_insert_in_list_loop_terminates T key value ls
decreasing_by hash_map_insert_in_list_loop_decreases key value ls

/- [hashmap::HashMap::{0}::insert_in_list] -/
def hash_map_insert_in_list_fwd
  (T : Type) (key : Usize) (value : T) (ls : list_t T) : Result Bool :=
  hash_map_insert_in_list_loop_fwd T key value ls

/- [hashmap::HashMap::{0}::insert_in_list] -/
def hash_map_insert_in_list_loop_back
  (T : Type) (key : Usize) (value : T) (ls : list_t T) : (Result (list_t T)) :=
  match h: ls with
  | list_t.Cons ckey cvalue tl =>
    if h: ckey = key
    then Result.ret (list_t.Cons ckey value tl)
    else
      do
        let tl0  hash_map_insert_in_list_loop_back T key value tl
        Result.ret (list_t.Cons ckey cvalue tl0)
  | list_t.Nil => let l := list_t.Nil
                  Result.ret (list_t.Cons key value l)
termination_by hash_map_insert_in_list_loop_back key value ls =>
  hash_map_insert_in_list_loop_terminates T key value ls
decreasing_by hash_map_insert_in_list_loop_decreases key value ls

/- [hashmap::HashMap::{0}::insert_in_list] -/
def hash_map_insert_in_list_back
  (T : Type) (key : Usize) (value : T) (ls : list_t T) : Result (list_t T) :=
  hash_map_insert_in_list_loop_back T key value ls

/- [hashmap::HashMap::{0}::insert_no_resize] -/
def hash_map_insert_no_resize_fwd_back
  (T : Type) (self : hash_map_t T) (key : Usize) (value : T) :
  Result (hash_map_t T)
  :=
  do
    let hash  hash_key_fwd key
    let i := vec_len (list_t T) self.hash_map_slots
    let hash_mod  hash % i
    let l  vec_index_mut_fwd (list_t T) self.hash_map_slots hash_mod
    let inserted  hash_map_insert_in_list_fwd T key value l
    if h: inserted
    then
      do
        let i0  self.hash_map_num_entries + (Usize.ofInt 1 (by intlit))
        let l0  hash_map_insert_in_list_back T key value l
        let v  vec_index_mut_back (list_t T) self.hash_map_slots hash_mod l0
        Result.ret
          { self with hash_map_num_entries := i0, hash_map_slots := v }
    else
      do
        let l0  hash_map_insert_in_list_back T key value l
        let v  vec_index_mut_back (list_t T) self.hash_map_slots hash_mod l0
        Result.ret { self with hash_map_slots := v }

/- [core::num::u32::{9}::MAX] -/
def core_num_u32_max_body : Result U32 :=
  Result.ret (U32.ofInt 4294967295 (by intlit))
def core_num_u32_max_c : U32 := eval_global core_num_u32_max_body (by simp)

/- [hashmap::HashMap::{0}::move_elements_from_list] -/
def hash_map_move_elements_from_list_loop_fwd_back
  (T : Type) (ntable : hash_map_t T) (ls : list_t T) :
  (Result (hash_map_t T))
  :=
  match h: ls with
  | list_t.Cons k v tl =>
    do
      let ntable0  hash_map_insert_no_resize_fwd_back T ntable k v
      hash_map_move_elements_from_list_loop_fwd_back T ntable0 tl
  | list_t.Nil => Result.ret ntable
termination_by hash_map_move_elements_from_list_loop_fwd_back ntable ls =>
  hash_map_move_elements_from_list_loop_terminates T ntable ls
decreasing_by hash_map_move_elements_from_list_loop_decreases ntable ls

/- [hashmap::HashMap::{0}::move_elements_from_list] -/
def hash_map_move_elements_from_list_fwd_back
  (T : Type) (ntable : hash_map_t T) (ls : list_t T) : Result (hash_map_t T) :=
  hash_map_move_elements_from_list_loop_fwd_back T ntable ls

/- [hashmap::HashMap::{0}::move_elements] -/
def hash_map_move_elements_loop_fwd_back
  (T : Type) (ntable : hash_map_t T) (slots : Vec (list_t T)) (i : Usize) :
  (Result ((hash_map_t T) × (Vec (list_t T))))
  :=
  let i0 := vec_len (list_t T) slots
  if h: i < i0
  then
    do
      let l  vec_index_mut_fwd (list_t T) slots i
      let ls := mem_replace_fwd (list_t T) l list_t.Nil
      let ntable0  hash_map_move_elements_from_list_fwd_back T ntable ls
      let i1  i + (Usize.ofInt 1 (by intlit))
      let l0 := mem_replace_back (list_t T) l list_t.Nil
      let slots0  vec_index_mut_back (list_t T) slots i l0
      hash_map_move_elements_loop_fwd_back T ntable0 slots0 i1
  else Result.ret (ntable, slots)
termination_by hash_map_move_elements_loop_fwd_back ntable slots i =>
  hash_map_move_elements_loop_terminates T ntable slots i
decreasing_by hash_map_move_elements_loop_decreases ntable slots i

/- [hashmap::HashMap::{0}::move_elements] -/
def hash_map_move_elements_fwd_back
  (T : Type) (ntable : hash_map_t T) (slots : Vec (list_t T)) (i : Usize) :
  Result ((hash_map_t T) × (Vec (list_t T)))
  :=
  hash_map_move_elements_loop_fwd_back T ntable slots i

/- [hashmap::HashMap::{0}::try_resize] -/
def hash_map_try_resize_fwd_back
  (T : Type) (self : hash_map_t T) : Result (hash_map_t T) :=
  do
    let max_usize  Scalar.cast .Usize core_num_u32_max_c
    let capacity := vec_len (list_t T) self.hash_map_slots
    let n1  max_usize / (Usize.ofInt 2 (by intlit))
    let (i, i0) := self.hash_map_max_load_factor
    let i1  n1 / i
    if h: capacity <= i1
    then
      do
        let i2  capacity * (Usize.ofInt 2 (by intlit))
        let ntable  hash_map_new_with_capacity_fwd T i2 i i0
        let (ntable0, _) 
          hash_map_move_elements_fwd_back T ntable self.hash_map_slots
            (Usize.ofInt 0 (by intlit))
        Result.ret
          {
            ntable0
              with
              hash_map_num_entries := self.hash_map_num_entries,
              hash_map_max_load_factor := (i, i0)
          }
    else Result.ret { self with hash_map_max_load_factor := (i, i0) }

/- [hashmap::HashMap::{0}::insert] -/
def hash_map_insert_fwd_back
  (T : Type) (self : hash_map_t T) (key : Usize) (value : T) :
  Result (hash_map_t T)
  :=
  do
    let self0  hash_map_insert_no_resize_fwd_back T self key value
    let i  hash_map_len_fwd T self0
    if h: i > self0.hash_map_max_load
    then hash_map_try_resize_fwd_back T self0
    else Result.ret self0

/- [hashmap::HashMap::{0}::contains_key_in_list] -/
def hash_map_contains_key_in_list_loop_fwd
  (T : Type) (key : Usize) (ls : list_t T) : (Result Bool) :=
  match h: ls with
  | list_t.Cons ckey t tl =>
    if h: ckey = key
    then Result.ret true
    else hash_map_contains_key_in_list_loop_fwd T key tl
  | list_t.Nil => Result.ret false
termination_by hash_map_contains_key_in_list_loop_fwd key ls =>
  hash_map_contains_key_in_list_loop_terminates T key ls
decreasing_by hash_map_contains_key_in_list_loop_decreases key ls

/- [hashmap::HashMap::{0}::contains_key_in_list] -/
def hash_map_contains_key_in_list_fwd
  (T : Type) (key : Usize) (ls : list_t T) : Result Bool :=
  hash_map_contains_key_in_list_loop_fwd T key ls

/- [hashmap::HashMap::{0}::contains_key] -/
def hash_map_contains_key_fwd
  (T : Type) (self : hash_map_t T) (key : Usize) : Result Bool :=
  do
    let hash  hash_key_fwd key
    let i := vec_len (list_t T) self.hash_map_slots
    let hash_mod  hash % i
    let l  vec_index_fwd (list_t T) self.hash_map_slots hash_mod
    hash_map_contains_key_in_list_fwd T key l

/- [hashmap::HashMap::{0}::get_in_list] -/
def hash_map_get_in_list_loop_fwd
  (T : Type) (key : Usize) (ls : list_t T) : (Result T) :=
  match h: ls with
  | list_t.Cons ckey cvalue tl =>
    if h: ckey = key
    then Result.ret cvalue
    else hash_map_get_in_list_loop_fwd T key tl
  | list_t.Nil => Result.fail Error.panic
termination_by hash_map_get_in_list_loop_fwd key ls =>
  hash_map_get_in_list_loop_terminates T key ls
decreasing_by hash_map_get_in_list_loop_decreases key ls

/- [hashmap::HashMap::{0}::get_in_list] -/
def hash_map_get_in_list_fwd
  (T : Type) (key : Usize) (ls : list_t T) : Result T :=
  hash_map_get_in_list_loop_fwd T key ls

/- [hashmap::HashMap::{0}::get] -/
def hash_map_get_fwd
  (T : Type) (self : hash_map_t T) (key : Usize) : Result T :=
  do
    let hash  hash_key_fwd key
    let i := vec_len (list_t T) self.hash_map_slots
    let hash_mod  hash % i
    let l  vec_index_fwd (list_t T) self.hash_map_slots hash_mod
    hash_map_get_in_list_fwd T key l

/- [hashmap::HashMap::{0}::get_mut_in_list] -/
def hash_map_get_mut_in_list_loop_fwd
  (T : Type) (ls : list_t T) (key : Usize) : (Result T) :=
  match h: ls with
  | list_t.Cons ckey cvalue tl =>
    if h: ckey = key
    then Result.ret cvalue
    else hash_map_get_mut_in_list_loop_fwd T tl key
  | list_t.Nil => Result.fail Error.panic
termination_by hash_map_get_mut_in_list_loop_fwd ls key =>
  hash_map_get_mut_in_list_loop_terminates T ls key
decreasing_by hash_map_get_mut_in_list_loop_decreases ls key

/- [hashmap::HashMap::{0}::get_mut_in_list] -/
def hash_map_get_mut_in_list_fwd
  (T : Type) (ls : list_t T) (key : Usize) : Result T :=
  hash_map_get_mut_in_list_loop_fwd T ls key

/- [hashmap::HashMap::{0}::get_mut_in_list] -/
def hash_map_get_mut_in_list_loop_back
  (T : Type) (ls : list_t T) (key : Usize) (ret0 : T) : (Result (list_t T)) :=
  match h: ls with
  | list_t.Cons ckey cvalue tl =>
    if h: ckey = key
    then Result.ret (list_t.Cons ckey ret0 tl)
    else
      do
        let tl0  hash_map_get_mut_in_list_loop_back T tl key ret0
        Result.ret (list_t.Cons ckey cvalue tl0)
  | list_t.Nil => Result.fail Error.panic
termination_by hash_map_get_mut_in_list_loop_back ls key ret0 =>
  hash_map_get_mut_in_list_loop_terminates T ls key
decreasing_by hash_map_get_mut_in_list_loop_decreases ls key

/- [hashmap::HashMap::{0}::get_mut_in_list] -/
def hash_map_get_mut_in_list_back
  (T : Type) (ls : list_t T) (key : Usize) (ret0 : T) : Result (list_t T) :=
  hash_map_get_mut_in_list_loop_back T ls key ret0

/- [hashmap::HashMap::{0}::get_mut] -/
def hash_map_get_mut_fwd
  (T : Type) (self : hash_map_t T) (key : Usize) : Result T :=
  do
    let hash  hash_key_fwd key
    let i := vec_len (list_t T) self.hash_map_slots
    let hash_mod  hash % i
    let l  vec_index_mut_fwd (list_t T) self.hash_map_slots hash_mod
    hash_map_get_mut_in_list_fwd T l key

/- [hashmap::HashMap::{0}::get_mut] -/
def hash_map_get_mut_back
  (T : Type) (self : hash_map_t T) (key : Usize) (ret0 : T) :
  Result (hash_map_t T)
  :=
  do
    let hash  hash_key_fwd key
    let i := vec_len (list_t T) self.hash_map_slots
    let hash_mod  hash % i
    let l  vec_index_mut_fwd (list_t T) self.hash_map_slots hash_mod
    let l0  hash_map_get_mut_in_list_back T l key ret0
    let v  vec_index_mut_back (list_t T) self.hash_map_slots hash_mod l0
    Result.ret { self with hash_map_slots := v }

/- [hashmap::HashMap::{0}::remove_from_list] -/
def hash_map_remove_from_list_loop_fwd
  (T : Type) (key : Usize) (ls : list_t T) : (Result (Option T)) :=
  match h: ls with
  | list_t.Cons ckey t tl =>
    if h: ckey = key
    then
      let mv_ls :=
        mem_replace_fwd (list_t T) (list_t.Cons ckey t tl) list_t.Nil
      match h: mv_ls with
      | list_t.Cons i cvalue tl0 => Result.ret (Option.some cvalue)
      | list_t.Nil => Result.fail Error.panic
    else hash_map_remove_from_list_loop_fwd T key tl
  | list_t.Nil => Result.ret Option.none
termination_by hash_map_remove_from_list_loop_fwd key ls =>
  hash_map_remove_from_list_loop_terminates T key ls
decreasing_by hash_map_remove_from_list_loop_decreases key ls

/- [hashmap::HashMap::{0}::remove_from_list] -/
def hash_map_remove_from_list_fwd
  (T : Type) (key : Usize) (ls : list_t T) : Result (Option T) :=
  hash_map_remove_from_list_loop_fwd T key ls

/- [hashmap::HashMap::{0}::remove_from_list] -/
def hash_map_remove_from_list_loop_back
  (T : Type) (key : Usize) (ls : list_t T) : (Result (list_t T)) :=
  match h: ls with
  | list_t.Cons ckey t tl =>
    if h: ckey = key
    then
      let mv_ls :=
        mem_replace_fwd (list_t T) (list_t.Cons ckey t tl) list_t.Nil
      match h: mv_ls with
      | list_t.Cons i cvalue tl0 => Result.ret tl0
      | list_t.Nil => Result.fail Error.panic
    else
      do
        let tl0  hash_map_remove_from_list_loop_back T key tl
        Result.ret (list_t.Cons ckey t tl0)
  | list_t.Nil => Result.ret list_t.Nil
termination_by hash_map_remove_from_list_loop_back key ls =>
  hash_map_remove_from_list_loop_terminates T key ls
decreasing_by hash_map_remove_from_list_loop_decreases key ls

/- [hashmap::HashMap::{0}::remove_from_list] -/
def hash_map_remove_from_list_back
  (T : Type) (key : Usize) (ls : list_t T) : Result (list_t T) :=
  hash_map_remove_from_list_loop_back T key ls

/- [hashmap::HashMap::{0}::remove] -/
def hash_map_remove_fwd
  (T : Type) (self : hash_map_t T) (key : Usize) : Result (Option T) :=
  do
    let hash  hash_key_fwd key
    let i := vec_len (list_t T) self.hash_map_slots
    let hash_mod  hash % i
    let l  vec_index_mut_fwd (list_t T) self.hash_map_slots hash_mod
    let x  hash_map_remove_from_list_fwd T key l
    match h: x with
    | Option.none => Result.ret Option.none
    | Option.some x0 =>
      do
        let _  self.hash_map_num_entries - (Usize.ofInt 1 (by intlit))
        Result.ret (Option.some x0)

/- [hashmap::HashMap::{0}::remove] -/
def hash_map_remove_back
  (T : Type) (self : hash_map_t T) (key : Usize) : Result (hash_map_t T) :=
  do
    let hash  hash_key_fwd key
    let i := vec_len (list_t T) self.hash_map_slots
    let hash_mod  hash % i
    let l  vec_index_mut_fwd (list_t T) self.hash_map_slots hash_mod
    let x  hash_map_remove_from_list_fwd T key l
    match h: x with
    | Option.none =>
      do
        let l0  hash_map_remove_from_list_back T key l
        let v  vec_index_mut_back (list_t T) self.hash_map_slots hash_mod l0
        Result.ret { self with hash_map_slots := v }
    | Option.some x0 =>
      do
        let i0  self.hash_map_num_entries - (Usize.ofInt 1 (by intlit))
        let l0  hash_map_remove_from_list_back T key l
        let v  vec_index_mut_back (list_t T) self.hash_map_slots hash_mod l0
        Result.ret
          { self with hash_map_num_entries := i0, hash_map_slots := v }

/- [hashmap::test1] -/
def test1_fwd : Result Unit :=
  do
    let hm  hash_map_new_fwd U64
    let hm0 
      hash_map_insert_fwd_back U64 hm (Usize.ofInt 0 (by intlit))
        (U64.ofInt 42 (by intlit))
    let hm1 
      hash_map_insert_fwd_back U64 hm0 (Usize.ofInt 128 (by intlit))
        (U64.ofInt 18 (by intlit))
    let hm2 
      hash_map_insert_fwd_back U64 hm1 (Usize.ofInt 1024 (by intlit))
        (U64.ofInt 138 (by intlit))
    let hm3 
      hash_map_insert_fwd_back U64 hm2 (Usize.ofInt 1056 (by intlit))
        (U64.ofInt 256 (by intlit))
    let i  hash_map_get_fwd U64 hm3 (Usize.ofInt 128 (by intlit))
    if h: not (i = (U64.ofInt 18 (by intlit)))
    then Result.fail Error.panic
    else
      do
        let hm4 
          hash_map_get_mut_back U64 hm3 (Usize.ofInt 1024 (by intlit))
            (U64.ofInt 56 (by intlit))
        let i0  hash_map_get_fwd U64 hm4 (Usize.ofInt 1024 (by intlit))
        if h: not (i0 = (U64.ofInt 56 (by intlit)))
        then Result.fail Error.panic
        else
          do
            let x 
              hash_map_remove_fwd U64 hm4 (Usize.ofInt 1024 (by intlit))
            match h: x with
            | Option.none => Result.fail Error.panic
            | Option.some x0 =>
              if h: not (x0 = (U64.ofInt 56 (by intlit)))
              then Result.fail Error.panic
              else
                do
                  let hm5 
                    hash_map_remove_back U64 hm4 (Usize.ofInt 1024 (by intlit))
                  let i1 
                    hash_map_get_fwd U64 hm5 (Usize.ofInt 0 (by intlit))
                  if h: not (i1 = (U64.ofInt 42 (by intlit)))
                  then Result.fail Error.panic
                  else
                    do
                      let i2 
                        hash_map_get_fwd U64 hm5 (Usize.ofInt 128 (by intlit))
                      if h: not (i2 = (U64.ofInt 18 (by intlit)))
                      then Result.fail Error.panic
                      else
                        do
                          let i3 
                            hash_map_get_fwd U64 hm5
                              (Usize.ofInt 1056 (by intlit))
                          if h: not (i3 = (U64.ofInt 256 (by intlit)))
                          then Result.fail Error.panic
                          else Result.ret ()