Struct Armies 

pub struct Armies { /* private fields */ }

Manages all fighters across all teams in the game.

The Armies struct provides a centralized collection of all fighters, indexed by their unique u64 ID. It supports adding, removing, and querying fighters regardless of which team they belong to.

Example

use liquidwar7core::{Armies, Fighter};

let mut armies = Armies::new();
let team_id = 0x1234567890abcdef_u64;
// Fighter::new(team_id, x, y, z, gradient_index, health)
let fighter = Fighter::new(team_id, 5.0, 5.0, 0.5, 0, 1.0);
let fighter_id = armies.add_fighter(fighter);

assert_eq!(armies.fighter_count(), 1);
assert!(armies.get_fighter(&fighter_id).is_some());

Implementations

impl Armies

pub fn new() -> Self

Creates a new empty Armies collection.

pub fn add_fighter(&mut self, fighter: Fighter) -> u64

Adds a fighter to the collection and returns its unique ID.

A new random u64 ID is generated, with collision checking.

pub fn set_fighter(&mut self, id: u64, fighter: Fighter)

Inserts or updates a fighter with a specific ID.

Used for network sync where fighter IDs must match across server and clients.

pub fn remove_fighter(&mut self, id: &u64) -> Option<Fighter>

Removes a fighter from the collection by its ID.

Returns the removed fighter if it existed, or None if not found.

pub fn get_fighter(&self, id: &u64) -> Option<&Fighter>

Returns a reference to the fighter with the given ID.

Returns None if no fighter with that ID exists.

pub fn get_fighter_mut(&mut self, id: &u64) -> Option<&mut Fighter>

Returns a mutable reference to the fighter with the given ID.

Returns None if no fighter with that ID exists.

pub fn fighter_count(&self) -> usize

Returns the total number of fighters in the collection.

pub fn iter(&self, odd_even: bool) -> impl Iterator<Item = (&u64, &Fighter)>

Returns an iterator over all fighters and their IDs, sorted by ID.

The sorting ensures deterministic iteration order across different program instances processing similar data.

Arguments

• odd_even - If true, reverses the sort order to avoid systematic bias

pub fn iter_mut( &mut self, odd_even: bool, ) -> impl Iterator<Item = (&u64, &mut Fighter)>

Returns a mutable iterator over all fighters and their IDs, sorted by ID.

The sorting ensures deterministic iteration order across different program instances processing similar data.

Arguments

• odd_even - If true, reverses the sort order to avoid systematic bias

pub fn unsorted_iter(&self) -> impl Iterator<Item = &Fighter>

Returns an unsorted iterator over all fighters (values only).

Use this when order doesn’t matter and you only need fighter data. This is faster than iter() which sorts by ID.

pub fn unsorted_iter_with_ids(&self) -> impl Iterator<Item = (&u64, &Fighter)>

Returns an unsorted iterator over all fighters with their IDs.

Use this when order doesn’t matter but you need both IDs and fighter data. This is faster than iter() which sorts by ID.

Trait Implementations

impl Clone for Armies

fn clone(&self) -> Armies

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Armies

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

Formats the value using the given formatter.

impl Default for Armies

fn default() -> Self

Returns the “default value” for a type.

impl Display for Armies

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

Formats the value using the given formatter.

impl PartialEq for Armies

fn eq(&self, other: &Armies) -> 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 Armies

impl StructuralPartialEq for Armies