-
Notifications
You must be signed in to change notification settings - Fork 4
Expand file tree
/
Copy pathNativeProcedures.cpp
More file actions
237 lines (200 loc) · 6.26 KB
/
NativeProcedures.cpp
File metadata and controls
237 lines (200 loc) · 6.26 KB
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
//
// NativeProcedures.cpp
// Scheme++
//
// Created by Josh Sun on 2017-05-12.
// Copyright © 2017 Josh Sun. All rights reserved.
//
#include "NativeProcedures.hpp"
SList add (const SLists& argv) {
double dVal = atof(argv[0].val().c_str());
for (auto vi = argv.begin()+1; vi != argv.end(); vi++)
dVal += atof((*vi).val().c_str());
return SList(dVal);
}
SList subtract (const SLists& argv) {
double dVal = atof(argv[0].val().c_str());
for (auto vi = argv.begin()+1; vi != argv.end(); vi++)
dVal -= atof((*vi).val().c_str());
return SList(dVal);
}
SList multiply (const SLists& argv) {
double dVal = atof(argv[0].val().c_str());
for (auto vi = argv.begin()+1; vi != argv.end(); vi++)
dVal *= atof((*vi).val().c_str());
return SList(dVal);
}
SList divide (const SLists& argv) {
double dVal = atof(argv[0].val().c_str());
for (auto vi = argv.begin()+1; vi != argv.end(); vi++)
dVal /= atof((*vi).val().c_str());
return SList(dVal);
}
SList mod (const SLists& argv) {
int iVal = atoi(argv[0].val().c_str());
for (auto vi = argv.begin()+1; vi != argv.end(); vi++)
iVal %= atoi((*vi).val().c_str());
return SList(iVal);
}
SList sqrt (const SLists& arg) {
return SList(sqrt(atof(arg[0].val().c_str())));
}
SList sin (const SLists& arg) {
return SList(sin(atof(arg[0].val().c_str())));
}
SList cos (const SLists& arg) {
return SList(cos(atof(arg[0].val().c_str())));
}
SList tan (const SLists& arg) {
return SList(tan(atof(arg[0].val().c_str())));
}
SList arcsin (const SLists& arg) {
return SList(asin(atof(arg[0].val().c_str())));
}
SList arccos (const SLists& arg) {
return SList(acos(atof(arg[0].val().c_str())));
}
SList arctan (const SLists& arg) {
return SList(atan(atof(arg[0].val().c_str())));
}
SList abs (const SLists& arg) {
return SList(fabs(atof(arg[0].val().c_str())));
}
SList greater_than (const SLists& argv) {
for (auto vi = argv.begin(); vi != argv.end()-1; vi++) {
if (atof((*(vi+1)).val().c_str()) >= atof((*vi).val().c_str()))
return SList("#f");
}
return SList("#t");
}
SList less_than (const SLists& argv) {
for (auto vi = argv.begin(); vi != argv.end()-1; vi++) {
if (atof((*(vi+1)).val().c_str()) <= atof((*vi).val().c_str()))
return SList("#f");
}
return SList("#t");
}
SList equal_num (const SLists& argv) {
for (auto vi = argv.begin(); vi != argv.end()-1; vi++) {
if (fabs(atof((*(vi+1)).val().c_str())-atof((*vi).val().c_str()))>0.00000001) {
return SList("#f");
}
}
return SList("#t");
}
SList greater_equal (const SLists& argv) {
for (auto vi = argv.begin(); vi != argv.end()-1; vi++) {
if (atof((*(vi+1)).val().c_str()) > atof((*vi).val().c_str()))
return SList("#f");
}
return SList("#t");
}
SList less_equal (const SLists& argv) {
for (auto vi = argv.begin(); vi != argv.end()-1; vi++) {
if (atof((*(vi+1)).val().c_str()) < atof((*vi).val().c_str()))
return SList("#f");
}
return SList("#t");
}
SList append (const SLists& argv) {
SList l;
for (auto vi = argv.begin(); vi != argv.end(); vi++) {
l.pushList(vi->getList());
}
return SList(l);
}
SList apply (const SLists& argv) {
return argv[0].getProc()(argv[1].getList());
}
SList map (const SLists& argv) {
SList newList(SList::LIST);
for (int i = 0; i < argv[1].getList().size(); i++) {
SLists n;
SList args(SList::LIST);
n.push_back(argv[0].getProc());
for (int j = 1; j < argv.size(); j++) {
args.push(argv[j].getList()[i]);
}
n.push_back(args);
newList.push(apply(n));
}
return newList;
}
SList max (const SLists& argv) {
double max = -std::numeric_limits<double>::infinity();
for (auto vi = argv.begin(); vi != argv.end(); vi++) {
if (atof(vi->val().c_str()) > max)
max = atof(vi->val().c_str());
}
return max;
}
SList min (const SLists& argv) {
double min = std::numeric_limits<double>::infinity();
for (auto vi = argv.begin(); vi != argv.end(); vi++) {
if (atof(vi->val().c_str()) < min)
min = atof(vi->val().c_str());
}
return min;
}
SList eqv (const SLists& argv) {
for (auto vi = argv.begin(); vi != argv.end()-1; vi++) {
if (vi->getType() != (vi+1)->getType()) {
return SList("#f");
} else if (vi->getType() == SList::SYMBOL) {
if (vi->val() == "#f" || vi->val() != (vi+1)->val())
return SList("#f");
} else if (vi->getType() == SList::NUMBER) {
if (fabs(atof((*(vi+1)).val().c_str())-atof((*vi).val().c_str()))>0.00000001)
return SList("#f");
} else if (vi->getType() == SList::LAMBDA || vi->getType() == SList::PROC) {
if (vi->getProc() != (vi+1)->getProc())
return SList("#f");
} else {
return eqv(vi->getList());
}
}
return SList("#t");
}
SList isNumber (const SLists& arg) {
return arg[0].getType()==SList::NUMBER ? SList("#t") : SList("#f");
}
SList isProcedure (const SLists& arg) {
return arg[0].getType()==SList::PROC ? SList("#t") : SList("#f");
}
SList isSymbol (const SLists& arg) {
return arg[0].getType()==SList::SYMBOL ? SList("#t") : SList("#f");
}
SList isList (const SLists& arg) {
return arg[0].getType()==SList::LIST ? SList("#t") : SList("#f");
}
SList isNull (const SLists& arg) {
if (arg[0].getType()!=SList::LIST) return SList("#f");
if (arg[0].getList().size()==0) return SList("#t");
return SList("#f");
}
SList length (const SLists& arg) {
return arg[0].getList().size();
}
SList list (const SLists& argv) {
SList newList(SList::LIST);
for (auto vi = argv.begin(); vi != argv.end(); vi++) {
newList.push(*vi);
}
return newList;
}
SList cons (const SLists& argv) {
SList newList(SList::LIST);
newList.push(argv[0]);
newList.push(argv[1]);
return newList;
}
SList car (const SLists& argv) {
return argv[0].getList()[0];
}
SList cdr (const SLists& argv) {
SList s(SList::LIST);
for (int i = 1; i < argv[0].getList().size(); i++) {
s.push(argv[0].getList()[i]);
}
return s;
}