1use crate::{evaluate_add_op, Binding, Result, Val};2use indexmap::IndexMap;3use jsonnet_parser::Visibility;4use std::{5 cell::RefCell,6 collections::{BTreeMap, HashMap},7 fmt::Debug,8 rc::Rc,9};1011#[derive(Debug)]12pub struct ObjMember {13 pub add: bool,14 pub visibility: Visibility,15 pub invoke: Binding,16}1718#[derive(Debug)]19pub struct ObjValueInternals {20 super_obj: Option<ObjValue>,21 this_entries: Rc<BTreeMap<String, ObjMember>>,22 value_cache: RefCell<HashMap<String, Val>>,23}24pub struct ObjValue(pub(crate) Rc<ObjValueInternals>);25impl Debug for ObjValue {26 fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {27 if let Some(super_obj) = self.0.super_obj.as_ref() {28 if f.alternate() {29 write!(f, "{:#?}", super_obj)?;30 } else {31 write!(f, "{:?}", super_obj)?;32 }33 write!(f, " + ")?;34 }35 let mut debug = f.debug_struct("ObjValue");36 for (name, member) in self.0.this_entries.iter() {37 debug.field(name, member);38 }39 debug.finish_non_exhaustive()40 }41}4243impl ObjValue {44 pub fn new(45 super_obj: Option<ObjValue>,46 this_entries: Rc<BTreeMap<String, ObjMember>>,47 ) -> ObjValue {48 ObjValue(Rc::new(ObjValueInternals {49 super_obj,50 this_entries,51 value_cache: RefCell::new(HashMap::new()),52 }))53 }54 pub fn with_super(&self, super_obj: ObjValue) -> ObjValue {55 match &self.0.super_obj {56 None => ObjValue::new(Some(super_obj), self.0.this_entries.clone()),57 Some(v) => ObjValue::new(Some(v.with_super(super_obj)), self.0.this_entries.clone()),58 }59 }60 pub fn enum_fields(&self, handler: &impl Fn(&str, &Visibility)) {61 if let Some(s) = &self.0.super_obj {62 s.enum_fields(handler);63 }64 for (name, member) in self.0.this_entries.iter() {65 handler(&name, &member.visibility);66 }67 }68 pub fn fields_visibility(&self) -> IndexMap<String, bool> {69 let out = Rc::new(RefCell::new(IndexMap::new()));70 self.enum_fields(&|name, visibility| {71 match visibility {72 Visibility::Normal => {73 if !out.borrow_mut().contains_key(name) {74 out.borrow_mut().insert(name.to_owned(), true);75 }76 }77 Visibility::Hidden => {78 out.borrow_mut().insert(name.to_owned(), false);79 }80 Visibility::Unhide => {81 out.borrow_mut().insert(name.to_owned(), true);82 }83 };84 });85 Rc::try_unwrap(out).unwrap().into_inner()86 }87 pub fn get(&self, key: &str) -> Result<Option<Val>> {88 if let Some(v) = self.0.value_cache.borrow().get(key) {89 return Ok(Some(v.clone()));90 }91 if let Some(v) = self.get_raw(key, self)? {92 let v = v.unwrap_if_lazy()?;93 self.094 .value_cache95 .borrow_mut()96 .insert(key.to_owned(), v.clone());97 Ok(Some(v))98 } else {99 Ok(None)100 }101 }102 pub(crate) fn get_raw(&self, key: &str, real_this: &ObjValue) -> Result<Option<Val>> {103 match (self.0.this_entries.get(key), &self.0.super_obj) {104 (Some(k), None) => Ok(Some(k.invoke.0(105 Some(real_this.clone()),106 self.0.super_obj.clone(),107 )?)),108 (Some(k), Some(s)) => {109 let our = k.invoke.0(Some(real_this.clone()), self.0.super_obj.clone())?;110 if k.add {111 s.get_raw(key, real_this)?112 .map_or(Ok(Some(our.clone())), |v| {113 Ok(Some(evaluate_add_op(&v, &our)?))114 })115 } else {116 Ok(Some(our))117 }118 }119 (None, Some(s)) => s.get_raw(key, real_this),120 (None, None) => Ok(None),121 }122 }123}124impl Clone for ObjValue {125 fn clone(&self) -> Self {126 ObjValue(self.0.clone())127 }128}129impl PartialEq for ObjValue {130 fn eq(&self, other: &Self) -> bool {131 Rc::ptr_eq(&self.0, &other.0)132 }133}