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
use std::{cell::UnsafeCell, collections::HashMap, mem::MaybeUninit, ptr};
use crate::join::Index;
pub trait Component: Sized {
type Storage: RawStorage<Self>;
}
pub trait RawStorage<C> {
unsafe fn get(&self, index: Index) -> &C;
unsafe fn get_mut(&self, index: Index) -> &mut C;
unsafe fn insert(&mut self, index: Index, value: C);
unsafe fn remove(&mut self, index: Index) -> C;
}
pub struct VecStorage<C>(Vec<UnsafeCell<MaybeUninit<C>>>);
unsafe impl<C: Send> Send for VecStorage<C> {}
unsafe impl<C: Sync> Sync for VecStorage<C> {}
impl<C> Default for VecStorage<C> {
fn default() -> Self {
Self(Vec::new())
}
}
impl<C> RawStorage<C> for VecStorage<C> {
unsafe fn get(&self, index: Index) -> &C {
&*(*self.0.get_unchecked(index as usize).get()).as_ptr()
}
unsafe fn get_mut(&self, index: Index) -> &mut C {
&mut *(*self.0.get_unchecked(index as usize).get()).as_mut_ptr()
}
unsafe fn insert(&mut self, index: Index, c: C) {
let index = index as usize;
if self.0.len() <= index {
let delta = index + 1 - self.0.len();
self.0.reserve(delta);
self.0.set_len(index + 1);
}
*self.0.get_unchecked_mut(index as usize) = UnsafeCell::new(MaybeUninit::new(c));
}
unsafe fn remove(&mut self, index: Index) -> C {
ptr::read((*self.0.get_unchecked(index as usize).get()).as_mut_ptr())
}
}
pub struct DenseVecStorage<C> {
data: Vec<MaybeUninit<Index>>,
values: Vec<UnsafeCell<C>>,
indexes: Vec<Index>,
}
unsafe impl<C: Send> Send for DenseVecStorage<C> {}
unsafe impl<C: Sync> Sync for DenseVecStorage<C> {}
impl<C> Default for DenseVecStorage<C> {
fn default() -> Self {
Self {
data: Vec::new(),
values: Vec::new(),
indexes: Vec::new(),
}
}
}
impl<C> RawStorage<C> for DenseVecStorage<C> {
unsafe fn get(&self, index: Index) -> &C {
let dind = *self.data.get_unchecked(index as usize).as_ptr();
&*self.values.get_unchecked(dind as usize).get()
}
unsafe fn get_mut(&self, index: Index) -> &mut C {
let dind = *self.data.get_unchecked(index as usize).as_ptr();
&mut *self.values.get_unchecked(dind as usize).get()
}
unsafe fn insert(&mut self, index: Index, c: C) {
if self.data.len() <= index as usize {
let delta = index as usize + 1 - self.data.len();
self.data.reserve(delta);
self.data.set_len(index as usize + 1);
}
self.indexes.reserve(1);
self.values.reserve(1);
self.data
.get_unchecked_mut(index as usize)
.as_mut_ptr()
.write(self.values.len() as Index);
self.indexes.push(index);
self.values.push(UnsafeCell::new(c));
}
unsafe fn remove(&mut self, index: Index) -> C {
let dind = *self.data.get_unchecked(index as usize).as_ptr();
let last_index = *self.indexes.get_unchecked(self.indexes.len() - 1);
self.data
.get_unchecked_mut(last_index as usize)
.as_mut_ptr()
.write(dind);
self.indexes.swap_remove(dind as usize);
self.values.swap_remove(dind as usize).into_inner()
}
}
pub struct HashMapStorage<C>(HashMap<Index, UnsafeCell<C>>);
unsafe impl<C: Send> Send for HashMapStorage<C> {}
unsafe impl<C: Sync> Sync for HashMapStorage<C> {}
impl<C> Default for HashMapStorage<C> {
fn default() -> Self {
Self(HashMap::default())
}
}
impl<C> RawStorage<C> for HashMapStorage<C> {
unsafe fn get(&self, index: Index) -> &C {
&*self.0.get(&index).unwrap().get()
}
unsafe fn get_mut(&self, index: Index) -> &mut C {
&mut *self.0.get(&index).unwrap().get()
}
unsafe fn insert(&mut self, index: Index, v: C) {
self.0.insert(index, UnsafeCell::new(v));
}
unsafe fn remove(&mut self, index: Index) -> C {
self.0.remove(&index).unwrap().into_inner()
}
}