From 137cc7335e64fcb70c254e7fd2a6fa353fb43e61 Mon Sep 17 00:00:00 2001
From: Son Ho
Date: Tue, 21 Nov 2023 14:57:38 +0100
Subject: Regenerate the files
---
tests/lean/Hashmap/Funs.lean | 114 ++++++++++++++++++++++++++++--------------
tests/lean/Hashmap/Types.lean | 6 ++-
2 files changed, 80 insertions(+), 40 deletions(-)
(limited to 'tests/lean/Hashmap')
diff --git a/tests/lean/Hashmap/Funs.lean b/tests/lean/Hashmap/Funs.lean
index a1cd435e..95c501f6 100644
--- a/tests/lean/Hashmap/Funs.lean
+++ b/tests/lean/Hashmap/Funs.lean
@@ -6,11 +6,13 @@ open Primitives
namespace hashmap
-/- [hashmap::hash_key]: forward function -/
+/- [hashmap::hash_key]: forward function
+ Source: 'src/hashmap.rs', lines 27:0-27:32 -/
def hash_key (k : Usize) : Result Usize :=
Result.ret k
-/- [hashmap::{hashmap::HashMap<T>}::allocate_slots]: loop 0: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::allocate_slots]: loop 0: forward function
+ Source: 'src/hashmap.rs', lines 50:4-56:5 -/
divergent def HashMap.allocate_slots_loop
(T : Type) (slots : alloc.vec.Vec (List T)) (n : Usize) :
Result (alloc.vec.Vec (List T))
@@ -23,14 +25,16 @@ divergent def HashMap.allocate_slots_loop
HashMap.allocate_slots_loop T slots0 n0
else Result.ret slots
-/- [hashmap::{hashmap::HashMap<T>}::allocate_slots]: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::allocate_slots]: forward function
+ Source: 'src/hashmap.rs', lines 50:4-50:76 -/
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::HashMap<T>}::new_with_capacity]: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::new_with_capacity]: forward function
+ Source: 'src/hashmap.rs', lines 59:4-63:13 -/
def HashMap.new_with_capacity
(T : Type) (capacity : Usize) (max_load_dividend : Usize)
(max_load_divisor : Usize) :
@@ -49,12 +53,14 @@ def HashMap.new_with_capacity
slots := slots
}
-/- [hashmap::{hashmap::HashMap<T>}::new]: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::new]: forward function
+ Source: 'src/hashmap.rs', lines 75:4-75: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: merged forward/backward function
- (there is a single backward function, and the forward function returns ()) -/
+ (there is a single backward function, and the forward function returns ())
+ Source: 'src/hashmap.rs', lines 80:4-88:5 -/
divergent def HashMap.clear_loop
(T : Type) (slots : alloc.vec.Vec (List T)) (i : Usize) :
Result (alloc.vec.Vec (List T))
@@ -72,17 +78,20 @@ divergent def HashMap.clear_loop
else Result.ret slots
/- [hashmap::{hashmap::HashMap<T>}::clear]: merged forward/backward function
- (there is a single backward function, and the forward function returns ()) -/
+ (there is a single backward function, and the forward function returns ())
+ Source: 'src/hashmap.rs', lines 80:4-80:27 -/
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::HashMap<T>}::len]: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::len]: forward function
+ Source: 'src/hashmap.rs', lines 90:4-90:30 -/
def HashMap.len (T : Type) (self : HashMap T) : Result Usize :=
Result.ret self.num_entries
-/- [hashmap::{hashmap::HashMap<T>}::insert_in_list]: loop 0: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::insert_in_list]: loop 0: forward function
+ Source: 'src/hashmap.rs', lines 97:4-114:5 -/
divergent def HashMap.insert_in_list_loop
(T : Type) (key : Usize) (value : T) (ls : List T) : Result Bool :=
match ls with
@@ -92,12 +101,14 @@ divergent def HashMap.insert_in_list_loop
else HashMap.insert_in_list_loop T key value tl
| List.Nil => Result.ret true
-/- [hashmap::{hashmap::HashMap<T>}::insert_in_list]: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::insert_in_list]: forward function
+ Source: 'src/hashmap.rs', lines 97:4-97:71 -/
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::HashMap<T>}::insert_in_list]: loop 0: backward function 0 -/
+/- [hashmap::{hashmap::HashMap<T>}::insert_in_list]: loop 0: backward function 0
+ Source: 'src/hashmap.rs', lines 97:4-114:5 -/
divergent def HashMap.insert_in_list_loop_back
(T : Type) (key : Usize) (value : T) (ls : List T) : Result (List T) :=
match ls with
@@ -111,13 +122,15 @@ divergent def HashMap.insert_in_list_loop_back
| List.Nil => let l := List.Nil
Result.ret (List.Cons key value l)
-/- [hashmap::{hashmap::HashMap<T>}::insert_in_list]: backward function 0 -/
+/- [hashmap::{hashmap::HashMap<T>}::insert_in_list]: backward function 0
+ Source: 'src/hashmap.rs', lines 97:4-97:71 -/
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::HashMap<T>}::insert_no_resize]: merged forward/backward function
- (there is a single backward function, and the forward function returns ()) -/
+ (there is a single backward function, and the forward function returns ())
+ Source: 'src/hashmap.rs', lines 117:4-117:54 -/
def HashMap.insert_no_resize
(T : Type) (self : HashMap T) (key : Usize) (value : T) :
Result (HashMap T)
@@ -151,7 +164,8 @@ def HashMap.insert_no_resize
Result.ret { self with slots := v }
/- [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 ()) -/
+ (there is a single backward function, and the forward function returns ())
+ Source: 'src/hashmap.rs', lines 183:4-196:5 -/
divergent def HashMap.move_elements_from_list_loop
(T : Type) (ntable : HashMap T) (ls : List T) : Result (HashMap T) :=
match ls with
@@ -162,13 +176,15 @@ divergent def HashMap.move_elements_from_list_loop
| List.Nil => Result.ret ntable
/- [hashmap::{hashmap::HashMap<T>}::move_elements_from_list]: merged forward/backward function
- (there is a single backward function, and the forward function returns ()) -/
+ (there is a single backward function, and the forward function returns ())
+ Source: 'src/hashmap.rs', lines 183:4-183:72 -/
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::HashMap<T>}::move_elements]: loop 0: merged forward/backward function
- (there is a single backward function, and the forward function returns ()) -/
+ (there is a single backward function, and the forward function returns ())
+ Source: 'src/hashmap.rs', lines 171:4-180:5 -/
divergent def HashMap.move_elements_loop
(T : Type) (ntable : HashMap T) (slots : alloc.vec.Vec (List T)) (i : Usize)
:
@@ -192,7 +208,8 @@ divergent def HashMap.move_elements_loop
else Result.ret (ntable, slots)
/- [hashmap::{hashmap::HashMap<T>}::move_elements]: merged forward/backward function
- (there is a single backward function, and the forward function returns ()) -/
+ (there is a single backward function, and the forward function returns ())
+ Source: 'src/hashmap.rs', lines 171:4-171:95 -/
def HashMap.move_elements
(T : Type) (ntable : HashMap T) (slots : alloc.vec.Vec (List T)) (i : Usize)
:
@@ -201,7 +218,8 @@ def HashMap.move_elements
HashMap.move_elements_loop T ntable slots i
/- [hashmap::{hashmap::HashMap<T>}::try_resize]: merged forward/backward function
- (there is a single backward function, and the forward function returns ()) -/
+ (there is a single backward function, and the forward function returns ())
+ Source: 'src/hashmap.rs', lines 140:4-140:28 -/
def HashMap.try_resize (T : Type) (self : HashMap T) : Result (HashMap T) :=
do
let max_usize ← Scalar.cast .Usize core_u32_max
@@ -224,7 +242,8 @@ def HashMap.try_resize (T : Type) (self : HashMap T) : Result (HashMap T) :=
else Result.ret { self with max_load_factor := (i, i0) }
/- [hashmap::{hashmap::HashMap<T>}::insert]: merged forward/backward function
- (there is a single backward function, and the forward function returns ()) -/
+ (there is a single backward function, and the forward function returns ())
+ Source: 'src/hashmap.rs', lines 129:4-129:48 -/
def HashMap.insert
(T : Type) (self : HashMap T) (key : Usize) (value : T) :
Result (HashMap T)
@@ -236,7 +255,8 @@ def HashMap.insert
then HashMap.try_resize T self0
else Result.ret self0
-/- [hashmap::{hashmap::HashMap<T>}::contains_key_in_list]: loop 0: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::contains_key_in_list]: loop 0: forward function
+ Source: 'src/hashmap.rs', lines 206:4-219:5 -/
divergent def HashMap.contains_key_in_list_loop
(T : Type) (key : Usize) (ls : List T) : Result Bool :=
match ls with
@@ -246,12 +266,14 @@ 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::HashMap<T>}::contains_key_in_list]: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::contains_key_in_list]: forward function
+ Source: 'src/hashmap.rs', lines 206:4-206:68 -/
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::HashMap<T>}::contains_key]: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::contains_key]: forward function
+ Source: 'src/hashmap.rs', lines 199:4-199:49 -/
def HashMap.contains_key
(T : Type) (self : HashMap T) (key : Usize) : Result Bool :=
do
@@ -264,7 +286,8 @@ def HashMap.contains_key
hash_mod
HashMap.contains_key_in_list T key l
-/- [hashmap::{hashmap::HashMap<T>}::get_in_list]: loop 0: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::get_in_list]: loop 0: forward function
+ Source: 'src/hashmap.rs', lines 224:4-237:5 -/
divergent def HashMap.get_in_list_loop
(T : Type) (key : Usize) (ls : List T) : Result T :=
match ls with
@@ -274,11 +297,13 @@ divergent def HashMap.get_in_list_loop
else HashMap.get_in_list_loop T key tl
| List.Nil => Result.fail Error.panic
-/- [hashmap::{hashmap::HashMap<T>}::get_in_list]: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::get_in_list]: forward function
+ Source: 'src/hashmap.rs', lines 224:4-224:70 -/
def HashMap.get_in_list (T : Type) (key : Usize) (ls : List T) : Result T :=
HashMap.get_in_list_loop T key ls
-/- [hashmap::{hashmap::HashMap<T>}::get]: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::get]: forward function
+ Source: 'src/hashmap.rs', lines 239:4-239:55 -/
def HashMap.get (T : Type) (self : HashMap T) (key : Usize) : Result T :=
do
let hash ← hash_key key
@@ -290,7 +315,8 @@ def HashMap.get (T : Type) (self : HashMap T) (key : Usize) : Result T :=
hash_mod
HashMap.get_in_list T key l
-/- [hashmap::{hashmap::HashMap<T>}::get_mut_in_list]: loop 0: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::get_mut_in_list]: loop 0: forward function
+ Source: 'src/hashmap.rs', lines 245:4-254:5 -/
divergent def HashMap.get_mut_in_list_loop
(T : Type) (ls : List T) (key : Usize) : Result T :=
match ls with
@@ -300,12 +326,14 @@ 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::HashMap<T>}::get_mut_in_list]: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::get_mut_in_list]: forward function
+ Source: 'src/hashmap.rs', lines 245:4-245:86 -/
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::HashMap<T>}::get_mut_in_list]: loop 0: backward function 0 -/
+/- [hashmap::{hashmap::HashMap<T>}::get_mut_in_list]: loop 0: backward function 0
+ Source: 'src/hashmap.rs', lines 245:4-254:5 -/
divergent def HashMap.get_mut_in_list_loop_back
(T : Type) (ls : List T) (key : Usize) (ret0 : T) : Result (List T) :=
match ls with
@@ -318,12 +346,14 @@ divergent def HashMap.get_mut_in_list_loop_back
Result.ret (List.Cons ckey cvalue tl0)
| List.Nil => Result.fail Error.panic
-/- [hashmap::{hashmap::HashMap<T>}::get_mut_in_list]: backward function 0 -/
+/- [hashmap::{hashmap::HashMap<T>}::get_mut_in_list]: backward function 0
+ Source: 'src/hashmap.rs', lines 245:4-245:86 -/
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::HashMap<T>}::get_mut]: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::get_mut]: forward function
+ Source: 'src/hashmap.rs', lines 257:4-257:67 -/
def HashMap.get_mut (T : Type) (self : HashMap T) (key : Usize) : Result T :=
do
let hash ← hash_key key
@@ -335,7 +365,8 @@ def HashMap.get_mut (T : Type) (self : HashMap T) (key : Usize) : Result T :=
hash_mod
HashMap.get_mut_in_list T l key
-/- [hashmap::{hashmap::HashMap<T>}::get_mut]: backward function 0 -/
+/- [hashmap::{hashmap::HashMap<T>}::get_mut]: backward function 0
+ Source: 'src/hashmap.rs', lines 257:4-257:67 -/
def HashMap.get_mut_back
(T : Type) (self : HashMap T) (key : Usize) (ret0 : T) :
Result (HashMap T)
@@ -355,7 +386,8 @@ def HashMap.get_mut_back
hash_mod l0
Result.ret { self with slots := v }
-/- [hashmap::{hashmap::HashMap<T>}::remove_from_list]: loop 0: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::remove_from_list]: loop 0: forward function
+ Source: 'src/hashmap.rs', lines 265:4-291:5 -/
divergent def HashMap.remove_from_list_loop
(T : Type) (key : Usize) (ls : List T) : Result (Option T) :=
match ls with
@@ -369,12 +401,14 @@ divergent def HashMap.remove_from_list_loop
else HashMap.remove_from_list_loop T key tl
| List.Nil => Result.ret none
-/- [hashmap::{hashmap::HashMap<T>}::remove_from_list]: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::remove_from_list]: forward function
+ Source: 'src/hashmap.rs', lines 265:4-265:69 -/
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::HashMap<T>}::remove_from_list]: loop 0: backward function 1 -/
+/- [hashmap::{hashmap::HashMap<T>}::remove_from_list]: loop 0: backward function 1
+ Source: 'src/hashmap.rs', lines 265:4-291:5 -/
divergent def HashMap.remove_from_list_loop_back
(T : Type) (key : Usize) (ls : List T) : Result (List T) :=
match ls with
@@ -391,12 +425,14 @@ divergent def HashMap.remove_from_list_loop_back
Result.ret (List.Cons ckey t tl0)
| List.Nil => Result.ret List.Nil
-/- [hashmap::{hashmap::HashMap<T>}::remove_from_list]: backward function 1 -/
+/- [hashmap::{hashmap::HashMap<T>}::remove_from_list]: backward function 1
+ Source: 'src/hashmap.rs', lines 265:4-265:69 -/
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::HashMap<T>}::remove]: forward function -/
+/- [hashmap::{hashmap::HashMap<T>}::remove]: forward function
+ Source: 'src/hashmap.rs', lines 294:4-294:52 -/
def HashMap.remove
(T : Type) (self : HashMap T) (key : Usize) : Result (Option T) :=
do
@@ -414,7 +450,8 @@ def HashMap.remove
let _ ← self.num_entries - 1#usize
Result.ret (some x0)
-/- [hashmap::{hashmap::HashMap<T>}::remove]: backward function 0 -/
+/- [hashmap::{hashmap::HashMap<T>}::remove]: backward function 0
+ Source: 'src/hashmap.rs', lines 294:4-294:52 -/
def HashMap.remove_back
(T : Type) (self : HashMap T) (key : Usize) : Result (HashMap T) :=
do
@@ -445,7 +482,8 @@ def HashMap.remove_back
hash_mod l0
Result.ret { self with num_entries := i0, slots := v }
-/- [hashmap::test1]: forward function -/
+/- [hashmap::test1]: forward function
+ Source: 'src/hashmap.rs', lines 315:0-315:10 -/
def test1 : Result Unit :=
do
let hm ← HashMap.new U64
diff --git a/tests/lean/Hashmap/Types.lean b/tests/lean/Hashmap/Types.lean
index e007bce0..fa454123 100644
--- a/tests/lean/Hashmap/Types.lean
+++ b/tests/lean/Hashmap/Types.lean
@@ -5,12 +5,14 @@ open Primitives
namespace hashmap
-/- [hashmap::List] -/
+/- [hashmap::List]
+ Source: 'src/hashmap.rs', lines 19:0-19:16 -/
inductive List (T : Type) :=
| Cons : Usize → T → List T → List T
| Nil : List T
-/- [hashmap::HashMap] -/
+/- [hashmap::HashMap]
+ Source: 'src/hashmap.rs', lines 35:0-35:21 -/
structure HashMap (T : Type) where
num_entries : Usize
max_load_factor : (Usize × Usize)
--
cgit v1.2.3