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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
use crate::{RawDrain, Storage};
use core::iter::FusedIterator;
pub struct DrainFilter<'a, T, S, F>
where
S: ?Sized + Storage<T>,
F: FnMut(&mut T) -> bool,
{
raw: RawDrain<'a, T, S>,
filter: F,
}
impl<'a, T, S, F> DrainFilter<'a, T, S, F>
where
S: ?Sized + Storage<T>,
F: FnMut(&mut T) -> bool,
{
pub(crate) fn new(raw: RawDrain<'a, T, S>, filter: F) -> Self { Self { raw, filter } }
}
impl<T, S, F> Drop for DrainFilter<'_, T, S, F>
where
S: ?Sized + Storage<T>,
F: FnMut(&mut T) -> bool,
{
fn drop(&mut self) { self.for_each(drop); }
}
impl<T, S, F> FusedIterator for DrainFilter<'_, T, S, F>
where
S: ?Sized + Storage<T>,
F: FnMut(&mut T) -> bool,
{
}
impl<T, S, F> Iterator for DrainFilter<'_, T, S, F>
where
S: ?Sized + Storage<T>,
F: FnMut(&mut T) -> bool,
{
type Item = T;
fn next(&mut self) -> Option<Self::Item> {
loop {
if self.raw.is_complete() {
break None
}
unsafe {
let value = self.raw.front();
if (self.filter)(value) {
break Some(self.raw.take_front())
} else {
self.raw.skip_front();
}
}
}
}
fn size_hint(&self) -> (usize, Option<usize>) {
let len = self.raw.remaining();
(0, Some(len))
}
}
impl<T, S, F> DoubleEndedIterator for DrainFilter<'_, T, S, F>
where
S: ?Sized + Storage<T>,
F: FnMut(&mut T) -> bool,
{
fn next_back(&mut self) -> Option<Self::Item> {
loop {
if self.raw.is_complete() {
break None
}
unsafe {
let value = self.raw.back();
if (self.filter)(value) {
break Some(self.raw.take_back())
} else {
self.raw.skip_back();
}
}
}
}
}