Struct ConcurrentReplayBuffer 

pub struct ConcurrentReplayBuffer { /* private fields */ }

Thread-safe concurrent replay buffer backed by parking_lot::Mutex.

Multiple actor threads can push transitions concurrently. A single learner thread samples batches.

parking_lot::Mutex is ~2x faster than std::Mutex on uncontended locks (~10ns), which is negligible compared to the data copy cost of each push.

Thread Safety

Automatically Send + Sync because Mutex<T: Send> is Send + Sync.

Implementations

impl ConcurrentReplayBuffer

pub fn new(capacity: usize, obs_dim: usize, act_dim: usize) -> Self

Create a concurrent replay buffer with fixed capacity.

All arrays are pre-allocated inside the inner ReplayBuffer. obs_dim and act_dim define the per-transition dimensionality.

pub fn push( &self, obs: &[f32], next_obs: &[f32], action: &[f32], reward: f32, terminated: bool, truncated: bool, ) -> Result<(), RloxError>

Push a transition into the buffer from borrowed slices.

Thread-safe: multiple threads may call push concurrently.

pub fn sample( &self, batch_size: usize, seed: u64, ) -> Result<SampledBatch, RloxError>

Sample a batch of transitions uniformly at random.

Uses ChaCha8Rng seeded with seed for deterministic cross-platform reproducibility.

pub fn len(&self) -> usize

Number of transitions currently stored.

This is always <= capacity.

pub fn is_empty(&self) -> bool

Whether the buffer has no transitions.

pub fn capacity(&self) -> usize

Maximum number of transitions the buffer can hold.