summaryrefslogtreecommitdiff
path: root/tests/fstar/hashmap/Hashmap.Funs.fst
blob: 0140aadc4bdca65741c1577c757c79ef1f565185 (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
(** 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 1 --ifuel 1"

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

(** [hashmap::HashMap::{0}::allocate_slots] *)
let rec hash_map_allocate_slots_loop_fwd
  (t : Type0) (slots : vec (list_t t)) (n : usize) :
  Tot (result (vec (list_t t)))
  (decreases (hash_map_allocate_slots_loop_decreases t slots n))
  =
  if n > 0
  then begin
    let* slots0 = vec_push_back (list_t t) slots ListNil in
    let* n0 = usize_sub n 1 in
    hash_map_allocate_slots_loop_fwd t slots0 n0 end
  else Return slots

(** [hashmap::HashMap::{0}::allocate_slots] *)
let hash_map_allocate_slots_fwd
  (t : Type0) (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] *)
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
  let* slots = hash_map_allocate_slots_fwd t v capacity in
  let* i = usize_mul capacity max_load_dividend in
  let* i0 = usize_div i max_load_divisor in
  Return (Mkhash_map_t 0 (max_load_dividend, max_load_divisor) i0 slots)

(** [hashmap::HashMap::{0}::new] *)
let hash_map_new_fwd (t : Type0) : result (hash_map_t t) =
  hash_map_new_with_capacity_fwd t 32 4 5

(** [hashmap::HashMap::{0}::clear] *)
let rec hash_map_clear_loop_fwd_back
  (t : Type0) (slots : vec (list_t t)) (i : usize) :
  Tot (result (vec (list_t t)))
  (decreases (hash_map_clear_loop_decreases t slots i))
  =
  let i0 = vec_len (list_t t) slots in
  if i < i0
  then begin
    let* i1 = usize_add i 1 in
    let* slots0 = vec_index_mut_back (list_t t) slots i ListNil in
    hash_map_clear_loop_fwd_back t slots0 i1 end
  else Return slots

(** [hashmap::HashMap::{0}::clear] *)
let hash_map_clear_fwd_back
  (t : Type0) (self : hash_map_t t) : result (hash_map_t t) =
  let* v = hash_map_clear_loop_fwd_back t self.hash_map_slots 0 in
  Return (Mkhash_map_t 0 self.hash_map_max_load_factor self.hash_map_max_load
    v)

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

(** [hashmap::HashMap::{0}::insert_in_list] *)
let rec hash_map_insert_in_list_loop_fwd
  (t : Type0) (key : usize) (value : t) (ls : list_t t) :
  Tot (result bool)
  (decreases (hash_map_insert_in_list_loop_decreases t key value ls))
  =
  begin match ls with
  | ListCons ckey cvalue tl ->
    if ckey = key
    then Return false
    else hash_map_insert_in_list_loop_fwd t key value tl
  | ListNil -> Return true
  end

(** [hashmap::HashMap::{0}::insert_in_list] *)
let hash_map_insert_in_list_fwd
  (t : Type0) (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] *)
let rec hash_map_insert_in_list_loop_back
  (t : Type0) (key : usize) (value : t) (ls : list_t t) :
  Tot (result (list_t t))
  (decreases (hash_map_insert_in_list_loop_decreases t key value ls))
  =
  begin match ls with
  | ListCons ckey cvalue tl ->
    if ckey = key
    then Return (ListCons ckey value tl)
    else begin
      let* tl0 = hash_map_insert_in_list_loop_back t key value tl in
      Return (ListCons ckey cvalue tl0) end
  | ListNil -> let l = ListNil in Return (ListCons key value l)
  end

(** [hashmap::HashMap::{0}::insert_in_list] *)
let hash_map_insert_in_list_back
  (t : Type0) (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] *)
