use std::collections::HashMap; #[derive(Debug)] pub struct Register { name: char, values: Vec, } impl Register { pub const fn new(name: char) -> Self { Self { name, values: Vec::new(), } } pub fn new_with_values(name: char, values: Vec) -> Self { if name == '_' { Self::new(name) } else { Self { name, values } } } pub const fn name(&self) -> char { self.name } pub fn read(&self) -> &[String] { &self.values } pub fn write(&mut self, values: Vec) { if self.name != '_' { self.values = values; } } pub fn push(&mut self, value: String) { if self.name != '_' { self.values.push(value); } } } /// Currently just wraps a `HashMap` of `Register`s #[derive(Debug, Default)] pub struct Registers { inner: HashMap, } impl Registers { pub fn get(&self, name: char) -> Option<&Register> { self.inner.get(&name) } pub fn get_mut(&mut self, name: char) -> &mut Register { self.inner .entry(name) .or_insert_with(|| Register::new(name)) } pub fn write(&mut self, name: char, values: Vec) { self.inner .insert(name, Register::new_with_values(name, values)); } pub fn read(&self, name: char) -> Option<&[String]> { self.get(name).map(|reg| reg.read()) } pub fn inner(&self) -> &HashMap { &self.inner } }