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
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190

use super::*;

impl<A: Array> iter::Extend<A::Item> for StackVec<A> {
    #[inline]
    fn extend<Iterable: IntoIterator<Item = A::Item>> (
        self: &mut Self,
        iterable: Iterable,
    )
    {
        debug_assert!(self.len <= Self::CAPACITY);
        // This is currently the most optimized `extend` implementation,
        // branching-prediction-wise
        if self.len == Self::CAPACITY {
            return
        };
        for value in iterable {
            let mut len = self.len;
            unsafe {
                debug_assert!(len < Self::CAPACITY);
                ptr::write(
                    self.array.as_mut_ptr()
                        .offset(len as isize),
                    value,
                );
                len += 1;
                self.len = len;
            };
            if len == Self::CAPACITY { break };
        };

        // // This version was less optimized:
        // let mut iterator = iterable.into_iter();
        // let mut len = self.len;
        // while len < Self::CAPACITY {
        //     if let Some(value) = iterator.next() {
        //         unsafe {
        //             ptr::write(
        //                 self.array.as_mut_ptr()
        //                     .offset(len as isize),
        //                 value,
        //             );
        //             len += 1;
        //         }
        //     } else {
        //         break
        //     };
        // };
        // self.len = len;

        // // And this one even worse o_O
        // iterable.into_iter()
        //     .take(Self::CAPACITY - self.len)
        //     .for_each(|value| unsafe {
        //         self.push_unchecked(value)
        //     })
    }
}

impl<A: Array> iter::FromIterator<A::Item> for StackVec<A> {
    #[inline(always)]
    fn from_iter<Iterable: IntoIterator<Item = A::Item>> (
        iterable: Iterable,
    ) -> Self
    {
        let mut slf = Self::new();
        slf.extend(iterable);
        slf
    }
}

pub use self::into_iter::Iter as StackVecIter;
mod into_iter {
    use super::*;

    pub struct Iter<A: Array> {
        stackvec: StackVec<A>,
        start: usize,
    }

    impl<A: Array> Drop for Iter<A> {
        fn drop (
            self: &mut Self,
        )
        {
            let len = self.stackvec.len;
            self.stackvec.len = 0;
            for i in self.start .. len {
                unsafe {
                    ptr::drop_in_place(
                        self.stackvec
                            .array.as_mut_ptr()
                            .offset(i as isize)
                    );
                };
            };
        }
    }

    impl<A: Array> Iterator for Iter<A> {
        type Item = A::Item;

        #[inline]
        fn next (
            self: &mut Self,
        ) -> Option<Self::Item>
        {
            let start = self.start;
            if start < self.stackvec.len {
                self.start = start + 1;
                Some(unsafe {
                    ptr::read(
                        self.stackvec
                            .array.as_ptr()
                            .offset(start as isize),
                    )
                })
            } else {
                None
            }
        }

        #[inline]
        fn size_hint (
            self: &Self,
        ) -> (usize, Option<usize>)
        {
            let size = self.stackvec.len - self.start;
            (size, Some(size))
        }
    }

    impl<A: Array> ExactSizeIterator for Iter<A> {
        #[inline]
        fn len (
            self: &Self,
        ) -> usize
        {
            self.stackvec.len - self.start
        }

        #[cfg(feature = "exact_size_is_empty")]
        #[inline]
        fn is_empty (
            self: &Self,
        ) -> bool
        {
            self.stackvec.len == self.start
        }
    }

    impl<A: Array> DoubleEndedIterator for Iter<A> {
        #[inline]
        fn next_back (
            self: &mut Self,
        ) -> Option<Self::Item>
        {
            let last = self.stackvec.len.saturating_sub(1);
            if self.start <= last {
                self.stackvec.len = last;
                Some(unsafe {
                    ptr::read(
                        self.stackvec
                            .array.as_ptr()
                            .offset(last as isize),
                    )
                })
            } else {
                None
            }

        }
    }

    impl<A: Array> IntoIterator for StackVec<A> {
        type Item = A::Item;

        type IntoIter = Iter<A>;

        #[inline]
        fn into_iter (
            self: Self,
        ) -> Self::IntoIter
        {
            Iter {
                stackvec: self,
                start: 0,
            }
        }
    }
}