tulisp 0.29.0

An embeddable lisp interpreter.
Documentation 
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
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122

use crate::{
    Error, TulispContext, TulispObject,
    bytecode::{Instruction, compiler::compiler::compile_expr, instruction::BinaryOp},
};

pub(super) fn compile_fn_plus(
    ctx: &mut TulispContext,
    _name: &TulispObject,
    args: &TulispObject,
) -> Result<Vec<Instruction>, Error> {
    let mut result = vec![];
    let args = args.base_iter().collect::<Vec<_>>();
    if args.is_empty() {
        // `(+)` => 0 (additive identity), matching Emacs.
        return Ok(if ctx.compiler.as_ref().unwrap().keep_result {
            vec![Instruction::Push(0.into())]
        } else {
            vec![]
        });
    }
    for arg in args.iter().rev() {
        result.append(&mut compile_expr(ctx, arg)?);
    }
    let compiler = ctx.compiler.as_mut().unwrap();
    if compiler.keep_result {
        for _ in 0..args.len() - 1 {
            result.push(Instruction::BinaryOp(BinaryOp::Add));
        }
    }
    Ok(result)
}

pub(super) fn compile_fn_minus(
    ctx: &mut TulispContext,
    _name: &TulispObject,
    args: &TulispObject,
) -> Result<Vec<Instruction>, Error> {
    let mut result = vec![];
    let args = args.base_iter().collect::<Vec<_>>();
    if args.is_empty() {
        // `(-)` => 0, matching Emacs.
        return Ok(if ctx.compiler.as_ref().unwrap().keep_result {
            vec![Instruction::Push(0.into())]
        } else {
            vec![]
        });
    }
    for arg in args.iter().rev() {
        result.append(&mut compile_expr(ctx, arg)?);
    }
    let compiler = ctx.compiler.as_mut().unwrap();
    if args.len() == 1 {
        if compiler.keep_result {
            result.push(Instruction::Push((-1).into()));
            result.push(Instruction::BinaryOp(BinaryOp::Mul));
        }
        return Ok(result);
    }
    if compiler.keep_result {
        for _ in 0..args.len() - 1 {
            result.push(Instruction::BinaryOp(BinaryOp::Sub));
        }
    }
    Ok(result)
}

pub(super) fn compile_fn_mul(
    ctx: &mut TulispContext,
    _name: &TulispObject,
    args: &TulispObject,
) -> Result<Vec<Instruction>, Error> {
    let mut result = vec![];
    let args = args.base_iter().collect::<Vec<_>>();
    if args.is_empty() {
        // `(*)` => 1 (multiplicative identity), matching Emacs.
        return Ok(if ctx.compiler.as_ref().unwrap().keep_result {
            vec![Instruction::Push(1.into())]
        } else {
            vec![]
        });
    }
    for arg in args.iter().rev() {
        result.append(&mut compile_expr(ctx, arg)?);
    }
    let compiler = ctx.compiler.as_mut().unwrap();
    if compiler.keep_result {
        for _ in 0..args.len() - 1 {
            result.push(Instruction::BinaryOp(BinaryOp::Mul));
        }
    }
    Ok(result)
}

pub(super) fn compile_fn_div(
    ctx: &mut TulispContext,
    _name: &TulispObject,
    args: &TulispObject,
) -> Result<Vec<Instruction>, Error> {
    let compiler = ctx.compiler.as_mut().unwrap();
    if !compiler.keep_result {
        return Ok(vec![]);
    }
    let mut result = vec![];
    let args = args.base_iter().collect::<Vec<_>>();
    if args.is_empty() {
        // `(/)` needs an argument (Emacs errors too); use the same
        // wording as the tree-walker builtin so both paths agree.
        return Err(Error::missing_argument("Too few arguments".to_string()));
    }
    for arg in args.iter().rev() {
        result.append(&mut compile_expr(ctx, arg)?);
    }
    if args.len() == 1 {
        result.push(Instruction::Push(1.into()));
        result.push(Instruction::BinaryOp(BinaryOp::Div));
        return Ok(result);
    }
    for _ in 0..args.len() - 1 {
        result.push(Instruction::BinaryOp(BinaryOp::Div));
    }
    Ok(result)
}