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
173
174
use super::handle::HandleLike;
use super::handle_pool::HandlePool;
pub struct ObjectPool<H: HandleLike, T: Sized> {
handles: HandlePool<H>,
entries: Vec<T>,
}
impl<H: HandleLike, T: Sized> Default for ObjectPool<H, T> {
fn default() -> Self {
ObjectPool {
handles: HandlePool::new(),
entries: Vec::new(),
}
}
}
impl<H: HandleLike, T: Sized> ObjectPool<H, T> {
pub fn new() -> Self {
Default::default()
}
pub fn with_capacity(capacity: usize) -> Self {
ObjectPool {
handles: HandlePool::with_capacity(capacity),
entries: Vec::with_capacity(capacity),
}
}
pub fn create(&mut self, mut value: T) -> H {
let handle = self.handles.create();
if handle.index() >= self.entries.len() as u32 {
self.entries.push(value);
} else {
::std::mem::swap(&mut value, &mut self.entries[handle.index() as usize]);
::std::mem::forget(value);
}
handle
}
#[inline]
pub fn get_mut(&mut self, handle: H) -> Option<&mut T> {
if self.handles.contains(handle) {
unsafe { Some(self.entries.get_unchecked_mut(handle.index() as usize)) }
} else {
None
}
}
#[inline]
pub fn get(&self, handle: H) -> Option<&T> {
if self.handles.contains(handle) {
unsafe { Some(self.entries.get_unchecked(handle.index() as usize)) }
} else {
None
}
}
#[inline]
pub fn contains(&self, handle: H) -> bool {
self.handles.contains(handle)
}
#[inline]
pub fn free(&mut self, handle: H) -> Option<T> {
if self.handles.free(handle) {
unsafe {
let mut v = ::std::mem::uninitialized();
::std::mem::swap(&mut v, &mut self.entries[handle.index() as usize]);
Some(v)
}
} else {
None
}
}
pub fn retain<P>(&mut self, mut predicate: P)
where
P: FnMut(H, &mut T) -> bool,
{
let entries = &mut self.entries;
self.handles.retain(|handle| unsafe {
let mut v = entries.get_unchecked_mut(handle.index() as usize);
if predicate(handle, v) {
true
} else {
#[allow(clippy::invalid_ref)]
std::mem::swap(&mut v, &mut std::mem::uninitialized());
false
}
});
}
#[inline]
pub fn len(&self) -> usize {
self.handles.len()
}
#[inline]
pub fn is_empty(&self) -> bool {
self.len() == 0
}
#[inline]
pub fn iter<'a>(&'a self) -> impl DoubleEndedIterator<Item = (H, &T)> + 'a {
self.handles
.iter()
.map(move |v| unsafe { (v, self.entries.get_unchecked(v.index() as usize)) })
}
#[inline]
pub fn iter_mut(&mut self) -> impl DoubleEndedIterator<Item = (H, &mut T)> {
let entries = &mut self.entries;
self.handles.iter().map(move |v| unsafe {
let w = entries.get_unchecked_mut(v.index() as usize);
(v, &mut *(w as *mut T))
})
}
#[inline]
pub fn keys<'a>(&'a self) -> impl DoubleEndedIterator<Item = H> + 'a {
self.handles.iter()
}
#[inline]
pub fn values<'a>(&'a self) -> impl DoubleEndedIterator<Item = &T> + 'a {
self.handles
.iter()
.map(move |v| unsafe { self.entries.get_unchecked(v.index() as usize) })
}
#[inline]
pub fn values_mut<'a>(&'a mut self) -> impl DoubleEndedIterator<Item = &mut T> + 'a {
let entries = &mut self.entries;
self.handles.iter().map(move |v| unsafe {
let w = entries.get_unchecked_mut(v.index() as usize);
&mut *(w as *mut T)
})
}
}
impl<H: HandleLike, T: Sized> Drop for ObjectPool<H, T> {
fn drop(&mut self) {
unsafe {
for v in &self.handles {
::std::ptr::drop_in_place(&mut self.entries[v.index() as usize]);
}
self.entries.set_len(0);
}
}
}