use crate::db::data::{CanonicalRow, DataKey, RawDataKey, RawRow};
use canic_cdk::structures::{BTreeMap, DefaultMemoryImpl, memory::VirtualMemory};
use derive_more::Deref;
#[derive(Deref)]
pub struct DataStore(BTreeMap<RawDataKey, RawRow, VirtualMemory<DefaultMemoryImpl>>);
impl DataStore {
#[must_use]
pub fn init(memory: VirtualMemory<DefaultMemoryImpl>) -> Self {
Self(BTreeMap::init(memory))
}
pub(in crate::db) fn insert(&mut self, key: RawDataKey, row: CanonicalRow) -> Option<RawRow> {
self.0.insert(key, row.into_raw_row())
}
#[cfg(test)]
pub(crate) fn insert_raw_for_test(&mut self, key: RawDataKey, row: RawRow) -> Option<RawRow> {
self.0.insert(key, row)
}
pub fn remove(&mut self, key: &RawDataKey) -> Option<RawRow> {
self.0.remove(key)
}
pub fn get(&self, key: &RawDataKey) -> Option<RawRow> {
self.0.get(key)
}
#[must_use]
pub fn contains(&self, key: &RawDataKey) -> bool {
self.0.contains_key(key)
}
pub fn clear(&mut self) {
self.0.clear();
}
pub fn memory_bytes(&self) -> u64 {
self.iter()
.map(|entry| DataKey::STORED_SIZE_BYTES + entry.value().len() as u64)
.sum()
}
}