shipyard 0.5.0

Entity Component System
Documentation 
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

use super::abstract_mut::FastAbstractMut;

#[allow(missing_docs)]
pub struct FastChunkExact<Storage> {
    pub(super) storage: Storage,
    pub(super) current: usize,
    pub(super) end: usize,
    pub(super) step: usize,
}

impl<Storage: FastAbstractMut> FastChunkExact<Storage> {
    /// Retreives the lasts elements of the storage that won't be yielded by the iterator.
    pub fn remainder(&mut self) -> Storage::Slice {
        let remainder = core::cmp::min(self.end - self.current, self.end % self.step);
        let old_end = self.end;
        self.end -= remainder;
        // SAFE we checked for OOB and the lifetime is ok
        unsafe { self.storage.get_data_slice(self.end..old_end) }
    }
}

impl<Storage: FastAbstractMut> Iterator for FastChunkExact<Storage> {
    type Item = Storage::Slice;

    #[inline]
    fn next(&mut self) -> Option<Self::Item> {
        if self.current + self.step <= self.end {
            self.current += self.step;

            Some(unsafe {
                FastAbstractMut::get_data_slice(
                    &self.storage,
                    self.current - self.step..self.current,
                )
            })
        } else {
            None
        }
    }
    #[inline]
    fn size_hint(&self) -> (usize, Option<usize>) {
        let exact = (self.end - self.current) / self.step;

        (exact, Some(exact))
    }
    #[inline]
    fn fold<B, F>(mut self, mut init: B, mut f: F) -> B
    where
        Self: Sized,
        F: FnMut(B, Self::Item) -> B,
    {
        while self.current + self.step <= self.end {
            self.current += self.step;

            init = f(init, unsafe {
                FastAbstractMut::get_data_slice(
                    &self.storage,
                    self.current - self.step..self.current,
                )
            });
        }

        init
    }
}

impl<Storage: FastAbstractMut> ExactSizeIterator for FastChunkExact<Storage> {
    #[inline]
    fn len(&self) -> usize {
        (self.end - self.current) / self.step
    }
}

impl<Storage: FastAbstractMut> DoubleEndedIterator for FastChunkExact<Storage> {
    #[inline]
    fn next_back(&mut self) -> Option<Self::Item> {
        if self.current + self.step < self.end {
            self.end -= self.step;

            Some(unsafe {
                FastAbstractMut::get_data_slice(&self.storage, self.end..self.end + self.step)
            })
        } else {
            None
        }
    }
    #[inline]
    fn rfold<B, F>(mut self, mut init: B, mut f: F) -> B
    where
        Self: Sized,
        F: FnMut(B, Self::Item) -> B,
    {
        while self.current + self.step < self.end {
            self.end -= self.step;

            init = f(init, unsafe {
                FastAbstractMut::get_data_slice(&self.storage, self.end..self.end + self.step)
            });
        }

        init
    }
}