let hash_map_insert_no_resize_fwd_back
  (t : Type0) (self : hash_map_t t) (key : usize) (value : t) :
  result (hash_map_t t)
  =
  let* hash = hash_key_fwd key in
  let i = vec_len (list_t t) self.hash_map_slots in
  let* hash_mod = usize_rem hash i in
  let* l = vec_index_mut_fwd (list_t t) self.hash_map_slots hash_mod in
  let* inserted = hash_map_insert_in_list_fwd t key value l in
  if inserted
  then begin
    let* i0 = usize_add self.hash_map_num_entries 1 in
    let* l0 = hash_map_insert_in_list_back t key value l in
    let* v = vec_index_mut_back (list_t t) self.hash_map_slots hash_mod l0 in
    Return (Mkhash_map_t i0 self.hash_map_max_load_factor
      self.hash_map_max_load v) end
  else begin
    let* l0 = hash_map_insert_in_list_back t key value l in
    let* v = vec_index_mut_back (list_t t) self.hash_map_slots hash_mod l0 in
    Return (Mkhash_map_t self.hash_map_num_entries
      self.hash_map_max_load_factor self.hash_map_max_load v) end

(** [core::num::u32::{9}::MAX] *)
let core_num_u32_max_body : result u32 = Return 4294967295
let core_num_u32_max_c : u32 = eval_global core_num_u32_max_body

(** [hashmap::HashMap::{0}::move_elements_from_list] *)
let rec hash_map_move_elements_from_list_loop_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_loop_decreases t ntable ls))
  =
  begin match ls with
  | ListCons k v tl ->
    let* ntable0 = hash_map_insert_no_resize_fwd_back t ntable k v in
    hash_map_move_elements_from_list_loop_fwd_back t ntable0 tl
  | ListNil -> Return ntable
  end

(** [hashmap::HashMap::{0}::move_elements_from_list] *)
let hash_map_move_elements_from_list_fwd_back
  (t : Type0) (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] *)
let rec hash_map_move_elements_loop_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_loop_decreases t ntable slots i))
  =
  let i0 = vec_len (list_t t) slots in
  if i < i0
  then begin
    let* l = vec_index_mut_fwd (list_t t) slots i in
    let ls = mem_replace_fwd (list_t t) l ListNil in
    let* ntable0 = hash_map_move_elements_from_list_fwd_back t ntable ls in
    let* i1 = usize_add i 1 in
    let l0 = mem_replace_back (list_t t) l ListNil in
    let* slots0 = vec_index_mut_back (list_t t) slots i l0 in
    hash_map_move_elements_loop_fwd_back t ntable0 slots0 i1 end
  else Return (ntable, slots)

(** [hashmap::HashMap::{0}::move_elements] *)
let hash_map_move_elements_fwd_back
  (t : Type0) (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] *)
let hash_map_try_resize_fwd_back
  (t : Type0) (self : hash_map_t t) : result (hash_map_t t) =
  let* max_usize = scalar_cast U32 Usize core_num_u32_max_c in
  let capacity = vec_len (list_t t) self.hash_map_slots in
  let* n1 = usize_div max_usize 2 in
  let (i, i0) = self.hash_map_max_load_factor in
  let* i1 = usize_div n1 i in
  if capacity <= i1
  then begin
    let* i2 = usize_mul capacity 2 in
    let* ntable = hash_map_new_with_capacity_fwd t i2 i i0 in
    let* (ntable0, _) =
      hash_map_move_elements_fwd_back t ntable self.hash_map_slots 0 in
    Return (Mkhash_map_t self.hash_map_num_entries (i, i0)
      ntable0.hash_map_max_load ntable0.hash_map_slots) end
  else
    Return (Mkhash_map_t self.hash_map_num_entries (i, i0)
      self.hash_map_max_load self.hash_map_slots)

(** [hashmap::HashMap::{0}::insert] *)
let hash_map_insert_fwd_back
  (t : Type0) (self : hash_map_t t) (key : usize) (value : t) :
  result (hash_map_t t)
  =
  let* self0 = hash_map_insert_no_resize_fwd_back t self key value in
  let* i = hash_map_len_fwd t self0 in
  if i > self0.hash_map_max_load
  then hash_map_try_resize_fwd_back t self0
  else Return self0

