1use std::cmp::Ordering;
19use std::collections::HashMap;
20use std::rc::Rc;
21
22use crate::nan_value::{Arena, NanValue};
23use crate::value::{RuntimeError, Value, aver_repr, list_from_vec, list_view};
24
25pub fn register(global: &mut HashMap<String, Value>) {
26 let mut members = HashMap::new();
27 for method in &[
28 "empty", "set", "get", "remove", "has", "keys", "values", "entries", "len", "fromList",
29 ] {
30 members.insert(
31 method.to_string(),
32 Value::Builtin(format!("Map.{}", method)),
33 );
34 }
35 global.insert(
36 "Map".to_string(),
37 Value::Namespace {
38 name: "Map".to_string(),
39 members,
40 },
41 );
42}
43
44pub fn effects(_name: &str) -> &'static [&'static str] {
45 &[]
46}
47
48pub fn call(name: &str, args: &[Value]) -> Option<Result<Value, RuntimeError>> {
50 match name {
51 "Map.empty" => Some(empty(args)),
52 "Map.set" => Some(set(args)),
53 "Map.get" => Some(get(args)),
54 "Map.remove" => Some(remove(args)),
55 "Map.has" => Some(has(args)),
56 "Map.keys" => Some(keys(args)),
57 "Map.values" => Some(values(args)),
58 "Map.entries" => Some(entries(args)),
59 "Map.len" => Some(len(args)),
60 "Map.fromList" => Some(from_list(args)),
61 _ => None,
62 }
63}
64
65fn empty(args: &[Value]) -> Result<Value, RuntimeError> {
66 if !args.is_empty() {
67 return Err(RuntimeError::Error(format!(
68 "Map.empty() takes 0 arguments, got {}",
69 args.len()
70 )));
71 }
72 Ok(Value::Map(HashMap::new()))
73}
74
75fn set(args: &[Value]) -> Result<Value, RuntimeError> {
76 let [map_val, key, value] = three_args("Map.set", args)?;
77 let Value::Map(map) = map_val else {
78 return Err(RuntimeError::Error(
79 "Map.set() first argument must be a Map".to_string(),
80 ));
81 };
82 ensure_hashable_key("Map.set", key)?;
83 let mut out = map.clone();
84 out.insert(key.clone(), value.clone());
85 Ok(Value::Map(out))
86}
87
88fn get(args: &[Value]) -> Result<Value, RuntimeError> {
89 let [map_val, key] = two_args("Map.get", args)?;
90 let Value::Map(map) = map_val else {
91 return Err(RuntimeError::Error(
92 "Map.get() first argument must be a Map".to_string(),
93 ));
94 };
95 ensure_hashable_key("Map.get", key)?;
96 Ok(match map.get(key) {
97 Some(v) => Value::Some(Box::new(v.clone())),
98 None => Value::None,
99 })
100}
101
102fn remove(args: &[Value]) -> Result<Value, RuntimeError> {
103 let [map_val, key] = two_args("Map.remove", args)?;
104 let Value::Map(map) = map_val else {
105 return Err(RuntimeError::Error(
106 "Map.remove() first argument must be a Map".to_string(),
107 ));
108 };
109 ensure_hashable_key("Map.remove", key)?;
110 let mut out = map.clone();
111 out.remove(key);
112 Ok(Value::Map(out))
113}
114
115fn has(args: &[Value]) -> Result<Value, RuntimeError> {
116 let [map_val, key] = two_args("Map.has", args)?;
117 let Value::Map(map) = map_val else {
118 return Err(RuntimeError::Error(
119 "Map.has() first argument must be a Map".to_string(),
120 ));
121 };
122 ensure_hashable_key("Map.has", key)?;
123 Ok(Value::Bool(map.contains_key(key)))
124}
125
126fn keys(args: &[Value]) -> Result<Value, RuntimeError> {
127 let [map_val] = one_arg("Map.keys", args)?;
128 let Value::Map(map) = map_val else {
129 return Err(RuntimeError::Error(
130 "Map.keys() argument must be a Map".to_string(),
131 ));
132 };
133 let mut out = map.keys().cloned().collect::<Vec<_>>();
134 out.sort_by(compare_scalar_keys);
135 Ok(list_from_vec(out))
136}
137
138fn values(args: &[Value]) -> Result<Value, RuntimeError> {
139 let [map_val] = one_arg("Map.values", args)?;
140 let Value::Map(map) = map_val else {
141 return Err(RuntimeError::Error(
142 "Map.values() argument must be a Map".to_string(),
143 ));
144 };
145 let mut entries = map.iter().collect::<Vec<_>>();
146 entries.sort_by(|(k1, _), (k2, _)| compare_scalar_keys(k1, k2));
147 let out = entries
148 .into_iter()
149 .map(|(_, v)| v.clone())
150 .collect::<Vec<_>>();
151 Ok(list_from_vec(out))
152}
153
154fn entries(args: &[Value]) -> Result<Value, RuntimeError> {
155 let [map_val] = one_arg("Map.entries", args)?;
156 let Value::Map(map) = map_val else {
157 return Err(RuntimeError::Error(
158 "Map.entries() argument must be a Map".to_string(),
159 ));
160 };
161 let mut entries = map.iter().collect::<Vec<_>>();
162 entries.sort_by(|(k1, _), (k2, _)| compare_scalar_keys(k1, k2));
163 let out = entries
164 .into_iter()
165 .map(|(k, v)| Value::Tuple(vec![k.clone(), v.clone()]))
166 .collect::<Vec<_>>();
167 Ok(list_from_vec(out))
168}
169
170fn len(args: &[Value]) -> Result<Value, RuntimeError> {
171 let [map_val] = one_arg("Map.len", args)?;
172 let Value::Map(map) = map_val else {
173 return Err(RuntimeError::Error(
174 "Map.len() argument must be a Map".to_string(),
175 ));
176 };
177 Ok(Value::Int(map.len() as i64))
178}
179
180fn from_list(args: &[Value]) -> Result<Value, RuntimeError> {
181 let [pairs] = one_arg("Map.fromList", args)?;
182 let items = list_view(pairs).ok_or_else(|| {
183 RuntimeError::Error(
184 "Map.fromList() argument must be a List of (key, value) tuples".to_string(),
185 )
186 })?;
187
188 let mut out = HashMap::new();
189 for (idx, pair) in items.iter().enumerate() {
190 let Value::Tuple(parts) = pair else {
191 return Err(RuntimeError::Error(format!(
192 "Map.fromList() item {} must be (key, value)",
193 idx + 1
194 )));
195 };
196 if parts.len() != 2 {
197 return Err(RuntimeError::Error(format!(
198 "Map.fromList() item {} must have 2 elements",
199 idx + 1
200 )));
201 }
202
203 let key = &parts[0];
204 let value = &parts[1];
205 ensure_hashable_key("Map.fromList", key)?;
206 out.insert(key.clone(), value.clone());
207 }
208 Ok(Value::Map(out))
209}
210
211fn is_hashable_key(value: &Value) -> bool {
212 matches!(
213 value,
214 Value::Int(_) | Value::Float(_) | Value::Str(_) | Value::Bool(_)
215 )
216}
217
218fn ensure_hashable_key(name: &str, value: &Value) -> Result<(), RuntimeError> {
219 if is_hashable_key(value) {
220 Ok(())
221 } else {
222 Err(RuntimeError::Error(format!(
223 "{}: key must be Int, Float, String, or Bool",
224 name
225 )))
226 }
227}
228
229fn compare_scalar_keys(a: &Value, b: &Value) -> Ordering {
230 match (a, b) {
231 (Value::Int(x), Value::Int(y)) => x.cmp(y),
232 (Value::Float(x), Value::Float(y)) => x.partial_cmp(y).unwrap_or_else(|| {
233 let xb = x.to_bits();
234 let yb = y.to_bits();
235 xb.cmp(&yb)
236 }),
237 (Value::Str(x), Value::Str(y)) => x.cmp(y),
238 (Value::Bool(x), Value::Bool(y)) => x.cmp(y),
239 _ => aver_repr(a).cmp(&aver_repr(b)),
240 }
241}
242
243fn one_arg<'a>(name: &str, args: &'a [Value]) -> Result<[&'a Value; 1], RuntimeError> {
244 if args.len() != 1 {
245 return Err(RuntimeError::Error(format!(
246 "{}() takes 1 argument, got {}",
247 name,
248 args.len()
249 )));
250 }
251 Ok([&args[0]])
252}
253
254fn two_args<'a>(name: &str, args: &'a [Value]) -> Result<[&'a Value; 2], RuntimeError> {
255 if args.len() != 2 {
256 return Err(RuntimeError::Error(format!(
257 "{}() takes 2 arguments, got {}",
258 name,
259 args.len()
260 )));
261 }
262 Ok([&args[0], &args[1]])
263}
264
265fn three_args<'a>(name: &str, args: &'a [Value]) -> Result<[&'a Value; 3], RuntimeError> {
266 if args.len() != 3 {
267 return Err(RuntimeError::Error(format!(
268 "{}() takes 3 arguments, got {}",
269 name,
270 args.len()
271 )));
272 }
273 Ok([&args[0], &args[1], &args[2]])
274}
275
276pub fn register_nv(global: &mut HashMap<String, NanValue>, arena: &mut Arena) {
279 let methods = &[
280 "empty", "set", "get", "remove", "has", "keys", "values", "entries", "len", "fromList",
281 ];
282 let mut members: Vec<(Rc<str>, NanValue)> = Vec::with_capacity(methods.len());
283 for method in methods {
284 let idx = arena.push_builtin(&format!("Map.{}", method));
285 members.push((Rc::from(*method), NanValue::new_builtin(idx)));
286 }
287 let ns_idx = arena.push(crate::nan_value::ArenaEntry::Namespace {
288 name: Rc::from("Map"),
289 members,
290 });
291 global.insert("Map".to_string(), NanValue::new_namespace(ns_idx));
292}
293
294pub fn call_nv(
295 name: &str,
296 args: &[NanValue],
297 arena: &mut Arena,
298) -> Option<Result<NanValue, RuntimeError>> {
299 match name {
300 "Map.empty" => Some(empty_nv(args, arena)),
301 "Map.set" => Some(set_nv(args, arena)),
302 "Map.get" => Some(get_nv(args, arena)),
303 "Map.remove" => Some(remove_nv(args, arena)),
304 "Map.has" => Some(has_nv(args, arena)),
305 "Map.keys" => Some(keys_nv(args, arena)),
306 "Map.values" => Some(values_nv(args, arena)),
307 "Map.entries" => Some(entries_nv(args, arena)),
308 "Map.len" => Some(len_nv(args, arena)),
309 "Map.fromList" => Some(from_list_nv(args, arena)),
310 _ => None,
311 }
312}
313
314fn is_hashable_nv(v: NanValue) -> bool {
315 v.is_int() || v.is_float() || v.is_string() || v.is_bool()
316}
317
318fn ensure_hashable_nv(name: &str, v: NanValue) -> Result<(), RuntimeError> {
319 if is_hashable_nv(v) {
320 Ok(())
321 } else {
322 Err(RuntimeError::Error(format!(
323 "{}: key must be Int, Float, String, or Bool",
324 name
325 )))
326 }
327}
328
329fn nv_key_bits(v: NanValue, arena: &Arena) -> u64 {
330 v.map_key_hash(arena)
331}
332
333fn empty_nv(args: &[NanValue], arena: &mut Arena) -> Result<NanValue, RuntimeError> {
334 if !args.is_empty() {
335 return Err(RuntimeError::Error(format!(
336 "Map.empty() takes 0 arguments, got {}",
337 args.len()
338 )));
339 }
340 let _ = arena;
341 Ok(NanValue::EMPTY_MAP)
342}
343
344fn set_nv(args: &[NanValue], arena: &mut Arena) -> Result<NanValue, RuntimeError> {
345 if args.len() != 3 {
346 return Err(RuntimeError::Error(format!(
347 "Map.set() takes 3 arguments, got {}",
348 args.len()
349 )));
350 }
351 if !args[0].is_map() {
352 return Err(RuntimeError::Error(
353 "Map.set() first argument must be a Map".to_string(),
354 ));
355 }
356 ensure_hashable_nv("Map.set", args[1])?;
357 let old_map = arena.clone_map_value(args[0]);
358 let key_hash = nv_key_bits(args[1], arena);
359 let new_map = old_map.insert(key_hash, (args[1], args[2]));
360 let map_idx = arena.push_map(new_map);
361 Ok(NanValue::new_map(map_idx))
362}
363
364fn get_nv(args: &[NanValue], arena: &mut Arena) -> Result<NanValue, RuntimeError> {
365 if args.len() != 2 {
366 return Err(RuntimeError::Error(format!(
367 "Map.get() takes 2 arguments, got {}",
368 args.len()
369 )));
370 }
371 if !args[0].is_map() {
372 return Err(RuntimeError::Error(
373 "Map.get() first argument must be a Map".to_string(),
374 ));
375 }
376 ensure_hashable_nv("Map.get", args[1])?;
377 let key_hash = nv_key_bits(args[1], arena);
378 let map = arena.map_ref_value(args[0]);
379 match map.get(&key_hash) {
380 Some((_, v)) => Ok(NanValue::new_some_value(*v, arena)),
381 None => Ok(NanValue::NONE),
382 }
383}
384
385fn remove_nv(args: &[NanValue], arena: &mut Arena) -> Result<NanValue, RuntimeError> {
386 if args.len() != 2 {
387 return Err(RuntimeError::Error(format!(
388 "Map.remove() takes 2 arguments, got {}",
389 args.len()
390 )));
391 }
392 if !args[0].is_map() {
393 return Err(RuntimeError::Error(
394 "Map.remove() first argument must be a Map".to_string(),
395 ));
396 }
397 ensure_hashable_nv("Map.remove", args[1])?;
398 let old_map = arena.clone_map_value(args[0]);
399 let key_hash = nv_key_bits(args[1], arena);
400 let new_map = old_map.remove(&key_hash);
401 if new_map.is_empty() {
402 Ok(NanValue::EMPTY_MAP)
403 } else {
404 let map_idx = arena.push_map(new_map);
405 Ok(NanValue::new_map(map_idx))
406 }
407}
408
409fn has_nv(args: &[NanValue], arena: &mut Arena) -> Result<NanValue, RuntimeError> {
410 if args.len() != 2 {
411 return Err(RuntimeError::Error(format!(
412 "Map.has() takes 2 arguments, got {}",
413 args.len()
414 )));
415 }
416 if !args[0].is_map() {
417 return Err(RuntimeError::Error(
418 "Map.has() first argument must be a Map".to_string(),
419 ));
420 }
421 ensure_hashable_nv("Map.has", args[1])?;
422 let key_hash = nv_key_bits(args[1], arena);
423 let map = arena.map_ref_value(args[0]);
424 Ok(NanValue::new_bool(map.contains_key(&key_hash)))
425}
426
427fn keys_nv(args: &[NanValue], arena: &mut Arena) -> Result<NanValue, RuntimeError> {
428 if args.len() != 1 {
429 return Err(RuntimeError::Error(format!(
430 "Map.keys() takes 1 argument, got {}",
431 args.len()
432 )));
433 }
434 if !args[0].is_map() {
435 return Err(RuntimeError::Error(
436 "Map.keys() argument must be a Map".to_string(),
437 ));
438 }
439 let map = arena.clone_map_value(args[0]);
440 let mut keys: Vec<NanValue> = map.values().map(|(k, _)| *k).collect();
441 keys.sort_by_key(|a| a.repr(arena));
442 if keys.is_empty() {
443 return Ok(NanValue::EMPTY_LIST);
444 }
445 let list_idx = arena.push_list(keys);
446 Ok(NanValue::new_list(list_idx))
447}
448
449fn values_nv(args: &[NanValue], arena: &mut Arena) -> Result<NanValue, RuntimeError> {
450 if args.len() != 1 {
451 return Err(RuntimeError::Error(format!(
452 "Map.values() takes 1 argument, got {}",
453 args.len()
454 )));
455 }
456 if !args[0].is_map() {
457 return Err(RuntimeError::Error(
458 "Map.values() argument must be a Map".to_string(),
459 ));
460 }
461 let map = arena.clone_map_value(args[0]);
462 let mut entries: Vec<(NanValue, NanValue)> = map.values().cloned().collect();
463 entries.sort_by(|(a, _), (b, _)| a.repr(arena).cmp(&b.repr(arena)));
464 let vals: Vec<NanValue> = entries.into_iter().map(|(_, v)| v).collect();
465 if vals.is_empty() {
466 return Ok(NanValue::EMPTY_LIST);
467 }
468 let list_idx = arena.push_list(vals);
469 Ok(NanValue::new_list(list_idx))
470}
471
472fn entries_nv(args: &[NanValue], arena: &mut Arena) -> Result<NanValue, RuntimeError> {
473 if args.len() != 1 {
474 return Err(RuntimeError::Error(format!(
475 "Map.entries() takes 1 argument, got {}",
476 args.len()
477 )));
478 }
479 if !args[0].is_map() {
480 return Err(RuntimeError::Error(
481 "Map.entries() argument must be a Map".to_string(),
482 ));
483 }
484 let map = arena.clone_map_value(args[0]);
485 let mut entries: Vec<(NanValue, NanValue)> = map.values().cloned().collect();
486 entries.sort_by(|(a, _), (b, _)| a.repr(arena).cmp(&b.repr(arena)));
487 let pairs: Vec<NanValue> = entries
488 .into_iter()
489 .map(|(k, v)| {
490 let tuple_idx = arena.push_tuple(vec![k, v]);
491 NanValue::new_tuple(tuple_idx)
492 })
493 .collect();
494 if pairs.is_empty() {
495 return Ok(NanValue::EMPTY_LIST);
496 }
497 let list_idx = arena.push_list(pairs);
498 Ok(NanValue::new_list(list_idx))
499}
500
501fn len_nv(args: &[NanValue], arena: &mut Arena) -> Result<NanValue, RuntimeError> {
502 if args.len() != 1 {
503 return Err(RuntimeError::Error(format!(
504 "Map.len() takes 1 argument, got {}",
505 args.len()
506 )));
507 }
508 if !args[0].is_map() {
509 return Err(RuntimeError::Error(
510 "Map.len() argument must be a Map".to_string(),
511 ));
512 }
513 let map = arena.map_ref_value(args[0]);
514 Ok(NanValue::new_int(map.len() as i64, arena))
515}
516
517fn from_list_nv(args: &[NanValue], arena: &mut Arena) -> Result<NanValue, RuntimeError> {
518 if args.len() != 1 {
519 return Err(RuntimeError::Error(format!(
520 "Map.fromList() takes 1 argument, got {}",
521 args.len()
522 )));
523 }
524 if !args[0].is_list() {
525 return Err(RuntimeError::Error(
526 "Map.fromList() argument must be a List of (key, value) tuples".to_string(),
527 ));
528 }
529 let items = arena.list_to_vec_value(args[0]);
530 let mut out = crate::nan_value::PersistentMap::new();
531 for (idx, pair) in items.iter().enumerate() {
532 if !pair.is_tuple() {
533 return Err(RuntimeError::Error(format!(
534 "Map.fromList() item {} must be (key, value)",
535 idx + 1
536 )));
537 }
538 let parts = arena.get_tuple(pair.arena_index());
539 if parts.len() != 2 {
540 return Err(RuntimeError::Error(format!(
541 "Map.fromList() item {} must have 2 elements",
542 idx + 1
543 )));
544 }
545 let key = parts[0];
546 let value = parts[1];
547 ensure_hashable_nv("Map.fromList", key)?;
548 let key_hash = nv_key_bits(key, arena);
549 out = out.insert(key_hash, (key, value));
550 }
551 if out.is_empty() {
552 Ok(NanValue::EMPTY_MAP)
553 } else {
554 let map_idx = arena.push_map(out);
555 Ok(NanValue::new_map(map_idx))
556 }
557}