use std::collections::HashMap;
use std::fmt::Display;
use ergotree_ir::mir::val_def::ValId;
use ergotree_ir::mir::value::Value;
#[derive(PartialEq, Eq, Debug, Clone)]
pub struct Env<'ctx> {
store: HashMap<ValId, Value<'ctx>>,
}
impl<'ctx> Env<'ctx> {
pub fn empty() -> Env<'ctx> {
Env {
store: HashMap::new(),
}
}
pub fn is_empty(&self) -> bool {
self.store.is_empty()
}
pub fn extend(&self, idx: ValId, v: Value<'ctx>) -> Env<'ctx> {
let mut new_store = self.store.clone();
new_store.insert(idx, v);
Env { store: new_store }
}
pub fn insert(&mut self, idx: ValId, v: Value<'ctx>) {
self.store.insert(idx, v);
}
pub fn remove(&mut self, idx: &ValId) {
self.store.remove(idx);
}
pub fn get(&self, idx: ValId) -> Option<&Value<'ctx>> {
self.store.get(&idx)
}
pub(crate) fn to_static(&'ctx self) -> Env<'static> {
Env {
store: self
.store
.iter()
.map(|(&k, v)| (k, v.to_static()))
.collect(),
}
}
}
impl Display for Env<'_> {
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
let mut keys: Vec<&ValId> = self.store.keys().collect();
keys.sort();
for k in keys {
writeln!(f, "v{}: {}", k, self.store[k])?;
}
Ok(())
}
}