(** [hashmap::HashMap::{0}::contains_key_in_list] *)
let rec hash_map_contains_key_in_list_loop_fwd
  (t : Type0) (key : usize) (ls : list_t t) :
  Tot (result bool)
  (decreases (hash_map_contains_key_in_list_loop_decreases t key ls))
  =
  begin match ls with
  | ListCons ckey x tl ->
    if ckey = key
    then Return true
    else hash_map_contains_key_in_list_loop_fwd t key tl
  | ListNil -> Return false
  end

(** [hashmap::HashMap::{0}::contains_key_in_list] *)
let hash_map_contains_key_in_list_fwd
  (t : Type0) (key : usize) (ls : list_t t) : result bool =
  hash_map_contains_key_in_list_loop_fwd t key ls

(** [hashmap::HashMap::{0}::contains_key] *)
let hash_map_contains_key_fwd
  (t : Type0) (self : hash_map_t t) (key : usize) : result bool =
  let* hash = hash_key_fwd key in
  let i = vec_len (list_t t) self.hash_map_slots in
  let* hash_mod = usize_rem hash i in
  let* l = vec_index_fwd (list_t t) self.hash_map_slots hash_mod in
  hash_map_contains_key_in_list_fwd t key l

(** [hashmap::HashMap::{0}::get_in_list] *)
let rec hash_map_get_in_list_loop_fwd
  (t : Type0) (key : usize) (ls : list_t t) :
  Tot (result t) (decreases (hash_map_get_in_list_loop_decreases t key ls))
  =
  begin match ls with
  | ListCons ckey cvalue tl ->
    if ckey = key
    then Return cvalue
    else hash_map_get_in_list_loop_fwd t key tl
  | ListNil -> Fail Failure
  end

(** [hashmap::HashMap::{0}::get_in_list] *)
let hash_map_get_in_list_fwd
  (t : Type0) (key : usize) (ls : list_t t) : result t =
  hash_map_get_in_list_loop_fwd t key ls

(** [hashmap::HashMap::{0}::get] *)
let hash_map_get_fwd
  (t : Type0) (self : hash_map_t t) (key : usize) : result t =
  let* hash = hash_key_fwd key in
  let i = vec_len (list_t t) self.hash_map_slots in
  let* hash_mod = usize_rem hash i in
  let* l = vec_index_fwd (list_t t) self.hash_map_slots hash_mod in
  hash_map_get_in_list_fwd t key l

(** [hashmap::HashMap::{0}::get_mut_in_list] *)
let rec hash_map_get_mut_in_list_loop_fwd
  (t : Type0) (ls : list_t t) (key : usize) :
  Tot (result t) (decreases (hash_map_get_mut_in_list_loop_decreases t ls key))
  =
  begin match ls with
  | ListCons ckey cvalue tl ->
    if ckey = key
    then Return cvalue
    else hash_map_get_mut_in_list_loop_fwd t tl key
  | ListNil -> Fail Failure
  end

(** [hashmap::HashMap::{0}::get_mut_in_list] *)
let hash_map_get_mut_in_list_fwd
  (t : Type0) (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] *)
let rec hash_map_get_mut_in_list_loop_back
  (t : Type0) (ls : list_t t) (key : usize) (ret : t) :
  Tot (result (list_t t))
  (decreases (hash_map_get_mut_in_list_loop_decreases t ls key))
  =
  begin match ls with
  | ListCons ckey cvalue tl ->
    if ckey = key
    then Return (ListCons ckey ret tl)
    else begin
      let* tl0 = hash_map_get_mut_in_list_loop_back t tl key ret in
      Return (ListCons ckey cvalue tl0) end
  | ListNil -> Fail Failure
  end

(** [hashmap::HashMap::{0}::get_mut_in_list] *)
let hash_map_get_mut_in_list_back
  (t : Type0) (ls : list_t t) (key : usize) (ret : t) : result (list_t t) =
  hash_map_get_mut_in_list_loop_back t ls key ret

