Datasets:
File size: 1,311 Bytes
c62beea | 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 | use vstd::prelude::*;
fn main() {}
verus!{
fn f1_sub_array_at_index(main: &Vec<i32>, sub: &Vec<i32>, idx: usize) -> (result: bool)
requires
0 <= idx <= (main.len() - sub.len()),
{
let mut i = 0;
while i < sub.len()
{
if (main[idx + i] != sub[i]) {
return false;
}
i += 1;
}
true
}
spec fn f1_is_subrange_at(main: Seq<i32>, sub: Seq<i32>, i: int) -> bool {
sub =~= main.subrange(i, i + sub.len())
}
fn f1_is_sub_array(main: &Vec<i32>, sub: &Vec<i32>) -> (result: bool)
{
if sub.len() > main.len() {
return false;
}
let mut index = 0;
while index <= (main.len() - sub.len())
{
if (f1_sub_array_at_index(&main, &sub, index)) {
return true;
}
index += 1;
}
false
}
spec fn step1(__hp0: Seq<i32>, __hp1: Seq<i32>, __hp2: usize, outp: bool) -> bool {
(outp == (__hp0.subrange(__hp2 as int, (__hp2 + __hp1.len())) =~= __hp1))
}
fn chain_driver(main: &Vec<i32>, sub: &Vec<i32>, idx: usize) -> (r_final: bool)
requires
0 <= idx <= (main.len() - sub.len()),
ensures
step1(main@, sub@, idx, r_final),
{
let x1 = f1_sub_array_at_index(main, sub, idx);
proof {
assert(step1(main@, sub@, idx, x1));
}
x1
}
} // verus!
|