48 lines
1.4 KiB
Rust
48 lines
1.4 KiB
Rust
|
use nalgebra::{DMatrix, DVector};
|
||
|
|
|
||
|
|
pub struct Searcher<'a> {
|
||
|
|
pub counts: Vec<u64>,
|
||
|
|
maxes: &'a Vec<f64>,
|
||
|
|
generators: &'a Vec<DMatrix<f64>>,
|
||
|
|
}
|
||
|
|
|
||
|
|
impl<'a> Searcher<'a> {
|
||
|
|
pub fn new(maxes: &'a Vec<f64>, generators: &'a Vec<DMatrix<f64>>) -> Self {
|
||
|
|
Self {
|
||
|
|
counts: vec![0; maxes.len()],
|
||
|
|
maxes,
|
||
|
|
generators,
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
pub fn search(
|
||
|
|
&mut self,
|
||
|
|
circle: &DVector<f64>,
|
||
|
|
previous_generator: usize,
|
||
|
|
generations: usize,
|
||
|
|
max_generations: usize,
|
||
|
|
) {
|
||
|
|
if generations > max_generations {
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
for (i, generator) in self.generators.iter().enumerate() {
|
||
|
|
if i != previous_generator {
|
||
|
|
let new_circle = generator * circle;
|
||
|
|
{
|
||
|
|
let mut seen = false;
|
||
|
|
for (j, max) in self.maxes.iter().enumerate() {
|
||
|
|
if seen || new_circle[1] > circle[1] && circle[1] < *max {
|
||
|
|
seen = true;
|
||
|
|
self.counts[j] += 1;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
if !seen {
|
||
|
|
continue;
|
||
|
|
}
|
||
|
|
} // ensure seen is dropped before recursive call to minimize stack frame size
|
||
|
|
self.search(&new_circle, i, generations + 1, max_generations);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|