(** [hashmap::HashMap::{0}::get_mut] *)
let hash_map_get_mut_fwd
  (t : Type0) (self : hash_map_t t) (key : usize) : result t =
  let* hash = hash_key_fwd key in
  let i = vec_len (list_t t) self.hash_map_slots in
  let* hash_mod = usize_rem hash i in
  let* l = vec_index_mut_fwd (list_t t) self.hash_map_slots hash_mod in
  hash_map_get_mut_in_list_fwd t l key

(** [hashmap::HashMap::{0}::get_mut] *)
let hash_map_get_mut_back
  (t : Type0) (self : hash_map_t t) (key : usize) (ret : t) :
  result (hash_map_t t)
  =
  let* hash = hash_key_fwd key in
  let i = vec_len (list_t t) self.hash_map_slots in
  let* hash_mod = usize_rem hash i in
  let* l = vec_index_mut_fwd (list_t t) self.hash_map_slots hash_mod in
  let* l0 = hash_map_get_mut_in_list_back t l key ret in
  let* v = vec_index_mut_back (list_t t) self.hash_map_slots hash_mod l0 in
  Return (Mkhash_map_t self.hash_map_num_entries self.hash_map_max_load_factor
    self.hash_map_max_load v)

(** [hashmap::HashMap::{0}::remove_from_list] *)
let rec hash_map_remove_from_list_loop_fwd
  (t : Type0) (key : usize) (ls : list_t t) :
  Tot (result (option t))
  (decreases (hash_map_remove_from_list_loop_decreases t key ls))
  =
  begin match ls with
  | ListCons ckey x tl ->
    if ckey = key
    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 Failure
      end
    else hash_map_remove_from_list_loop_fwd t key tl
  | ListNil -> Return None
  end

(** [hashmap::HashMap::{0}::remove_from_list] *)
let hash_map_remove_from_list_fwd
  (t : Type0) (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] *)
let rec hash_map_remove_from_list_loop_back
  (t : Type0) (key : usize) (ls : list_t t) :
  Tot (result (list_t t))
  (decreases (hash_map_remove_from_list_loop_decreases t key ls))
  =
  begin match ls with
  | ListCons ckey x tl ->
    if ckey = key
    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 Failure
      end
    else begin
      let* tl0 = hash_map_remove_from_list_loop_back t key tl in
      Return (ListCons ckey x tl0) end
  | ListNil -> Return ListNil
  end

(** [hashmap::HashMap::{0}::remove_from_list] *)
let hash_map_remove_from_list_back
  (t : Type0) (key : usize) (ls : list_t t) : result (list_t t) =
  hash_map_remove_from_list_loop_back t key ls

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

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

(** [hashmap::test1] *)
let test1_fwd : result unit =
  let* hm = hash_map_new_fwd u64 in
  let* hm0 = hash_map_insert_fwd_back u64 hm 0 42 in
  let* hm1 = hash_map_insert_fwd_back u64 hm0 128 18 in
  let* hm2 = hash_map_insert_fwd_back u64 hm1 1024 138 in
  let* hm3 = hash_map_insert_fwd_back u64 hm2 1056 256 in
  let* i = hash_map_get_fwd u64 hm3 128 in
  if not (i = 18)
  then Fail Failure
  else begin
    let* hm4 = hash_map_get_mut_back u64 hm3 1024 56 in
    let* i0 = hash_map_get_fwd u64 hm4 1024 in
    if not (i0 = 56)
    then Fail Failure
    else begin
      let* x = hash_map_remove_fwd u64 hm4 1024 in
      begin match x with
      | None -> Fail Failure
      | Some x0 ->
        if not (x0 = 56)
        then Fail Failure
        else begin
          let* hm5 = hash_map_remove_back u64 hm4 1024 in
          let* i1 = hash_map_get_fwd u64 hm5 0 in
          if not (i1 = 42)
          then Fail Failure
          else begin
            let* i2 = hash_map_get_fwd u64 hm5 128 in
            if not (i2 = 18)
            then Fail Failure
            else begin
              let* i3 = hash_map_get_fwd u64 hm5 1056 in
              if not (i3 = 256) then Fail Failure else Return () end end end
      end end end

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