stak_native/
list.rs

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
use stak_vm::{Error, Memory, PrimitiveSet, Type};

/// A list primitive.
pub enum ListPrimitive {
    /// A `assq` procedure.
    Assq,
    /// A `cons` procedure.
    Cons,
    /// A `memq` procedure.
    Memq,
}

impl ListPrimitive {
    const ASSQ: usize = Self::Assq as _;
    const CONS: usize = Self::Cons as _;
    const MEMQ: usize = Self::Memq as _;
}

/// A list primitive set.
#[derive(Debug, Default)]
pub struct ListPrimitiveSet {}

impl ListPrimitiveSet {
    /// Creates a primitive set.
    pub fn new() -> Self {
        Self::default()
    }
}

impl PrimitiveSet for ListPrimitiveSet {
    type Error = Error;

    fn operate(&mut self, memory: &mut Memory, primitive: usize) -> Result<(), Self::Error> {
        match primitive {
            ListPrimitive::ASSQ => {
                let [x, xs] = memory.pop_many();
                let mut xs = xs.assume_cons();
                let mut y = memory.boolean(false);

                while xs != memory.null() {
                    let cons = memory.car(xs).assume_cons();

                    if x == memory.car(cons) {
                        y = cons;
                        break;
                    }

                    xs = memory.cdr(xs).assume_cons();
                }

                memory.push(y.into())?;
            }
            ListPrimitive::CONS => {
                let [car, cdr] = memory.pop_many();

                let rib = memory.allocate(car, cdr.set_tag(Type::Pair as _))?;
                memory.push(rib.into())?;
            }
            ListPrimitive::MEMQ => {
                let [x, xs] = memory.pop_many();
                let mut xs = xs.assume_cons();
                let mut y = memory.boolean(false);

                while xs != memory.null() {
                    if x == memory.car(xs) {
                        y = xs;
                        break;
                    }

                    xs = memory.cdr(xs).assume_cons();
                }

                memory.push(y.into())?;
            }
            _ => return Err(Error::IllegalPrimitive),
        }

        Ok(())
    }
}