summaryrefslogtreecommitdiff
path: root/tests/lean
diff options
context:
space:
mode:
Diffstat (limited to 'tests/lean')
-rw-r--r--tests/lean/Array.lean32
-rw-r--r--tests/lean/Constants.lean2
-rw-r--r--tests/lean/External/FunsExternal_Template.lean4
-rw-r--r--tests/lean/Hashmap/Funs.lean130
-rw-r--r--tests/lean/HashmapMain/Funs.lean115
-rw-r--r--tests/lean/Loops.lean15
6 files changed, 145 insertions, 153 deletions
diff --git a/tests/lean/Array.lean b/tests/lean/Array.lean
index 20f02e97..5a4e09ab 100644
--- a/tests/lean/Array.lean
+++ b/tests/lean/Array.lean
@@ -91,14 +91,14 @@ def index_mut_slice_back
def slice_subslice_shared_
(x : Slice U32) (y : Usize) (z : Usize) : Result (Slice U32) :=
core.slice.index.Slice.index U32 (core.ops.range.Range Usize)
- (core.slice.index.Range.coresliceindexSliceIndexInst U32) x
+ (core.slice.index.SliceIndexRangeUsizeSliceTInst U32) x
{ start := y, end_ := z }
/- [array::slice_subslice_mut_]: forward function -/
def slice_subslice_mut_
(x : Slice U32) (y : Usize) (z : Usize) : Result (Slice U32) :=
core.slice.index.Slice.index_mut U32 (core.ops.range.Range Usize)
- (core.slice.index.Range.coresliceindexSliceIndexInst U32) x
+ (core.slice.index.SliceIndexRangeUsizeSliceTInst U32) x
{ start := y, end_ := z }
/- [array::slice_subslice_mut_]: backward function 0 -/
@@ -107,7 +107,7 @@ def slice_subslice_mut__back
Result (Slice U32)
:=
core.slice.index.Slice.index_mut_back U32 (core.ops.range.Range Usize)
- (core.slice.index.Range.coresliceindexSliceIndexInst U32) x
+ (core.slice.index.SliceIndexRangeUsizeSliceTInst U32) x
{ start := y, end_ := z } ret0
/- [array::array_to_slice_shared_]: forward function -/
@@ -127,16 +127,16 @@ def array_to_slice_mut__back
def array_subslice_shared_
(x : Array U32 32#usize) (y : Usize) (z : Usize) : Result (Slice U32) :=
core.array.Array.index U32 (core.ops.range.Range Usize) 32#usize
- (core.slice.index.Slice.coreopsindexIndexInst U32 (core.ops.range.Range
- Usize) (core.slice.index.Range.coresliceindexSliceIndexInst U32)) x
+ (core.ops.index.IndexSliceTIInst U32 (core.ops.range.Range Usize)
+ (core.slice.index.SliceIndexRangeUsizeSliceTInst U32)) x
{ start := y, end_ := z }
/- [array::array_subslice_mut_]: forward function -/
def array_subslice_mut_
(x : Array U32 32#usize) (y : Usize) (z : Usize) : Result (Slice U32) :=
core.array.Array.index_mut U32 (core.ops.range.Range Usize) 32#usize
- (core.slice.index.Slice.coreopsindexIndexMutInst U32 (core.ops.range.Range
- Usize) (core.slice.index.Range.coresliceindexSliceIndexInst U32)) x
+ (core.ops.index.IndexMutSliceTIInst U32 (core.ops.range.Range Usize)
+ (core.slice.index.SliceIndexRangeUsizeSliceTInst U32)) x
{ start := y, end_ := z }
/- [array::array_subslice_mut_]: backward function 0 -/
@@ -145,8 +145,8 @@ def array_subslice_mut__back
Result (Array U32 32#usize)
:=
core.array.Array.index_mut_back U32 (core.ops.range.Range Usize) 32#usize
- (core.slice.index.Slice.coreopsindexIndexMutInst U32 (core.ops.range.Range
- Usize) (core.slice.index.Range.coresliceindexSliceIndexInst U32)) x
+ (core.ops.index.IndexMutSliceTIInst U32 (core.ops.range.Range Usize)
+ (core.slice.index.SliceIndexRangeUsizeSliceTInst U32)) x
{ start := y, end_ := z } ret0
/- [array::index_slice_0]: forward function -/
@@ -288,17 +288,15 @@ def range_all : Result Unit :=
do
let s ←
core.array.Array.index_mut U32 (core.ops.range.Range Usize) 4#usize
- (core.slice.index.Slice.coreopsindexIndexMutInst U32
- (core.ops.range.Range Usize)
- (core.slice.index.Range.coresliceindexSliceIndexInst U32))
+ (core.ops.index.IndexMutSliceTIInst U32 (core.ops.range.Range Usize)
+ (core.slice.index.SliceIndexRangeUsizeSliceTInst U32))
(Array.make U32 4#usize [ 0#u32, 0#u32, 0#u32, 0#u32 ])
{ start := 1#usize, end_ := 3#usize }
let s0 ← update_mut_slice s
let _ ←
core.array.Array.index_mut_back U32 (core.ops.range.Range Usize) 4#usize
- (core.slice.index.Slice.coreopsindexIndexMutInst U32
- (core.ops.range.Range Usize)
- (core.slice.index.Range.coresliceindexSliceIndexInst U32))
+ (core.ops.index.IndexMutSliceTIInst U32 (core.ops.range.Range Usize)
+ (core.slice.index.SliceIndexRangeUsizeSliceTInst U32))
(Array.make U32 4#usize [ 0#u32, 0#u32, 0#u32, 0#u32 ])
{ start := 1#usize, end_ := 3#usize } s0
Result.ret ()
@@ -392,8 +390,8 @@ def f2 (i : U32) : Result Unit :=
/- [array::f4]: forward function -/
def f4 (x : Array U32 32#usize) (y : Usize) (z : Usize) : Result (Slice U32) :=
core.array.Array.index U32 (core.ops.range.Range Usize) 32#usize
- (core.slice.index.Slice.coreopsindexIndexInst U32 (core.ops.range.Range
- Usize) (core.slice.index.Range.coresliceindexSliceIndexInst U32)) x
+ (core.ops.index.IndexSliceTIInst U32 (core.ops.range.Range Usize)
+ (core.slice.index.SliceIndexRangeUsizeSliceTInst U32)) x
{ start := y, end_ := z }
/- [array::f3]: forward function -/
diff --git a/tests/lean/Constants.lean b/tests/lean/Constants.lean
index bd3a07b7..62e45d76 100644
--- a/tests/lean/Constants.lean
+++ b/tests/lean/Constants.lean
@@ -58,7 +58,7 @@ def p3_c : Pair U32 U32 := eval_global p3_body (by simp)
structure Wrap (T : Type) where
value : T
-/- [constants::Wrap::{0}::new]: forward function -/
+/- [constants::{constants::Wrap<T>}::new]: forward function -/
def Wrap.new (T : Type) (value : T) : Result (Wrap T) :=
Result.ret { value := value }
diff --git a/tests/lean/External/FunsExternal_Template.lean b/tests/lean/External/FunsExternal_Template.lean
index c8bc397f..0fccef86 100644
--- a/tests/lean/External/FunsExternal_Template.lean
+++ b/tests/lean/External/FunsExternal_Template.lean
@@ -17,11 +17,11 @@ axiom core.mem.swap_back0
axiom core.mem.swap_back1
(T : Type) : T → T → State → State → Result (State × T)
-/- [core::num::nonzero::NonZeroU32::{14}::new]: forward function -/
+/- [core::num::nonzero::{core::num::nonzero::NonZeroU32#14}::new]: forward function -/
axiom core.num.nonzero.NonZeroU32.new
: U32 → State → Result (State × (Option core.num.nonzero.NonZeroU32))
-/- [core::option::Option::{0}::unwrap]: forward function -/
+/- [core::option::{core::option::Option<T>}::unwrap]: forward function -/
axiom core.option.Option.unwrap
(T : Type) : Option T → State → Result (State × T)
diff --git a/tests/lean/Hashmap/Funs.lean b/tests/lean/Hashmap/Funs.lean
index 8464c432..a1cd435e 100644
--- a/tests/lean/Hashmap/Funs.lean
+++ b/tests/lean/Hashmap/Funs.lean
@@ -10,7 +10,7 @@ namespace hashmap
def hash_key (k : Usize) : Result Usize :=
Result.ret k
-/- [hashmap::HashMap::{0}::allocate_slots]: loop 0: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::allocate_slots]: loop 0: forward function -/
divergent def HashMap.allocate_slots_loop
(T : Type) (slots : alloc.vec.Vec (List T)) (n : Usize) :
Result (alloc.vec.Vec (List T))
@@ -23,14 +23,14 @@ divergent def HashMap.allocate_slots_loop
HashMap.allocate_slots_loop T slots0 n0
else Result.ret slots
-/- [hashmap::HashMap::{0}::allocate_slots]: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::allocate_slots]: forward function -/
def HashMap.allocate_slots
(T : Type) (slots : alloc.vec.Vec (List T)) (n : Usize) :
Result (alloc.vec.Vec (List T))
:=
HashMap.allocate_slots_loop T slots n
-/- [hashmap::HashMap::{0}::new_with_capacity]: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::new_with_capacity]: forward function -/
def HashMap.new_with_capacity
(T : Type) (capacity : Usize) (max_load_dividend : Usize)
(max_load_divisor : Usize) :
@@ -49,11 +49,11 @@ def HashMap.new_with_capacity
slots := slots
}
-/- [hashmap::HashMap::{0}::new]: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::new]: forward function -/
def HashMap.new (T : Type) : Result (HashMap T) :=
HashMap.new_with_capacity T 32#usize 4#usize 5#usize
-/- [hashmap::HashMap::{0}::clear]: loop 0: merged forward/backward function
+/- [hashmap::{hashmap::HashMap<T>}::clear]: loop 0: merged forward/backward function
(there is a single backward function, and the forward function returns ()) -/
divergent def HashMap.clear_loop
(T : Type) (slots : alloc.vec.Vec (List T)) (i : Usize) :
@@ -66,23 +66,23 @@ divergent def HashMap.clear_loop
let i1 ← i + 1#usize
let slots0 ←
alloc.vec.Vec.index_mut_back (List T) Usize
- (core.slice.index.usize.coresliceindexSliceIndexInst (List T)) slots
- i List.Nil
+ (core.slice.index.SliceIndexUsizeSliceTInst (List T)) slots i
+ List.Nil
HashMap.clear_loop T slots0 i1
else Result.ret slots
-/- [hashmap::HashMap::{0}::clear]: merged forward/backward function
+/- [hashmap::{hashmap::HashMap<T>}::clear]: merged forward/backward function
(there is a single backward function, and the forward function returns ()) -/
def HashMap.clear (T : Type) (self : HashMap T) : Result (HashMap T) :=
do
let v ← HashMap.clear_loop T self.slots 0#usize
Result.ret { self with num_entries := 0#usize, slots := v }
-/- [hashmap::HashMap::{0}::len]: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::len]: forward function -/
def HashMap.len (T : Type) (self : HashMap T) : Result Usize :=
Result.ret self.num_entries
-/- [hashmap::HashMap::{0}::insert_in_list]: loop 0: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::insert_in_list]: loop 0: forward function -/
divergent def HashMap.insert_in_list_loop
(T : Type) (key : Usize) (value : T) (ls : List T) : Result Bool :=
match ls with
@@ -92,12 +92,12 @@ divergent def HashMap.insert_in_list_loop
else HashMap.insert_in_list_loop T key value tl
| List.Nil => Result.ret true
-/- [hashmap::HashMap::{0}::insert_in_list]: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::insert_in_list]: forward function -/
def HashMap.insert_in_list
(T : Type) (key : Usize) (value : T) (ls : List T) : Result Bool :=
HashMap.insert_in_list_loop T key value ls
-/- [hashmap::HashMap::{0}::insert_in_list]: loop 0: backward function 0 -/
+/- [hashmap::{hashmap::HashMap<T>}::insert_in_list]: loop 0: backward function 0 -/
divergent def HashMap.insert_in_list_loop_back
(T : Type) (key : Usize) (value : T) (ls : List T) : Result (List T) :=
match ls with
@@ -111,12 +111,12 @@ divergent def HashMap.insert_in_list_loop_back
| List.Nil => let l := List.Nil
Result.ret (List.Cons key value l)
-/- [hashmap::HashMap::{0}::insert_in_list]: backward function 0 -/
+/- [hashmap::{hashmap::HashMap<T>}::insert_in_list]: backward function 0 -/
def HashMap.insert_in_list_back
(T : Type) (key : Usize) (value : T) (ls : List T) : Result (List T) :=
HashMap.insert_in_list_loop_back T key value ls
-/- [hashmap::HashMap::{0}::insert_no_resize]: merged forward/backward function
+/- [hashmap::{hashmap::HashMap<T>}::insert_no_resize]: merged forward/backward function
(there is a single backward function, and the forward function returns ()) -/
def HashMap.insert_no_resize
(T : Type) (self : HashMap T) (key : Usize) (value : T) :
@@ -128,8 +128,8 @@ def HashMap.insert_no_resize
let hash_mod ← hash % i
let l ←
alloc.vec.Vec.index_mut (List T) Usize
- (core.slice.index.usize.coresliceindexSliceIndexInst (List T))
- self.slots hash_mod
+ (core.slice.index.SliceIndexUsizeSliceTInst (List T)) self.slots
+ hash_mod
let inserted ← HashMap.insert_in_list T key value l
if inserted
then
@@ -138,19 +138,19 @@ def HashMap.insert_no_resize
let l0 ← HashMap.insert_in_list_back T key value l
let v ←
alloc.vec.Vec.index_mut_back (List T) Usize
- (core.slice.index.usize.coresliceindexSliceIndexInst (List T))
- self.slots hash_mod l0
+ (core.slice.index.SliceIndexUsizeSliceTInst (List T)) self.slots
+ hash_mod l0
Result.ret { self with num_entries := i0, slots := v }
else
do
let l0 ← HashMap.insert_in_list_back T key value l
let v ←
alloc.vec.Vec.index_mut_back (List T) Usize
- (core.slice.index.usize.coresliceindexSliceIndexInst (List T))
- self.slots hash_mod l0
+ (core.slice.index.SliceIndexUsizeSliceTInst (List T)) self.slots
+ hash_mod l0
Result.ret { self with slots := v }
-/- [hashmap::HashMap::{0}::move_elements_from_list]: loop 0: merged forward/backward function
+/- [hashmap::{hashmap::HashMap<T>}::move_elements_from_list]: loop 0: merged forward/backward function
(there is a single backward function, and the forward function returns ()) -/
divergent def HashMap.move_elements_from_list_loop
(T : Type) (ntable : HashMap T) (ls : List T) : Result (HashMap T) :=
@@ -161,13 +161,13 @@ divergent def HashMap.move_elements_from_list_loop
HashMap.move_elements_from_list_loop T ntable0 tl
| List.Nil => Result.ret ntable
-/- [hashmap::HashMap::{0}::move_elements_from_list]: merged forward/backward function
+/- [hashmap::{hashmap::HashMap<T>}::move_elements_from_list]: merged forward/backward function
(there is a single backward function, and the forward function returns ()) -/
def HashMap.move_elements_from_list
(T : Type) (ntable : HashMap T) (ls : List T) : Result (HashMap T) :=
HashMap.move_elements_from_list_loop T ntable ls
-/- [hashmap::HashMap::{0}::move_elements]: loop 0: merged forward/backward function
+/- [hashmap::{hashmap::HashMap<T>}::move_elements]: loop 0: merged forward/backward function
(there is a single backward function, and the forward function returns ()) -/
divergent def HashMap.move_elements_loop
(T : Type) (ntable : HashMap T) (slots : alloc.vec.Vec (List T)) (i : Usize)
@@ -180,20 +180,18 @@ divergent def HashMap.move_elements_loop
do
let l ←
alloc.vec.Vec.index_mut (List T) Usize
- (core.slice.index.usize.coresliceindexSliceIndexInst (List T)) slots
- i
+ (core.slice.index.SliceIndexUsizeSliceTInst (List T)) slots i
let ls := core.mem.replace (List T) l List.Nil
let ntable0 ← HashMap.move_elements_from_list T ntable ls
let i1 ← i + 1#usize
let l0 := core.mem.replace_back (List T) l List.Nil
let slots0 ←
alloc.vec.Vec.index_mut_back (List T) Usize
- (core.slice.index.usize.coresliceindexSliceIndexInst (List T)) slots
- i l0
+ (core.slice.index.SliceIndexUsizeSliceTInst (List T)) slots i l0
HashMap.move_elements_loop T ntable0 slots0 i1
else Result.ret (ntable, slots)
-/- [hashmap::HashMap::{0}::move_elements]: merged forward/backward function
+/- [hashmap::{hashmap::HashMap<T>}::move_elements]: merged forward/backward function
(there is a single backward function, and the forward function returns ()) -/
def HashMap.move_elements
(T : Type) (ntable : HashMap T) (slots : alloc.vec.Vec (List T)) (i : Usize)
@@ -202,7 +200,7 @@ def HashMap.move_elements
:=
HashMap.move_elements_loop T ntable slots i
-/- [hashmap::HashMap::{0}::try_resize]: merged forward/backward function
+/- [hashmap::{hashmap::HashMap<T>}::try_resize]: merged forward/backward function
(there is a single backward function, and the forward function returns ()) -/
def HashMap.try_resize (T : Type) (self : HashMap T) : Result (HashMap T) :=
do
@@ -225,7 +223,7 @@ def HashMap.try_resize (T : Type) (self : HashMap T) : Result (HashMap T) :=
}
else Result.ret { self with max_load_factor := (i, i0) }
-/- [hashmap::HashMap::{0}::insert]: merged forward/backward function
+/- [hashmap::{hashmap::HashMap<T>}::insert]: merged forward/backward function
(there is a single backward function, and the forward function returns ()) -/
def HashMap.insert
(T : Type) (self : HashMap T) (key : Usize) (value : T) :
@@ -238,7 +236,7 @@ def HashMap.insert
then HashMap.try_resize T self0
else Result.ret self0
-/- [hashmap::HashMap::{0}::contains_key_in_list]: loop 0: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::contains_key_in_list]: loop 0: forward function -/
divergent def HashMap.contains_key_in_list_loop
(T : Type) (key : Usize) (ls : List T) : Result Bool :=
match ls with
@@ -248,12 +246,12 @@ divergent def HashMap.contains_key_in_list_loop
else HashMap.contains_key_in_list_loop T key tl
| List.Nil => Result.ret false
-/- [hashmap::HashMap::{0}::contains_key_in_list]: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::contains_key_in_list]: forward function -/
def HashMap.contains_key_in_list
(T : Type) (key : Usize) (ls : List T) : Result Bool :=
HashMap.contains_key_in_list_loop T key ls
-/- [hashmap::HashMap::{0}::contains_key]: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::contains_key]: forward function -/
def HashMap.contains_key
(T : Type) (self : HashMap T) (key : Usize) : Result Bool :=
do
@@ -262,11 +260,11 @@ def HashMap.contains_key
let hash_mod ← hash % i
let l ←
alloc.vec.Vec.index (List T) Usize
- (core.slice.index.usize.coresliceindexSliceIndexInst (List T))
- self.slots hash_mod
+ (core.slice.index.SliceIndexUsizeSliceTInst (List T)) self.slots
+ hash_mod
HashMap.contains_key_in_list T key l
-/- [hashmap::HashMap::{0}::get_in_list]: loop 0: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::get_in_list]: loop 0: forward function -/
divergent def HashMap.get_in_list_loop
(T : Type) (key : Usize) (ls : List T) : Result T :=
match ls with
@@ -276,11 +274,11 @@ divergent def HashMap.get_in_list_loop
else HashMap.get_in_list_loop T key tl
| List.Nil => Result.fail Error.panic
-/- [hashmap::HashMap::{0}::get_in_list]: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::get_in_list]: forward function -/
def HashMap.get_in_list (T : Type) (key : Usize) (ls : List T) : Result T :=
HashMap.get_in_list_loop T key ls
-/- [hashmap::HashMap::{0}::get]: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::get]: forward function -/
def HashMap.get (T : Type) (self : HashMap T) (key : Usize) : Result T :=
do
let hash ← hash_key key
@@ -288,11 +286,11 @@ def HashMap.get (T : Type) (self : HashMap T) (key : Usize) : Result T :=
let hash_mod ← hash % i
let l ←
alloc.vec.Vec.index (List T) Usize
- (core.slice.index.usize.coresliceindexSliceIndexInst (List T))
- self.slots hash_mod
+ (core.slice.index.SliceIndexUsizeSliceTInst (List T)) self.slots
+ hash_mod
HashMap.get_in_list T key l
-/- [hashmap::HashMap::{0}::get_mut_in_list]: loop 0: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::get_mut_in_list]: loop 0: forward function -/
divergent def HashMap.get_mut_in_list_loop
(T : Type) (ls : List T) (key : Usize) : Result T :=
match ls with
@@ -302,12 +300,12 @@ divergent def HashMap.get_mut_in_list_loop
else HashMap.get_mut_in_list_loop T tl key
| List.Nil => Result.fail Error.panic
-/- [hashmap::HashMap::{0}::get_mut_in_list]: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::get_mut_in_list]: forward function -/
def HashMap.get_mut_in_list
(T : Type) (ls : List T) (key : Usize) : Result T :=
HashMap.get_mut_in_list_loop T ls key
-/- [hashmap::HashMap::{0}::get_mut_in_list]: loop 0: backward function 0 -/
+/- [hashmap::{hashmap::HashMap<T>}::get_mut_in_list]: loop 0: backward function 0 -/
divergent def HashMap.get_mut_in_list_loop_back
(T : Type) (ls : List T) (key : Usize) (ret0 : T) : Result (List T) :=
match ls with
@@ -320,12 +318,12 @@ divergent def HashMap.get_mut_in_list_loop_back
Result.ret (List.Cons ckey cvalue tl0)
| List.Nil => Result.fail Error.panic
-/- [hashmap::HashMap::{0}::get_mut_in_list]: backward function 0 -/
+/- [hashmap::{hashmap::HashMap<T>}::get_mut_in_list]: backward function 0 -/
def HashMap.get_mut_in_list_back
(T : Type) (ls : List T) (key : Usize) (ret0 : T) : Result (List T) :=
HashMap.get_mut_in_list_loop_back T ls key ret0
-/- [hashmap::HashMap::{0}::get_mut]: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::get_mut]: forward function -/
def HashMap.get_mut (T : Type) (self : HashMap T) (key : Usize) : Result T :=
do
let hash ← hash_key key
@@ -333,11 +331,11 @@ def HashMap.get_mut (T : Type) (self : HashMap T) (key : Usize) : Result T :=
let hash_mod ← hash % i
let l ←
alloc.vec.Vec.index_mut (List T) Usize
- (core.slice.index.usize.coresliceindexSliceIndexInst (List T))
- self.slots hash_mod
+ (core.slice.index.SliceIndexUsizeSliceTInst (List T)) self.slots
+ hash_mod
HashMap.get_mut_in_list T l key
-/- [hashmap::HashMap::{0}::get_mut]: backward function 0 -/
+/- [hashmap::{hashmap::HashMap<T>}::get_mut]: backward function 0 -/
def HashMap.get_mut_back
(T : Type) (self : HashMap T) (key : Usize) (ret0 : T) :
Result (HashMap T)
@@ -348,16 +346,16 @@ def HashMap.get_mut_back
let hash_mod ← hash % i
let l ←
alloc.vec.Vec.index_mut (List T) Usize
- (core.slice.index.usize.coresliceindexSliceIndexInst (List T))
- self.slots hash_mod
+ (core.slice.index.SliceIndexUsizeSliceTInst (List T)) self.slots
+ hash_mod
let l0 ← HashMap.get_mut_in_list_back T l key ret0
let v ←
alloc.vec.Vec.index_mut_back (List T) Usize
- (core.slice.index.usize.coresliceindexSliceIndexInst (List T))
- self.slots hash_mod l0
+ (core.slice.index.SliceIndexUsizeSliceTInst (List T)) self.slots
+ hash_mod l0
Result.ret { self with slots := v }
-/- [hashmap::HashMap::{0}::remove_from_list]: loop 0: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::remove_from_list]: loop 0: forward function -/
divergent def HashMap.remove_from_list_loop
(T : Type) (key : Usize) (ls : List T) : Result (Option T) :=
match ls with
@@ -371,12 +369,12 @@ divergent def HashMap.remove_from_list_loop
else HashMap.remove_from_list_loop T key tl
| List.Nil => Result.ret none
-/- [hashmap::HashMap::{0}::remove_from_list]: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::remove_from_list]: forward function -/
def HashMap.remove_from_list
(T : Type) (key : Usize) (ls : List T) : Result (Option T) :=
HashMap.remove_from_list_loop T key ls
-/- [hashmap::HashMap::{0}::remove_from_list]: loop 0: backward function 1 -/
+/- [hashmap::{hashmap::HashMap<T>}::remove_from_list]: loop 0: backward function 1 -/
divergent def HashMap.remove_from_list_loop_back
(T : Type) (key : Usize) (ls : List T) : Result (List T) :=
match ls with
@@ -393,12 +391,12 @@ divergent def HashMap.remove_from_list_loop_back
Result.ret (List.Cons ckey t tl0)
| List.Nil => Result.ret List.Nil
-/- [hashmap::HashMap::{0}::remove_from_list]: backward function 1 -/
+/- [hashmap::{hashmap::HashMap<T>}::remove_from_list]: backward function 1 -/
def HashMap.remove_from_list_back
(T : Type) (key : Usize) (ls : List T) : Result (List T) :=
HashMap.remove_from_list_loop_back T key ls
-/- [hashmap::HashMap::{0}::remove]: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::remove]: forward function -/
def HashMap.remove
(T : Type) (self : HashMap T) (key : Usize) : Result (Option T) :=
do
@@ -407,8 +405,8 @@ def HashMap.remove
let hash_mod ← hash % i
let l ←
alloc.vec.Vec.index_mut (List T) Usize
- (core.slice.index.usize.coresliceindexSliceIndexInst (List T))
- self.slots hash_mod
+ (core.slice.index.SliceIndexUsizeSliceTInst (List T)) self.slots
+ hash_mod
let x ← HashMap.remove_from_list T key l
match x with
| none => Result.ret none
@@ -416,7 +414,7 @@ def HashMap.remove
let _ ← self.num_entries - 1#usize
Result.ret (some x0)
-/- [hashmap::HashMap::{0}::remove]: backward function 0 -/
+/- [hashmap::{hashmap::HashMap<T>}::remove]: backward function 0 -/
def HashMap.remove_back
(T : Type) (self : HashMap T) (key : Usize) : Result (HashMap T) :=
do
@@ -425,8 +423,8 @@ def HashMap.remove_back
let hash_mod ← hash % i
let l ←
alloc.vec.Vec.index_mut (List T) Usize
- (core.slice.index.usize.coresliceindexSliceIndexInst (List T))
- self.slots hash_mod
+ (core.slice.index.SliceIndexUsizeSliceTInst (List T)) self.slots
+ hash_mod
let x ← HashMap.remove_from_list T key l
match x with
| none =>
@@ -434,8 +432,8 @@ def HashMap.remove_back
let l0 ← HashMap.remove_from_list_back T key l
let v ←
alloc.vec.Vec.index_mut_back (List T) Usize
- (core.slice.index.usize.coresliceindexSliceIndexInst (List T))
- self.slots hash_mod l0
+ (core.slice.index.SliceIndexUsizeSliceTInst (List T)) self.slots
+ hash_mod l0
Result.ret { self with slots := v }
| some x0 =>
do
@@ -443,8 +441,8 @@ def HashMap.remove_back
let l0 ← HashMap.remove_from_list_back T key l
let v ←
alloc.vec.Vec.index_mut_back (List T) Usize
- (core.slice.index.usize.coresliceindexSliceIndexInst (List T))
- self.slots hash_mod l0
+ (core.slice.index.SliceIndexUsizeSliceTInst (List T)) self.slots
+ hash_mod l0
Result.ret { self with num_entries := i0, slots := v }
/- [hashmap::test1]: forward function -/
diff --git a/tests/lean/HashmapMain/Funs.lean b/tests/lean/HashmapMain/Funs.lean
index 74fa8653..5e05a399 100644
--- a/tests/lean/HashmapMain/Funs.lean
+++ b/tests/lean/HashmapMain/Funs.lean
@@ -11,7 +11,7 @@ namespace hashmap_main
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 -/
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 +24,14 @@ 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 -/
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 -/
def hashmap.HashMap.new_with_capacity
(T : Type) (capacity : Usize) (max_load_dividend : Usize)
(max_load_divisor : Usize) :
@@ -50,11 +50,11 @@ 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 -/
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
+/- [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 ()) -/
divergent def hashmap.HashMap.clear_loop
(T : Type) (slots : alloc.vec.Vec (hashmap.List T)) (i : Usize) :
@@ -67,12 +67,12 @@ 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
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::clear]: merged forward/backward function
(there is a single backward function, and the forward function returns ()) -/
def hashmap.HashMap.clear
(T : Type) (self : hashmap.HashMap T) : Result (hashmap.HashMap T) :=
@@ -80,11 +80,11 @@ def hashmap.HashMap.clear
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 -/
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 -/
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 +94,12 @@ 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 -/
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 -/
divergent def hashmap.HashMap.insert_in_list_loop_back
(T : Type) (key : Usize) (value : T) (ls : hashmap.List T) :
Result (hashmap.List T)
@@ -116,14 +116,14 @@ 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 -/
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
+/- [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 ()) -/
def hashmap.HashMap.insert_no_resize
(T : Type) (self : hashmap.HashMap T) (key : Usize) (value : T) :
@@ -135,7 +135,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,19 +145,19 @@ 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
+/- [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 ()) -/
divergent def hashmap.HashMap.move_elements_from_list_loop
(T : Type) (ntable : hashmap.HashMap T) (ls : hashmap.List T) :
@@ -170,7 +170,7 @@ 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
+/- [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 ()) -/
def hashmap.HashMap.move_elements_from_list
(T : Type) (ntable : hashmap.HashMap T) (ls : hashmap.List T) :
@@ -178,7 +178,7 @@ def hashmap.HashMap.move_elements_from_list
:=
hashmap.HashMap.move_elements_from_list_loop T ntable ls
-/- [hashmap_main::hashmap::HashMap::{0}::move_elements]: loop 0: merged forward/backward function
+/- [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 ()) -/
divergent def hashmap.HashMap.move_elements_loop
(T : Type) (ntable : hashmap.HashMap T)
@@ -191,20 +191,19 @@ 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
+/- [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 ()) -/
def hashmap.HashMap.move_elements
(T : Type) (ntable : hashmap.HashMap T)
@@ -213,7 +212,7 @@ 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
+/- [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 ()) -/
def hashmap.HashMap.try_resize
(T : Type) (self : hashmap.HashMap T) : Result (hashmap.HashMap T) :=
@@ -238,7 +237,7 @@ 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
+/- [hashmap_main::hashmap::{hashmap_main::hashmap::HashMap<T>}::insert]: merged forward/backward function
(there is a single backward function, and the forward function returns ()) -/
def hashmap.HashMap.insert
(T : Type) (self : hashmap.HashMap T) (key : Usize) (value : T) :
@@ -251,7 +250,7 @@ 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 -/
divergent def hashmap.HashMap.contains_key_in_list_loop
(T : Type) (key : Usize) (ls : hashmap.List T) : Result Bool :=
match ls with
@@ -261,12 +260,12 @@ 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 -/
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 -/
def hashmap.HashMap.contains_key
(T : Type) (self : hashmap.HashMap T) (key : Usize) : Result Bool :=
do
@@ -275,11 +274,11 @@ 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 -/
divergent def hashmap.HashMap.get_in_list_loop
(T : Type) (key : Usize) (ls : hashmap.List T) : Result T :=
match ls with
@@ -289,12 +288,12 @@ 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 -/
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 -/
def hashmap.HashMap.get
(T : Type) (self : hashmap.HashMap T) (key : Usize) : Result T :=
do
@@ -303,11 +302,11 @@ 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 -/
divergent def hashmap.HashMap.get_mut_in_list_loop
(T : Type) (ls : hashmap.List T) (key : Usize) : Result T :=
match ls with
@@ -317,12 +316,12 @@ 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 -/
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 -/
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 +336,14 @@ 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 -/
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 -/
def hashmap.HashMap.get_mut
(T : Type) (self : hashmap.HashMap T) (key : Usize) : Result T :=
do
@@ -353,11 +352,11 @@ 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 -/
def hashmap.HashMap.get_mut_back
(T : Type) (self : hashmap.HashMap T) (key : Usize) (ret0 : T) :
Result (hashmap.HashMap T)
@@ -368,16 +367,16 @@ 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 -/
divergent def hashmap.HashMap.remove_from_list_loop
(T : Type) (key : Usize) (ls : hashmap.List T) : Result (Option T) :=
match ls with
@@ -393,12 +392,12 @@ 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 -/
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 -/
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 +416,12 @@ 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 -/
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 -/
def hashmap.HashMap.remove
(T : Type) (self : hashmap.HashMap T) (key : Usize) : Result (Option T) :=
do
@@ -431,7 +430,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 +439,7 @@ 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 -/
def hashmap.HashMap.remove_back
(T : Type) (self : hashmap.HashMap T) (key : Usize) :
Result (hashmap.HashMap T)
@@ -451,7 +450,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 +459,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,8 +468,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 num_entries := i0, slots := v }
/- [hashmap_main::hashmap::test1]: forward function -/
diff --git a/tests/lean/Loops.lean b/tests/lean/Loops.lean
index c6360338..701dc6f7 100644
--- a/tests/lean/Loops.lean
+++ b/tests/lean/Loops.lean
@@ -59,7 +59,7 @@ divergent def clear_loop
let i1 ← i + 1#usize
let v0 ←
alloc.vec.Vec.index_mut_back U32 Usize
- (core.slice.index.usize.coresliceindexSliceIndexInst U32) v i 0#u32
+ (core.slice.index.SliceIndexUsizeSliceTInst U32) v i 0#u32
clear_loop v0 i1
else Result.ret v
@@ -150,8 +150,7 @@ def get_elem_mut
do
let l ←
alloc.vec.Vec.index_mut (List Usize) Usize
- (core.slice.index.usize.coresliceindexSliceIndexInst (List Usize))
- slots 0#usize
+ (core.slice.index.SliceIndexUsizeSliceTInst (List Usize)) slots 0#usize
get_elem_mut_loop x l
/- [loops::get_elem_mut]: loop 0: backward function 0 -/
@@ -175,12 +174,11 @@ def get_elem_mut_back
do
let l ←
alloc.vec.Vec.index_mut (List Usize) Usize
- (core.slice.index.usize.coresliceindexSliceIndexInst (List Usize))
- slots 0#usize
+ (core.slice.index.SliceIndexUsizeSliceTInst (List Usize)) slots 0#usize
let l0 ← get_elem_mut_loop_back x l ret0
alloc.vec.Vec.index_mut_back (List Usize) Usize
- (core.slice.index.usize.coresliceindexSliceIndexInst (List Usize)) slots
- 0#usize l0
+ (core.slice.index.SliceIndexUsizeSliceTInst (List Usize)) slots 0#usize
+ l0
/- [loops::get_elem_shared]: loop 0: forward function -/
divergent def get_elem_shared_loop
@@ -197,8 +195,7 @@ def get_elem_shared
do
let l ←
alloc.vec.Vec.index (List Usize) Usize
- (core.slice.index.usize.coresliceindexSliceIndexInst (List Usize))
- slots 0#usize
+ (core.slice.index.SliceIndexUsizeSliceTInst (List Usize)) slots 0#usize
get_elem_shared_loop x l
/- [loops::id_mut]: forward function -/
generated by cgit v1.2.3 (git 2.25.1) at 2024-10-28 05:24:32 +0000