🚨 fix more lint errors

Author: chase-manning

pleco/src/board/mod.rs

@@ -205,7 +205,7 @@ pub struct Board {
     half_moves: u16,                                  // Total moves played
     depth: u16,                                       // Current depth since last shallow_copy
     piece_counts: [[u8; PIECE_TYPE_CNT]; PLAYER_CNT], // Count of each Piece
-    piece_locations: PieceLocations,                  // Mapping Squares to Pieces and Plauers
+    piece_locations: PieceLocations,                  // Mapping Squares to Pieces and Players
     zobrist_history: Vec<u64>,                        // Historic Zobrist keys of the board
     threefold_repetition: bool,                       // Whether the board has been repeated 3 times
 
@@ -700,7 +700,7 @@ impl Board {
         let mut next_arc_state = UniqueArc::new(self.state.partial_clone());
 
         // Separate Block to allow dereferencing the BoardState
-        // As there is garunteed only one owner of the Arc, this is allowed
+        // As there is guaranteed only one owner of the Arc, this is allowed
         {
             let new_state: &mut BoardState = &mut next_arc_state;
 
@@ -1242,7 +1242,7 @@ impl Board {
     fn apply_castling(
         &mut self,
         player: Player,
-        k_src: SQ,          // from, king startng spot
+        k_src: SQ,          // from, king starting spot
         to_r_orig: &mut SQ, // originally
         r_src: &mut SQ,
         r_dst: &mut SQ,

pleco/src/board/movegen.rs

@@ -111,7 +111,7 @@ impl Legality for PseudoLegal {
     }
 }
 
-// Pieces to generate moves with inter-changably
+// Pieces to generate moves with interchangeably
 const STANDARD_PIECES: [PieceType; 4] = [PieceType::B, PieceType::N, PieceType::R, PieceType::Q];
 const DEFAULT_MOVES_LENGTH: usize = 32;
 

pleco/src/bots/mod.rs

@@ -120,7 +120,7 @@ pub fn eval_board(board: &Board) -> ScoringMove {
 mod tests {
     use super::*;
 
-    // We test these, as both algorithms should give the same result no matter if paralleized
+    // We test these, as both algorithms should give the same result no matter if parallelized
     // or not.
 
     #[test]

pleco/src/helper/prelude.rs

@@ -193,7 +193,7 @@ pub fn z_ep(sq: SQ) -> u64 {
     zobrist::z_ep(sq)
 }
 
-/// Returns the Zobrish hash for a castling right.
+/// Returns the Zobrist hash for a castling right.
 ///
 /// Undefined behavior will occur if the bits are greater than 15.
 #[inline(always)]

pleco/src/tools/tt.rs

@@ -43,7 +43,7 @@ use super::prefetch_write;
 use super::PreFetchable;
 use core::piece_move::BitMove;
 
-// TODO: investigate potention for SIMD in key lookup
+// TODO: investigate potential for SIMD in key lookup
 // Currently, there is now way to do this right now in rust without it being extensive.
 
 pub type Key = u64;
@@ -352,7 +352,7 @@ impl TranspositionTable {
     /// Returns the current number of cycles a TT has gone through. Cycles is simply the
     /// number of times refresh has been called.
     #[inline]
-    pub fn time_age_cylces(&self) -> u8 {
+    pub fn time_age_cycles(&self) -> u8 {
         unsafe { (*self.time_age.get()).wrapping_shr(2) }
     }
 

pleco/tests/board_hash.rs

@@ -66,7 +66,7 @@ impl HashCorrect for PawnHashCorrect {
     }
 }
 
-// Testing that applying / undoing a move leads to the same zobriust hash
+// Testing that applying / undoing a move leads to the same zobrist hash
 #[test]
 fn zobrist_correctness() {
     for _x in 0..15 {

pleco_engine/src/search/eval.rs

@@ -266,7 +266,7 @@ const PAWNLESS_FLANK: Score = Score(20, 80);
 const THREAT_BY_SAFE_PAWN: Score = Score(192, 175);
 const THREAT_BY_RANK: Score = Score(16, 3);
 const HANGING: Score = Score(48, 27);
-const WEAK_UNOPOSSED_PAWN: Score = Score(5, 25);
+const WEAK_UNOPPOSED_PAWN: Score = Score(5, 25);
 const SLIDER_ON_QUEEN: Score = Score(42, 21);
 const THREAT_BY_PAWN_PUSH: Score = Score(38, 22);
 const THREAT_BY_ATTACK_ON_QUEEN: Score = Score(38, 22);
@@ -961,7 +961,7 @@ impl<'a, 'b, T: Tracing> EvaluationInner<'a, 'b, T> {
             .piece_two_bb(PieceType::R, PieceType::Q, us)
             .is_not_empty()
         {
-            score += WEAK_UNOPOSSED_PAWN * self.pawn_entry.weak_unopposed(them);
+            score += WEAK_UNOPPOSED_PAWN * self.pawn_entry.weak_unopposed(them);
         }
 
         // Find squares where our pawns can push on the next move

pleco_engine/src/search/mod.rs

@@ -293,7 +293,7 @@ impl Searcher {
 
     // The per thread searching function
     fn search_root(&mut self) {
-        // Early return. This shouldn't notmally happen.
+        // Early return. This shouldn't normally happen.
         if self.stop() {
             return;
         }
@@ -948,7 +948,7 @@ impl Searcher {
                         rm.score = NEG_INFINITE;
                     }
                 }
-                // If we have a new best move at root, update the nmber of best_move changes.
+                // If we have a new best move at root, update the number of best_move changes.
                 if incr_bmc {
                     self.best_move_changes += 1.0;
                 }

pleco_engine/src/tables/pawn_table.rs

@@ -377,7 +377,7 @@ impl PawnEntry {
             {
                 0 // Blocked By King
             } else if rk_us == Rank::R1 {
-                1 // Unopossed
+                1 // Unopposed
             } else if rk_them as u8 == rk_us as u8 + 1 {
                 2 // Blocked by Pawn
             } else {

pleco_engine/src/time/uci_timer.rs

@@ -25,7 +25,7 @@ impl LimitsType {
 #[derive(Clone)]
 pub struct UCITimer {
     pub time_msec: [i64; PLAYER_CNT], // time each player has remaining
-    pub inc_msec: [i64; PLAYER_CNT],  // increments for each palyer after each turn
+    pub inc_msec: [i64; PLAYER_CNT],  // increments for each player after each turn
     pub moves_to_go: u32,             // Moves to go until next time control sent
 }