-
Notifications
You must be signed in to change notification settings - Fork 6
/
c.rs
150 lines (142 loc) · 5.5 KB
/
c.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
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
use r_derive::*;
use crate::callable::core::*;
use crate::context::Context;
use crate::lang::*;
use crate::object::types::*;
use crate::object::*;
#[derive(Debug, Clone, PartialEq)]
#[builtin(sym = "c")]
pub struct PrimitiveC;
impl Callable for PrimitiveC {
fn call(&self, args: ExprList, stack: &mut CallStack) -> EvalResult {
// this can be cleaned up quite a bit, but I just need it working with
// more types for now to test vectorized operators using different types
let Obj::List(vals) = stack.eval_list_eager(args)? else {
unreachable!()
};
// lets first see what we're aiming to build.
let ty: u8 = vals
.values
.borrow()
.iter()
.map(|(_, v)| match v {
Obj::Null => 0,
Obj::Vector(_) => 1,
Obj::List(_) => 2,
_ => 0,
})
.fold(0, std::cmp::max);
// most complex type was NULL
if ty == 0 {
return Ok(Obj::Null);
}
// most complex type was List
if ty == 2 {
return Ok(Obj::List(vals));
}
// otherwise, try to collapse vectors into same type
let ret = vals
.values
.borrow()
.iter()
.map(|(_, r)| match r {
Obj::Vector(Vector::Logical(_)) => Vector::from(Vec::<Logical>::new()),
Obj::Vector(Vector::Integer(_)) => Vector::from(Vec::<Integer>::new()),
Obj::Vector(Vector::Double(_)) => Vector::from(Vec::<Double>::new()),
Obj::Vector(Vector::Character(_)) => Vector::from(Vec::<Character>::new()),
_ => unreachable!(),
})
.fold(Vector::from(Vec::<Logical>::new()), |l, r| match (l, r) {
(v @ Vector::Character(_), _) => v,
(_, v @ Vector::Character(_)) => v,
(v @ Vector::Double(_), _) => v,
(_, v @ Vector::Double(_)) => v,
(v @ Vector::Integer(_), _) => v,
(_, v @ Vector::Integer(_)) => v,
(v @ Vector::Logical(_), _) => v,
});
// consume values and merge into a new collection
match ret {
Vector::Character(v) => Ok(Obj::Vector(Vector::from(
v.inner()
.clone()
.borrow_mut()
.clone()
.into_iter()
.chain(
vals.values
.borrow_mut()
.clone()
.into_iter()
.flat_map(|(_, i)| match i.as_character() {
Ok(Obj::Vector(Vector::Character(v))) => {
v.inner().clone().borrow().clone().into_iter()
}
_ => unreachable!(),
}),
)
.collect::<Vec<Character>>(),
))),
Vector::Double(v) => Ok(Obj::Vector(Vector::from(
v.inner()
.clone()
.borrow_mut()
.clone()
.into_iter()
.chain(
vals.values
.borrow_mut()
.clone()
.into_iter()
.flat_map(|(_, i)| match i.as_double() {
Ok(Obj::Vector(Vector::Double(v))) => {
v.inner().clone().borrow().clone().into_iter()
}
_ => unreachable!(),
}),
)
.collect::<Vec<Double>>(),
))),
Vector::Integer(v) => Ok(Obj::Vector(Vector::from(
v.inner()
.clone()
.borrow_mut()
.clone()
.into_iter()
.chain(
vals.values
.borrow_mut()
.clone()
.into_iter()
.flat_map(|(_, i)| match i.as_integer() {
Ok(Obj::Vector(Vector::Integer(v))) => {
v.inner().clone().borrow().clone().into_iter()
}
_ => unreachable!(),
}),
)
.collect::<Vec<Integer>>(),
))),
Vector::Logical(v) => Ok(Obj::Vector(Vector::from(
v.inner()
.clone()
.borrow_mut()
.clone()
.into_iter()
.chain(
vals.values
.borrow_mut()
.clone()
.into_iter()
.flat_map(|(_, i)| match i.as_logical() {
Ok(Obj::Vector(Vector::Logical(v))) => {
v.inner().clone().borrow().clone().into_iter()
}
_ => unreachable!(),
}),
)
.collect::<Vec<Logical>>(),
))),
}
}
}