provekit-whir 0.1.1

An implementation of the WHIR polynomial commitment scheme
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

use std::sync::atomic::{AtomicUsize, Ordering};

pub static HASH_COUNTER: HashCounter = HashCounter::new();

#[derive(Debug)]
pub struct HashCounter(AtomicUsize);

impl Default for HashCounter {
    fn default() -> Self {
        Self::new()
    }
}

impl HashCounter {
    pub const fn new() -> Self {
        Self(AtomicUsize::new(0))
    }

    pub(crate) fn add(&self, count: usize) {
        self.0.fetch_add(count, Ordering::Relaxed);
    }

    pub fn reset(&self) {
        self.0.store(0, Ordering::SeqCst);
    }

    pub fn get(&self) -> usize {
        self.0.load(Ordering::SeqCst)
    }
}