Struct FairQueue 

pub struct FairQueue<V: FairGroup> { /* private fields */ }

Spatially distancing fair queue. First in, first out, ensuring that each group of similar values is placed as far apart as possible.

Implementations

impl<V: FairGroup> FairQueue<V>

pub fn new(max_group_size: usize) -> Self

pub fn can_insert(&self, value: &V) -> bool

Check if a value can be inserted without exceeding group limits

pub fn insert(&mut self, value: Arc<V>) -> bool

Inserts a new item into the queue, ensuring spatial distancing between items of the same group. Returns true if inserted successfully, false if group is full.

pub fn pop(&mut self) -> Option<Arc<V>>