55 lines
1.1 KiB
Rust
55 lines
1.1 KiB
Rust
use {
|
|
crate::utils::ptr_ext::MutPtrExt,
|
|
std::{cell::UnsafeCell, collections::VecDeque, mem},
|
|
};
|
|
|
|
#[derive(Debug)]
|
|
pub struct SyncQueue<T> {
|
|
el: UnsafeCell<VecDeque<T>>,
|
|
}
|
|
|
|
impl<T> Default for SyncQueue<T> {
|
|
fn default() -> Self {
|
|
Self {
|
|
el: Default::default(),
|
|
}
|
|
}
|
|
}
|
|
|
|
impl<T> SyncQueue<T> {
|
|
pub fn push(&self, t: T) {
|
|
unsafe {
|
|
self.el.get().deref_mut().push_back(t);
|
|
}
|
|
}
|
|
|
|
pub fn push_front(&self, t: T) {
|
|
unsafe {
|
|
self.el.get().deref_mut().push_front(t);
|
|
}
|
|
}
|
|
|
|
pub fn pop(&self) -> Option<T> {
|
|
unsafe { self.el.get().deref_mut().pop_front() }
|
|
}
|
|
|
|
pub fn is_empty(&self) -> bool {
|
|
unsafe { self.el.get().deref_mut().is_empty() }
|
|
}
|
|
|
|
pub fn is_not_empty(&self) -> bool {
|
|
!self.is_empty()
|
|
}
|
|
|
|
pub fn swap(&self, queue: &mut VecDeque<T>) {
|
|
unsafe {
|
|
mem::swap(self.el.get().deref_mut(), queue);
|
|
}
|
|
}
|
|
|
|
pub fn take(&self) -> VecDeque<T> {
|
|
let mut res = VecDeque::new();
|
|
self.swap(&mut res);
|
|
res
|
|
}
|
|
}
|