| use core::ops::{Range, RangeBounds}; |
| use core::{fmt, ptr, slice}; |
| |
| use super::Vec; |
| use crate::alloc::{Allocator, Global}; |
| |
| /// An iterator which uses a closure to determine if an element should be removed. |
| /// |
| /// This struct is created by [`Vec::extract_if`]. |
| /// See its documentation for more. |
| /// |
| /// # Example |
| /// |
| /// ``` |
| /// let mut v = vec![0, 1, 2]; |
| /// let iter: std::vec::ExtractIf<'_, _, _> = v.extract_if(.., |x| *x % 2 == 0); |
| /// ``` |
| #[stable(feature = "extract_if", since = "1.87.0")] |
| #[must_use = "iterators are lazy and do nothing unless consumed"] |
| pub struct ExtractIf< |
| 'a, |
| T, |
| F, |
| #[unstable(feature = "allocator_api", issue = "32838")] A: Allocator = Global, |
| > { |
| vec: &'a mut Vec<T, A>, |
| /// The index of the item that will be inspected by the next call to `next`. |
| idx: usize, |
| /// Elements at and beyond this point will be retained. Must be equal or smaller than `old_len`. |
| end: usize, |
| /// The number of items that have been drained (removed) thus far. |
| del: usize, |
| /// The original length of `vec` prior to draining. |
| old_len: usize, |
| /// The filter test predicate. |
| pred: F, |
| } |
| |
| impl<'a, T, F, A: Allocator> ExtractIf<'a, T, F, A> { |
| pub(super) fn new<R: RangeBounds<usize>>(vec: &'a mut Vec<T, A>, pred: F, range: R) -> Self { |
| let old_len = vec.len(); |
| let Range { start, end } = slice::range(range, ..old_len); |
| |
| // Guard against the vec getting leaked (leak amplification) |
| unsafe { |
| vec.set_len(0); |
| } |
| ExtractIf { vec, idx: start, del: 0, end, old_len, pred } |
| } |
| |
| /// Returns a reference to the underlying allocator. |
| #[unstable(feature = "allocator_api", issue = "32838")] |
| #[inline] |
| pub fn allocator(&self) -> &A { |
| self.vec.allocator() |
| } |
| } |
| |
| #[stable(feature = "extract_if", since = "1.87.0")] |
| impl<T, F, A: Allocator> Iterator for ExtractIf<'_, T, F, A> |
| where |
| F: FnMut(&mut T) -> bool, |
| { |
| type Item = T; |
| |
| fn next(&mut self) -> Option<T> { |
| unsafe { |
| while self.idx < self.end { |
| let i = self.idx; |
| let v = slice::from_raw_parts_mut(self.vec.as_mut_ptr(), self.old_len); |
| let drained = (self.pred)(&mut v[i]); |
| // Update the index *after* the predicate is called. If the index |
| // is updated prior and the predicate panics, the element at this |
| // index would be leaked. |
| self.idx += 1; |
| if drained { |
| self.del += 1; |
| return Some(ptr::read(&v[i])); |
| } else if self.del > 0 { |
| let del = self.del; |
| let src: *const T = &v[i]; |
| let dst: *mut T = &mut v[i - del]; |
| ptr::copy_nonoverlapping(src, dst, 1); |
| } |
| } |
| None |
| } |
| } |
| |
| fn size_hint(&self) -> (usize, Option<usize>) { |
| (0, Some(self.end - self.idx)) |
| } |
| } |
| |
| #[stable(feature = "extract_if", since = "1.87.0")] |
| impl<T, F, A: Allocator> Drop for ExtractIf<'_, T, F, A> { |
| fn drop(&mut self) { |
| unsafe { |
| if self.idx < self.old_len && self.del > 0 { |
| let ptr = self.vec.as_mut_ptr(); |
| let src = ptr.add(self.idx); |
| let dst = src.sub(self.del); |
| let tail_len = self.old_len - self.idx; |
| src.copy_to(dst, tail_len); |
| } |
| self.vec.set_len(self.old_len - self.del); |
| } |
| } |
| } |
| |
| #[stable(feature = "extract_if", since = "1.87.0")] |
| impl<T, F, A> fmt::Debug for ExtractIf<'_, T, F, A> |
| where |
| T: fmt::Debug, |
| A: Allocator, |
| { |
| fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result { |
| let peek = if self.idx < self.end { self.vec.get(self.idx) } else { None }; |
| f.debug_struct("ExtractIf").field("peek", &peek).finish_non_exhaustive() |
| } |
| } |