int score;
};
-// Note that operator< is set up such that std::sort() will sort in descending order
+// Note that operator< is set up such that sorting will be in descending order
inline bool operator<(const MoveStack& f, const MoveStack& s) { return s.score < f.score; }
+// Our stable insertion sort in range [firstMove, lastMove), platform independent
+template<typename T>
+inline void sort_moves(T* firstMove, T* lastMove)
+{
+ T value;
+ T *cur, *p, *d;
+
+ if (firstMove != lastMove)
+ for (cur = firstMove; ++cur != lastMove; )
+ {
+ p = d = cur;
+ value = *p--;
+ if (value < *p)
+ {
+ do *d = *p;
+ while (--d != firstMove && value < *--p);
+ *d = value;
+ }
+ }
+}
////
//// Inline functions
//// Includes
////
-#include <algorithm>
#include <cassert>
#include "history.h"
case PH_GOOD_CAPTURES:
lastMove = generate_captures(pos, moves);
score_captures();
- std::sort(moves, lastMove);
+ sort_moves(moves, lastMove);
return;
case PH_KILLERS:
case PH_NONCAPTURES:
lastMove = generate_noncaptures(pos, moves);
score_noncaptures();
- std::sort(moves, lastMove);
+ sort_moves(moves, lastMove);
return;
case PH_BAD_CAPTURES:
// to get SEE move ordering.
curMove = badCaptures;
lastMove = lastBadCapture;
- std::sort(badCaptures, lastMove);
+ sort_moves(badCaptures, lastMove);
return;
case PH_EVASIONS:
assert(pos.is_check());
lastMove = generate_evasions(pos, moves, pinned);
score_evasions();
- std::sort(moves, lastMove);
+ sort_moves(moves, lastMove);
return;
case PH_QCAPTURES:
lastMove = generate_captures(pos, moves);
score_captures();
- std::sort(moves, lastMove);
+ sort_moves(moves, lastMove);
return;
case PH_QCHECKS: