mirror of
https://github.com/MaaAssistantArknights/MaaAssistantArknights.git
synced 2026-07-19 18:47:55 +08:00
384 lines
14 KiB
C++
384 lines
14 KiB
C++
#include "InfrastProductionTask.h"
|
||
|
||
#include <algorithm>
|
||
|
||
#include <calculator/calculator.hpp>
|
||
|
||
#include "Resource.h"
|
||
#include "Controller.h"
|
||
#include "InfrastSkillsImageAnalyzer.h"
|
||
#include "MultiMatchImageAnalyzer.h"
|
||
#include "MatchImageAnalyzer.h"
|
||
#include "AsstUtils.hpp"
|
||
#include "Logger.hpp"
|
||
#include "RuntimeStatus.h"
|
||
|
||
//bool asst::InfrastProductionTask::run()
|
||
//{
|
||
// json::value task_start_json = json::object{
|
||
// { "task_type", "InfrastProductionTask" },
|
||
// { "task_chain", m_task_chain}
|
||
// };
|
||
// m_callback(AsstMsg::TaskStart, task_start_json, m_callback_arg);
|
||
//
|
||
// m_all_available_opers.clear();
|
||
//
|
||
// swipe_to_the_left_of_operlist();
|
||
// bool ret = opers_detect_with_swipe();
|
||
//
|
||
// optimal_calc();
|
||
//
|
||
// opers_choose();
|
||
//
|
||
// return true;
|
||
//}
|
||
|
||
bool asst::InfrastProductionTask::shift_facility_list()
|
||
{
|
||
facility_list_detect();
|
||
|
||
const auto tab_task_ptr = std::dynamic_pointer_cast<MatchTaskInfo>(
|
||
resource.task().task_ptr("InfrastFacilityListTab" + m_facility));
|
||
MatchImageAnalyzer add_analyzer;
|
||
const auto add_task_ptr = std::dynamic_pointer_cast<MatchTaskInfo>(
|
||
resource.task().task_ptr("InfrastAddOperator" + m_facility));
|
||
add_analyzer.set_task_info(*add_task_ptr);
|
||
|
||
for (const Rect& tab : m_facility_list_tabs) {
|
||
ctrler.click(tab);
|
||
sleep(tab_task_ptr->rear_delay);
|
||
|
||
/* 识别当前制造/贸易站有没有添加干员按钮，没有就不换班 */
|
||
const auto& image = ctrler.get_image();
|
||
add_analyzer.set_image(image);
|
||
if (!add_analyzer.analyze()) {
|
||
continue;
|
||
}
|
||
Rect add_button = add_analyzer.get_result().rect;
|
||
|
||
/* 识别当前正在造什么 */
|
||
MatchImageAnalyzer product_analyzer(image);
|
||
auto& all_products = resource.infrast().get_facility_info(m_facility).products;
|
||
std::string cur_product;
|
||
for (const std::string& product : all_products) {
|
||
const static std::string prefix = "InfrastFlag";
|
||
const auto task_ptr = std::dynamic_pointer_cast<MatchTaskInfo>(
|
||
resource.task().task_ptr(prefix + product));
|
||
product_analyzer.set_task_info(*task_ptr);
|
||
if (product_analyzer.analyze()) {
|
||
cur_product = product;
|
||
break;
|
||
}
|
||
}
|
||
set_product(cur_product);
|
||
/* 进入干员选择页面 */
|
||
ctrler.click(add_button);
|
||
sleep(add_task_ptr->rear_delay);
|
||
click_clear_button();
|
||
swipe_to_the_left_of_operlist();
|
||
|
||
if (m_all_available_opers.empty()) {
|
||
opers_detect_with_swipe();
|
||
swipe_to_the_left_of_operlist();
|
||
}
|
||
else {
|
||
opers_detect();
|
||
}
|
||
optimal_calc();
|
||
opers_choose();
|
||
click_confirm_button();
|
||
}
|
||
return true;
|
||
}
|
||
|
||
bool asst::InfrastProductionTask::opers_detect_with_swipe()
|
||
{
|
||
m_all_available_opers.clear();
|
||
|
||
int first_number = 0;
|
||
while (true) {
|
||
size_t num = opers_detect();
|
||
|
||
// 这里本来是判断不相等就可以退出循环。
|
||
// 但是有时候滑动会把一个干员挡住一半，一个页面完整的干员真的只有10个，所以加个2的差值
|
||
if (max_num_of_opers_per_page - num > 2) {
|
||
break;
|
||
}
|
||
|
||
// 异步在最后会多滑动一下，耽误的时间还不如用同步
|
||
sync_swipe_of_operlist();
|
||
}
|
||
|
||
if (!m_all_available_opers.empty()) {
|
||
return true;
|
||
}
|
||
return false;
|
||
}
|
||
|
||
size_t asst::InfrastProductionTask::opers_detect()
|
||
{
|
||
const auto& image = ctrler.get_image();
|
||
|
||
InfrastSkillsImageAnalyzer skills_analyzer(image);
|
||
skills_analyzer.set_facility(m_facility);
|
||
|
||
if (!skills_analyzer.analyze()) {
|
||
return 0;
|
||
}
|
||
const auto& cur_all_info = skills_analyzer.get_result();
|
||
max_num_of_opers_per_page = (std::max)(max_num_of_opers_per_page, cur_all_info.size());
|
||
|
||
for (const auto& cur_info : cur_all_info) {
|
||
auto find_iter = std::find_if(m_all_available_opers.cbegin(), m_all_available_opers.cend(),
|
||
[&cur_info](const InfrastOperSkillInfo& info) -> bool {
|
||
int dist = utils::hamming(cur_info.hash, info.hash);
|
||
return dist < HashDistThres;
|
||
});
|
||
// 如果两个的hash距离过小，则认为是同一个干员，不进行插入
|
||
if (find_iter != m_all_available_opers.cend()) {
|
||
continue;
|
||
}
|
||
auto pred_info = cur_info;
|
||
// 根据正则，计算当前干员的实际效率
|
||
for (auto&& [product, formula] : pred_info.skills_comb.efficient_regex) {
|
||
std::string cur_formula = formula;
|
||
for (size_t pos = 0; pos != std::string::npos;) {
|
||
pos = cur_formula.find('[', pos);
|
||
if (pos == std::string::npos) {
|
||
break;
|
||
}
|
||
size_t rp_pos = cur_formula.find(']', pos);
|
||
if (rp_pos == std::string::npos) {
|
||
break;
|
||
// TODO 报错！
|
||
}
|
||
std::string status_key = cur_formula.substr(pos + 1, rp_pos - pos - 1);
|
||
int status_value = std::any_cast<int>(status.get(status_key));
|
||
cur_formula.replace(pos, rp_pos - pos + 1, std::to_string(status_value));
|
||
}
|
||
|
||
int eff = calculator::eval(cur_formula);
|
||
pred_info.skills_comb.efficient[product] = eff;
|
||
}
|
||
m_all_available_opers.emplace_back(std::move(pred_info));
|
||
}
|
||
return cur_all_info.size();
|
||
}
|
||
|
||
bool asst::InfrastProductionTask::optimal_calc()
|
||
{
|
||
auto& facility_info = resource.infrast().get_facility_info(m_facility);
|
||
int max_num_of_opers = facility_info.max_num_of_opers;
|
||
|
||
if (m_all_available_opers.size() < max_num_of_opers) {
|
||
return false;
|
||
}
|
||
|
||
// 先把单个的技能按效率排个序，取效率最高的几个
|
||
std::vector<InfrastOperSkillInfo> optimal_opers;
|
||
optimal_opers.reserve(max_num_of_opers);
|
||
double max_efficient = 0;
|
||
std::sort(m_all_available_opers.begin(), m_all_available_opers.end(),
|
||
[&](const InfrastOperSkillInfo& lhs, const InfrastOperSkillInfo& rhs) -> bool {
|
||
return lhs.skills_comb.efficient.at(m_product) > rhs.skills_comb.efficient.at(m_product);
|
||
});
|
||
|
||
for (const auto& oper : m_all_available_opers) {
|
||
std::string skill_str;
|
||
for (const auto& skill : oper.skills_comb.skills) {
|
||
skill_str += skill.id + " ";
|
||
}
|
||
log.trace(skill_str, oper.skills_comb.efficient.at(m_product));
|
||
}
|
||
|
||
for (int i = 0; i != max_num_of_opers; ++i) {
|
||
optimal_opers.emplace_back(m_all_available_opers.at(i));
|
||
max_efficient += m_all_available_opers.at(i).skills_comb.efficient.at(m_product);
|
||
}
|
||
|
||
{
|
||
std::string log_str = "[ ";
|
||
for (const auto& oper : optimal_opers) {
|
||
log_str += oper.skills_comb.intro.empty() ? oper.skills_comb.skills.begin()->names.front() : oper.skills_comb.intro;
|
||
log_str += "; ";
|
||
}
|
||
log_str += "]";
|
||
log.trace("Single comb efficient", max_efficient, " , skills:", log_str);
|
||
}
|
||
|
||
// 遍历所有组合，找到效率最高的
|
||
auto& all_group = resource.infrast().get_skills_group(m_facility);
|
||
for (const InfrastSkillsGroup& group : all_group) {
|
||
auto cur_available_opers = m_all_available_opers;
|
||
bool group_unavailable = false;
|
||
std::vector<InfrastOperSkillInfo> cur_opers;
|
||
cur_opers.reserve(max_num_of_opers);
|
||
double cur_efficient = 0;
|
||
// 条件判断，不符合的直接过滤掉
|
||
for (const auto& [cond, cond_value] : group.conditions) {
|
||
if (!status.exist(cond)) {
|
||
continue;
|
||
}
|
||
// TODO：这里做成除了不等于，还可计算大于、小于等不同条件的
|
||
int cur_value = std::any_cast<int>(status.get(cond));
|
||
if (cur_value != cond_value) {
|
||
continue;
|
||
}
|
||
}
|
||
// necessary里的技能，一个都不能少
|
||
for (const InfrastSkillsComb& nec_skills : group.necessary) {
|
||
auto find_iter = std::find_if(cur_available_opers.cbegin(), cur_available_opers.cend(),
|
||
[&](const InfrastOperSkillInfo& arg) -> bool {
|
||
return arg.skills_comb == nec_skills;
|
||
});
|
||
if (find_iter == cur_available_opers.cend()) {
|
||
group_unavailable = true;
|
||
break;
|
||
}
|
||
cur_opers.emplace_back(nec_skills);
|
||
cur_efficient += nec_skills.efficient.at(m_product);
|
||
cur_available_opers.erase(find_iter);
|
||
}
|
||
if (group_unavailable) {
|
||
continue;
|
||
}
|
||
// 排个序，因为产物不同，效率可能会发生变化，所以配置文件里默认的顺序不一定准确
|
||
auto optional = group.optional;
|
||
std::sort(optional.begin(), optional.end(),
|
||
[&](const InfrastSkillsComb& lhs, const InfrastSkillsComb& rhs) -> bool {
|
||
return lhs.efficient.at(m_product) > rhs.efficient.at(m_product);
|
||
});
|
||
|
||
// 可能有多个干员有同样的技能，所以这里需要循环找同一个技能，直到找不到为止
|
||
for (const InfrastSkillsComb& opt : optional) {
|
||
auto find_iter = cur_available_opers.cbegin();
|
||
while (cur_opers.size() != max_num_of_opers) {
|
||
find_iter = std::find_if(find_iter, cur_available_opers.cend(),
|
||
[&](const InfrastOperSkillInfo& arg) -> bool {
|
||
return arg.skills_comb.skills == opt.skills;
|
||
});
|
||
if (find_iter != cur_available_opers.cend()) {
|
||
cur_opers.emplace_back(opt);
|
||
cur_efficient += opt.efficient.at(m_product);
|
||
find_iter = cur_available_opers.erase(find_iter);
|
||
}
|
||
else {
|
||
break;
|
||
}
|
||
}
|
||
}
|
||
|
||
// 说明可选的没凑满人
|
||
if (cur_opers.size() < max_num_of_opers) {
|
||
// 允许外部的话，就把单个干员凑进来
|
||
if (group.allow_external) {
|
||
for (size_t i = cur_opers.size(); i != max_num_of_opers; ++i) {
|
||
cur_opers.emplace_back(cur_available_opers.at(i));
|
||
cur_efficient += cur_available_opers.at(i).skills_comb.efficient.at(m_product);
|
||
}
|
||
}
|
||
else { // 否则这个组合人不够，就不可用了
|
||
continue;
|
||
}
|
||
}
|
||
{
|
||
std::string log_str = "[ ";
|
||
for (const auto& oper : cur_opers) {
|
||
log_str += oper.skills_comb.intro.empty() ? oper.skills_comb.skills.begin()->names.front() : oper.skills_comb.intro;
|
||
log_str += "; ";
|
||
}
|
||
log_str += "]";
|
||
log.trace(group.intro, "efficient", cur_efficient, " , skills:", log_str);
|
||
}
|
||
|
||
if (cur_efficient > max_efficient) {
|
||
optimal_opers = std::move(cur_opers);
|
||
max_efficient = cur_efficient;
|
||
}
|
||
}
|
||
{
|
||
std::string log_str = "[ ";
|
||
for (const auto& oper : optimal_opers) {
|
||
log_str += oper.skills_comb.intro.empty() ? oper.skills_comb.skills.begin()->names.front() : oper.skills_comb.intro;
|
||
log_str += "; ";
|
||
}
|
||
log_str += "]";
|
||
log.trace("optimal efficient", max_efficient, " , skills:", log_str);
|
||
}
|
||
|
||
m_optimal_opers = std::move(optimal_opers);
|
||
|
||
return true;
|
||
}
|
||
|
||
bool asst::InfrastProductionTask::opers_choose()
|
||
{
|
||
while (true) {
|
||
const auto& image = ctrler.get_image();
|
||
|
||
InfrastSkillsImageAnalyzer skills_analyzer(image);
|
||
skills_analyzer.set_facility(m_facility);
|
||
|
||
if (!skills_analyzer.analyze()) {
|
||
return false;
|
||
}
|
||
auto cur_all_info = skills_analyzer.get_result();
|
||
|
||
std::vector<std::string> selected_hash;
|
||
for (auto opt_iter = m_optimal_opers.begin(); opt_iter != m_optimal_opers.end();) {
|
||
auto find_iter = std::find_if(cur_all_info.cbegin(), cur_all_info.cend(),
|
||
[&](const InfrastOperSkillInfo& lhs) -> bool {
|
||
return lhs.skills_comb == opt_iter->skills_comb;
|
||
});
|
||
if (find_iter == cur_all_info.cend()) {
|
||
++opt_iter;
|
||
continue;
|
||
}
|
||
if (find_iter->selected == true) {
|
||
continue;
|
||
}
|
||
ctrler.click(find_iter->rect);
|
||
selected_hash.emplace_back(find_iter->hash);
|
||
{
|
||
auto avlb_iter = std::find_if(m_all_available_opers.cbegin(), m_all_available_opers.cend(),
|
||
[&](const InfrastOperSkillInfo& lhs) -> bool {
|
||
return lhs.skills_comb == opt_iter->skills_comb;
|
||
});
|
||
m_all_available_opers.erase(avlb_iter);
|
||
}
|
||
cur_all_info.erase(find_iter);
|
||
opt_iter = m_optimal_opers.erase(opt_iter);
|
||
}
|
||
if (m_optimal_opers.empty()) {
|
||
break;
|
||
}
|
||
|
||
// 因为识别完了还要点击，所以这里不能异步滑动
|
||
sync_swipe_of_operlist();
|
||
}
|
||
|
||
return true;
|
||
}
|
||
|
||
bool asst::InfrastProductionTask::facility_list_detect()
|
||
{
|
||
m_facility_list_tabs.clear();
|
||
|
||
const auto& image = ctrler.get_image();
|
||
MultiMatchImageAnalyzer mm_analyzer(image);
|
||
|
||
const auto task_ptr = std::dynamic_pointer_cast<MatchTaskInfo>(
|
||
resource.task().task_ptr("InfrastFacilityListTab" + m_facility));
|
||
mm_analyzer.set_task_info(*task_ptr);
|
||
|
||
if (!mm_analyzer.analyze()) {
|
||
return false;
|
||
}
|
||
mm_analyzer.sort_result();
|
||
m_facility_list_tabs.reserve(mm_analyzer.get_result().size());
|
||
for (const auto& res : mm_analyzer.get_result()) {
|
||
m_facility_list_tabs.emplace_back(res.rect);
|
||
}
|
||
|
||
return true;
|
||
} |