1 #include "find1_axioms.h"
5 requires \valid_read(a + (0..n-1));
7 ensures 0 <= \result <= n;
10 assumes \exists integer i; 0 <= i < n && a[i] == v;
12 ensures 0 <= \result < n;
13 ensures a[\result] == v;
14 ensures \forall integer i; 0 <= i < \result ==> a[i] != v;
17 assumes \forall integer i; 0 <= i < n ==> a[i] != v;
25 find(const value_type* a, size_type n, value_type v)
28 loop invariant 0 <= i <= n;
29 loop invariant \forall integer k; 0 <= k < i ==> a[k] != v;
33 for (size_type i = 0u; i < n; i++) {