1 #include "find2_axioms.h"
5 requires valid: \valid_read(a + (0..n-1));
7 ensures result: 0 <= \result <= n;
10 assumes SomeEqual(a, n, v);
12 ensures bound: 0 <= \result < n;
13 ensures result: a[\result] == v;
14 ensures first: NoneEqual(a, \result, v);
17 assumes NoneEqual(a, n, v);
19 ensures result: \result == n;
25 find2(const value_type* a, size_type n, value_type v)
28 loop invariant bound: 0 <= i <= n;
29 loop invariant not_found: NoneEqual(a, i, v);
33 for (size_type i = 0u; i < n; i++) {