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
/// Dot products M.v for profiling & benchmarking.
/// Run in release mode for realistic timings.
///
/// SPDX-FileCopyrightText: 2025 Nessan Fitzmaurice <nzznfitz+gh@icloud.com>
/// SPDX-License-Identifier: MIT
use gf2::*;
use std::io::{
self,
Write,
};
use utilities_rs::{
Pretty,
Stopwatch,
};
fn main() {
// Number of trials & progress ticks.
let n_trials: usize = 1_000;
let n_tick = (n_trials / 20).max(1);
// Vector size.
let n: usize = 10_000;
// Random vector & matrix
type Word = usize;
let mut u: BitVector<Word> = BitVector::random(n);
let mat: BitMatrix<Word> = BitMatrix::random(n, n);
// To do something in the loop, we count how often the first element from the dot product is 1.
let mut count: usize = 0;
print!("Running {} trials of M.v where M is {} x {} ", n_trials.pretty(), n.pretty(), n.pretty());
io::stdout().flush().ok();
// Start a stop-watch
let sw = Stopwatch::new();
for trial in 0..n_trials {
if trial % n_tick == 0 {
print!(".");
io::stdout().flush().ok();
}
if mat.dot(&u).get(0) {
count += 1;
}
// Change the input a bit for the next trial.
u.set(trial % n, true);
}
println!(" done.");
println!("Loop time: {}.", sw);
println!("Counter: {}.", count.pretty());
}