jay-compositor 1.15.0

The Jay compositor
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

use std::cell::Cell;
use std::fmt::Debug;
use std::fmt::Formatter;
use std::ops::Add;
use std::ops::BitAnd;
use std::ops::BitOr;
use std::ops::Sub;

#[derive(Default)]
pub struct NumCell<T> {
    t: Cell<T>,
}

impl<T: Copy + Debug> Debug for NumCell<T> {
    fn fmt(&self, f: &mut Formatter<'_>) -> std::fmt::Result {
        self.t.get().fmt(f)
    }
}

impl<T> NumCell<T> {
    #[inline(always)]
    pub fn new(t: T) -> Self {
        Self { t: Cell::new(t) }
    }

    #[inline(always)]
    pub fn set(&self, n: T) {
        let _ = self.t.replace(n);
    }

    #[inline(always)]
    pub fn replace(&self, n: T) -> T {
        self.t.replace(n)
    }

    #[inline(always)]
    pub fn get(&self) -> T
    where
        T: Copy,
    {
        self.t.get()
    }

    #[inline(always)]
    pub fn fetch_add(&self, n: T) -> T
    where
        T: Copy + Add<T, Output = T>,
    {
        let res = self.t.get();
        self.t.set(res + n);
        res
    }

    #[inline(always)]
    pub fn add_fetch(&self, n: T) -> T
    where
        T: Copy + Add<T, Output = T>,
    {
        let res = self.t.get() + n;
        self.t.set(res);
        res
    }

    #[inline(always)]
    pub fn fetch_sub(&self, n: T) -> T
    where
        T: Copy + Sub<T, Output = T>,
    {
        let res = self.t.get();
        self.t.set(res - n);
        res
    }

    #[inline(always)]
    pub fn sub_fetch(&self, n: T) -> T
    where
        T: Copy + Sub<T, Output = T>,
    {
        let res = self.t.get() - n;
        self.t.set(res);
        res
    }

    #[inline(always)]
    pub fn or_assign(&self, n: T)
    where
        T: Copy + BitOr<Output = T>,
    {
        self.t.set(self.t.get() | n);
    }

    #[inline(always)]
    pub fn and_assign(&self, n: T)
    where
        T: Copy + BitAnd<Output = T>,
    {
        self.t.set(self.t.get() & n);
    }

    #[inline(always)]
    pub fn is_zero(&self) -> bool
    where
        T: Eq + Copy + Default,
    {
        self.t.get() == T::default()
    }

    #[inline(always)]
    pub fn is_not_zero(&self) -> bool
    where
        T: Eq + Copy + Default,
    {
        !self.is_zero()
    }

    #[inline(always)]
    pub fn take(&self) -> T
    where
        T: Default,
    {
        self.t.replace(T::default())
    }
}

impl<T: BitOr<Output = T> + Copy> BitOr<T> for &'_ NumCell<T> {
    type Output = T;

    #[inline(always)]
    fn bitor(self, rhs: T) -> Self::Output {
        self.t.get() | rhs
    }
}

impl<T: BitAnd<Output = T> + Copy> BitAnd<T> for &'_ NumCell<T> {
    type Output = T;

    #[inline(always)]
    fn bitand(self, rhs: T) -> Self::Output {
        self.t.get() & rhs
    }
}