* This class helps sorting the next moves * * You have to add moves first with their score * then you can get them back in decreasing score * * This class implement an insertion sort that is in practice very * efficient for small number of move to sort (max is Position::WIDTH) * and also efficient if the move are pushed in approximatively increasing * order which can be acheived by using a
source not stored for this graph (policy: none)
nothing calls this directly
no outgoing calls
no test coverage detected