rc_event_queue 0.4.3

VecDeque-like fast, unbounded, FIFO, concurent read-lock-free message queue.
Documentation 
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

use std::ops::{Add};

#[inline(always)]
#[allow(unreachable_code)]
pub fn bittest_u64<const N: u8>(value: u64) -> bool {
    #[cfg(not(miri))]
    unsafe {
        #[cfg(target_arch = "x86_64")]
        return core::arch::x86_64::_bittest64(&(value as i64), N as i64) != 0;
    }

    return value & (1 << N) != 0;
}
#[inline(always)]
#[must_use]
pub fn bitset_u64<const N: u8>(mut value: u64, bit: bool) -> u64 {
    // should be const. Lets hope rust precalculate it.
    let mask: u64 = 1<<N; // all bits = 0, Nth = 1

    // clear bit
    value &= !mask;

    // set bit
    value |= (bit as u64) << N;

    value
}

/// Epoch or generation or version.
#[derive(Copy, Clone, PartialEq, Debug)]
pub struct Epoch<T, const MAX: u64> (T)
    where T : Copy + Add<Output = T> + PartialOrd + From<u8> + Into<u64>;

impl<T, const MAX: u64> Epoch<T, MAX>
    where T : Copy + Add<Output = T> + PartialOrd + From<u8> + Into<u64>
{
    #[inline(always)]
    pub fn zero() -> Self {
        Self{0: T::from(0)}
    }

    pub fn new(init: T) -> Self {
        assert!(init.into() <= MAX);
        Self{0: init}
    }

    #[inline(always)]
    pub unsafe fn new_unchecked(init: T) -> Self {
        Self{0: init}
    }

    /// +1
    #[must_use]
    #[inline]
    pub fn increment(&self) -> Self{
        if self.0.into() == MAX{
            Self::zero()
        } else {
            Self{0: self.0 + T::from(1)}
        }
    }

    #[inline(always)]
    pub fn into_inner(self) -> T{
        self.0
    }
}