/*
Stockfish, a UCI chess playing engine derived from Glaurung 2.1
- Copyright (C) 2004-2008 Tord Romstad (Glaurung author)
- Copyright (C) 2008-2015 Marco Costalba, Joona Kiiski, Tord Romstad
- Copyright (C) 2015-2019 Marco Costalba, Joona Kiiski, Gary Linscott, Tord Romstad
+ Copyright (C) 2004-2022 The Stockfish developers (see AUTHORS file)
Stockfish is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
#ifndef ENDGAME_H_INCLUDED
#define ENDGAME_H_INCLUDED
-#include <map>
#include <memory>
#include <string>
#include <type_traits>
+#include <unordered_map>
#include <utility>
#include "position.h"
#include "types.h"
+namespace Stockfish {
/// EndgameCode lists all supported endgame functions by corresponding codes
KBPKB, // KBP vs KB
KBPPKB, // KBPP vs KB
KBPKN, // KBP vs KN
- KNPK, // KNP vs K
- KNPKB, // KNP vs KB
KPKP // KP vs KP
};
};
-/// The Endgames class stores the pointers to endgame evaluation and scaling
+/// The Endgames namespace handles the pointers to endgame evaluation and scaling
/// base objects in two std::map. We use polymorphism to invoke the actual
/// endgame function by calling its virtual operator().
namespace Endgames {
template<typename T> using Ptr = std::unique_ptr<EndgameBase<T>>;
- template<typename T> using Map = std::map<Key, Ptr<T>>;
-
+ template<typename T> using Map = std::unordered_map<Key, Ptr<T>>;
+
extern std::pair<Map<Value>, Map<ScaleFactor>> maps;
+ void init();
+
template<typename T>
Map<T>& map() {
return std::get<std::is_same<T, ScaleFactor>::value>(maps);
template<typename T>
const EndgameBase<T>* probe(Key key) {
- return map<T>().count(key) ? map<T>()[key].get() : nullptr;
+ auto it = map<T>().find(key);
+ return it != map<T>().end() ? it->second.get() : nullptr;
}
-
- void init();
}
+} // namespace Stockfish
+
#endif // #ifndef ENDGAME_H_INCLUDED