Struct TacticsOrder 

#[non_exhaustive]
pub struct TacticsOrder<H> {
    pub hooks: H,
    pub cap: usize,
}

A planner’s candidate order for grid games, in eight steps (the module’s docs): every piece’s best strike, the game’s pick, its extras, each piece’s advance and hold, the other strikes, the rest, and the end of the turn within cap.

Fields (Non-exhaustive)

Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.

hooks: H

What the order asks the game.

cap: usize

The most commands it lists; 0 counts as 1. The planner’s candidates.

Implementations

impl<H> TacticsOrder<H>

pub const fn new(hooks: H, cap: usize) -> Self

An order asking hooks, listing at most cap commands.

Trait Implementations

impl<H: Clone> Clone for TacticsOrder<H>

fn clone(&self) -> TacticsOrder<H>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<H: Debug> Debug for TacticsOrder<H>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<H: Eq> Eq for TacticsOrder<H>

impl<R, H> Order<R> for TacticsOrder<H>

where R: Sides, R::Command: PartialEq, H: OrderHooks<R>,

fn order(&mut self, rules: &R, commands: Vec<R::Command>) -> Vec<R::Command>

commands (the legal commands of rules), dropped and reordered.

impl<H: PartialEq> PartialEq for TacticsOrder<H>

fn eq(&self, other: &TacticsOrder<H>) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl<H: PartialEq> StructuralPartialEq for TacticsOrder<H>