Struct Chance

pub struct Chance<'a> { /* private fields */ }

A chance node

A chance node represents a point in the game where things advance randomly, or alternatively, where “nature” takes a turn.

Implementations

impl<'a> Chance<'a>

pub fn name(&self) -> &'a EscapedStr

The name of the node

pub fn infoset(&self) -> u64

The if of the node’s infoset

pub fn infoset_name(&self) -> Option<&'a EscapedStr>

The infoset’s name

Note that just because this infoset doesn’t have a name attached, doesn’t mean that the same id doesn’t have a name attached at a different node.

pub fn actions(&self) -> &[(&'a EscapedStr, BigRational, Node<'a>)]

All possible outcomes with names and probabilities

pub fn outcome(&self) -> u64

The outcome id

pub fn outcome_payoffs(&self) -> Option<&[BigRational]>

Outcome payoffs for this node

Outcome payoffs are added to every players’ payoffs for traversing through this node. Note that if these are missing, they be defined at another node sharing the same outcome.

Trait Implementations

impl<'a> Clone for Chance<'a>

fn clone(&self) -> Chance<'a>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a> Debug for Chance<'a>

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

Formats the value using the given formatter.

impl<'a> Display for Chance<'a>

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

Formats the value using the given formatter.

impl<'a> PartialEq for Chance<'a>

fn eq(&self, other: &Chance<'a>) -> bool

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

const 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<'a> StructuralPartialEq for Chance<'a>