array-vec 0.1.3

A library that provides a minimal Vec<T> that is backed by an array, instead of on the heap
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

use super::*;

pub struct SetLenOnDrop<'a> {
    len: &'a mut usize,
    local: usize,
}

impl<'a> SetLenOnDrop<'a> {
    pub fn new(len: &'a mut usize) -> Self {
        Self { local: *len, len }
    }

    pub fn inc(&mut self, count: usize) {
        self.local += count;
    }
}

impl Drop for SetLenOnDrop<'_> {
    fn drop(&mut self) {
        *self.len = self.local;
    }
}

impl<T: Clone, const N: usize> ArrayVec<T, { N }> {
    pub fn extend_from_slice(&mut self, slice: &[T]) {
        self.extend_slice(slice)
    }
}

trait ExtendSlice<T> {
    fn extend_slice(&mut self, slice: &[T]);
}

impl<T: Clone, const N: usize> ExtendSlice<T> for ArrayVec<T, { N }> {
    default fn extend_slice(&mut self, slice: &[T]) {
        if self.len + slice.len() > N {
            let mut ptr = unsafe { self.as_mut_ptr().add(self.len) };
            let mut len = SetLenOnDrop::new(&mut self.len);

            for i in slice.iter() {
                unsafe {
                    ptr.write(i.clone());
                    ptr = ptr.add(1);
                    len.inc(1);
                }
            }
        }
    }
}

impl<T: Copy, const N: usize> ExtendSlice<T> for ArrayVec<T, { N }> {
    default fn extend_slice(&mut self, slice: &[T]) {
        if self.len + slice.len() <= N {
            unsafe {
                self.copy_from_slice_unchecked(slice);
            }
        }
    }
}