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
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
use core::alloc::Allocator;
use dynode::AllocateError;
use crate::{
node::{self, Header},
DynList, Ends, MaybeUninitNode,
};
impl<T, A> DynList<[T], A>
where
A: Allocator,
{
/// Attempts to allocate an uninitialised array node at the front of the list.
///
/// # Errors
/// If allocation fails, or an arithmetic overflow occours in [`Layout::array`](core::alloc::Layout::array), this will return an [`AllocateError`].
pub fn try_allocate_uninit_array_front(
&mut self,
length: usize,
) -> Result<MaybeUninitNode<[T], A>, AllocateError> {
let header = Header {
next: self.ends.map(|Ends { front, .. }| front),
previous: None,
};
node::try_new_array(self, length, header)
}
/// Attempts to allocate an uninitialised array node at the back of the list.
///
/// # Errors
/// If allocation fails, or an arithmetic overflow occours in [`Layout::array`](core::alloc::Layout::array), this will return an [`AllocateError`].
pub fn try_allocate_uninit_array_back(
&mut self,
length: usize,
) -> Result<MaybeUninitNode<[T], A>, AllocateError> {
let header = Header {
next: None,
previous: self.ends.map(|Ends { back, .. }| back),
};
node::try_new_array(self, length, header)
}
#[must_use]
/// Allocates an uninitialised array node at the front of the list.
pub fn allocate_uninit_array_front(&mut self, length: usize) -> MaybeUninitNode<[T], A> {
AllocateError::unwrap_result(self.try_allocate_uninit_array_front(length))
}
#[must_use]
/// Allocates an uninitialised array node at the back of the list.
pub fn allocate_uninit_array_back(&mut self, length: usize) -> MaybeUninitNode<[T], A> {
AllocateError::unwrap_result(self.try_allocate_uninit_array_back(length))
}
// TODO: rename `try_push_front_copy_slice` for consistency
/// Attempts to copy the array `src` and push it to the front of the list.
///
/// # Errors
/// If allocation fails, this will return an [`AllocateError`].
pub fn try_push_front_copy_array(&mut self, src: &[T]) -> Result<(), AllocateError>
where
T: Copy,
{
let mut node = self.try_allocate_uninit_array_front(src.len())?;
node.copy_from_slice(src);
unsafe { node.insert() };
Ok(())
}
// TODO: rename `try_push_back_copy_slice` for consistency
/// Attempts to copy the array `src` and push it to the back of the list.
///
/// # Errors
/// If allocation fails, this will return an [`AllocateError`].
pub fn try_push_back_copy_array(&mut self, src: &[T]) -> Result<(), AllocateError>
where
T: Copy,
{
let mut node = self.try_allocate_uninit_array_back(src.len())?;
node.copy_from_slice(src);
unsafe { node.insert() };
Ok(())
}
// TODO: rename `push_front_copy_slice` for consistency
/// Copies the array `src` and pushes it to the front of the list.
pub fn push_front_copy_array(&mut self, src: &[T])
where
T: Copy,
{
let mut node = self.allocate_uninit_array_front(src.len());
node.copy_from_slice(src);
unsafe { node.insert() };
}
// TODO: rename `push_back_copy_slice` for consistency
/// Copies the array `src` and pushes it to the back of the list.
pub fn push_back_copy_array(&mut self, src: &[T])
where
T: Copy,
{
let mut node = self.allocate_uninit_array_back(src.len());
node.copy_from_slice(src);
unsafe { node.insert() };
}
// TODO: rename `try_push_front_clone_slice` for consistency
/// Attempts to clone the array `src` and push it to the front of the list.
///
/// # Errors
/// If allocation fails, this will return an [`AllocateError`].
pub fn try_push_front_clone_array(&mut self, src: &[T]) -> Result<(), AllocateError>
where
T: Clone,
{
let mut node = self.try_allocate_uninit_array_front(src.len())?;
node.clone_from_slice(src);
unsafe { node.insert() };
Ok(())
}
// TODO: rename `try_push_back_clone_slice` for consistency
/// Attempts to clone the array `src` and push it to the back of the list.
///
/// # Errors
/// If allocation fails, this will return an [`AllocateError`].
pub fn try_push_back_clone_array(&mut self, src: &[T]) -> Result<(), AllocateError>
where
T: Clone,
{
let mut node = self.try_allocate_uninit_array_back(src.len())?;
node.clone_from_slice(src);
unsafe { node.insert() };
Ok(())
}
// TODO: rename `push_front_clone_slice` for consistency
/// Clones the array `src` and pushes it to the front of the list.
pub fn push_front_clone_array(&mut self, src: &[T])
where
T: Clone,
{
let mut node = self.allocate_uninit_array_front(src.len());
node.clone_from_slice(src);
unsafe { node.insert() };
}
// TODO: rename `push_back_clone_slice` for consistency
/// Clones the array `src` and pushes it to the back of the list.
pub fn push_back_clone_array(&mut self, src: &[T])
where
T: Clone,
{
let mut node = self.allocate_uninit_array_back(src.len());
node.clone_from_slice(src);
unsafe { node.insert() };
}
}