Endgame-Analyzer/include/download.h

51 lines
1.6 KiB
C++

#ifndef DYNAMIC_PROGRAM_DOWNLOAD_H
#define DYNAMIC_PROGRAM_DOWNLOAD_H
#include <iostream>
#include <variant>
#include <vector>
#include <memory>
#include <boost/json.hpp>
#include "game_state.h"
#include "myassert.h"
namespace Hanabi {
Card tag_invoke(boost::json::value_to_tag<Card>, boost::json::value const &jv);
void tag_invoke(boost::json::value_from_tag, boost::json::value &jv, Hanabi::Card const &card);
}
namespace Download {
struct Action {
Hanabi::ActionType type{};
int8_t target{};
};
Action tag_invoke(boost::json::value_to_tag<Action>, boost::json::value const &jv);
std::pair<std::vector<Hanabi::Card>, Hanabi::rank_t> parse_deck(const boost::json::value &deck_json);
std::vector<Action> parse_actions(const boost::json::value &action_json);
std::optional<boost::json::object> download_game_json(int game_id);
std::optional<boost::json::object> open_game_json(const char *filename);
/**
* @brief Create game object from given source
* @param game_spec Either an id to download from hanab.live or a filename with a json specification
* @param score_goal What score counts as a win for this game. If left empty, the maximum score is inserted.
* @return Game state
*
* If both turn and draw_pile_break are specified, the game skips until the specified turn or the first time the
* draw pile hits the given size, whichever comes first
*
*/
Hanabi::Game get_game(std::variant<int, const char*> game_spec, std::optional<uint8_t> score_goal);
} // namespace Download
#endif // DYNAMIC_PROGRAM_DOWNLOAD_H