titaniumtown/othello
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

future_moves: remove turbofish

Browse Source
This commit is contained in:
Simon Gardling 2025-03-25 12:50:13 -04:00
parent 4444dd9a4a
commit 072dd6daf1
Signed by: titaniumtown
GPG Key ID: 9AB28AC10ECE533D
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
src/logic/future_moves.rs
View File

@ -105,14 +105,14 @@ impl FutureMoves {
/// Returns indexes of leaf [`Move`]s, sorted by their depth (increasing order) /// Returns indexes of leaf [`Move`]s, sorted by their depth (increasing order)
fn leaf_moves(&self) -> Vec<usize> { fn leaf_moves(&self) -> Vec<usize> {
let mut indexes = (0..self.arena.len()) let mut indexes: Vec<usize> = (0..self.arena.len())
// we want to select all nodes that don't have children, or are lazy (need to maybe be regenerated) // we want to select all nodes that don't have children, or are lazy (need to maybe be regenerated)
.filter(|&idx| { .filter(|&idx| {
let got = &self.arena[idx]; let got = &self.arena[idx];
!got.is_trimmed && !got.tried_children && got.winner == Winner::None !got.is_trimmed && !got.tried_children && got.winner == Winner::None
}) })
.filter(|&idx| self.is_connected_to_root(idx)) .filter(|&idx| self.is_connected_to_root(idx))
.collect::<Vec<usize>>(); .collect();
// we want to try and make the tree even in depth // we want to try and make the tree even in depth
// by first generating children for younger moves // by first generating children for younger moves