mod error;
use error::Error;
use itertools::Itertools;
use std::{cell::RefCell, collections::HashMap};
pub struct Memory {
index: RefCell<HashMap<String, i64>>,
}
impl Default for Memory {
fn default() -> Self {
Self::new()
}
}
impl Memory {
pub fn new() -> Self {
Self {
index: RefCell::new(HashMap::new()),
}
}
pub fn add(&self, request: String, id: i64) -> Result<(), Error> {
let mut index = self.index.borrow_mut();
if index.contains_key(&request) {
return Err(Error::Overwrite(request));
}
match index.insert(request, id) {
Some(_) => Err(Error::Unexpected),
None => Ok(()),
}
}
pub fn delete(&self, request: &str) -> Result<(), Error> {
match self.index.borrow_mut().remove(request) {
Some(_) => Ok(()),
None => Err(Error::Unexpected), }
}
pub fn get(&self, request: &str) -> Result<i64, Error> {
match self.index.borrow().get(request) {
Some(&value) => Ok(value),
None => Err(Error::Unexpected), }
}
pub fn recent(&self) -> Vec<String> {
let mut recent: Vec<String> = Vec::new();
for (request, _) in self
.index
.borrow()
.iter()
.sorted_by(|a, b| Ord::cmp(&b.1, &a.1))
{
recent.push(request.to_string())
}
recent
}
pub fn total(&self) -> usize {
self.index.borrow().len()
}
}