subms 0.2.1

Zero-dependency perf-test harness for Rust: timed stages, percentiles, and a stable JSON shape consumed by the submillisecond.com cookbook. Includes a `Recipe` trait for cookbook benchmarks.
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

//! Small shared utilities used by cookbook recipes.

/// Deterministic linear congruential generator. Cheap, repeatable, and
/// zero-dependency — suitable for generating reproducible workloads in
/// benchmarks. Not cryptographically secure.
pub struct Lcg(u64);

impl Lcg {
    pub fn new(seed: u64) -> Self {
        // OR-1 so a zero seed never collapses the multiplier-add sequence.
        Lcg(seed | 1)
    }

    pub fn next_u32(&mut self) -> u32 {
        self.0 = self
            .0
            .wrapping_mul(6364136223846793005)
            .wrapping_add(1442695040888963407);
        (self.0 >> 32) as u32
    }

    pub fn bounded(&mut self, n: u32) -> u32 {
        if n == 0 {
            return 0;
        }
        self.next_u32() % n
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn lcg_is_deterministic() {
        let mut a = Lcg::new(42);
        let mut b = Lcg::new(42);
        for _ in 0..1000 {
            assert_eq!(a.next_u32(), b.next_u32());
        }
    }

    #[test]
    fn lcg_bounded_stays_in_range() {
        let mut rng = Lcg::new(7);
        for _ in 0..10_000 {
            assert!(rng.bounded(100) < 100);
        }
    }

    #[test]
    fn lcg_bounded_zero_is_safe() {
        let mut rng = Lcg::new(7);
        assert_eq!(rng.bounded(0), 0);
    }
}