bi 0.11.0

...
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

/*
==--==--==--==--==--==--==--==--==--==--==--==--==--==--==--==--

Bi

Copyright (C) 2019, 2021-2022, 2024  Anonymous

There are several releases over multiple years,
they are listed as ranges, such as: "2021-2022".

This program is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.

This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU Lesser General Public License for more details.

You should have received a copy of the GNU Lesser General Public License
along with this program.  If not, see <https://www.gnu.org/licenses/>.

::--::--::--::--::--::--::--::--::--::--::--::--::--::--::--::--
*/

use {
    core::sync::atomic::AtomicUsize,
    std::sync::Arc,
    crate::ATOMIC_ORDERING,
};

/// # Counter
#[derive(Debug)]
pub (crate) struct Counter {
    size: usize,
    counter: Arc<AtomicUsize>,
}

impl Counter {

    /// # Makes new instance
    pub fn new(size: usize, counter: Arc<AtomicUsize>) -> Self {
        Self {
            size,
            counter,
        }
    }

}

impl Drop for Counter {

    fn drop(&mut self) {
        if self.counter.fetch_update(ATOMIC_ORDERING, ATOMIC_ORDERING, |c| Some(c.saturating_sub(self.size))).is_err() {
            // Ignore it
        }
    }

}