summaryrefslogtreecommitdiff
path: root/tests/lean/Hashmap/Funs.lean
blob: f01f1c4f092cd6ad2d877fd3d3a66235fb86d036 (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
-- THIS FILE WAS AUTOMATICALLY GENERATED BY AENEAS
-- [hashmap]: function definitions
import Base
import Hashmap.Types
import Hashmap.FunsExternal
open Primitives
set_option linter.dupNamespace false
set_option linter.hashCommand false
set_option linter.unusedVariables false

namespace hashmap

/- [hashmap::hash_key]:
   Source: 'tests/src/hashmap.rs', lines 38:0-38:32 -/
def hash_key (k : Usize) : Result Usize :=
  Result.ok k

/- [hashmap::{hashmap::HashMap<T>}::allocate_slots]: loop 0:
   Source: 'tests/src/hashmap.rs', lines 63:4-69:5 -/
divergent def HashMap.allocate_slots_loop
  (T : Type) (slots : alloc.vec.Vec (AList T)) (n : Usize) :
  Result (alloc.vec.Vec (AList T))
  :=
  if n > 0#usize
  then
    do
    let slots1  alloc.vec.Vec.push (AList T) slots AList.Nil
    let n1  n - 1#usize
    HashMap.allocate_slots_loop T slots1 n1
  else Result.ok slots

/- [hashmap::{hashmap::HashMap<T>}::allocate_slots]:
   Source: 'tests/src/hashmap.rs', lines 63:4-63:78 -/
@[reducible]
def HashMap.allocate_slots
  (T : Type) (slots : alloc.vec.Vec (AList T)) (n : Usize) :
  Result (alloc.vec.Vec (AList T))
  :=
  HashMap.allocate_slots_loop T slots n

/- [hashmap::{hashmap::HashMap<T>}::new_with_capacity]:
   Source: 'tests/src/hashmap.rs', lines 72:4-76:13 -/
def HashMap.new_with_capacity
  (T : Type) (capacity : Usize) (max_load_dividend : Usize)
  (max_load_divisor : Usize) :
  Result (HashMap T)
  :=
  do
  let slots  HashMap.allocate_slots T (alloc.vec.Vec.new (AList T)) capacity
  let i  capacity * max_load_dividend
  let i1  i / max_load_divisor
  Result.ok
    {
      num_entries := 0#usize,
      max_load_factor := (max_load_dividend, max_load_divisor),
      max_load := i1,
      saturated := false,
      slots := slots
    }

/- [hashmap::{hashmap::HashMap<T>}::new]:
   Source: 'tests/src/hashmap.rs', lines 89:4-89:24 -/
def HashMap.new (T : Type) : Result (HashMap T) :=
  HashMap.new_with_capacity T 32#usize 4#usize 5#usize

/- [hashmap::{hashmap::HashMap<T>}::clear]: loop 0:
   Source: 'tests/src/hashmap.rs', lines 97:8-102:5 -/
divergent def HashMap.clear_loop
  (T : Type) (slots : alloc.vec.Vec (AList T)) (i : Usize) :
  Result (alloc.vec.Vec (AList T))
  :=
  let i1 := alloc.vec.Vec.len (AList T) slots
  if i < i1
  then
    do
    let (_, index_mut_back) 
      alloc.vec.Vec.index_mut (AList T) Usize
        (core.slice.index.SliceIndexUsizeSliceTInst (AList T)) slots i
    let i2  i + 1#usize
    let slots1  index_mut_back AList.Nil
    HashMap.clear_loop T slots1 i2
  else Result.ok slots

/- [hashmap::{hashmap::HashMap<T>}::clear]:
   Source: 'tests/src/hashmap.rs', lines 94:4-94:27 -/
def HashMap.clear (T : Type) (self : HashMap T) : Result (HashMap T) :=
  do
  let hm  HashMap.clear_loop T self.slots 0#usize
  Result.ok { self with num_entries := 0#usize, slots := hm }

/- [hashmap::{hashmap::HashMap<T>}::len]:
   Source: 'tests/src/hashmap.rs', lines 104:4-104:30 -/
def HashMap.len (T : Type) (self : HashMap T) : Result Usize :=
  Result.ok self.num_entries

/- [hashmap::{hashmap::HashMap<T>}::insert_in_list]: loop 0:
   Source: 'tests/src/hashmap.rs', lines 111:4-128:5 -/
divergent def HashMap.insert_in_list_loop
  (T : Type) (key : Usize) (value : T) (ls : AList T) :
  Result (Bool × (AList T))
  :=
  match ls with
  | AList.Cons ckey cvalue tl =>
    if ckey = key
    then Result.ok (false, AList.Cons ckey value tl)
    else
      do
      let (b, tl1)  HashMap.insert_in_list_loop T key value tl
      Result.ok (b, AList.Cons ckey cvalue tl1)
  | AList.Nil => Result.ok (true, AList.Cons key value AList.Nil)

/- [hashmap::{hashmap::HashMap<T>}::insert_in_list]:
   Source: 'tests/src/hashmap.rs', lines 111:4-111:72 -/
@[reducible]
def HashMap.insert_in_list
  (T : Type) (key : Usize) (value : T) (ls : AList T) :
  Result (Bool × (AList T))
  :=
  HashMap.insert_in_list_loop T key value ls

/- [hashmap::{hashmap::HashMap<T>}::insert_no_resize]:
   Source: 'tests/src/hashmap.rs', lines 131:4-131:54 -/
def HashMap.insert_no_resize
  (T : Type) (self : HashMap T) (key : Usize) (value : T) :
  Result (HashMap T)
  :=
  do
  let hash  hash_key key
  let i := alloc.vec.Vec.len (AList T) self.slots
  let hash_mod  hash % i
  let (a, index_mut_back) 
    alloc.vec.Vec.index_mut (AList T) Usize
      (core.slice.index.SliceIndexUsizeSliceTInst (AList T)) self.slots
      hash_mod
  let (inserted, a1)  HashMap.insert_in_list T key value a
  if inserted
  then
    do
    let i1  self.num_entries + 1#usize
    let v  index_mut_back a1
    Result.ok { self with num_entries := i1, slots := v }
  else do
       let v  index_mut_back a1
       Result.ok { self with slots := v }

/- [hashmap::{hashmap::HashMap<T>}::move_elements_from_list]: loop 0:
   Source: 'tests/src/hashmap.rs', lines 194:4-207:5 -/
divergent def HashMap.move_elements_from_list_loop
  (T : Type) (ntable : HashMap T) (ls : AList T) : Result (HashMap T) :=
  match ls with
  | AList.Cons k v tl =>
    do
    let ntable1  HashMap.insert_no_resize T ntable k v
    HashMap.move_elements_from_list_loop T ntable1 tl
  | AList.Nil => Result.ok ntable

/- [hashmap::{hashmap::HashMap<T>}::move_elements_from_list]:
   Source: 'tests/src/hashmap.rs', lines 194:4-194:73 -/
@[reducible]
def HashMap.move_elements_from_list
  (T : Type) (ntable : HashMap T) (ls : AList T) : Result (HashMap T) :=
  HashMap.move_elements_from_list_loop T ntable ls

/- [hashmap::{hashmap::HashMap<T>}::move_elements]: loop 0:
   Source: 'tests/src/hashmap.rs', lines 182:8-191:5 -/
divergent def HashMap.move_elements_loop
  (T : Type) (ntable : HashMap T) (slots : alloc.vec.Vec (AList T)) (i : Usize)
  :
  Result ((HashMap T) × (alloc.vec.Vec (AList T)))
  :=
  let i1 := alloc.vec.Vec.len (AList T) slots
  if i < i1
  then
    do
    let (a, index_mut_back) 
      alloc.vec.Vec.index_mut (AList T) Usize
        (core.slice.index.SliceIndexUsizeSliceTInst (AList T)) slots i
    let (ls, a1) := core.mem.replace (AList T) a AList.Nil
    let ntable1  HashMap.move_elements_from_list T ntable ls
    let i2  i + 1#usize
    let slots1  index_mut_back a1
    HashMap.move_elements_loop T ntable1 slots1 i2
  else Result.ok (ntable, slots)

/- [hashmap::{hashmap::HashMap<T>}::move_elements]:
   Source: 'tests/src/hashmap.rs', lines 181:4-181:82 -/
def HashMap.move_elements
  (T : Type) (ntable : HashMap T) (slots : alloc.vec.Vec (AList T)) :
  Result ((HashMap T) × (alloc.vec.Vec (AList T)))
  :=
  HashMap.move_elements_loop T ntable slots 0#usize

/- [hashmap::{hashmap::HashMap<T>}::try_resize]:
   Source: 'tests/src/hashmap.rs', lines 154:4-154:28 -/
def HashMap.try_resize (T : Type) (self : HashMap T) : Result (HashMap T) :=
  do
  let capacity := alloc.vec.Vec.len (AList T) self.slots
  let n1  core_usize_max / 2#usize
  let (i, i1) := self.max_load_factor
  let i2  n1 / i
  if capacity <= i2
  then
    do
    let i3  capacity * 2#usize
    let ntable  HashMap.new_with_capacity T i3 i i1
    let p  HashMap.move_elements T ntable self.slots
    let (ntable1, _) := p
    Result.ok
      {
        self
          with
          max_load_factor := (i, i1),
          max_load := ntable1.max_load,
          slots := ntable1.slots
      }
  else Result.ok { self with max_load_factor := (i, i1), saturated := true }

/- [hashmap::{hashmap::HashMap<T>}::insert]:
   Source: 'tests/src/hashmap.rs', lines 143:4-143:48 -/
def HashMap.insert
  (T : Type) (self : HashMap T) (key : Usize) (value : T) :
  Result (HashMap T)
  :=
  do
  let self1  HashMap.insert_no_resize T self key value
  let i  HashMap.len T self1
  if i > self1.max_load
  then
    if self1.saturated
    then Result.ok { self1 with saturated := true }
    else HashMap.try_resize T { self1 with saturated := false }
  else Result.ok self1

/- [hashmap::{hashmap::HashMap<T>}::contains_key_in_list]: loop 0:
   Source: 'tests/src/hashmap.rs', lines 217:4-230:5 -/
divergent def HashMap.contains_key_in_list_loop
  (T : Type) (key : Usize) (ls : AList T) : Result Bool :=
  match ls with
  | AList.Cons ckey _ tl =>
    if ckey = key
    then Result.ok true
    else HashMap.contains_key_in_list_loop T key tl
  | AList.Nil => Result.ok false

/- [hashmap::{hashmap::HashMap<T>}::contains_key_in_list]:
   Source: 'tests/src/hashmap.rs', lines 217:4-217:69 -/
@[reducible]
def HashMap.contains_key_in_list
  (T : Type) (key : Usize) (ls : AList T) : Result Bool :=
  HashMap.contains_key_in_list_loop T key ls

/- [hashmap::{hashmap::HashMap<T>}::contains_key]:
   Source: 'tests/src/hashmap.rs', lines 210:4-210:49 -/
def HashMap.contains_key
  (T : Type) (self : HashMap T) (key : Usize) : Result Bool :=
  do
  let hash  hash_key key
  let i := alloc.vec.Vec.len (AList T) self.slots
  let hash_mod  hash % i
  let a 
    alloc.vec.Vec.index (AList T) Usize
      (core.slice.index.SliceIndexUsizeSliceTInst (AList T)) self.slots
      hash_mod
  HashMap.contains_key_in_list T key a

/- [hashmap::{hashmap::HashMap<T>}::get_in_list]: loop 0:
   Source: 'tests/src/hashmap.rs', lines 235:4-248:5 -/
divergent def HashMap.get_in_list_loop
  (T : Type) (key : Usize) (ls : AList T) : Result T :=
  match ls with
  | AList.Cons ckey cvalue tl =>
    if ckey = key
    then Result.ok cvalue
    else HashMap.get_in_list_loop T key tl
  | AList.Nil => Result.fail .panic

/- [hashmap::{hashmap::HashMap<T>}::get_in_list]:
   Source: 'tests/src/hashmap.rs', lines 235:4-235:71 -/
@[reducible]
def HashMap.get_in_list (T : Type) (key : Usize) (ls : AList T) : Result T :=
  HashMap.get_in_list_loop T key ls

/- [hashmap::{hashmap::HashMap<T>}::get]:
   Source: 'tests/src/hashmap.rs', lines 250:4-250:55 -/
def HashMap.get (T : Type) (self : HashMap T) (key : Usize) : Result T :=
  do
  let hash  hash_key key
  let i := alloc.vec.Vec.len (AList T) self.slots
  let hash_mod  hash % i
  let a 
    alloc.vec.Vec.index (AList T) Usize
      (core.slice.index.SliceIndexUsizeSliceTInst (AList T)) self.slots
      hash_mod
  HashMap.get_in_list T key a

/- [hashmap::{hashmap::HashMap<T>}::get_mut_in_list]: loop 0:
   Source: 'tests/src/hashmap.rs', lines 256:4-265:5 -/
divergent def HashMap.get_mut_in_list_loop
  (T : Type) (ls : AList T) (key : Usize) :
  Result (T × (T  Result (AList T)))
  :=
  match ls with
  | AList.Cons ckey cvalue tl =>
    if ckey = key
    then
      let back := fun ret => Result.ok (AList.Cons ckey ret tl)
      Result.ok (cvalue, back)
    else
      do
      let (t, back)  HashMap.get_mut_in_list_loop T tl key
      let back1 :=
        fun ret =>
          do
          let tl1  back ret
          Result.ok (AList.Cons ckey cvalue tl1)
      Result.ok (t, back1)
  | AList.Nil => Result.fail .panic

/- [hashmap::{hashmap::HashMap<T>}::get_mut_in_list]:
   Source: 'tests/src/hashmap.rs', lines 256:4-256:87 -/
@[reducible]
def HashMap.get_mut_in_list
  (T : Type) (ls : AList T) (key : Usize) :
  Result (T × (T  Result (AList T)))
  :=
  HashMap.get_mut_in_list_loop T ls key

/- [hashmap::{hashmap::HashMap<T>}::get_mut]:
   Source: 'tests/src/hashmap.rs', lines 268:4-268:67 -/
def HashMap.get_mut
  (T : Type) (self : HashMap T) (key : Usize) :
  Result (T × (T  Result (HashMap T)))
  :=
  do
  let hash  hash_key key
  let i := alloc.vec.Vec.len (AList T) self.slots
  let hash_mod  hash % i
  let (a, index_mut_back) 
    alloc.vec.Vec.index_mut (AList T) Usize
      (core.slice.index.SliceIndexUsizeSliceTInst (AList T)) self.slots
      hash_mod
  let (t, get_mut_in_list_back)  HashMap.get_mut_in_list T a key
  let back :=
    fun ret =>
      do
      let a1  get_mut_in_list_back ret
      let v  index_mut_back a1
      Result.ok { self with slots := v }
  Result.ok (t, back)

/- [hashmap::{hashmap::HashMap<T>}::remove_from_list]: loop 0:
   Source: 'tests/src/hashmap.rs', lines 276:4-302:5 -/
divergent def HashMap.remove_from_list_loop
  (T : Type) (key : Usize) (ls : AList T) : Result ((Option T) × (AList T)) :=
  match ls with
  | AList.Cons ckey t tl =>
    if ckey = key
    then
      let (mv_ls, _) :=
        core.mem.replace (AList T) (AList.Cons ckey t tl) AList.Nil
      match mv_ls with
      | AList.Cons _ cvalue tl1 => Result.ok (some cvalue, tl1)
      | AList.Nil => Result.fail .panic
    else
      do
      let (o, tl1)  HashMap.remove_from_list_loop T key tl
      Result.ok (o, AList.Cons ckey t tl1)
  | AList.Nil => Result.ok (none, AList.Nil)

/- [hashmap::{hashmap::HashMap<T>}::remove_from_list]:
   Source: 'tests/src/hashmap.rs', lines 276:4-276:70 -/
@[reducible]
def HashMap.remove_from_list
  (T : Type) (key : Usize) (ls : AList T) : Result ((Option T) × (AList T)) :=
  HashMap.remove_from_list_loop T key ls

/- [hashmap::{hashmap::HashMap<T>}::remove]:
   Source: 'tests/src/hashmap.rs', lines 305:4-305:52 -/
def HashMap.remove
  (T : Type) (self : HashMap T) (key : Usize) :
  Result ((Option T) × (HashMap T))
  :=
  do
  let hash  hash_key key
  let i := alloc.vec.Vec.len (AList T) self.slots
  let hash_mod  hash % i
  let (a, index_mut_back) 
    alloc.vec.Vec.index_mut (AList T) Usize
      (core.slice.index.SliceIndexUsizeSliceTInst (AList T)) self.slots
      hash_mod
  let (x, a1)  HashMap.remove_from_list T key a
  match x with
  | none =>
    do
    let v  index_mut_back a1
    Result.ok (none, { self with slots := v })
  | some x1 =>
    do
    let i1  self.num_entries - 1#usize
    let v  index_mut_back a1
    Result.ok (some x1, { self with num_entries := i1, slots := v })

/- [hashmap::insert_on_disk]:
   Source: 'tests/src/hashmap.rs', lines 336:0-336:43 -/
def insert_on_disk
  (key : Usize) (value : U64) (st : State) : Result (State × Unit) :=
  do
  let (st1, hm)  utils.deserialize st
  let hm1  HashMap.insert U64 hm key value
  utils.serialize hm1 st1

/- [hashmap::test1]:
   Source: 'tests/src/hashmap.rs', lines 351:0-351:10 -/
def test1 : Result Unit :=
  do
  let hm  HashMap.new U64
  let hm1  HashMap.insert U64 hm 0#usize 42#u64
  let hm2  HashMap.insert U64 hm1 128#usize 18#u64
  let hm3  HashMap.insert U64 hm2 1024#usize 138#u64
  let hm4  HashMap.insert U64 hm3 1056#usize 256#u64
  let i  HashMap.get U64 hm4 128#usize
  if i = 18#u64
  then
    do
    let (_, get_mut_back)  HashMap.get_mut U64 hm4 1024#usize
    let hm5  get_mut_back 56#u64
    let i1  HashMap.get U64 hm5 1024#usize
    if i1 = 56#u64
    then
      do
      let (x, hm6)  HashMap.remove U64 hm5 1024#usize
      match x with
      | none => Result.fail .panic
      | some x1 =>
        if x1 = 56#u64
        then
          do
          let i2  HashMap.get U64 hm6 0#usize
          if i2 = 42#u64
          then
            do
            let i3  HashMap.get U64 hm6 128#usize
            if i3 = 18#u64
            then
              do
              let i4  HashMap.get U64 hm6 1056#usize
              if i4 = 256#u64
              then Result.ok ()
              else Result.fail .panic
            else Result.fail .panic
          else Result.fail .panic
        else Result.fail .panic
    else Result.fail .panic
  else Result.fail .panic

end hashmap