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
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
use std::{collections::BTreeMap, mem::MaybeUninit};
use hashbrown::HashMap;
use hibitset::BitSetLike;
use crate::{
storage::{DistinctStorage, UnprotectedStorage},
world::Index,
};
pub trait SliceAccess<T> {
type Element;
fn as_slice(&self) -> &[Self::Element];
fn as_mut_slice(&mut self) -> &mut [Self::Element];
}
pub struct BTreeStorage<T>(BTreeMap<Index, T>);
impl<T> Default for BTreeStorage<T> {
fn default() -> Self {
Self(Default::default())
}
}
impl<T> UnprotectedStorage<T> for BTreeStorage<T> {
unsafe fn clean<B>(&mut self, _has: B)
where
B: BitSetLike,
{
}
unsafe fn get(&self, id: Index) -> &T {
&self.0[&id]
}
unsafe fn get_mut(&mut self, id: Index) -> &mut T {
self.0.get_mut(&id).unwrap()
}
unsafe fn insert(&mut self, id: Index, v: T) {
self.0.insert(id, v);
}
unsafe fn remove(&mut self, id: Index) -> T {
self.0.remove(&id).unwrap()
}
}
unsafe impl<T> DistinctStorage for BTreeStorage<T> {}
pub struct HashMapStorage<T>(HashMap<Index, T>);
impl<T> Default for HashMapStorage<T> {
fn default() -> Self {
Self(Default::default())
}
}
impl<T> UnprotectedStorage<T> for HashMapStorage<T> {
unsafe fn clean<B>(&mut self, _has: B)
where
B: BitSetLike,
{
}
unsafe fn get(&self, id: Index) -> &T {
&self.0[&id]
}
unsafe fn get_mut(&mut self, id: Index) -> &mut T {
self.0.get_mut(&id).unwrap()
}
unsafe fn insert(&mut self, id: Index, v: T) {
self.0.insert(id, v);
}
unsafe fn remove(&mut self, id: Index) -> T {
self.0.remove(&id).unwrap()
}
}
unsafe impl<T> DistinctStorage for HashMapStorage<T> {}
pub struct DenseVecStorage<T> {
data: Vec<T>,
entity_id: Vec<Index>,
data_id: Vec<MaybeUninit<Index>>,
}
impl<T> Default for DenseVecStorage<T> {
fn default() -> Self {
Self {
data: Default::default(),
entity_id: Default::default(),
data_id: Default::default(),
}
}
}
impl<T> SliceAccess<T> for DenseVecStorage<T> {
type Element = T;
#[inline]
fn as_slice(&self) -> &[Self::Element] {
self.data.as_slice()
}
#[inline]
fn as_mut_slice(&mut self) -> &mut [Self::Element] {
self.data.as_mut_slice()
}
}
impl<T> UnprotectedStorage<T> for DenseVecStorage<T> {
unsafe fn clean<B>(&mut self, _has: B)
where
B: BitSetLike,
{
}
unsafe fn get(&self, id: Index) -> &T {
let did = self.data_id.get_unchecked(id as usize).assume_init();
self.data.get_unchecked(did as usize)
}
unsafe fn get_mut(&mut self, id: Index) -> &mut T {
let did = self.data_id.get_unchecked(id as usize).assume_init();
self.data.get_unchecked_mut(did as usize)
}
unsafe fn insert(&mut self, id: Index, v: T) {
let id = id as usize;
if self.data_id.len() <= id {
let delta = id + 1 - self.data_id.len();
self.data_id.reserve(delta);
self.data_id.set_len(id + 1);
}
self.data_id
.get_unchecked_mut(id)
.as_mut_ptr()
.write(self.data.len() as Index);
self.entity_id.push(id as Index);
self.data.push(v);
}
unsafe fn remove(&mut self, id: Index) -> T {
let did = self.data_id.get_unchecked(id as usize).assume_init();
let last = *self.entity_id.last().unwrap();
self.data_id
.get_unchecked_mut(last as usize)
.as_mut_ptr()
.write(did);
self.entity_id.swap_remove(did as usize);
self.data.swap_remove(did as usize)
}
}
unsafe impl<T> DistinctStorage for DenseVecStorage<T> {}
pub struct NullStorage<T>(T);
impl<T> UnprotectedStorage<T> for NullStorage<T>
where
T: Default,
{
unsafe fn clean<B>(&mut self, _has: B)
where
B: BitSetLike,
{
}
unsafe fn get(&self, _: Index) -> &T {
&self.0
}
unsafe fn get_mut(&mut self, _: Index) -> &mut T {
&mut self.0
}
unsafe fn insert(&mut self, _: Index, _: T) {}
unsafe fn remove(&mut self, _: Index) -> T {
Default::default()
}
}
impl<T> Default for NullStorage<T>
where
T: Default,
{
fn default() -> Self {
use std::mem::size_of;
assert_eq!(size_of::<T>(), 0, "NullStorage can only be used with ZST");
NullStorage(Default::default())
}
}
unsafe impl<T> DistinctStorage for NullStorage<T> {}
pub struct VecStorage<T>(Vec<MaybeUninit<T>>);
impl<T> Default for VecStorage<T> {
fn default() -> Self {
Self(Default::default())
}
}
impl<T> SliceAccess<T> for VecStorage<T> {
type Element = MaybeUninit<T>;
#[inline]
fn as_slice(&self) -> &[Self::Element] {
self.0.as_slice()
}
#[inline]
fn as_mut_slice(&mut self) -> &mut [Self::Element] {
self.0.as_mut_slice()
}
}
impl<T> UnprotectedStorage<T> for VecStorage<T> {
unsafe fn clean<B>(&mut self, has: B)
where
B: BitSetLike,
{
use std::ptr;
for (i, v) in self.0.iter_mut().enumerate() {
if has.contains(i as u32) {
ptr::drop_in_place(&mut *v.as_mut_ptr());
}
}
self.0.set_len(0);
}
unsafe fn get(&self, id: Index) -> &T {
&*self.0.get_unchecked(id as usize).as_ptr()
}
unsafe fn get_mut(&mut self, id: Index) -> &mut T {
&mut *self.0.get_unchecked_mut(id as usize).as_mut_ptr()
}
unsafe fn insert(&mut self, id: Index, v: T) {
let id = id as usize;
if self.0.len() <= id {
let delta = id + 1 - self.0.len();
self.0.reserve(delta);
self.0.set_len(id + 1);
}
*self.0.get_unchecked_mut(id as usize) = MaybeUninit::new(v);
}
unsafe fn remove(&mut self, id: Index) -> T {
use std::ptr;
ptr::read(self.get(id))
}
}
unsafe impl<T> DistinctStorage for VecStorage<T> {}
pub struct DefaultVecStorage<T>(Vec<T>);
impl<T> Default for DefaultVecStorage<T> {
fn default() -> Self {
Self(Default::default())
}
}
impl<T> UnprotectedStorage<T> for DefaultVecStorage<T>
where
T: Default,
{
unsafe fn clean<B>(&mut self, _has: B)
where
B: BitSetLike,
{
self.0.clear();
}
unsafe fn get(&self, id: Index) -> &T {
self.0.get_unchecked(id as usize)
}
unsafe fn get_mut(&mut self, id: Index) -> &mut T {
self.0.get_unchecked_mut(id as usize)
}
unsafe fn insert(&mut self, id: Index, v: T) {
let id = id as usize;
if self.0.len() <= id {
self.0.resize_with(id, Default::default);
self.0.push(v)
} else {
self.0[id] = v;
}
}
unsafe fn remove(&mut self, id: Index) -> T {
let mut v = T::default();
std::ptr::swap(self.0.get_unchecked_mut(id as usize), &mut v);
v
}
}
unsafe impl<T> DistinctStorage for DefaultVecStorage<T> {}
impl<T> SliceAccess<T> for DefaultVecStorage<T> {
type Element = T;
#[inline]
fn as_slice(&self) -> &[Self::Element] {
self.0.as_slice()
}
#[inline]
fn as_mut_slice(&mut self) -> &mut [Self::Element] {
self.0.as_mut_slice()
}
}