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
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
|
#![allow(dead_code)]
use std::rc::Rc;
use std::cell::RefCell;
use std::collections::HashMap;
use std::fmt;
use super::printer::{escape_str,pr_list};
use super::env::{Env,env_new,env_bind};
use self::MalType::*;
use self::MalError::*;
#[derive(Clone)]
#[allow(non_camel_case_types)]
pub enum MalType {
Nil,
True,
False,
Int(isize),
Strn(String),
Sym(String),
List(Vec<MalVal>, MalVal),
Vector(Vec<MalVal>, MalVal),
Hash_Map(HashMap<String, MalVal>, MalVal),
Func(fn(Vec<MalVal>) -> MalRet, MalVal),
MalFunc(MalFuncData, MalVal),
Atom(RefCell<MalVal>),
}
pub type MalVal = Rc<MalType>;
#[derive(Debug)]
pub enum MalError {
ErrString(String),
ErrMalVal(MalVal),
}
pub type MalRet = Result<MalVal,MalError>;
pub fn err_string(s: String) -> MalRet {
Err(ErrString(s))
}
pub fn err_str(s: &str) -> MalRet {
Err(ErrString(s.to_string()))
}
pub fn err_val(mv: MalVal) -> MalRet {
Err(ErrMalVal(mv))
}
#[derive(Clone)]
pub struct MalFuncData {
pub eval: fn(MalVal, Env) -> MalRet,
pub exp: MalVal,
pub env: Env,
pub params: MalVal,
pub is_macro: bool,
}
impl MalType {
pub fn pr_str(&self, print_readably: bool) -> String {
let _r = print_readably;
match *self {
Nil => "nil".to_string(),
True => "true".to_string(),
False => "false".to_string(),
Int(v) => v.to_string(),
Sym(ref v) => v.clone(),
Strn(ref v) => {
if v.starts_with("\u{29e}") {
format!(":{}", &v[2..])
} else if print_readably {
escape_str(v)
} else {
v.clone()
}
},
List(ref v,_) => {
pr_list(v, _r, "(", ")", " ")
},
Vector(ref v,_) => {
pr_list(v, _r, "[", "]", " ")
},
Hash_Map(ref v,_) => {
let mut res = String::new();
res.push_str("{");
for (i, (key, value)) in v.iter().enumerate() {
if i != 0 { res.push_str(" "); }
if key.starts_with("\u{29e}") {
res.push_str(":");
res.push_str(&key[2..])
} else if print_readably {
res.push_str(&escape_str(key))
} else {
res.push_str(key)
}
res.push_str(" ");
res.push_str(&value.pr_str(_r));
}
res.push_str("}");
res
},
// TODO: better native function representation
Func(_, _) => format!("#<function ...>"),
MalFunc(ref mf,_) => format!("(fn* {:?} {:?})", mf.params, mf.exp),
Atom(ref v) => format!("(atom {:?})", &**v.borrow()),
}
}
pub fn apply(&self, args:Vec<MalVal>) -> MalRet {
match *self {
Func(f,_) => f(args),
MalFunc(ref mf,_) => {
let mfc = mf.clone();
let alst = list(args);
let new_env = env_new(Some(mfc.env.clone()));
match env_bind(&new_env, mfc.params, alst) {
Ok(_) => (mfc.eval)(mfc.exp, new_env),
Err(e) => err_string(e),
}
},
_ => err_str("attempt to call non-function"),
}
}
}
impl PartialEq for MalType {
fn eq(&self, other: &MalType) -> bool {
match (self, other) {
(&Nil, &Nil) |
(&True, &True) |
(&False, &False) => true,
(&Int(ref a), &Int(ref b)) => a == b,
(&Strn(ref a), &Strn(ref b)) => a == b,
(&Sym(ref a), &Sym(ref b)) => a == b,
(&List(ref a,_), &List(ref b,_)) |
(&Vector(ref a,_), &Vector(ref b,_)) |
(&List(ref a,_), &Vector(ref b,_)) |
(&Vector(ref a,_), &List(ref b,_)) => a == b,
(&Hash_Map(ref a,_), &Hash_Map(ref b,_)) => a == b,
// TODO: fix this
(&Func(_,_), &Func(_,_)) => false,
(&MalFunc(_,_), &MalFunc(_,_)) => false,
_ => return false,
}
}
}
impl fmt::Debug for MalType {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
write!(f, "{}", self.pr_str(true))
}
}
// Scalars
pub fn _nil() -> MalVal { Rc::new(Nil) }
pub fn nil_q(a:Vec<MalVal>) -> MalRet {
if a.len() != 1 {
return err_str("Wrong arity to nil? call");
}
match *a[0].clone() {
Nil => Ok(_true()),
_ => Ok(_false()),
}
}
pub fn _true() -> MalVal { Rc::new(True) }
pub fn true_q(a:Vec<MalVal>) -> MalRet {
if a.len() != 1 {
return err_str("Wrong arity to true? call");
}
match *a[0].clone() {
True => Ok(_true()),
_ => Ok(_false()),
}
}
pub fn _false() -> MalVal { Rc::new(False) }
pub fn false_q(a:Vec<MalVal>) -> MalRet {
if a.len() != 1 {
return err_str("Wrong arity to false? call");
}
match *a[0].clone() {
False => Ok(_true()),
_ => Ok(_false()),
}
}
pub fn _int(i: isize) -> MalVal { Rc::new(Int(i)) }
// Symbols
pub fn symbol(strn: &str) -> MalVal { Rc::new(Sym(strn.to_string())) }
pub fn _symbol(a: Vec<MalVal>) -> MalRet {
if a.len() != 1 {
return err_str("Wrong arity to symbol call");
}
match *a[0].clone() {
Strn(ref s) => {
Ok(Rc::new(Sym(s.to_string())))
},
_ => return err_str("symbol called on non-string"),
}
}
pub fn symbol_q(a:Vec<MalVal>) -> MalRet {
if a.len() != 1 {
return err_str("Wrong arity to symbol? call");
}
match *a[0].clone() {
Sym(_) => Ok(_true()),
_ => Ok(_false()),
}
}
// Keywords
pub fn _keyword(a: Vec<MalVal>) -> MalRet {
if a.len() != 1 {
return err_str("Wrong arity to keyword call");
}
match *a[0] {
Strn(ref s) => Ok(Rc::new(Strn(format!("\u{29e}{}", s)))),
_ => err_str("keyword called on non-string"),
}
}
pub fn keyword_q(a:Vec<MalVal>) -> MalRet {
if a.len() != 1 {
return err_str("Wrong arity to keyword? call");
}
match *a[0].clone() {
Strn(ref s) => {
if s.starts_with("\u{29e}") {
Ok(_true())
} else {
Ok(_false())
}
},
_ => Ok(_false()),
}
}
// Strings
pub fn strn(strn: &str) -> MalVal { Rc::new(Strn(strn.to_string())) }
pub fn string(strn: String) -> MalVal { Rc::new(Strn(strn)) }
// Lists
pub fn list(seq: Vec<MalVal>) -> MalVal { Rc::new(List(seq,_nil())) }
pub fn listm(seq: Vec<MalVal>, meta: MalVal) -> MalVal {
Rc::new(List(seq,meta))
}
pub fn listv(seq:Vec<MalVal>) -> MalRet { Ok(list(seq)) }
pub fn list_q(a:Vec<MalVal>) -> MalRet {
if a.len() != 1 {
return err_str("Wrong arity to list? call");
}
match *a[0].clone() {
List(_,_) => Ok(_true()),
_ => Ok(_false()),
}
}
// Vectors
pub fn vector(seq: Vec<MalVal>) -> MalVal { Rc::new(Vector(seq,_nil())) }
pub fn vectorm(seq: Vec<MalVal>, meta: MalVal) -> MalVal {
Rc::new(Vector(seq,meta))
}
pub fn vectorv(seq: Vec<MalVal>) -> MalRet { Ok(vector(seq)) }
pub fn vector_q(a:Vec<MalVal>) -> MalRet {
if a.len() != 1 {
return err_str("Wrong arity to vector? call");
}
match *a[0].clone() {
Vector(_,_) => Ok(_true()),
_ => Ok(_false()),
}
}
// Hash Maps
pub fn hash_map(hm: HashMap<String,MalVal>) -> MalVal {
Rc::new(Hash_Map(hm,_nil()))
}
pub fn hash_mapm(hm: HashMap<String,MalVal>, meta: MalVal) -> MalVal {
Rc::new(Hash_Map(hm,meta))
}
pub fn _assoc(hm: &HashMap<String,MalVal>, a:Vec<MalVal>) -> MalRet {
if a.len() % 2 == 1 {
return err_str("odd number of hash-map keys/values");
}
let mut new_hm = hm.clone();
let mut it = a.iter();
loop {
let k = match it.next() {
Some(mv) => match *mv.clone() {
Strn(ref s) => s.to_string(),
_ => return err_str("key is not a string in hash-map call"),
},
None => break,
};
let v = it.next().unwrap();
new_hm.insert(k, v.clone());
}
Ok(Rc::new(Hash_Map(new_hm,_nil())))
}
pub fn _dissoc(hm: &HashMap<String,MalVal>, a:Vec<MalVal>) -> MalRet {
let mut new_hm = hm.clone();
let mut it = a.iter();
loop {
let k = match it.next() {
Some(mv) => match *mv.clone() {
Strn(ref s) => s.to_string(),
_ => return err_str("key is not a string in hash-map call"),
},
None => break,
};
new_hm.remove(&k);
}
Ok(Rc::new(Hash_Map(new_hm,_nil())))
}
pub fn hash_mapv(seq: Vec<MalVal>) -> MalRet {
let new_hm: HashMap<String,MalVal> = HashMap::new();
_assoc(&new_hm, seq)
}
pub fn hash_map_q(a:Vec<MalVal>) -> MalRet {
if a.len() != 1 {
return err_str("Wrong arity to map? call");
}
match *a[0].clone() {
Hash_Map(_,_) => Ok(_true()),
_ => Ok(_false()),
}
}
// Functions
pub fn func(f: fn(Vec<MalVal>) -> MalRet) -> MalVal {
Rc::new(Func(f, _nil()))
}
pub fn funcm(f: fn(Vec<MalVal>) -> MalRet, meta: MalVal) -> MalVal {
Rc::new(Func(f, meta))
}
pub fn malfunc(eval: fn(MalVal, Env) -> MalRet,
exp: MalVal,
env: Env,
params: MalVal,
meta: MalVal) -> MalVal {
Rc::new(MalFunc(MalFuncData{eval: eval,
exp: exp,
env: env,
params: params,
is_macro: false},meta))
}
pub fn malfuncd(mfd: MalFuncData, meta: MalVal) -> MalVal {
Rc::new(MalFunc(mfd,meta))
}
// Atoms
pub fn atom_q(a:Vec<MalVal>) -> MalRet {
if a.len() != 1 {
return err_str("Wrong arity to atom? call");
}
match *a[0].clone() {
Atom(_) => Ok(_true()),
_ => Ok(_false()),
}
}
pub fn atom(a:Vec<MalVal>) -> MalRet {
if a.len() != 1 {
return err_str("Wrong arity to atom call");
}
Ok(Rc::new(Atom(RefCell::new(a[0].clone()))))
}
// General functions
pub fn sequential_q(a:Vec<MalVal>) -> MalRet {
if a.len() != 1 {
return err_str("Wrong arity to sequential? call");
}
match *a[0].clone() {
List(_,_) | Vector(_,_) => Ok(_true()),
_ => Ok(_false()),
}
}
|