From c405ac9bd5b6e34fca1d743949992b605a15d13e Mon Sep 17 00:00:00 2001 From: Justin Worthe Date: Sun, 2 Sep 2018 09:29:14 +0200 Subject: Clippy suggested improvements --- src/strategy/monte_carlo.rs | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) (limited to 'src/strategy') diff --git a/src/strategy/monte_carlo.rs b/src/strategy/monte_carlo.rs index 347af96..0587e31 100644 --- a/src/strategy/monte_carlo.rs +++ b/src/strategy/monte_carlo.rs @@ -58,11 +58,11 @@ pub fn choose_move(state: &BitwiseGameState, start_time: PreciseTime, max_time: println!("NOTHING"); println!("{}", command_scores.iter().find(|c| c.command == Command::Nothing).map(|s| s.win_ratio()).unwrap_or(0)); - println!(""); + println!(); println!("IRON CURTAIN"); println!("{}", command_scores.iter().find(|c| c.command == Command::IronCurtain).map(|s| s.win_ratio()).unwrap_or(0)); - println!(""); + println!(); } command @@ -83,7 +83,7 @@ fn debug_print_choices Option<(Point, i32)>>(label: & } println!(" |"); } - println!(""); + println!(); } #[cfg(not(feature = "discard-poor-performers"))] @@ -174,7 +174,7 @@ fn random_move(player: &Player, opponent: &Player, rng: &mut R) -> Comma let mut m = [Command::Nothing; NUMBER_OF_POSSIBLE_MOVES]; m[1] = Command::IronCurtain; let mut i = 2; - for b in [BuildingType::Energy, BuildingType::Defence, BuildingType::Attack, BuildingType::Tesla].iter() { + for b in &[BuildingType::Energy, BuildingType::Defence, BuildingType::Attack, BuildingType::Tesla] { for p in 0..NUMBER_OF_MAP_POSITIONS as u8 { let point = Point::new_index(p); m[i] = Command::Build(point, *b); @@ -284,7 +284,7 @@ fn random_move(player: &Player, opponent: &Player, rng: &mut R) -> Comma // TODO can this be a more efficient lookup? let index = cdf.iter().position(|&c| c > choice).expect("Random number has exceeded cumulative distribution"); - MOVES[index].clone() + MOVES[index] } #[cfg(not(feature = "heuristic-random"))] -- cgit v1.2.3