Struct ActivePlayers 

pub struct ActivePlayers(/* private fields */);

An ordered, deterministic set of players who owe a decision.

Wraps a BTreeSet so iteration order is stable (ascending by seat index) rather than the per-process random order of a hashed set. Determinism is the engine’s core promise, so ordering is part of the observable contract: two replays of the same seed and inputs must visit active players in the same order. The backing collection is intentionally not exposed.

Cardinality carries meaning:

• empty during engine-only resolution steps (adjudicating simultaneous orders, running a deterministic resolution pass),
• one for strictly alternating games (the common case),
• many during simultaneous or secret phases.

Implementations

impl ActivePlayers

pub const fn none() -> Self

Returns the empty set (no player owes a decision).

pub fn one(player: PlayerId) -> Self

Returns a singleton set containing just player.

pub fn all(num_players: u32) -> Self

Returns the set of all real seats 0..num_players.

Does not include PlayerId::CHANCE.

pub fn contains(&self, player: PlayerId) -> bool

Returns true if player owes a decision.

pub fn len(&self) -> usize

Returns the number of active players.

pub fn is_empty(&self) -> bool

Returns true if no player owes a decision.

pub fn iter(&self) -> impl Iterator<Item = PlayerId> + '_

Iterates the active players in ascending seat order.

Trait Implementations

impl Clone for ActivePlayers

fn clone(&self) -> ActivePlayers

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ActivePlayers

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

Formats the value using the given formatter.

impl Default for ActivePlayers

fn default() -> ActivePlayers

Returns the “default value” for a type.

impl FromIterator<PlayerId> for ActivePlayers

fn from_iter<I: IntoIterator<Item = PlayerId>>(iter: I) -> Self

Creates a value from an iterator.

impl<'a> IntoIterator for &'a ActivePlayers

type Item = PlayerId

The type of the elements being iterated over.

type IntoIter = Copied<Iter<'a, PlayerId>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl PartialEq for ActivePlayers

fn eq(&self, other: &ActivePlayers) -> bool

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for ActivePlayers

impl StructuralPartialEq for ActivePlayers