1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30

use super::*;
use crate::state::movescan::Move;
use crate::utils::assert_fast;
use crate::MoveScores;
use crate::Moves;

/// Performs a selection sort on `moves` and `move_scores` arrays with the length specified in `moves_count`, starting from `start_index`.
/// When it completes, the move and corresponding score will be under `start_index` - the function also explicitly returns both of them.
pub fn sort_next_move(moves: &mut Moves, move_scores: &mut MoveScores, start_index: usize, moves_count: usize) -> (Move, i16) {
    assert_fast!(start_index < MAX_MOVES_COUNT);
    assert_fast!(start_index <= moves_count);

    let mut best_score = unsafe { move_scores[start_index].assume_init() };
    let mut best_index = start_index;

    for index in (start_index + 1)..moves_count {
        assert_fast!(index < MAX_MOVES_COUNT);

        let score = unsafe { move_scores[index].assume_init() };
        if score > best_score {
            best_score = score;
            best_index = index;
        }
    }

    moves.swap(start_index, best_index);
    move_scores.swap(start_index, best_index);

    unsafe { (moves[start_index].assume_init(), best_score) }
}