use crate::na::DMatrix;
use rayon::prelude::*;
pub(crate) fn correspondence_matrix<F>(
count: usize,
pair_count: F,
) -> std::result::Result<DMatrix<f64>, String>
where
F: Fn(usize, usize) -> std::result::Result<f64, String> + Sync,
{
let mut matrix = DMatrix::<f64>::zeros(count, count);
let mut work_list = Vec::new();
for i in 0..count {
for j in (i + 1)..count {
work_list.push((i, j));
}
}
let collected = work_list
.par_iter()
.map(|&(i, j)| pair_count(i, j).map(|c| (i, j, c)))
.collect::<std::result::Result<Vec<_>, String>>()?;
for (i, j, count) in collected {
matrix[(i, j)] = count;
matrix[(j, i)] = count;
}
Ok(matrix)
}
pub(crate) fn reference_priority(matrix: DMatrix<f64>) -> Vec<usize> {
let max = matrix.max();
let mut corr = matrix;
if max > 0.0 {
corr /= max;
}
corr.apply(|x| *x = x.sqrt());
let mut pairs = corr
.column_sum()
.iter()
.enumerate()
.map(|(i, x)| (i, *x))
.collect::<Vec<_>>();
pairs.sort_by(|a, b| b.1.total_cmp(&a.1));
pairs.iter().map(|(i, _)| *i).collect()
}