summaryrefslogtreecommitdiff
path: root/tests/lean/HashmapMain
diff options
context:
space:
mode:
Diffstat (limited to 'tests/lean/HashmapMain')
-rw-r--r--tests/lean/HashmapMain/Funs.lean181
-rw-r--r--tests/lean/HashmapMain/FunsExternal_Template.lean6
-rw-r--r--tests/lean/HashmapMain/Types.lean6
3 files changed, 118 insertions, 75 deletions
diff --git a/tests/lean/HashmapMain/Funs.lean b/tests/lean/HashmapMain/Funs.lean
index 74fa8653..abe84bbf 100644
--- a/tests/lean/HashmapMain/Funs.lean
+++ b/tests/lean/HashmapMain/Funs.lean
@@ -7,11 +7,13 @@ open Primitives
namespace hashmap_main
-/- [hashmap_main::hashmap::hash_key]: forward function -/
+/- [hashmap_main::hashmap::hash_key]: forward function
+ Source: 'src/hashmap.rs', lines 27:0-27:32 -/
def hashmap.hash_key (k : Usize) : Result Usize :=
Result.ret k
-/- [hashmap_main::hashmap::HashMap::{0}::allocate_slots]: loop 0: forward function -/
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::allocate_slots]: loop 0: forward function
+ Source: 'src/hashmap.rs', lines 50:4-56:5 -/
divergent def hashmap.HashMap.allocate_slots_loop
(T : Type) (slots : alloc.vec.Vec (hashmap.List T)) (n : Usize) :
Result (alloc.vec.Vec (hashmap.List T))
@@ -24,14 +26,16 @@ divergent def hashmap.HashMap.allocate_slots_loop
hashmap.HashMap.allocate_slots_loop T slots0 n0
else Result.ret slots
-/- [hashmap_main::hashmap::HashMap::{0}::allocate_slots]: forward function -/
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::allocate_slots]: forward function
+ Source: 'src/hashmap.rs', lines 50:4-50:76 -/
def hashmap.HashMap.allocate_slots
(T : Type) (slots : alloc.vec.Vec (hashmap.List T)) (n : Usize) :
Result (alloc.vec.Vec (hashmap.List T))
:=
hashmap.HashMap.allocate_slots_loop T slots n
-/- [hashmap_main::hashmap::HashMap::{0}::new_with_capacity]: forward function -/
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::new_with_capacity]: forward function
+ Source: 'src/hashmap.rs', lines 59:4-63:13 -/
def hashmap.HashMap.new_with_capacity
(T : Type) (capacity : Usize) (max_load_dividend : Usize)
(max_load_divisor : Usize) :
@@ -50,12 +54,14 @@ def hashmap.HashMap.new_with_capacity
slots := slots
}
-/- [hashmap_main::hashmap::HashMap::{0}::new]: forward function -/
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::new]: forward function
+ Source: 'src/hashmap.rs', lines 75:4-75:24 -/
def hashmap.HashMap.new (T : Type) : Result (hashmap.HashMap T) :=
hashmap.HashMap.new_with_capacity T 32#usize 4#usize 5#usize
-/- [hashmap_main::hashmap::HashMap::{0}::clear]: loop 0: merged forward/backward function
- (there is a single backward function, and the forward function returns ()) -/
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::clear]: loop 0: merged forward/backward function
+ (there is a single backward function, and the forward function returns ())
+ Source: 'src/hashmap.rs', lines 80:4-88:5 -/
divergent def hashmap.HashMap.clear_loop
(T : Type) (slots : alloc.vec.Vec (hashmap.List T)) (i : Usize) :
Result (alloc.vec.Vec (hashmap.List T))
@@ -67,24 +73,27 @@ divergent def hashmap.HashMap.clear_loop
let i1 ← i + 1#usize
let slots0 ←
alloc.vec.Vec.index_mut_back (hashmap.List T) Usize
- (core.slice.index.usize.coresliceindexSliceIndexInst (hashmap.List
- T)) slots i hashmap.List.Nil
+ (core.slice.index.SliceIndexUsizeSliceTInst (hashmap.List T)) slots i
+ hashmap.List.Nil
hashmap.HashMap.clear_loop T slots0 i1
else Result.ret slots
-/- [hashmap_main::hashmap::HashMap::{0}::clear]: merged forward/backward function
- (there is a single backward function, and the forward function returns ()) -/
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::clear]: merged forward/backward function
+ (there is a single backward function, and the forward function returns ())
+ Source: 'src/hashmap.rs', lines 80:4-80:27 -/
def hashmap.HashMap.clear
(T : Type) (self : hashmap.HashMap T) : Result (hashmap.HashMap T) :=
do
let v ← hashmap.HashMap.clear_loop T self.slots 0#usize
Result.ret { self with num_entries := 0#usize, slots := v }
-/- [hashmap_main::hashmap::HashMap::{0}::len]: forward function -/
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::len]: forward function
+ Source: 'src/hashmap.rs', lines 90:4-90:30 -/
def hashmap.HashMap.len (T : Type) (self : hashmap.HashMap T) : Result Usize :=
Result.ret self.num_entries
-/- [hashmap_main::hashmap::HashMap::{0}::insert_in_list]: loop 0: forward function -/
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::insert_in_list]: loop 0: forward function
+ Source: 'src/hashmap.rs', lines 97:4-114:5 -/
divergent def hashmap.HashMap.insert_in_list_loop
(T : Type) (key : Usize) (value : T) (ls : hashmap.List T) : Result Bool :=
match ls with
@@ -94,12 +103,14 @@ divergent def hashmap.HashMap.insert_in_list_loop
else hashmap.HashMap.insert_in_list_loop T key value tl
| hashmap.List.Nil => Result.ret true
-/- [hashmap_main::hashmap::HashMap::{0}::insert_in_list]: forward function -/
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::insert_in_list]: forward function
+ Source: 'src/hashmap.rs', lines 97:4-97:71 -/
def hashmap.HashMap.insert_in_list
(T : Type) (key : Usize) (value : T) (ls : hashmap.List T) : Result Bool :=
hashmap.HashMap.insert_in_list_loop T key value ls
-/- [hashmap_main::hashmap::HashMap::{0}::insert_in_list]: loop 0: backward function 0 -/
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::insert_in_list]: loop 0: backward function 0
+ Source: 'src/hashmap.rs', lines 97:4-114:5 -/
divergent def hashmap.HashMap.insert_in_list_loop_back
(T : Type) (key : Usize) (value : T) (ls : hashmap.List T) :
Result (hashmap.List T)
@@ -116,15 +127,17 @@ divergent def hashmap.HashMap.insert_in_list_loop_back
let l := hashmap.List.Nil
Result.ret (hashmap.List.Cons key value l)
-/- [hashmap_main::hashmap::HashMap::{0}::insert_in_list]: backward function 0 -/
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::insert_in_list]: backward function 0
+ Source: 'src/hashmap.rs', lines 97:4-97:71 -/
def hashmap.HashMap.insert_in_list_back
(T : Type) (key : Usize) (value : T) (ls : hashmap.List T) :
Result (hashmap.List T)
:=
hashmap.HashMap.insert_in_list_loop_back T key value ls
-/- [hashmap_main::hashmap::HashMap::{0}::insert_no_resize]: merged forward/backward function
- (there is a single backward function, and the forward function returns ()) -/
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::insert_no_resize]: merged forward/backward function
+ (there is a single backward function, and the forward function returns ())
+ Source: 'src/hashmap.rs', lines 117:4-117:54 -/
def hashmap.HashMap.insert_no_resize
(T : Type) (self : hashmap.HashMap T) (key : Usize) (value : T) :
Result (hashmap.HashMap T)
@@ -135,7 +148,7 @@ def hashmap.HashMap.insert_no_resize
let hash_mod ← hash % i
let l ←
alloc.vec.Vec.index_mut (hashmap.List T) Usize
- (core.slice.index.usize.coresliceindexSliceIndexInst (hashmap.List T))
+ (core.slice.index.SliceIndexUsizeSliceTInst (hashmap.List T))
self.slots hash_mod
let inserted ← hashmap.HashMap.insert_in_list T key value l
if inserted
@@ -145,20 +158,21 @@ def hashmap.HashMap.insert_no_resize
let l0 ← hashmap.HashMap.insert_in_list_back T key value l
let v ←
alloc.vec.Vec.index_mut_back (hashmap.List T) Usize
- (core.slice.index.usize.coresliceindexSliceIndexInst (hashmap.List
- T)) self.slots hash_mod l0
+ (core.slice.index.SliceIndexUsizeSliceTInst (hashmap.List T))
+ self.slots hash_mod l0
Result.ret { self with num_entries := i0, slots := v }
else
do
let l0 ← hashmap.HashMap.insert_in_list_back T key value l
let v ←
alloc.vec.Vec.index_mut_back (hashmap.List T) Usize
- (core.slice.index.usize.coresliceindexSliceIndexInst (hashmap.List
- T)) self.slots hash_mod l0
+ (core.slice.index.SliceIndexUsizeSliceTInst (hashmap.List T))
+ self.slots hash_mod l0
Result.ret { self with slots := v }
-/- [hashmap_main::hashmap::HashMap::{0}::move_elements_from_list]: loop 0: merged forward/backward function
- (there is a single backward function, and the forward function returns ()) -/
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::move_elements_from_list]: loop 0: merged forward/backward function
+ (there is a single backward function, and the forward function returns ())
+ Source: 'src/hashmap.rs', lines 183:4-196:5 -/
divergent def hashmap.HashMap.move_elements_from_list_loop
(T : Type) (ntable : hashmap.HashMap T) (ls : hashmap.List T) :
Result (hashmap.HashMap T)
@@ -170,16 +184,18 @@ divergent def hashmap.HashMap.move_elements_from_list_loop
hashmap.HashMap.move_elements_from_list_loop T ntable0 tl
| hashmap.List.Nil => Result.ret ntable
-/- [hashmap_main::hashmap::HashMap::{0}::move_elements_from_list]: merged forward/backward function
- (there is a single backward function, and the forward function returns ()) -/
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::move_elements_from_list]: merged forward/backward function
+ (there is a single backward function, and the forward function returns ())
+ Source: 'src/hashmap.rs', lines 183:4-183:72 -/
def hashmap.HashMap.move_elements_from_list
(T : Type) (ntable : hashmap.HashMap T) (ls : hashmap.List T) :
Result (hashmap.HashMap T)
:=
hashmap.HashMap.move_elements_from_list_loop T ntable ls
-/- [hashmap_main::hashmap::HashMap::{0}::move_elements]: loop 0: merged forward/backward function
- (there is a single backward function, and the forward function returns ()) -/
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::move_elements]: loop 0: merged forward/backward function
+ (there is a single backward function, and the forward function returns ())
+ Source: 'src/hashmap.rs', lines 171:4-180:5 -/
divergent def hashmap.HashMap.move_elements_loop
(T : Type) (ntable : hashmap.HashMap T)
(slots : alloc.vec.Vec (hashmap.List T)) (i : Usize) :
@@ -191,21 +207,21 @@ divergent def hashmap.HashMap.move_elements_loop
do
let l ←
alloc.vec.Vec.index_mut (hashmap.List T) Usize
- (core.slice.index.usize.coresliceindexSliceIndexInst (hashmap.List
- T)) slots i
+ (core.slice.index.SliceIndexUsizeSliceTInst (hashmap.List T)) slots i
let ls := core.mem.replace (hashmap.List T) l hashmap.List.Nil
let ntable0 ← hashmap.HashMap.move_elements_from_list T ntable ls
let i1 ← i + 1#usize
let l0 := core.mem.replace_back (hashmap.List T) l hashmap.List.Nil
let slots0 ←
alloc.vec.Vec.index_mut_back (hashmap.List T) Usize
- (core.slice.index.usize.coresliceindexSliceIndexInst (hashmap.List
- T)) slots i l0
+ (core.slice.index.SliceIndexUsizeSliceTInst (hashmap.List T)) slots i
+ l0
hashmap.HashMap.move_elements_loop T ntable0 slots0 i1
else Result.ret (ntable, slots)
-/- [hashmap_main::hashmap::HashMap::{0}::move_elements]: merged forward/backward function
- (there is a single backward function, and the forward function returns ()) -/
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::move_elements]: merged forward/backward function
+ (there is a single backward function, and the forward function returns ())
+ Source: 'src/hashmap.rs', lines 171:4-171:95 -/
def hashmap.HashMap.move_elements
(T : Type) (ntable : hashmap.HashMap T)
(slots : alloc.vec.Vec (hashmap.List T)) (i : Usize) :
@@ -213,8 +229,9 @@ def hashmap.HashMap.move_elements
:=
hashmap.HashMap.move_elements_loop T ntable slots i
-/- [hashmap_main::hashmap::HashMap::{0}::try_resize]: merged forward/backward function
- (there is a single backward function, and the forward function returns ()) -/
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::try_resize]: merged forward/backward function
+ (there is a single backward function, and the forward function returns ())
+ Source: 'src/hashmap.rs', lines 140:4-140:28 -/
def hashmap.HashMap.try_resize
(T : Type) (self : hashmap.HashMap T) : Result (hashmap.HashMap T) :=
do
@@ -238,8 +255,9 @@ def hashmap.HashMap.try_resize
}
else Result.ret { self with max_load_factor := (i, i0) }
-/- [hashmap_main::hashmap::HashMap::{0}::insert]: merged forward/backward function
- (there is a single backward function, and the forward function returns ()) -/
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::insert]: merged forward/backward function
+ (there is a single backward function, and the forward function returns ())
+ Source: 'src/hashmap.rs', lines 129:4-129:48 -/
def hashmap.HashMap.insert
(T : Type) (self : hashmap.HashMap T) (key : Usize) (value : T) :
Result (hashmap.HashMap T)
@@ -251,7 +269,8 @@ def hashmap.HashMap.insert
then hashmap.HashMap.try_resize T self0
else Result.ret self0
-/- [hashmap_main::hashmap::HashMap::{0}::contains_key_in_list]: loop 0: forward function -/
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::contains_key_in_list]: loop 0: forward function
+ Source: 'src/hashmap.rs', lines 206:4-219:5 -/
divergent def hashmap.HashMap.contains_key_in_list_loop
(T : Type) (key : Usize) (ls : hashmap.List T) : Result Bool :=
match ls with
@@ -261,12 +280,14 @@ divergent def hashmap.HashMap.contains_key_in_list_loop
else hashmap.HashMap.contains_key_in_list_loop T key tl
| hashmap.List.Nil => Result.ret false
-/- [hashmap_main::hashmap::HashMap::{0}::contains_key_in_list]: forward function -/
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::contains_key_in_list]: forward function
+ Source: 'src/hashmap.rs', lines 206:4-206:68 -/
def hashmap.HashMap.contains_key_in_list
(T : Type) (key : Usize) (ls : hashmap.List T) : Result Bool :=
hashmap.HashMap.contains_key_in_list_loop T key ls
-/- [hashmap_main::hashmap::HashMap::{0}::contains_key]: forward function -/
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::contains_key]: forward function
+ Source: 'src/hashmap.rs', lines 199:4-199:49 -/
def hashmap.HashMap.contains_key
(T : Type) (self : hashmap.HashMap T) (key : Usize) : Result Bool :=
do
@@ -275,11 +296,12 @@ def hashmap.HashMap.contains_key
let hash_mod ← hash % i
let l ←
alloc.vec.Vec.index (hashmap.List T) Usize
- (core.slice.index.usize.coresliceindexSliceIndexInst (hashmap.List T))
+ (core.slice.index.SliceIndexUsizeSliceTInst (hashmap.List T))
self.slots hash_mod
hashmap.HashMap.contains_key_in_list T key l
-/- [hashmap_main::hashmap::HashMap::{0}::get_in_list]: loop 0: forward function -/
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get_in_list]: loop 0: forward function
+ Source: 'src/hashmap.rs', lines 224:4-237:5 -/
divergent def hashmap.HashMap.get_in_list_loop
(T : Type) (key : Usize) (ls : hashmap.List T) : Result T :=
match ls with
@@ -289,12 +311,14 @@ divergent def hashmap.HashMap.get_in_list_loop
else hashmap.HashMap.get_in_list_loop T key tl
| hashmap.List.Nil => Result.fail Error.panic
-/- [hashmap_main::hashmap::HashMap::{0}::get_in_list]: forward function -/
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get_in_list]: forward function
+ Source: 'src/hashmap.rs', lines 224:4-224:70 -/
def hashmap.HashMap.get_in_list
(T : Type) (key : Usize) (ls : hashmap.List T) : Result T :=
hashmap.HashMap.get_in_list_loop T key ls
-/- [hashmap_main::hashmap::HashMap::{0}::get]: forward function -/
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get]: forward function
+ Source: 'src/hashmap.rs', lines 239:4-239:55 -/
def hashmap.HashMap.get
(T : Type) (self : hashmap.HashMap T) (key : Usize) : Result T :=
do
@@ -303,11 +327,12 @@ def hashmap.HashMap.get
let hash_mod ← hash % i
let l ←
alloc.vec.Vec.index (hashmap.List T) Usize
- (core.slice.index.usize.coresliceindexSliceIndexInst (hashmap.List T))
+ (core.slice.index.SliceIndexUsizeSliceTInst (hashmap.List T))
self.slots hash_mod
hashmap.HashMap.get_in_list T key l
-/- [hashmap_main::hashmap::HashMap::{0}::get_mut_in_list]: loop 0: forward function -/
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get_mut_in_list]: loop 0: forward function
+ Source: 'src/hashmap.rs', lines 245:4-254:5 -/
divergent def hashmap.HashMap.get_mut_in_list_loop
(T : Type) (ls : hashmap.List T) (key : Usize) : Result T :=
match ls with
@@ -317,12 +342,14 @@ divergent def hashmap.HashMap.get_mut_in_list_loop
else hashmap.HashMap.get_mut_in_list_loop T tl key
| hashmap.List.Nil => Result.fail Error.panic
-/- [hashmap_main::hashmap::HashMap::{0}::get_mut_in_list]: forward function -/
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get_mut_in_list]: forward function
+ Source: 'src/hashmap.rs', lines 245:4-245:86 -/
def hashmap.HashMap.get_mut_in_list
(T : Type) (ls : hashmap.List T) (key : Usize) : Result T :=
hashmap.HashMap.get_mut_in_list_loop T ls key
-/- [hashmap_main::hashmap::HashMap::{0}::get_mut_in_list]: loop 0: backward function 0 -/
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get_mut_in_list]: loop 0: backward function 0
+ Source: 'src/hashmap.rs', lines 245:4-254:5 -/
divergent def hashmap.HashMap.get_mut_in_list_loop_back
(T : Type) (ls : hashmap.List T) (key : Usize) (ret0 : T) :
Result (hashmap.List T)
@@ -337,14 +364,16 @@ divergent def hashmap.HashMap.get_mut_in_list_loop_back
Result.ret (hashmap.List.Cons ckey cvalue tl0)
| hashmap.List.Nil => Result.fail Error.panic
-/- [hashmap_main::hashmap::HashMap::{0}::get_mut_in_list]: backward function 0 -/
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get_mut_in_list]: backward function 0
+ Source: 'src/hashmap.rs', lines 245:4-245:86 -/
def hashmap.HashMap.get_mut_in_list_back
(T : Type) (ls : hashmap.List T) (key : Usize) (ret0 : T) :
Result (hashmap.List T)
:=
hashmap.HashMap.get_mut_in_list_loop_back T ls key ret0
-/- [hashmap_main::hashmap::HashMap::{0}::get_mut]: forward function -/
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get_mut]: forward function
+ Source: 'src/hashmap.rs', lines 257:4-257:67 -/
def hashmap.HashMap.get_mut
(T : Type) (self : hashmap.HashMap T) (key : Usize) : Result T :=
do
@@ -353,11 +382,12 @@ def hashmap.HashMap.get_mut
let hash_mod ← hash % i
let l ←
alloc.vec.Vec.index_mut (hashmap.List T) Usize
- (core.slice.index.usize.coresliceindexSliceIndexInst (hashmap.List T))
+ (core.slice.index.SliceIndexUsizeSliceTInst (hashmap.List T))
self.slots hash_mod
hashmap.HashMap.get_mut_in_list T l key
-/- [hashmap_main::hashmap::HashMap::{0}::get_mut]: backward function 0 -/
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::get_mut]: backward function 0
+ Source: 'src/hashmap.rs', lines 257:4-257:67 -/
def hashmap.HashMap.get_mut_back
(T : Type) (self : hashmap.HashMap T) (key : Usize) (ret0 : T) :
Result (hashmap.HashMap T)
@@ -368,16 +398,17 @@ def hashmap.HashMap.get_mut_back
let hash_mod ← hash % i
let l ←
alloc.vec.Vec.index_mut (hashmap.List T) Usize
- (core.slice.index.usize.coresliceindexSliceIndexInst (hashmap.List T))
+ (core.slice.index.SliceIndexUsizeSliceTInst (hashmap.List T))
self.slots hash_mod
let l0 ← hashmap.HashMap.get_mut_in_list_back T l key ret0
let v ←
alloc.vec.Vec.index_mut_back (hashmap.List T) Usize
- (core.slice.index.usize.coresliceindexSliceIndexInst (hashmap.List T))
+ (core.slice.index.SliceIndexUsizeSliceTInst (hashmap.List T))
self.slots hash_mod l0
Result.ret { self with slots := v }
-/- [hashmap_main::hashmap::HashMap::{0}::remove_from_list]: loop 0: forward function -/
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::remove_from_list]: loop 0: forward function
+ Source: 'src/hashmap.rs', lines 265:4-291:5 -/
divergent def hashmap.HashMap.remove_from_list_loop
(T : Type) (key : Usize) (ls : hashmap.List T) : Result (Option T) :=
match ls with
@@ -393,12 +424,14 @@ divergent def hashmap.HashMap.remove_from_list_loop
else hashmap.HashMap.remove_from_list_loop T key tl
| hashmap.List.Nil => Result.ret none
-/- [hashmap_main::hashmap::HashMap::{0}::remove_from_list]: forward function -/
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::remove_from_list]: forward function
+ Source: 'src/hashmap.rs', lines 265:4-265:69 -/
def hashmap.HashMap.remove_from_list
(T : Type) (key : Usize) (ls : hashmap.List T) : Result (Option T) :=
hashmap.HashMap.remove_from_list_loop T key ls
-/- [hashmap_main::hashmap::HashMap::{0}::remove_from_list]: loop 0: backward function 1 -/
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::remove_from_list]: loop 0: backward function 1
+ Source: 'src/hashmap.rs', lines 265:4-291:5 -/
divergent def hashmap.HashMap.remove_from_list_loop_back
(T : Type) (key : Usize) (ls : hashmap.List T) : Result (hashmap.List T) :=
match ls with
@@ -417,12 +450,14 @@ divergent def hashmap.HashMap.remove_from_list_loop_back
Result.ret (hashmap.List.Cons ckey t tl0)
| hashmap.List.Nil => Result.ret hashmap.List.Nil
-/- [hashmap_main::hashmap::HashMap::{0}::remove_from_list]: backward function 1 -/
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::remove_from_list]: backward function 1
+ Source: 'src/hashmap.rs', lines 265:4-265:69 -/
def hashmap.HashMap.remove_from_list_back
(T : Type) (key : Usize) (ls : hashmap.List T) : Result (hashmap.List T) :=
hashmap.HashMap.remove_from_list_loop_back T key ls
-/- [hashmap_main::hashmap::HashMap::{0}::remove]: forward function -/
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::remove]: forward function
+ Source: 'src/hashmap.rs', lines 294:4-294:52 -/
def hashmap.HashMap.remove
(T : Type) (self : hashmap.HashMap T) (key : Usize) : Result (Option T) :=
do
@@ -431,7 +466,7 @@ def hashmap.HashMap.remove
let hash_mod ← hash % i
let l ←
alloc.vec.Vec.index_mut (hashmap.List T) Usize
- (core.slice.index.usize.coresliceindexSliceIndexInst (hashmap.List T))
+ (core.slice.index.SliceIndexUsizeSliceTInst (hashmap.List T))
self.slots hash_mod
let x ← hashmap.HashMap.remove_from_list T key l
match x with
@@ -440,7 +475,8 @@ def hashmap.HashMap.remove
let _ ← self.num_entries - 1#usize
Result.ret (some x0)
-/- [hashmap_main::hashmap::HashMap::{0}::remove]: backward function 0 -/
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::remove]: backward function 0
+ Source: 'src/hashmap.rs', lines 294:4-294:52 -/
def hashmap.HashMap.remove_back
(T : Type) (self : hashmap.HashMap T) (key : Usize) :
Result (hashmap.HashMap T)
@@ -451,7 +487,7 @@ def hashmap.HashMap.remove_back
let hash_mod ← hash % i
let l ←
alloc.vec.Vec.index_mut (hashmap.List T) Usize
- (core.slice.index.usize.coresliceindexSliceIndexInst (hashmap.List T))
+ (core.slice.index.SliceIndexUsizeSliceTInst (hashmap.List T))
self.slots hash_mod
let x ← hashmap.HashMap.remove_from_list T key l
match x with
@@ -460,8 +496,8 @@ def hashmap.HashMap.remove_back
let l0 ← hashmap.HashMap.remove_from_list_back T key l
let v ←
alloc.vec.Vec.index_mut_back (hashmap.List T) Usize
- (core.slice.index.usize.coresliceindexSliceIndexInst (hashmap.List
- T)) self.slots hash_mod l0
+ (core.slice.index.SliceIndexUsizeSliceTInst (hashmap.List T))
+ self.slots hash_mod l0
Result.ret { self with slots := v }
| some x0 =>
do
@@ -469,11 +505,12 @@ def hashmap.HashMap.remove_back
let l0 ← hashmap.HashMap.remove_from_list_back T key l
let v ←
alloc.vec.Vec.index_mut_back (hashmap.List T) Usize
- (core.slice.index.usize.coresliceindexSliceIndexInst (hashmap.List
- T)) self.slots hash_mod l0
+ (core.slice.index.SliceIndexUsizeSliceTInst (hashmap.List T))
+ self.slots hash_mod l0
Result.ret { self with num_entries := i0, slots := v }
-/- [hashmap_main::hashmap::test1]: forward function -/
+/- [hashmap_main::hashmap::test1]: forward function
+ Source: 'src/hashmap.rs', lines 315:0-315:10 -/
def hashmap.test1 : Result Unit :=
do
let hm ← hashmap.HashMap.new U64
@@ -516,7 +553,8 @@ def hashmap.test1 : Result Unit :=
then Result.fail Error.panic
else Result.ret ()
-/- [hashmap_main::insert_on_disk]: forward function -/
+/- [hashmap_main::insert_on_disk]: forward function
+ Source: 'src/hashmap_main.rs', lines 7:0-7:43 -/
def insert_on_disk
(key : Usize) (value : U64) (st : State) : Result (State × Unit) :=
do
@@ -525,7 +563,8 @@ def insert_on_disk
let (st1, _) ← hashmap_utils.serialize hm0 st0
Result.ret (st1, ())
-/- [hashmap_main::main]: forward function -/
+/- [hashmap_main::main]: forward function
+ Source: 'src/hashmap_main.rs', lines 16:0-16:13 -/
def main : Result Unit :=
Result.ret ()
diff --git a/tests/lean/HashmapMain/FunsExternal_Template.lean b/tests/lean/HashmapMain/FunsExternal_Template.lean
index f537fc8f..02ca5b0e 100644
--- a/tests/lean/HashmapMain/FunsExternal_Template.lean
+++ b/tests/lean/HashmapMain/FunsExternal_Template.lean
@@ -6,11 +6,13 @@ import HashmapMain.Types
open Primitives
open hashmap_main
-/- [hashmap_main::hashmap_utils::deserialize]: forward function -/
+/- [hashmap_main::hashmap_utils::deserialize]: forward function
+ Source: 'src/hashmap_utils.rs', lines 10:0-10:43 -/
axiom hashmap_utils.deserialize
: State → Result (State × (hashmap.HashMap U64))
-/- [hashmap_main::hashmap_utils::serialize]: forward function -/
+/- [hashmap_main::hashmap_utils::serialize]: forward function
+ Source: 'src/hashmap_utils.rs', lines 5:0-5:42 -/
axiom hashmap_utils.serialize
: hashmap.HashMap U64 → State → Result (State × Unit)
diff --git a/tests/lean/HashmapMain/Types.lean b/tests/lean/HashmapMain/Types.lean
index 065c109b..f7be6719 100644
--- a/tests/lean/HashmapMain/Types.lean
+++ b/tests/lean/HashmapMain/Types.lean
@@ -5,12 +5,14 @@ open Primitives
namespace hashmap_main
-/- [hashmap_main::hashmap::List] -/
+/- [hashmap_main::hashmap::List]
+ Source: 'src/hashmap.rs', lines 19:0-19:16 -/
inductive hashmap.List (T : Type) :=
| Cons : Usize → T → hashmap.List T → hashmap.List T
| Nil : hashmap.List T
-/- [hashmap_main::hashmap::HashMap] -/
+/- [hashmap_main::hashmap::HashMap]
+ Source: 'src/hashmap.rs', lines 35:0-35:21 -/
structure hashmap.HashMap (T : Type) where
num_entries : Usize
max_load_factor : (Usize × Usize)