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
162
163
164
165
166
167
168
169
170
171
172
pub struct ReusableVec<T> {
	vec: Vec<T>,
	len: usize,
}

impl<T> ReusableVec<T> {
	#[inline]
	pub fn new() -> Self {
		Self { vec: Vec::new(), len: 0 }
	}

	#[inline]
	pub fn with_capacity(capacity: usize) -> Self {
		Self { vec: Vec::with_capacity(capacity), len: 0 }
	}

	#[inline]
	pub fn push_reuse(&mut self) -> Option<&mut T> {
		(self.len < self.vec.len()).then(move || {
			self.len += 1;
			&mut self.vec[self.len - 1]
		})
	}

	#[inline]
	pub fn push(&mut self, value: T) {
		self.len = self.len.checked_add(1).unwrap();

		if self.len <= self.vec.len() {
			self.vec[self.len - 1] = value;
		} else {
			self.vec.push(value);
		}
	}

	#[inline]
	pub fn as_slice(&self) -> &[T] {
		&self.vec[..self.len]
	}

	#[inline]
	pub fn as_mut_slice(&mut self) -> &mut [T] {
		&mut self.vec[..self.len]
	}

	#[inline]
	pub fn to_vec(mut self) -> Vec<T> {
		self.vec.truncate(self.len);
		self.vec
	}

	#[inline]
	pub fn clear_reuse(&mut self) {
		self.len = 0;
	}

	#[inline]
	pub fn clear_drop(&mut self) {
		self.vec.clear();
		self.len = 0;
	}
}

impl<T> From<Vec<T>> for ReusableVec<T> {
	#[inline]
	fn from(vec: Vec<T>) -> Self {
		Self { len: vec.len(), vec }
	}
}

impl<T> From<ReusableVec<T>> for Vec<T> {
	#[inline]
	fn from(reusable: ReusableVec<T>) -> Vec<T> {
		reusable.to_vec()
	}
}

impl<T> std::ops::Deref for ReusableVec<T> {
	type Target = [T];

	#[inline]
	fn deref(&self) -> &Self::Target {
		self.as_slice()
	}
}

impl<T> std::ops::DerefMut for ReusableVec<T> {
	#[inline]
	fn deref_mut(&mut self) -> &mut Self::Target {
		self.as_mut_slice()
	}
}

impl<T> IntoIterator for ReusableVec<T> {
	type Item = T;
	type IntoIter = <Vec<T> as IntoIterator>::IntoIter;

	#[inline]
	fn into_iter(self) -> Self::IntoIter {
		self.to_vec().into_iter()
	}
}

impl<'a, T> IntoIterator for &'a ReusableVec<T> {
	type Item = &'a T;
	type IntoIter = <&'a [T] as IntoIterator>::IntoIter;

	#[inline]
	fn into_iter(self) -> Self::IntoIter {
		self.as_slice().into_iter()
	}
}

impl<'a, T> IntoIterator for &'a mut ReusableVec<T> {
	type Item = &'a mut T;
	type IntoIter = <&'a mut [T] as IntoIterator>::IntoIter;

	#[inline]
	fn into_iter(self) -> Self::IntoIter {
		self.as_mut_slice().iter_mut()
	}
}

#[cfg(test)]
mod tests {
	use super::*;

	#[test]
	fn it_should_work() {
		struct Thing {
			cheap: u32,
			expensive: Vec<u32>,
		}

		let mut things = ReusableVec::<Thing>::new();

		for i in 0..2 {
			let new_thing = Thing { cheap: 123, expensive: Vec::new() };

			if let Some(reused) = things.push_reuse() {
				let mut expensive = std::mem::take(&mut reused.expensive);

				if i > 0 {
					assert_eq!(expensive, [456]);
				}

				expensive.clear();
				*reused = Thing { expensive, ..new_thing };
			} else {
				things.push(Thing { expensive: Vec::with_capacity(100), ..new_thing });
			}

			assert_eq!(things.len(), 1);
			let last = things.last_mut().unwrap();
			last.expensive.push(456);

			assert_eq!(last.cheap, 123);
			assert_eq!(last.expensive, [456]);

			things.clear_reuse();
			assert_eq!(things.len(), 0);
		}

		things.clear_drop();
		assert_eq!(things.len(), 0);
		assert!(things.push_reuse().is_none());

		things.push(Thing { cheap: 0, expensive: Vec::new() });
		things.clear_reuse();
		assert_eq!(Vec::from(things).len(), 0);
	}
}