dyn_list 0.2.1

A linked list that can hold dynamically sized values in its nodes.
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

use core::{alloc::Allocator, iter::FusedIterator, marker::PhantomData};

use crate::DynList;

use super::RawIter;

#[derive(Default)]
/// An iterator over mutable references to elements of a [`DynList`].
///
/// This is created by [`DynList::iter_mut`].
pub struct IterMut<'a, U: ?Sized> {
    raw: RawIter<U>,
    _phantom: PhantomData<&'a mut U>,
}

impl<'a, U: ?Sized> IterMut<'a, U> {
    #[must_use]
    #[inline]
    #[expect(clippy::needless_pass_by_ref_mut)]
    pub(crate) const fn new<A>(list: &'a mut DynList<U, A>) -> Self
    where
        A: Allocator,
    {
        Self {
            raw: RawIter::from_list(list),
            _phantom: PhantomData,
        }
    }
}

impl<'a, U: ?Sized> Iterator for IterMut<'a, U> {
    type Item = &'a mut U;

    fn next(&mut self) -> Option<Self::Item> {
        let node = self.raw.next()?;
        let mut ptr = unsafe { node.data_ptr() };
        Some(unsafe { ptr.as_mut() })
    }
}

impl<U: ?Sized> DoubleEndedIterator for IterMut<'_, U> {
    fn next_back(&mut self) -> Option<Self::Item> {
        let node = self.raw.next_back()?;
        let mut ptr = unsafe { node.data_ptr() };
        Some(unsafe { ptr.as_mut() })
    }
}

impl<U: ?Sized> FusedIterator for IterMut<'_, U> {}

unsafe impl<U> Send for IterMut<'_, U> where U: ?Sized + Send {}
unsafe impl<U> Sync for IterMut<'_, U> where U: ?Sized + Sync {}

impl<'a, U: ?Sized, A> IntoIterator for &'a mut DynList<U, A>
where
    A: Allocator,
{
    type Item = &'a mut U;
    type IntoIter = IterMut<'a, U>;

    fn into_iter(self) -> Self::IntoIter {
        IterMut::new(self)
    }
}