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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80

use crate::alloc;
use core::{alloc::Allocator, iter::FusedIterator};

use crate::DynList;

/// An iterator over boxed elements of a [`DynList`].
///
/// This is created by [`DynList::into_iter`].
pub struct IntoIterBoxed<U: ?Sized, A: Allocator = alloc::Global> {
    list: DynList<U, A>,
}

impl<U, A> IntoIterBoxed<U, A>
where
    U: ?Sized,
    A: Allocator,
{
    #[must_use]
    #[inline]
    pub(crate) const fn new(list: DynList<U, A>) -> Self
    where
        A: Clone,
    {
        Self { list }
    }

    #[must_use]
    #[inline]
    /// Gets a reference to the remainder of the [`DynList`].
    pub const fn remainder(&self) -> &DynList<U, A> {
        &self.list
    }

    #[must_use]
    #[inline]
    /// Converts the remaining iterator to a [`DynList`].
    pub fn take_remainder(self) -> DynList<U, A> {
        self.list
    }
}

#[cfg(feature = "alloc")]
impl<U> Default for IntoIterBoxed<U>
where
    U: ?Sized,
{
    #[inline]
    fn default() -> Self {
        Self::new(DynList::default())
    }
}

impl<U, A> Iterator for IntoIterBoxed<U, A>
where
    U: ?Sized,
    A: Allocator + Clone,
{
    type Item = alloc::Box<U, A>;

    fn next(&mut self) -> Option<Self::Item> {
        self.list.pop_front_boxed()
    }
}

impl<U, A> DoubleEndedIterator for IntoIterBoxed<U, A>
where
    U: ?Sized,
    A: Allocator + Clone,
{
    fn next_back(&mut self) -> Option<Self::Item> {
        self.list.pop_back_boxed()
    }
}

impl<U, A> FusedIterator for IntoIterBoxed<U, A>
where
    U: ?Sized,
    A: Allocator + Clone,
{
}