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

use core::{cell::UnsafeCell, mem::{MaybeUninit, needs_drop}, sync::atomic::Ordering};
use crate::{Flag, FALSE, TRUE};

/// Inverse of a `OnceCell`.
pub struct TakeCell<T> {
    taken: Flag,
    v: UnsafeCell<MaybeUninit<T>>
}

impl<T> TakeCell<T> {
    #[inline(always)]
    pub const fn new (v: T) -> Self {
        Self {
            taken: Flag::new(FALSE),
            v: UnsafeCell::new(MaybeUninit::new(v))
        }
    }

    #[inline(always)]
    pub const fn new_taken () -> Self {
        Self {
            taken: Flag::new(TRUE),
            v: UnsafeCell::new(MaybeUninit::uninit())
        }
    }

    #[inline(always)]
    pub fn is_taken (&self) -> bool {
        self.taken.load(Ordering::Relaxed) == TRUE
    }

    #[inline]
    pub fn try_take (&self) -> Option<T> {
        if self.taken.compare_exchange(FALSE, TRUE, Ordering::AcqRel, Ordering::Acquire).is_ok() {
            unsafe {
                let v = &*self.v.get();
                return Some(v.assume_init_read())
            }
        }   
        
        None
    }

    #[inline]
    pub fn try_take_mut (&mut self) -> Option<T> {
        let taken = self.taken.get_mut();
        if *taken == FALSE {
            *taken = TRUE;

            unsafe {
                return Some(self.v.get_mut().assume_init_read())
            }
        }

        None
    }
}

impl<T> Drop for TakeCell<T> {
    #[inline(always)]
    fn drop(&mut self) {
        if needs_drop::<T>() && *self.taken.get_mut() == FALSE {
            unsafe {
                self.v.get_mut().assume_init_drop()
            }
        }
    }
}

unsafe impl<T: Send> Send for TakeCell<T> {}
unsafe impl<T: Sync> Sync for TakeCell<T> {}