#[non_exhaustive]pub struct AutobalanceInput {
pub stage: Option<String>,
pub entrants: Vec<String>,
pub tries: Option<u32>,
pub quick: Option<u32>,
pub budget: Option<u32>,
pub time: Option<u64>,
pub seed: Option<u64>,
pub turns: Option<u32>,
pub threads: Option<u32>,
pub apply: bool,
pub start: Vec<GameArg>,
}Expand description
What autobalance searches. A number left out is the default: the
game’s for the tries (GameTools::playtest_defaults), the engine’s
for the rest.
Fields (Non-exhaustive)§
This struct is marked as non-exhaustive
Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.stage: Option<String>The stage, one of the game’s; needed when it has several.
entrants: Vec<String>The entrants that play, by name or by a group’s name; the game’s default ones if empty.
tries: Option<u32>How many tries of each entrant decide whether a stage is in its bands: the stage as authored and the one found play this many.
quick: Option<u32>The tries of each entrant in the search’s own runs, from the same
first seed: a fifth of tries (at least 1) if left out.
budget: Option<u32>The most evaluations (each a run of every entrant’s tries), the stage as authored’s among them: 100 if left out.
time: Option<u64>Stop the search after this many seconds, with the best setting
seen (whose run at tries still follows); no limit if left out.
What it finds then depends on the machine.
seed: Option<u64>The first try’s seed; each next try takes the next.
turns: Option<u32>The turn a try stops at if it hasn’t ended.
threads: Option<u32>The threads to play on; one a core if left out. What it finds never depends on it.
apply: boolHave the game write the changed stage to its files. This writes files of the game.
start: Vec<GameArg>The game’s own options, in the order given.
Implementations§
Trait Implementations§
Source§impl Clone for AutobalanceInput
impl Clone for AutobalanceInput
Source§fn clone(&self) -> AutobalanceInput
fn clone(&self) -> AutobalanceInput
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreSource§impl Debug for AutobalanceInput
impl Debug for AutobalanceInput
Source§impl Default for AutobalanceInput
impl Default for AutobalanceInput
Source§fn default() -> AutobalanceInput
fn default() -> AutobalanceInput
Source§impl<'de> Deserialize<'de> for AutobalanceInputwhere
AutobalanceInput: Default,
impl<'de> Deserialize<'de> for AutobalanceInputwhere
AutobalanceInput: Default,
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
impl Eq for AutobalanceInput
Source§impl JsonSchema for AutobalanceInput
impl JsonSchema for AutobalanceInput
Source§fn schema_id() -> Cow<'static, str>
fn schema_id() -> Cow<'static, str>
Source§fn json_schema(generator: &mut SchemaGenerator) -> Schema
fn json_schema(generator: &mut SchemaGenerator) -> Schema
Source§fn inline_schema() -> bool
fn inline_schema() -> bool
$ref keyword. Read moreSource§impl PartialEq for AutobalanceInput
impl PartialEq for AutobalanceInput
Source§impl Serialize for AutobalanceInput
impl Serialize for AutobalanceInput
impl StructuralPartialEq for AutobalanceInput
Auto Trait Implementations§
impl Freeze for AutobalanceInput
impl RefUnwindSafe for AutobalanceInput
impl Send for AutobalanceInput
impl Sync for AutobalanceInput
impl Unpin for AutobalanceInput
impl UnsafeUnpin for AutobalanceInput
impl UnwindSafe for AutobalanceInput
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.