devela 0.27.0

A development layer of coherence.
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
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

// devela::sys::mem::view::slice::iter
//
//! Defines [`SliceIter`], [`SliceIterMut`].
//

use crate::{
    IteratorLending, IteratorLendingDoubleEnded, IteratorLendingExactSize, IteratorLendingPeek,
};

#[doc = crate::_tags!(iterator lifetime)]
/// A lending iterator over a shared slice.
#[doc = crate::_doc_location!("sys/mem/view")]
///
/// Yields elements by reference in index order. Produces `&T` without copying.
#[derive(Debug)]
pub struct SliceIter<'s, T> {
    slice: &'s [T],
    front: usize,
    back: usize,
}
impl<'s, T> SliceIter<'s, T> {
    /// Creates an iterator over the given shared slice starting at index `0`.
    pub fn new(slice: &'s [T]) -> Self {
        let len = slice.len();
        Self { slice, front: 0, back: len }
    }
}
impl<'s, T> IteratorLending for SliceIter<'s, T> {
    type Item<'a>
        = &'a T
    where
        Self: 'a;

    fn next<'a>(&'a mut self) -> Option<Self::Item<'a>> {
        if self.front >= self.back {
            None
        } else {
            let i = self.front;
            self.front += 1;
            Some(&self.slice[i])
        }
    }
    fn size_hint(&self) -> (usize, Option<usize>) {
        let len = self.back - self.front;
        (len, Some(len))
    }
}
impl<'s, T> IteratorLendingExactSize for SliceIter<'s, T> {}
impl<'s, T> IteratorLendingDoubleEnded for SliceIter<'s, T> {
    fn next_back<'a>(&'a mut self) -> Option<Self::Item<'a>> {
        if self.front >= self.back {
            None
        } else {
            self.back -= 1;
            Some(&self.slice[self.back])
        }
    }
}
impl<'s, T> IteratorLendingPeek for SliceIter<'s, T> {
    fn peek<'a>(&'a mut self) -> Option<Self::Item<'a>> {
        if self.front >= self.slice.len() {
            None
        } else {
            Some(&self.slice[self.front])
        }
    }
}

//

#[doc = crate::_tags!(iterator lifetime)]
/// A lending iterator over an exclusive slice.
#[doc = crate::_doc_location!("sys/mem/view")]
///
/// Yields `&mut T` references in index order.
/// The returned references may outlive the iterator borrow taken by `next`
/// and may coexist as long as the underlying slice is not accessed through other means.
///
/// # Example
/// ```
/// # use devela::{IteratorLending, SliceIterMut};
/// let mut array = [0, 1, 2, 3];
/// let mut it = SliceIterMut::new(&mut array);
/// while let Some(x) = it.next() {
///     *x += 1;
/// }
/// assert_eq![array.as_slice(), &[1, 2, 3, 4]];
/// ```
#[derive(Debug)]
pub struct SliceIterMut<'s, T> {
    slice: &'s mut [T],
    front: usize,
    back: usize,
}
impl<'s, T> SliceIterMut<'s, T> {
    /// Creates an iterator over the given exclusive slice starting at index `0`.
    pub fn new(slice: &'s mut [T]) -> Self {
        let len = slice.len();
        Self { slice, front: 0, back: len }
    }
}
impl<'s, T> IteratorLending for SliceIterMut<'s, T> {
    type Item<'a>
        = &'a mut T
    where
        Self: 'a;

    fn next<'a>(&'a mut self) -> Option<Self::Item<'a>> {
        if self.front >= self.back {
            None
        } else {
            let i = self.front;
            self.front += 1;
            Some(&mut self.slice[i])
        }
    }
    fn size_hint(&self) -> (usize, Option<usize>) {
        let len = self.back - self.front;
        (len, Some(len))
    }
}
impl<'s, T> IteratorLendingExactSize for SliceIterMut<'s, T> {}
impl<'s, T> IteratorLendingDoubleEnded for SliceIterMut<'s, T> {
    fn next_back<'a>(&'a mut self) -> Option<Self::Item<'a>> {
        if self.front >= self.back {
            None
        } else {
            self.back -= 1;
            Some(&mut self.slice[self.back])
        }
    }
}