载入中...
搜索中...
未找到
Pluggable deterministic turn-scheduling policies. 更多...
#include "common/Result.h"#include "tactics/TacticsTypes.h"#include <map>#include <memory>#include <string>#include <string_view>#include <vector>类 | |
| struct | eve::tactics::UnitOrder |
| The scheduling projection a policy is allowed to compare. 更多... | |
| struct | eve::tactics::ChargeModel |
| The charge rule a policy declares for round scheduling. 更多... | |
| class | eve::tactics::ITurnPolicy |
| One deterministic unit-activation ordering strategy. 更多... | |
| class | eve::tactics::TurnPolicyRegistry |
| Registry of turn policies keyed by stable id. 更多... | |
命名空间 | |
| namespace | eve |
| Build metadata (engine git commit, build time, third-party version). | |
| namespace | eve::tactics |
枚举 | |
| enum class | eve::tactics::TurnOrder : std::uint8_t { eve::tactics::LeftFirst , eve::tactics::RightFirst , eve::tactics::Equivalent } |
| The total order a policy reports for one pair of units. 更多... | |
详细描述
Pluggable deterministic turn-scheduling policies.
The battle stores only a stable string id; the behaviour behind that id is resolved from a registry. That split is what keeps persistent data readable by a build that does not link a given project policy: an unknown id is a structured failure at resolve time, never a silently different schedule.
在文件 TurnPolicy.h 中定义.