use crate::content::identity::Identity;
use std::cmp::Reverse;
use std::collections::BinaryHeap;
use std::marker::PhantomData;
pub(crate) struct Slots<I, T> {
entries: Vec<Option<(u64, T)>>,
free: BinaryHeap<Reverse<usize>>,
identity: PhantomData<I>,
}
impl<I: Identity, T> Default for Slots<I, T> {
fn default() -> Self {
Self {
entries: Vec::new(),
free: BinaryHeap::new(),
identity: PhantomData,
}
}
}
impl<I: Identity, T> Slots<I, T> {
pub fn next_index(&self) -> usize {
self.free
.peek()
.map_or(self.entries.len(), |Reverse(index)| *index)
}
pub fn insert(&mut self, value: T) -> I {
let index = match self.free.pop() {
Some(Reverse(index)) => index,
None => {
self.entries.push(None);
self.entries.len() - 1
}
};
let generation = super::next_generation();
self.entries[index] = Some((generation, value));
I::issue(index, generation)
}
pub fn get(&self, id: I) -> Option<&T> {
match self.entries.get(id.index()) {
Some(Some((generation, value))) if *generation == id.generation() => Some(value),
_ => None,
}
}
pub fn get_mut(&mut self, id: I) -> Option<&mut T> {
match self.entries.get_mut(id.index()) {
Some(Some((generation, value))) if *generation == id.generation() => Some(value),
_ => None,
}
}
pub fn remove(&mut self, id: I) -> Option<T> {
self.get(id)?;
let (_, value) = self.entries[id.index()].take()?;
self.free.push(Reverse(id.index()));
Some(value)
}
pub fn is_empty(&self) -> bool {
self.free.len() == self.entries.len()
}
pub fn at(&self, index: usize) -> Option<&T> {
self.entries.get(index)?.as_ref().map(|(_, value)| value)
}
pub fn iter(&self) -> impl Iterator<Item = (I, &T)> {
self.entries
.iter()
.enumerate()
.filter_map(|(index, entry)| {
entry
.as_ref()
.map(|(generation, value)| (I::issue(index, *generation), value))
})
}
pub fn iter_mut(&mut self) -> impl Iterator<Item = (I, &mut T)> {
self.entries
.iter_mut()
.enumerate()
.filter_map(|(index, entry)| {
entry
.as_mut()
.map(|(generation, value)| (I::issue(index, *generation), value))
})
}
}