ralix 0.2.0

A simple, type-safe, tree walking interpreter
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23

use std::collections::HashMap;

use crate::{EvalResult, Evaluator, HashPair, Value, expressions::HashMapItem, try_eval_result};

impl Evaluator<'_> {
    pub fn evaluate_hashmap_literal(&mut self, items: Vec<HashMapItem>) -> EvalResult<Value> {
        let mut hash_map = HashMap::new();

        for i in items {
            let key_obj = try_eval_result!(self.evaluate_expression(i.key));
            let value_obj = try_eval_result!(self.evaluate_expression(i.value));

            let hash_key = key_obj.hash_key().unwrap();

            let key_addr = self.ctx.heap.alloc(key_obj);
            let value_addr = self.ctx.heap.alloc(value_obj);

            hash_map.insert(hash_key, HashPair::from((key_addr, value_addr)));
        }

        EvalResult::Value(Value::HashMap(hash_map))
    }
}