logaritmisk/trueskill-tt
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

perf(game): replace order.clone()+position() with inverse permutation

Browse Source
This commit is contained in:
Anders Olsson
2026-04-24 08:58:09 +02:00
parent cdee7b2b99
commit c02d5ca0ab
1 changed files with 7 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
src/game.rs
View File

@@ -192,15 +192,19 @@ impl<'a, D: Drift> Game<'a, D> {
.map(|si| lhood_win[si] * lhood_lose[si]) .map(|si| lhood_win[si] * lhood_lose[si])
.collect(); .collect();
// Map sorted-team likelihoods back to original team order. // Inverse permutation: inv[orig_i] = sorted_i (O(n), avoids clone + O(n²) search).
let order = arena.sort_buf.clone(); let mut inv = vec![0usize; n_teams];
for (si, &orig_i) in arena.sort_buf.iter().enumerate() {
inv[orig_i] = si;
}
self.likelihoods = self self.likelihoods = self
.teams .teams
.iter() .iter()
.zip(self.weights.iter()) .zip(self.weights.iter())
.enumerate() .enumerate()
.map(|(orig_i, (players, weights))| { .map(|(orig_i, (players, weights))| {
let sorted_i = order.iter().position(|&x| x == orig_i).unwrap(); let sorted_i = inv[orig_i];
let m = m_t_ft[sorted_i]; let m = m_t_ft[sorted_i];
let performance = players let performance = players
.iter() .iter()