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
use core::borrow::Borrow;
use core::convert::AsRef;
use core::mem::MaybeUninit;
use core::ops;
use core::slice;
use core::sync::atomic::{AtomicBool, AtomicUsize, Ordering};
pub struct History<T, const N: usize> {
is_full: AtomicBool,
last: AtomicUsize,
logs: MaybeUninit<[T; N]>,
}
impl<T, const N: usize> History<T, N> {
const CAPACITY: usize = N;
pub const fn new() -> Self {
History {
is_full: AtomicBool::new(false),
last: AtomicUsize::new(0),
logs: MaybeUninit::uninit(),
}
}
fn as_ptr(&self) -> *mut T {
self.logs.as_ptr() as *mut T
}
}
impl<T: PartialEq, const N: usize> History<T, N> {
pub fn insert(&self, value: T) -> bool {
if self.contains(&value) {
return false;
}
let last = self.last.load(Ordering::Relaxed);
if last == Self::CAPACITY - 1 {
self.last.store(0, Ordering::Relaxed);
self.is_full.store(true, Ordering::Relaxed);
} else {
self.last.store(last + 1, Ordering::Relaxed);
}
unsafe { slice::from_raw_parts_mut(self.as_ptr(), Self::CAPACITY)[last] = value };
return true;
}
}
impl<T, const N: usize> ops::Deref for History<T, N> {
type Target = [T];
fn deref(&self) -> &[T] {
if self.is_full.load(Ordering::Relaxed) {
unsafe { slice::from_raw_parts(self.as_ptr(), Self::CAPACITY) }
} else {
unsafe { slice::from_raw_parts(self.as_ptr(), self.last.load(Ordering::Relaxed)) }
}
}
}
impl<T, const N: usize> AsRef<[T]> for History<T, N> {
fn as_ref(&self) -> &[T] {
self
}
}
impl<T, const N: usize> Borrow<[T]> for History<T, N> {
fn borrow(&self) -> &[T] {
&self[..]
}
}