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
use std::cell::UnsafeCell;
pub use cgmath;
use std::sync::atomic::{AtomicBool, AtomicU64, Ordering};
use cgmath::{Vector3, Matrix4, Deg, Point3, dot, EuclideanSpace, Transform as CgTransform};
use num::traits::real::Real;
pub mod aabb;
pub mod color;
pub use color::{Color, ColorSpace};
pub mod noise;
pub mod transform;
pub use transform::Transform;
pub mod paths;
pub mod curve;
pub mod rect;
pub use rect::Rect;
pub mod once;
pub mod drag;
pub mod cell;
pub use cell::SimpleCell;
#[derive(Copy, Clone, Debug)]
pub struct Plane {
n: Vector3<f32>,
d: f32
}
#[derive(Clone, Debug)]
pub struct FrustumPlanes {
pub left: Plane,
pub right: Plane,
pub bottom: Plane,
pub top: Plane,
pub front: Plane,
pub rear: Plane,
}
pub fn view_to_frustum(pitch: f32, yaw: f32, fov: Deg<f32>, aspect: f32, near_z: f32, far_z: f32) -> FrustumPlanes {
let forward = Vector3::new(0.0, 0.0, 1.0);
let neg_yaw = -yaw + 180.0 - 90.0 - fov.0 + 5.0;
let pos_yaw = -yaw + 180.0 + 90.0 + fov.0 - 5.0;
let neg_pitch = -pitch - 90.0 - (fov.0 / aspect) + 5.0;
let pos_pitch = -pitch + 90.0 + (fov.0 / aspect) - 5.0;
let norm_left = (Matrix4::from_angle_y(Deg(pos_yaw)) * Matrix4::from_angle_x(Deg(pitch))).transform_vector(forward);
let norm_right = (Matrix4::from_angle_y(Deg(neg_yaw)) * Matrix4::from_angle_x(Deg(pitch))).transform_vector(forward);
let norm_bottom = (Matrix4::from_angle_y(Deg(-yaw + 180.0)) * Matrix4::from_angle_x(Deg(neg_pitch))).transform_vector(forward);
let norm_top = (Matrix4::from_angle_y(Deg(-yaw + 180.0)) * Matrix4::from_angle_x(Deg(pos_pitch))).transform_vector(forward);
let left = Plane { n: norm_left, d: 0.0 };
let right = Plane { n: norm_right, d: 0.0 };
let bottom = Plane { n: norm_bottom, d: 0.0 };
let top = Plane { n: norm_top, d: 0.0 };
let front = Plane { n: Vector3::new(0.0, 0.0, -1.0), d: near_z };
let rear = Plane { n: Vector3::new(0.0, 0.0, 1.0), d: far_z };
FrustumPlanes { left, right, bottom, top, front, rear }
}
pub fn lerp(a: f32, b: f32, alpha: f32) -> f32 {
(a * (1.0 - alpha)) + (b * alpha)
}
pub fn aabb_plane_intersection(bmin: Point3<f32>, bmax: Point3<f32>, plane: Plane) -> bool {
let center = (bmax + bmin.to_vec()) * 0.5;
let extents = bmax - center.to_vec();
let proj_int_radius = extents.x*((plane.n.x).abs()) + extents.y*((plane.n.y).abs()) + extents.z*((plane.n.z).abs());
let dist = dot(plane.n, center.to_vec()) - plane.d;
dist.abs() <= proj_int_radius
}
pub fn aabb_frustum_intersection(bmin: Point3<f32>, bmax: Point3<f32>, p: FrustumPlanes) -> bool {
for plane in &[p.left, p.right, p.top, p.bottom] {
let mut closest_pt = Vector3::new(0.0, 0.0, 0.0);
closest_pt.x = if plane.n.x > 0.0 { bmin.x } else { bmax.x };
closest_pt.y = if plane.n.y > 0.0 { bmin.y } else { bmax.y };
closest_pt.z = if plane.n.z > 0.0 { bmin.z } else { bmax.z };
if dot(plane.n, closest_pt) > 0.0 {
return false;
}
}
true
}
pub fn point_box_intersection(point: [f32; 2], box_mins: [f32; 2], box_maxes: [f32; 2]) -> bool {
point[0] >= box_mins[0] && point[0] <= box_maxes[0] && point[1] >= box_mins[1] && point[1] <= box_maxes[1]
}
pub fn format_bytes(bytes: u32, digits: u32) -> String {
if bytes < 1024 {
let s = bytes.to_string();
if s.len() > digits as usize {
if s.chars().nth(3).unwrap() == '.' { s[0..3].to_string() + " B" }
else { s[0..4].to_string() + " B" }
}
else { s + " B" }
}
else if bytes < 1024*1024 {
let s = (bytes as f32 / 1024.0).to_string();
if s.len() > digits as usize {
if s.chars().nth(3).unwrap() == '.' { s[0..3].to_string() + " kB" }
else { s[0..4].to_string() + " kB" }
}
else { s + " kB" }
}
else {
let s = (bytes as f32 / (1024.0*1024.0)).to_string();
if s.len() > digits as usize {
if s.chars().nth(3).unwrap() == '.' { s[0..3].to_string() + " MB" }
else { s[0..4].to_string() + " MB" }
}
else { s + " MB" }
}
}
pub fn normalize_with_constant(constant: f32, mut a: f32, mut b: f32) -> (f32, f32, f32) {
let difference = 1.0 - (constant + a + b);
let mut ratio_a = (a / (a + b)).max(0.001);
let mut ratio_b = (b / (a + b)).max(0.001);
if ratio_a.is_infinite() || ratio_a.is_nan() || ratio_b.is_infinite() || ratio_b.is_nan() {
ratio_a = 0.5;
ratio_b = 0.5;
}
let da = difference * ratio_a;
let db = difference * ratio_b;
if a < 0.0 {
a = (a + da).clamp(-1.0, 0.0);
}
else {
a = (a + da).clamp(0.0, 1.0);
}
if b < 0.0 {
b = (b + db).clamp(-1.0, 0.0);
}
else {
b = (b + db).clamp(0.0, 1.0);
}
(constant, a, b)
}
pub fn slice_max<T: Real>(slice: &[T]) -> T {
if slice.len() == 0 { panic!("Can't get the maximum of an empty slice!") }
let mut max = slice[0];
for i in 1..slice.len() {
max = max.max(slice[i]);
}
max
}
pub fn slice_min<T: Real>(slice: &[T]) -> T {
if slice.len() == 0 { panic!("Can't get the minimum of an empty slice!") }
let mut min = slice[0];
for i in 1..slice.len() {
min = min.min(slice[i]);
}
min
}
pub fn array_max<const N: usize, T: Real>(array: [T; N]) -> T {
if N == 0 { panic!("Can't get the maximum of an empty array!") }
let mut max = array[0];
for i in 1..N {
max = max.max(array[i]);
}
max
}
pub fn array_min<const N: usize, T: Real>(array: [T; N]) -> T {
if N == 0 { panic!("Can't get the minimum of an empty array!") }
let mut min = array[0];
for i in 1..N {
min = min.min(array[i]);
}
min
}
pub struct MonoCounter(AtomicU64);
impl MonoCounter {
pub const fn new() -> Self { MonoCounter(AtomicU64::new(0)) }
pub fn next(&self) -> u64 {
self.0.fetch_add(1, Ordering::SeqCst)
}
}
pub struct Defer<S> {
state: UnsafeCell<Option<S>>,
locked: AtomicBool,
}
impl<S> Defer<S> {
pub const fn new() -> Self {
Defer {
state: UnsafeCell::new(None),
locked: AtomicBool::new(false)
}
}
pub fn is_deferred(&self) -> bool { unsafe { (*self.state.get()).is_some() } }
pub fn defer(&self, state: S) {
let was_locked = self.locked.fetch_or(true, Ordering::SeqCst);
if was_locked { panic!("Defer::<{}>::defer() called while lock was already held", std::any::type_name::<S>()); }
unsafe { self.state.get().write(Some(state)); }
self.locked.store(false, Ordering::SeqCst);
}
pub fn try_defer(&self, state: S) -> bool {
let was_locked = self.locked.fetch_or(true, Ordering::SeqCst);
if was_locked {
false
}
else {
unsafe { self.state.get().write(Some(state)); }
self.locked.store(false, Ordering::SeqCst);
true
}
}
pub fn execute<F: FnOnce(S)>(&self, f: F) -> bool {
let was_locked = self.locked.fetch_or(true, Ordering::SeqCst);
if was_locked { panic!("Defer::<{}>::execute() called while lock was already held", std::any::type_name::<S>()); }
let did_run = unsafe {
let opt = (&mut *self.state.get()).take();
match opt {
Some(value) => {
f(value); true
}
None => false
}
};
self.locked.store(false, Ordering::SeqCst);
did_run
}
pub fn try_execute<F: FnOnce(S)>(&self, f: F) -> Result<bool, ()> {
let was_locked = self.locked.fetch_or(true, Ordering::SeqCst);
if was_locked {
Err(())
}
else {
let did_run = unsafe {
let opt = (&mut *self.state.get()).take();
match opt {
Some(value) => {
f(value); true
}
None => false
}
};
self.locked.store(false, Ordering::SeqCst);
Ok(did_run)
}
}
}