wasm4pm 26.6.13

High-performance process mining algorithms in WebAssembly for JavaScript/TypeScript
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
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
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167

// Benchmarks for cache-efficient data structures
// Run with: cargo bench --bench cache_efficiency_bench

use criterion::{black_box, criterion_group, criterion_main, Criterion};
use wasm4pm::cache_resident::{decode_rl_state, encode_rl_state, QTable, VariantMap};
use wasm4pm::RlState;

fn bench_encode_state(c: &mut Criterion) {
    c.bench_function("encode_rl_state", |b| {
        let state = RlState {
            health_level: 2,
            event_rate_q: 5,
            activity_count_q: 3,
            spc_alert_level: 1,
            drift_status: 2,
            rework_ratio_q: 7,
            circuit_state: 1,
            cycle_phase: 3,
        };

        b.iter(|| {
            let idx = encode_rl_state(black_box(&state));
            black_box(idx);
        });
    });
}

fn bench_decode_state(c: &mut Criterion) {
    c.bench_function("decode_rl_state", |b| {
        let state = RlState {
            health_level: 2,
            event_rate_q: 5,
            activity_count_q: 3,
            spc_alert_level: 1,
            drift_status: 2,
            rework_ratio_q: 7,
            circuit_state: 1,
            cycle_phase: 3,
        };
        let idx = encode_rl_state(&state);

        b.iter(|| {
            let decoded = decode_rl_state(black_box(idx));
            black_box(decoded);
        });
    });
}

fn bench_qtable_insert_sequential(c: &mut Criterion) {
    c.bench_function("qtable_insert_sequential_1000", |b| {
        let mut table: QTable<460_800> = QTable::new();

        b.iter(|| {
            for i in 0..1000 {
                table.insert(i as u32, (i % 8) as u8, 0.5 + (i as f32) * 0.001);
            }
        });
    });
}

fn bench_qtable_get_sequential(c: &mut Criterion) {
    c.bench_function("qtable_get_sequential_1000", |b| {
        let mut table: QTable<460_800> = QTable::new();
        for i in 0..1000 {
            table.insert(i as u32, (i % 8) as u8, 0.5);
        }

        b.iter(|| {
            let mut sum = 0.0;
            for i in 0..1000 {
                if let Some(q) = table.get(black_box(i as u32), (i % 8) as u8) {
                    sum += q;
                }
            }
            black_box(sum);
        });
    });
}

fn bench_qtable_get_random(c: &mut Criterion) {
    c.bench_function("qtable_get_random_10000", |b| {
        let mut table: QTable<460_800> = QTable::new();
        for i in 0..10000 {
            table.insert(i as u32, (i % 8) as u8, 0.5);
        }

        // Pre-generate random lookups to avoid RNG in benchmark
        let lookups: Vec<u32> = (0..10000).map(|i| ((i * 7919) % 10000) as u32).collect();

        b.iter(|| {
            let mut sum = 0.0;
            for &idx in &lookups {
                if let Some(q) = table.get(black_box(idx), (idx % 8) as u8) {
                    sum += q;
                }
            }
            black_box(sum);
        });
    });
}

fn bench_variant_map_insert(c: &mut Criterion) {
    c.bench_function("variant_map_insert_10000", |b| {
        let mut map = VariantMap::with_capacity(100_000);

        b.iter(|| {
            for i in 0..10000 {
                let fp = (i as u64).wrapping_mul(0x9e3779b97f4a7c15);
                map.insert(black_box(fp), 1);
            }
        });
    });
}

fn bench_variant_map_get_sequential(c: &mut Criterion) {
    c.bench_function("variant_map_get_sequential_10000", |b| {
        let mut map = VariantMap::with_capacity(100_000);
        for i in 0..10000 {
            let fp = (i as u64).wrapping_mul(0x9e3779b97f4a7c15);
            map.insert(fp, 1);
        }

        b.iter(|| {
            let mut sum = 0u64;
            for i in 0..10000 {
                let fp = (i as u64).wrapping_mul(0x9e3779b97f4a7c15);
                if let Some(count) = map.get(black_box(fp)) {
                    sum += count as u64;
                }
            }
            black_box(sum);
        });
    });
}

fn bench_variant_map_memory_overhead(c: &mut Criterion) {
    c.bench_function("variant_map_memory_overhead_1m", |b| {
        b.iter(|| {
            let map = VariantMap::with_capacity(1_000_000);
            let size_mb = map.size_bytes() as f64 / (1024.0 * 1024.0);
            black_box(size_mb);
        });
    });
}

fn bench_qtable_full_memory_creation(c: &mut Criterion) {
    c.bench_function("qtable_full_memory_creation_460k", |b| {
        b.iter(|| {
            let table: QTable<460_800> = QTable::new();
            black_box(table.size_bytes());
        });
    });
}

criterion_group!(
    benches,
    bench_encode_state,
    bench_decode_state,
    bench_qtable_insert_sequential,
    bench_qtable_get_sequential,
    bench_qtable_get_random,
    bench_variant_map_insert,
    bench_variant_map_get_sequential,
    bench_variant_map_memory_overhead,
    bench_qtable_full_memory_creation,
);
criterion_main!(benches);