Struct VecStore 

pub struct VecStore<A: Agent> { /* private fields */ }

Dense vector-based agent store.

Uses agent IDs as indices into a Vec<Option<RefCell<A>>>. Provides faster iteration than HashMapStore when IDs form a dense, contiguous range starting near 0.

Iteration order is ascending by agent ID, which makes it suitable for deterministic workflows when paired with deterministic stepping logic.

Inserting an agent with a large ID will grow the internal vector to accommodate it, potentially wasting memory for sparse ID spaces.

Implementations

impl<A: Agent> VecStore<A>

pub fn new() -> Self

Create an empty VecStore.

Trait Implementations

impl<A: Agent> AgentStore<A> for VecStore<A>

fn get(&self, id: AgentId) -> Option<Ref<'_, A>>

Borrow an agent immutably by ID.

fn get_mut(&self, id: AgentId) -> Option<RefMut<'_, A>>

Borrow an agent mutably by ID.

fn insert(&mut self, agent: A)

Insert an agent into the store.

fn remove(&mut self, id: AgentId) -> Option<A>

Remove and return an agent by ID, or None if not found.

fn iter_ids(&self) -> Vec<AgentId>

Collect all agent IDs into a new Vec.

fn iter_ids_into(&self, buf: &mut Vec<AgentId>)

Append all agent IDs into buf without clearing it first.

fn len(&self) -> usize

Number of agents in the store.

fn contains(&self, id: AgentId) -> bool

Check whether an agent with the given ID exists.

fn is_empty(&self) -> bool

Returns true if the store contains no agents.

impl<A: Debug + Agent> Debug for VecStore<A>

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

Formats the value using the given formatter.

impl<A: Default + Agent> Default for VecStore<A>

fn default() -> VecStore<A>

Returns the “default value” for a type.