1use super::super::prelude::*;
2use builtin::*;
3
4use alloc::vec::{IntoIter, Vec};
5use core::alloc::Allocator;
6use core::clone::Clone;
7use core::marker::PhantomData;
8use core::option::Option;
9use core::option::Option::None;
10
11use verus as verus_;
12verus_! {
13
14#[verifier::external_type_specification]
15#[verifier::external_body]
16#[verifier::accept_recursive_types(T)]
17#[verifier::reject_recursive_types(A)]
18pub struct ExVec<T, A: Allocator>(Vec<T, A>);
19
20pub trait VecAdditionalSpecFns<T>: View<V = Seq<T>> {
21 spec fn spec_index(&self, i: int) -> T
22 recommends
23 0 <= i < self.view().len(),
24 ;
25}
26
27impl<T, A: Allocator> VecAdditionalSpecFns<T> for Vec<T, A> {
28 #[verifier::inline]
29 open spec fn spec_index(&self, i: int) -> T {
30 self.view().index(i)
31 }
32}
33
34#[verifier::external_body]
45#[cfg_attr(verus_keep_ghost, rustc_diagnostic_item = "verus::vstd::std_specs::vec::vec_index")]
46pub fn vec_index<T, A: Allocator>(vec: &Vec<T, A>, i: usize) -> (element: &T)
47 requires
48 i < vec.view().len(),
49 ensures
50 *element == vec.view().index(i as int),
51 no_unwind
52{
53 &vec[i]
54}
55
56pub uninterp spec fn spec_vec_len<T, A: Allocator>(v: &Vec<T, A>) -> usize;
58
59pub broadcast proof fn axiom_spec_len<A>(v: &Vec<A>)
62 ensures
63 #[trigger] spec_vec_len(v) == v@.len(),
64{
65 admit();
66}
67
68#[verifier::when_used_as_spec(spec_vec_len)]
69pub assume_specification<T, A: Allocator>[ Vec::<T, A>::len ](vec: &Vec<T, A>) -> (len: usize)
70 ensures
71 len == spec_vec_len(vec),
72 no_unwind
73;
74
75pub assume_specification<T>[ Vec::<T>::new ]() -> (v: Vec<T>)
77 ensures
78 v@ == Seq::<T>::empty(),
79;
80
81pub assume_specification<T>[ Vec::<T>::with_capacity ](capacity: usize) -> (v: Vec<T>)
82 ensures
83 v@ == Seq::<T>::empty(),
84;
85
86pub assume_specification<T, A: Allocator>[ Vec::<T, A>::reserve ](
87 vec: &mut Vec<T, A>,
88 additional: usize,
89)
90 ensures
91 vec@ == old(vec)@,
92;
93
94pub assume_specification<T, A: Allocator>[ Vec::<T, A>::push ](vec: &mut Vec<T, A>, value: T)
95 ensures
96 vec@ == old(vec)@.push(value),
97;
98
99pub assume_specification<T, A: Allocator>[ Vec::<T, A>::pop ](vec: &mut Vec<T, A>) -> (value:
100 Option<T>)
101 ensures
102 old(vec)@.len() > 0 ==> value == Some(old(vec)@[old(vec)@.len() - 1]) && vec@ == old(
103 vec,
104 )@.subrange(0, old(vec)@.len() - 1),
105 old(vec)@.len() == 0 ==> value == None::<T> && vec@ == old(vec)@,
106;
107
108pub assume_specification<T, A: Allocator>[ Vec::<T, A>::append ](
109 vec: &mut Vec<T, A>,
110 other: &mut Vec<T, A>,
111)
112 ensures
113 vec@ == old(vec)@ + old(other)@,
114 other@ == Seq::<T>::empty(),
115;
116
117pub assume_specification<T: core::clone::Clone, A: Allocator>[ Vec::<T, A>::extend_from_slice ](
118 vec: &mut Vec<T, A>,
119 other: &[T],
120)
121 ensures
122 vec@.len() == old(vec)@.len() + other@.len(),
123 forall|i: int|
124 #![trigger vec@[i]]
125 0 <= i < vec@.len() ==> if i < old(vec)@.len() {
126 vec@[i] == old(vec)@[i]
127 } else {
128 cloned::<T>(other@[i - old(vec)@.len()], vec@[i])
129 },
130;
131
132pub assume_specification<T, A: Allocator>[ Vec::<T, A>::insert ](
145 vec: &mut Vec<T, A>,
146 i: usize,
147 element: T,
148)
149 requires
150 i <= old(vec).len(),
151 ensures
152 vec@ == old(vec)@.insert(i as int, element),
153;
154
155pub assume_specification<T, A: Allocator>[ Vec::<T, A>::remove ](
156 vec: &mut Vec<T, A>,
157 i: usize,
158) -> (element: T)
159 requires
160 i < old(vec).len(),
161 ensures
162 element == old(vec)[i as int],
163 vec@ == old(vec)@.remove(i as int),
164;
165
166pub assume_specification<T, A: Allocator>[ Vec::<T, A>::clear ](vec: &mut Vec<T, A>)
167 ensures
168 vec.view() == Seq::<T>::empty(),
169;
170
171pub assume_specification<T, A: Allocator>[ Vec::<T, A>::as_slice ](vec: &Vec<T, A>) -> (slice: &[T])
172 ensures
173 slice@ == vec@,
174;
175
176pub assume_specification<T, A: Allocator>[ <Vec<T, A> as core::ops::Deref>::deref ](
177 vec: &Vec<T, A>,
178) -> (slice: &[T])
179 ensures
180 slice@ == vec@,
181;
182
183pub assume_specification<T, A: Allocator + core::clone::Clone>[ Vec::<T, A>::split_off ](
184 vec: &mut Vec<T, A>,
185 at: usize,
186) -> (return_value: Vec<T, A>)
187 requires
188 at <= old(vec)@.len(),
189 ensures
190 vec@ == old(vec)@.subrange(0, at as int),
191 return_value@ == old(vec)@.subrange(at as int, old(vec)@.len() as int),
192;
193
194pub open spec fn vec_clone_trigger<T, A: Allocator>(v1: Vec<T, A>, v2: Vec<T, A>) -> bool {
195 true
196}
197
198pub assume_specification<T: Clone, A: Allocator + Clone>[ <Vec<T, A> as Clone>::clone ](
199 vec: &Vec<T, A>,
200) -> (res: Vec<T, A>)
201 ensures
202 res.len() == vec.len(),
203 forall|i| #![all_triggers] 0 <= i < vec.len() ==> cloned::<T>(vec[i], res[i]),
204 vec_clone_trigger(*vec, res),
205 vec@ =~= res@ ==> vec@ == res@,
206;
207
208pub broadcast proof fn vec_clone_deep_view_proof<T: DeepView, A: Allocator>(
209 v1: Vec<T, A>,
210 v2: Vec<T, A>,
211)
212 requires
213 #[trigger] vec_clone_trigger(v1, v2),
214 v1.deep_view() =~= v2.deep_view(),
215 ensures
216 v1.deep_view() == v2.deep_view(),
217{
218}
219
220pub assume_specification<T, A: Allocator>[ Vec::<T, A>::truncate ](vec: &mut Vec<T, A>, len: usize)
221 ensures
222 len <= old(vec).len() ==> vec@ == old(vec)@.subrange(0, len as int),
223 len > old(vec).len() ==> vec@ == old(vec)@,
224;
225
226pub assume_specification<T: Clone, A: Allocator>[ Vec::<T, A>::resize ](
227 vec: &mut Vec<T, A>,
228 len: usize,
229 value: T,
230)
231 ensures
232 len <= old(vec).len() ==> vec@ == old(vec)@.subrange(0, len as int),
233 len > old(vec).len() ==> {
234 &&& vec@.len() == len
235 &&& vec@.subrange(0, old(vec).len() as int) == old(vec)@
236 &&& forall|i| #![all_triggers] old(vec).len() <= i < len ==> cloned::<T>(value, vec@[i])
237 },
238;
239
240pub broadcast proof fn axiom_vec_index_decreases<A>(v: Vec<A>, i: int)
241 requires
242 0 <= i < v.len(),
243 ensures
244 #[trigger] (decreases_to!(v => v[i])),
245{
246 admit();
247}
248
249impl<T, A: Allocator> super::core::TrustedSpecSealed for Vec<T, A> {
250
251}
252
253impl<T, A: Allocator> super::core::IndexSetTrustedSpec<usize> for Vec<T, A> {
254 open spec fn spec_index_set_requires(&self, index: usize) -> bool {
255 0 <= index < self.len()
256 }
257
258 open spec fn spec_index_set_ensures(&self, new_container: &Self, index: usize, val: T) -> bool {
259 new_container@ === self@.update(index as int, val)
260 }
261}
262
263#[verifier::external_type_specification]
266#[verifier::external_body]
267#[verifier::accept_recursive_types(T)]
268#[verifier::reject_recursive_types(A)]
269pub struct ExIntoIter<T, A: Allocator>(IntoIter<T, A>);
270
271impl<T, A: Allocator> View for IntoIter<T, A> {
272 type V = (int, Seq<T>);
273
274 uninterp spec fn view(self: &IntoIter<T, A>) -> (int, Seq<T>);
275}
276
277pub assume_specification<T, A: Allocator>[ IntoIter::<T, A>::next ](
278 elements: &mut IntoIter<T, A>,
279) -> (r: Option<T>)
280 ensures
281 ({
282 let (old_index, old_seq) = old(elements)@;
283 match r {
284 None => {
285 &&& elements@ == old(elements)@
286 &&& old_index >= old_seq.len()
287 },
288 Some(element) => {
289 let (new_index, new_seq) = elements@;
290 &&& 0 <= old_index < old_seq.len()
291 &&& new_seq == old_seq
292 &&& new_index == old_index + 1
293 &&& element == old_seq[old_index]
294 },
295 }
296 }),
297;
298
299pub struct IntoIterGhostIterator<T, A: Allocator> {
300 pub pos: int,
301 pub elements: Seq<T>,
302 pub _marker: PhantomData<A>,
303}
304
305impl<T, A: Allocator> super::super::pervasive::ForLoopGhostIteratorNew for IntoIter<T, A> {
306 type GhostIter = IntoIterGhostIterator<T, A>;
307
308 open spec fn ghost_iter(&self) -> IntoIterGhostIterator<T, A> {
309 IntoIterGhostIterator { pos: self@.0, elements: self@.1, _marker: PhantomData }
310 }
311}
312
313impl<T, A: Allocator> super::super::pervasive::ForLoopGhostIterator for IntoIterGhostIterator<
314 T,
315 A,
316> {
317 type ExecIter = IntoIter<T, A>;
318
319 type Item = T;
320
321 type Decrease = int;
322
323 open spec fn exec_invariant(&self, exec_iter: &IntoIter<T, A>) -> bool {
324 &&& self.pos == exec_iter@.0
325 &&& self.elements == exec_iter@.1
326 }
327
328 open spec fn ghost_invariant(&self, init: Option<&Self>) -> bool {
329 init matches Some(init) ==> {
330 &&& init.pos == 0
331 &&& init.elements == self.elements
332 &&& 0 <= self.pos <= self.elements.len()
333 }
334 }
335
336 open spec fn ghost_ensures(&self) -> bool {
337 self.pos == self.elements.len()
338 }
339
340 open spec fn ghost_decrease(&self) -> Option<int> {
341 Some(self.elements.len() - self.pos)
342 }
343
344 open spec fn ghost_peek_next(&self) -> Option<T> {
345 if 0 <= self.pos < self.elements.len() {
346 Some(self.elements[self.pos])
347 } else {
348 None
349 }
350 }
351
352 open spec fn ghost_advance(&self, _exec_iter: &IntoIter<T, A>) -> IntoIterGhostIterator<T, A> {
353 Self { pos: self.pos + 1, ..*self }
354 }
355}
356
357impl<T, A: Allocator> View for IntoIterGhostIterator<T, A> {
358 type V = Seq<T>;
359
360 open spec fn view(&self) -> Seq<T> {
361 self.elements.take(self.pos)
362 }
363}
364
365pub uninterp spec fn spec_into_iter<T, A: Allocator>(v: Vec<T, A>) -> (iter: <Vec<
372 T,
373 A,
374> as core::iter::IntoIterator>::IntoIter);
375
376pub broadcast proof fn axiom_spec_into_iter<T, A: Allocator>(v: Vec<T, A>)
377 ensures
378 (#[trigger] spec_into_iter(v))@ == (0int, v@),
379{
380 admit();
381}
382
383#[verifier::when_used_as_spec(spec_into_iter)]
384pub assume_specification<T, A: Allocator>[ Vec::<T, A>::into_iter ](vec: Vec<T, A>) -> (iter: <Vec<
385 T,
386 A,
387> as core::iter::IntoIterator>::IntoIter)
388 ensures
389 iter@ == (0int, vec@),
390;
391
392pub broadcast group group_vec_axioms {
393 axiom_spec_len,
394 axiom_vec_index_decreases,
395 vec_clone_deep_view_proof,
396 axiom_spec_into_iter,
397}
398
399}