|
| 1 | +use crate::{ |
| 2 | + core::{Expr, JSObjectData, JSObjectDataPtr, PropertyKey, Value, evaluate_expr, obj_set_value}, |
| 3 | + error::JSError, |
| 4 | + raise_eval_error, |
| 5 | +}; |
| 6 | +use std::cell::RefCell; |
| 7 | +use std::rc::Rc; |
| 8 | + |
| 9 | +use crate::core::JSMap; |
| 10 | + |
| 11 | +/// Handle Map constructor calls |
| 12 | +pub(crate) fn handle_map_constructor(args: &[Expr], env: &JSObjectDataPtr) -> Result<Value, JSError> { |
| 13 | + let map = Rc::new(RefCell::new(JSMap { entries: Vec::new() })); |
| 14 | + |
| 15 | + if !args.is_empty() { |
| 16 | + if args.len() == 1 { |
| 17 | + // Map(iterable) |
| 18 | + let iterable = evaluate_expr(env, &args[0])?; |
| 19 | + match iterable { |
| 20 | + Value::Object(obj) => { |
| 21 | + // Try to iterate over the object |
| 22 | + // For now, assume it's an array-like or has entries |
| 23 | + // TODO: Implement proper iteration protocol |
| 24 | + let mut i = 0; |
| 25 | + loop { |
| 26 | + let key = format!("{}", i); |
| 27 | + if let Some(entry_val) = obj_get_value(&obj, &key.into())? { |
| 28 | + let entry = entry_val.borrow().clone(); |
| 29 | + if let Value::Object(entry_obj) = entry |
| 30 | + && let (Some(key_val), Some(value_val)) = |
| 31 | + (obj_get_value(&entry_obj, &"0".into())?, obj_get_value(&entry_obj, &"1".into())?) |
| 32 | + { |
| 33 | + map.borrow_mut() |
| 34 | + .entries |
| 35 | + .push((key_val.borrow().clone(), value_val.borrow().clone())); |
| 36 | + } |
| 37 | + } else { |
| 38 | + break; |
| 39 | + } |
| 40 | + i += 1; |
| 41 | + } |
| 42 | + } |
| 43 | + _ => { |
| 44 | + return Err(raise_eval_error!("Map constructor requires an iterable")); |
| 45 | + } |
| 46 | + } |
| 47 | + } else { |
| 48 | + return Err(raise_eval_error!("Map constructor takes at most one argument")); |
| 49 | + } |
| 50 | + } |
| 51 | + |
| 52 | + Ok(Value::Map(map)) |
| 53 | +} |
| 54 | + |
| 55 | +/// Handle Map instance method calls |
| 56 | +pub(crate) fn handle_map_instance_method( |
| 57 | + map: &Rc<RefCell<JSMap>>, |
| 58 | + method: &str, |
| 59 | + args: &[Expr], |
| 60 | + env: &JSObjectDataPtr, |
| 61 | +) -> Result<Value, JSError> { |
| 62 | + match method { |
| 63 | + "set" => { |
| 64 | + if args.len() != 2 { |
| 65 | + return Err(raise_eval_error!("Map.prototype.set requires exactly two arguments")); |
| 66 | + } |
| 67 | + let key = evaluate_expr(env, &args[0])?; |
| 68 | + let value = evaluate_expr(env, &args[1])?; |
| 69 | + |
| 70 | + // Remove existing entry with same key |
| 71 | + map.borrow_mut().entries.retain(|(k, _)| !values_equal(k, &key)); |
| 72 | + // Add new entry |
| 73 | + map.borrow_mut().entries.push((key, value)); |
| 74 | + |
| 75 | + Ok(Value::Map(map.clone())) |
| 76 | + } |
| 77 | + "get" => { |
| 78 | + if args.len() != 1 { |
| 79 | + return Err(raise_eval_error!("Map.prototype.get requires exactly one argument")); |
| 80 | + } |
| 81 | + let key = evaluate_expr(env, &args[0])?; |
| 82 | + |
| 83 | + for (k, v) in &map.borrow().entries { |
| 84 | + if values_equal(k, &key) { |
| 85 | + return Ok(v.clone()); |
| 86 | + } |
| 87 | + } |
| 88 | + Ok(Value::Undefined) |
| 89 | + } |
| 90 | + "has" => { |
| 91 | + if args.len() != 1 { |
| 92 | + return Err(raise_eval_error!("Map.prototype.has requires exactly one argument")); |
| 93 | + } |
| 94 | + let key = evaluate_expr(env, &args[0])?; |
| 95 | + |
| 96 | + let has_key = map.borrow().entries.iter().any(|(k, _)| values_equal(k, &key)); |
| 97 | + Ok(Value::Boolean(has_key)) |
| 98 | + } |
| 99 | + "delete" => { |
| 100 | + if args.len() != 1 { |
| 101 | + return Err(raise_eval_error!("Map.prototype.delete requires exactly one argument")); |
| 102 | + } |
| 103 | + let key = evaluate_expr(env, &args[0])?; |
| 104 | + |
| 105 | + let initial_len = map.borrow().entries.len(); |
| 106 | + map.borrow_mut().entries.retain(|(k, _)| !values_equal(k, &key)); |
| 107 | + let deleted = map.borrow().entries.len() < initial_len; |
| 108 | + |
| 109 | + Ok(Value::Boolean(deleted)) |
| 110 | + } |
| 111 | + "clear" => { |
| 112 | + if !args.is_empty() { |
| 113 | + return Err(raise_eval_error!("Map.prototype.clear takes no arguments")); |
| 114 | + } |
| 115 | + map.borrow_mut().entries.clear(); |
| 116 | + Ok(Value::Undefined) |
| 117 | + } |
| 118 | + "size" => { |
| 119 | + if !args.is_empty() { |
| 120 | + return Err(raise_eval_error!("Map.prototype.size is a getter")); |
| 121 | + } |
| 122 | + Ok(Value::Number(map.borrow().entries.len() as f64)) |
| 123 | + } |
| 124 | + "keys" => { |
| 125 | + if !args.is_empty() { |
| 126 | + return Err(raise_eval_error!("Map.prototype.keys takes no arguments")); |
| 127 | + } |
| 128 | + // Create an array of keys |
| 129 | + let keys_array = Rc::new(RefCell::new(JSObjectData::new())); |
| 130 | + for (i, (key, _)) in map.borrow().entries.iter().enumerate() { |
| 131 | + obj_set_value(&keys_array, &i.to_string().into(), key.clone())?; |
| 132 | + } |
| 133 | + // Set length |
| 134 | + obj_set_value(&keys_array, &"length".into(), Value::Number(map.borrow().entries.len() as f64))?; |
| 135 | + Ok(Value::Object(keys_array)) |
| 136 | + } |
| 137 | + "values" => { |
| 138 | + if !args.is_empty() { |
| 139 | + return Err(raise_eval_error!("Map.prototype.values takes no arguments")); |
| 140 | + } |
| 141 | + // Create an array of values |
| 142 | + let values_array = Rc::new(RefCell::new(JSObjectData::new())); |
| 143 | + for (i, (_, value)) in map.borrow().entries.iter().enumerate() { |
| 144 | + obj_set_value(&values_array, &i.to_string().into(), value.clone())?; |
| 145 | + } |
| 146 | + // Set length |
| 147 | + obj_set_value(&values_array, &"length".into(), Value::Number(map.borrow().entries.len() as f64))?; |
| 148 | + Ok(Value::Object(values_array)) |
| 149 | + } |
| 150 | + "entries" => { |
| 151 | + if !args.is_empty() { |
| 152 | + return Err(raise_eval_error!("Map.prototype.entries takes no arguments")); |
| 153 | + } |
| 154 | + // Create an array of [key, value] pairs |
| 155 | + let entries_array = Rc::new(RefCell::new(JSObjectData::new())); |
| 156 | + for (i, (key, value)) in map.borrow().entries.iter().enumerate() { |
| 157 | + let entry_array = Rc::new(RefCell::new(JSObjectData::new())); |
| 158 | + obj_set_value(&entry_array, &"0".into(), key.clone())?; |
| 159 | + obj_set_value(&entry_array, &"1".into(), value.clone())?; |
| 160 | + obj_set_value(&entry_array, &"length".into(), Value::Number(2.0))?; |
| 161 | + obj_set_value(&entries_array, &i.to_string().into(), Value::Object(entry_array))?; |
| 162 | + } |
| 163 | + // Set length |
| 164 | + obj_set_value(&entries_array, &"length".into(), Value::Number(map.borrow().entries.len() as f64))?; |
| 165 | + Ok(Value::Object(entries_array)) |
| 166 | + } |
| 167 | + _ => Err(raise_eval_error!(format!("Map.prototype.{} is not implemented", method))), |
| 168 | + } |
| 169 | +} |
| 170 | + |
| 171 | +// Helper function to compare two values for equality (simplified version) |
| 172 | +fn values_equal(a: &Value, b: &Value) -> bool { |
| 173 | + match (a, b) { |
| 174 | + (Value::Number(na), Value::Number(nb)) => na == nb, |
| 175 | + (Value::String(sa), Value::String(sb)) => sa == sb, |
| 176 | + (Value::Boolean(ba), Value::Boolean(bb)) => ba == bb, |
| 177 | + (Value::Undefined, Value::Undefined) => true, |
| 178 | + (Value::Symbol(sa), Value::Symbol(sb)) => Rc::ptr_eq(sa, sb), |
| 179 | + _ => false, // For objects, we use reference equality |
| 180 | + } |
| 181 | +} |
| 182 | + |
| 183 | +// Helper function to get object property value |
| 184 | +fn obj_get_value(js_obj: &JSObjectDataPtr, key: &PropertyKey) -> Result<Option<Rc<RefCell<Value>>>, JSError> { |
| 185 | + let mut current: Option<JSObjectDataPtr> = Some(js_obj.clone()); |
| 186 | + while let Some(cur) = current { |
| 187 | + if let Some(val) = cur.borrow().properties.get(key) { |
| 188 | + return Ok(Some(val.clone())); |
| 189 | + } |
| 190 | + current = cur.borrow().prototype.clone(); |
| 191 | + } |
| 192 | + Ok(None) |
| 193 | +} |
0 commit comments