partially inline struct Engine

lib/search/engine.rs

@@ -37,6 +37,7 @@ pub struct Engine {
 }
 
 impl Default for Engine {
+    #[inline(always)]
     fn default() -> Self {
         Self::new()
     }
@@ -50,11 +51,13 @@ impl Engine {
     }
 
     /// Initializes the engine with the default [`Options`].
+    #[inline(always)]
     pub fn new() -> Self {
         Self::with_options(Options::default())
     }
 
     /// Initializes the engine with the given [`Options`].
+    #[inline(always)]
     pub fn with_options(options: Options) -> Self {
         Engine {
             tt: TranspositionTable::new(options.hash),
@@ -90,6 +93,7 @@ impl Engine {
     /// An implementation of [mate distance pruning].
     ///
     /// [mate distance pruning]: https://www.chessprogramming.org/Mate_Distance_Pruning
+    #[inline(always)]
     fn mdp(&self, ply: Ply, bounds: &Range<Score>) -> (Score, Score) {
         let lower = Score::LOWER.normalize(ply);
         let upper = (Score::UPPER - 1).normalize(ply); // One can't mate in 0 plies!
@@ -101,6 +105,7 @@ impl Engine {
     /// An implementation of [null move pruning].
     ///
     /// [null move pruning]: https://www.chessprogramming.org/Null_Move_Pruning
+    #[inline(always)]
     fn nmp(&self, pos: &Position, guess: Score, beta: Score, depth: Depth) -> Option<Depth> {
         let turn = pos.turn();
         let r = match pos.by_color(turn).len() - pos.by_piece(Piece(turn, Role::Pawn)).len() {
@@ -120,6 +125,7 @@ impl Engine {
     /// An implementation of [late move pruning].
     ///
     /// [late move pruning]: https://www.chessprogramming.org/Late_Move_Reductions
+    #[inline(always)]
     fn lmp(&self, next: &Position, guess: Score, alpha: Score, depth: Depth) -> Option<Depth> {
         let r = match (alpha - guess).get() {
             ..=90 => return None,