cadb186f4d1a68deab1d34471c188549a228f610
[calc.git] / calc.c
1 /* depend: */
2 /* cflags: */
3 /* linker: alloc.o argument.o color.o debug.o element.o format.o parser.o program.o stack.o storage.o tabular.o workspace.o -lm -lreadline */
4
5 #include <malloc.h>
6 #include <stddef.h>
7 #include <stdio.h>
8 #include <stdlib.h>
9 #include <unistd.h>
10
11 #include <readline/readline.h>
12 #include <readline/history.h>
13
14 #include "debug.h"
15 #include "element.h"
16 #include "format.h"
17 #include "parser.h"
18
19 /* constants */
20
21 #define BUFFER_SIZE 4096
22 #define HISTORY_LEN 10
23
24 /* macros */
25
26 #define CEIL(x, y) (((x) + (y) - 1) / (y))
27 #define MIN(x, y) (((x) < (y)) ? (x) : (y))
28 #define MAX(x, y) (((x) > (y)) ? (x) : (y))
29
30 /* gobal variables */
31
32 char *progname = NULL;
33 char *iprompt = "<= ";
34 int mode = 1;
35 char *oprompt = "=> ";
36 int precision = 6;
37 char **completion_list = NULL;
38
39 /* help function */
40
41 int usage (int ret)
42 {
43 FILE *fid = ret ? stderr : stdout;
44 fprintf (fid, "usage: %s\n", progname);
45 fprintf (fid, " -h : help message\n");
46 fprintf (fid, " -b : in/out-put base (%s)\n", show_base ());
47 fprintf (fid, " -n : no readline mode (%s)\n", mode ? "yes" : "no");
48 fprintf (fid, " -n : no readline mode (%s)\n", mode ? "yes" : "no");
49 fprintf (fid, " -o : output prompt (%s)\n", oprompt);
50 fprintf (fid, " -p : precision (%d)\n", precision);
51 fprintf (fid, " -v : verbose level (%d)\n", verbose);
52
53 return ret;
54 }
55
56 /* completion function */
57
58 char *generator (const char *text, int state);
59
60 char **completion (const char *text, __attribute__((unused)) int start, __attribute__((unused)) int end)
61 {
62 rl_attempted_completion_over = 1;
63 return rl_completion_matches (text, generator);
64 }
65
66 char *generator (const char *text, int state)
67 {
68 static int index, len;
69 char *name;
70
71 if (!state) {
72 index = 0;
73 len = strlen(text);
74 }
75
76 while ((name = completion_list[index++])) {
77 if (strncmp (name, text, len) == 0) {
78 return strdup (name);
79 }
80 }
81
82 return NULL;
83 }
84
85 /* edit line */
86 char *edit_line = NULL;
87 int edit_hook ()
88 {
89 static int state = 0;
90 if (edit_line) {
91 if (state == 0) {
92 state = 1;
93 } else {
94 state = 0;
95 free (edit_line);
96 edit_line = NULL;
97 }
98 }
99 return rl_insert_text (edit_line);
100 }
101
102 /* main function */
103
104 int main (int argc, char *argv[])
105 {
106 char *buffer = NULL;
107 char buffer_static[BUFFER_SIZE + 1] = {0};
108 int i = 0, nb = 1, in, out;
109 int ret = 0;
110
111 /* program name */
112
113 progname = argv[0];
114 while (progname[i] != '\0') {
115 if ((progname[i] == '/') || (progname[i] == '\\')) {
116 progname += i + 1;
117 i = 0;
118 } else {
119 i++;
120 }
121 }
122
123 /* argument processing */
124
125 while (argc-- > 1) {
126 char *arg = *(++argv);
127 if (arg[0] != '-') {
128 VERBOSE (ERROR, fprintf (stderr, "%s: invalid option -- '%s'\n", progname, arg); usage (1));
129 return 1;
130 }
131 char *pt = NULL;
132 char c = arg[1];
133 switch (c) {
134 case 'b':
135 arg = (arg[2]) ? arg + 2 : (--argc > 0) ? *(++argv) : NULL;
136 if (arg == NULL) {
137 VERBOSE (ERROR, fprintf (stderr, "%s: missing base definition\n", progname); usage (1));
138 return 1;
139 }
140 in = out = strtol (arg, &pt, 10);
141 if ((*pt == ' ') || (*pt == ',') || (*pt == '-')) {
142 pt++;
143 if (*pt == '\0') {
144 VERBOSE (ERROR, fprintf (stderr, "%s: missing output base definition\n", progname); usage (1));
145 return 1;
146 } else {
147 out = atoi (pt);
148 }
149 }
150 set_base (in, out);
151 break;
152 case 'i':
153 arg = (arg[2]) ? arg + 2 : (--argc > 0) ? *(++argv) : NULL;
154 if (arg == NULL) {
155 VERBOSE (ERROR, fprintf (stderr, "%s: missing input prompt\n", progname); usage (1));
156 return 1;
157 }
158 iprompt = arg;
159 break;
160 case 'n':
161 mode = 0;
162 buffer = buffer_static;
163 break;
164 case 'o':
165 arg = (arg[2]) ? arg + 2 : (--argc > 0) ? *(++argv) : NULL;
166 if (arg == NULL) {
167 VERBOSE (ERROR, fprintf (stderr, "%s: missing output prompt\n", progname); usage (1));
168 return 1;
169 }
170 set_prompt (oprompt = arg);
171 break;
172 case 'p':
173 arg = (arg[2]) ? arg + 2 : (--argc > 0) ? *(++argv) : NULL;
174 if (arg == NULL) {
175 VERBOSE (ERROR, fprintf (stderr, "%s: missing precision\n", progname); usage (1));
176 return 1;
177 }
178 set_precision (precision = atoi (arg));
179 break;
180 case 'v':
181 arg = (arg[2]) ? arg + 2 : (--argc > 0) ? *(++argv) : NULL;
182 if (arg == NULL) {
183 VERBOSE (ERROR, fprintf (stderr, "%s: missing verbose level\n", progname); usage (1));
184 return 1;
185 }
186 verbose = atoi (arg);
187 break;
188 case 'h':
189 default:
190 return usage (c != 'h');
191 }
192 }
193
194 /* set format */
195 set_format ();
196
197 /* completion list*/
198 completion_list = generate_completion_list ();
199 rl_attempted_completion_function = completion;
200
201 /* startup hook */
202 rl_startup_hook = edit_hook;
203
204 /* read from input stream */
205
206 while (1) {
207 char *line[BUFFER_SIZE] = {0};
208
209 if (mode) {
210 if ((buffer = readline (iprompt)) == NULL) {
211 break;
212 }
213
214 /* check empty line */
215 if (strlen (buffer) == 0) {
216 free (buffer);
217 continue;
218 } else if (strcmp (buffer, ".") == 0) {
219 free (buffer);
220 break;
221 }
222
223 /* add line into history */
224 add_history (buffer);
225 VERBOSE (INFO, fprintf (stdout, "line (%d/%d): '%s'\n",
226 where_history (), history_length, buffer));
227 if (history_length > HISTORY_LEN) {
228 HIST_ENTRY *last = remove_history (0);
229 if (last) {
230 free_history_entry (last);
231 }
232 }
233 } else {
234 printf ("%s", iprompt);
235 if (read (STDIN_FILENO, buffer, BUFFER_SIZE) == 0) {
236 break;
237 }
238 VERBOSE (INFO, fprintf (stdout, "line: '%s'\n", buffer));
239 }
240
241 /* pre-process buffer */
242 nb = 0;
243 char *pt = line[nb++] = buffer;
244 while (*pt != '\0') {
245 switch (*pt) {
246 case '\n':
247 *pt = '\0';
248 // fallthrough
249 case ';':
250 line[nb++] = pt + 1;
251 }
252 pt++;
253 }
254
255 /* look for end of line */
256 for (i = 0; i < nb; i++) {
257 if (*line[i] == '\0') {
258 continue;
259 }
260 element_t *element = parser (line[i], NULL, -9);
261 if (element == ERROR_OP) {
262 VERBOSE (WARNING, fprintf (stdout, "error while parsing: '%s'\n", line[i]));
263 ret = 1;
264 } else if (element != NULL) {
265 VERBOSE (INFO, print_element (element, 0));
266 answer = evaluate_element (element, 0);
267 if (!element->hidden) {
268 print (answer);
269 }
270 delelement (element);
271 ret = 0;
272 }
273 }
274
275 if (mode) {
276 free (buffer);
277 } else {
278 memset (buffer, 0, BUFFER_SIZE);
279 }
280 }
281
282 free_completion_list (completion_list);
283
284 free_format ();
285
286 return ret;
287 }
288
289 // test: calc.exe -h
290 // test: calc.exe -h | awk '/usage:/ { rc=1 } END { exit (1-rc) }'
291 // test: echo 1 | calc.exe -v3 | grep -q value
292 // test: calc.exe -_ 2> /dev/null | awk 'END { if (NR == 0) { exit(0) } else exit (1) }'
293 // test: calc.exe -_ 2>&1 | awk '/usage:/ { rc=1 } END { exit (1-rc) }'
294 // test: calc.exe error 2>&1 | grep -q 'invalid option'
295 // test: calc.exe -b 2>&1 | grep -q 'missing base'
296 // test: calc.exe -b 10, 2>&1 | grep -q 'missing output base'
297 // test: calc.exe -b 10- 2>&1 | grep -q 'missing output base'
298 // test: calc.exe -b '10 ' 2>&1 | grep -q 'missing output base'
299 // test: calc.exe -i 2>&1 | grep -q 'missing input prompt'
300 // test: calc.exe -o 2>&1 | grep -q 'missing output prompt'
301 // test: calc.exe -p 2>&1 | grep -q 'missing precision'
302 // test: calc.exe -v 2>&1 | grep -q 'missing verbose'
303 // test: echo "1 + 1" | calc.exe -i '# ' | grep -q '# 1 + 1'
304 // test: echo "1 + 1" | calc.exe -o '# ' | grep -q '# 2'
305 // test: echo "1 + 2" | calc.exe | grep -q '=> 3'
306 // test: echo "1 - 2" | calc.exe | grep -q '=> -1'
307 // test: echo "2 * 3" | calc.exe | grep -q '=> 6'
308 // test: echo "1 / 2" | calc.exe | grep -q '=> 0\.5'
309 // test: echo "8 % 3" | calc.exe | grep -q '=> 2'
310 // test: echo "-9 % 3.1" | calc.exe | grep -q '=> -2\.8'
311 // test: echo "2 ^ 3" | calc.exe | grep -q '=> 8'
312 // test: echo "1e-1 + 2.34e3" | calc.exe | grep -q '=> 2340\.1'
313 // test: echo "sqrt (2)" | calc.exe | grep -q '=> 1\.41421'
314 // test: echo "pow (2, 3)" | calc.exe | grep -q '=> 8'
315 // test: echo "cos (2)" | calc.exe | grep -q '=> -0\.416147'
316 // test: echo "sin (2)" | calc.exe | grep -q '=> 0\.909297'
317 // test: echo "atan (2)" | calc.exe | grep -q '=> 1\.10715'
318 // test: echo "exp (2)" | calc.exe | grep -q '=> 7\.38906'
319 // test: echo "ln (2)" | calc.exe | grep -q '=> 0\.693147'
320 // test: echo "log (10)" | calc.exe | grep -q '=> 1'
321 // test: echo "2 + 3 - 4" | calc.exe | grep -q '=> 1'
322 // test: echo "1 + cos (2 - 3)" | calc.exe | grep -q '=> 1\.5403'
323 // test: echo "cos (1 / 2) * 3" | calc.exe | grep -q '=> 2\.63275'
324 // test: echo "1 + 4 * (2 - 3)" | calc.exe | grep -q '=> -3'
325 // test: echo "(2 - 3) / 4" | calc.exe | grep -q '=> -0\.25'
326 // test: echo "pow (8 - 3, 4 / 3)" | calc.exe | grep -q '=> 8\.54988'
327 // test: echo "1 + -2" | calc.exe | grep -q '=> -1'
328 // test: echo "1 - +2" | calc.exe | grep -q '=> -1'
329 // test: echo "-1 + +2" | calc.exe | grep -q '=> 1'
330 // test: echo "-1+2" | calc.exe | grep -q '=> 1'
331 // test: echo "1-2" | calc.exe | grep -q '=> -1'
332 // test: echo "1 * 2 / 3 + 4" | calc.exe | grep -q '=> 4\.66667'
333 // test: echo "2 ^ 3 * 4 + 5" | calc.exe | grep -q '=> 37'
334 // test: echo "2 + 3 * 4 ^ 5" | calc.exe | grep -q '=> 3074'
335 // test: echo "2 ^ 3 * 4 + cos(5/6)" | calc.exe | grep -q '=> 32\.6724'
336 // test: echo "95-6.3*15-1" | calc.exe | grep -q '=> -0.5'
337 // test: echo "95 - 6.3 * 15 - 1" | calc.exe | grep -q '=> -0\.5'
338 // test: echo "95-6.3+15" | calc.exe | grep -q '=> 103.7'
339 // test: echo "-cos (0) + 1" | calc.exe | grep -q '=> -0'
340 // test: echo "-cos(0)+1" | calc.exe | grep -q '=> -0'
341 // test: echo "quit" | calc.exe | grep -q 'bye'
342 // test: echo "help" | calc.exe | grep -q 'miscellaneous'
343 // test: echo "1 + 2 *" | calc.exe | grep -q 'error'
344 // test: echo "* 1 - 2" | calc.exe | grep -q 'error'
345 // test: echo "2 + * 3" | calc.exe | grep -q 'error'
346 // test: echo "2 + cos(3 *)" | calc.exe | grep -q 'error'
347 // test: echo "2 + (foo)" | calc.exe | grep -q 'error'
348 // test: echo "2 + cos (pi +" | calc.exe | grep -q 'error'
349 // test: echo "2 + cos (pi" | calc.exe | grep -q 'error'
350 // test: echo "(2 + " | calc.exe | grep -q 'error'
351 // test: echo "cos (1, 2)" | calc.exe | grep -q 'error'
352 // test: echo "sqrt 2" | calc.exe | grep -q 'error'
353 // test: echo "pow (2)" | calc.exe | grep -q 'error'
354 // test: echo "1.23456789" | calc.exe -p 4 | grep -q '=> 1\.235'
355 // test: echo . | calc.exe | grep -qv error
356 // test: echo -e '1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1\n1 + 1' | calc.exe -n | grep -q 64
357 // test: echo -e '1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1\n1 + 1' | calc.exe -n | grep -q 2
358 // test: echo -e '1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1\n1 + 1' | calc.exe | grep -q 64
359 // test: echo -e '1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1\n1 + 1' | calc.exe | grep -q 2
360 // test: echo -e '-cos (1)\n1 + 1\n1 - 1\n1 * 1\n1 / 1\n3%2\n2^2\nsqrt (2)\ncos (0)\nsin (0)\ntan (0)\nacos (0)\nasin (0)\natan (0)\nln (1)\nlog (1)\nexp (1)\nabs (-1)\nceil (1.2)\nfloor (-1.2)\nans\ne\npi\nsto (1)\nrcl (2)\ndisp\nhelp\nquit' | calc.exe -n -v 3 | grep -q bye
361 // test: echo -e '1 +\n1 -\n1 * 1\n1 /\n3%\n2^\nsqrt ()\ncos ()\nsin ()\ntan ()\nacos ()\nasin ()\natan ()\nln ()\nlog ()\nexp ()\nabs ()\nceil ()\nfloor ()\n1 + (\n1+2(\n1+2cos\n1+2pi' | calc.exe | grep -c error | xargs test 22 =
362 // test: echo -e '1 + 1\nans' | calc.exe -p 3 | grep -c 2 | xargs test 2 =
363 // test: echo -e 'sin (pi / 2)' | calc.exe -p 4 | grep -q 1
364 // test: echo -e 'e ^ 2' | calc.exe | grep -q '7\.38906'
365 // test: echo -e '\n\n\n' | calc.exe | grep -qv 'error'
366 // test: echo -e '\n\n\n' | calc.exe -n | grep -qv 'error'
367 // test: echo -e '1.5\nsto (2)\n3 + rcl(2) * 4\nsto (5)' | calc.exe | grep -q 9
368 // test: echo -e '1\nsto (0)\nsto (11)\nrcl (0)\nrcl (11)' | calc.exe | grep -c error | xargs test 4 =
369 // test: echo -e '1\nsto (2)\n3\nsto (5, 7)\nsto(9)\ndisp' | calc.exe | grep -q '0 1 0 0 7 0 0 0 7 0'
370 // test: echo -e '1+1 == 2' | calc.exe | grep -q '=> 1'
371 // test: echo -e '1 + 1 == 2 - 0' | calc.exe | grep -q '=> 1'
372 // test: echo -e '1 == 1 + 1 == 1' | calc.exe | grep -q '=> 0'
373 // test: echo -e '1-cos(3*pi/4) != 0.5^-2' | calc.exe | grep -q '=> 1'
374 // test: echo -e '1 >= 2' | calc.exe | grep -q '=> 0'
375 // test: echo -e '2 >= 2' | calc.exe | grep -q '=> 1'
376 // test: echo -e '1 <= 2' | calc.exe | grep -q '=> 1'
377 // test: echo -e '2 <= 2' | calc.exe | grep -q '=> 1'
378 // test: echo -e '1 > 2' | calc.exe | grep -q '=> 0'
379 // test: echo -e '2 > 2' | calc.exe | grep -q '=> 0'
380 // test: echo -e '1 < 2' | calc.exe | grep -q '=> 1'
381 // test: echo -e '2 < 2' | calc.exe | grep -q '=> 0'
382 // test: echo -e '1 == 1\n1 != 1\n1 >= 1\n1 <= 1\n1 > 1\n1 < 1\nquit' | calc.exe -v 3 | grep -q bye
383 // test: echo -e '(3 == 3) & (2 > 1)' | calc.exe | grep -q '=> 1'
384 // test: echo -e '(3 == 4) & (2 > 1)' | calc.exe | grep -q '=> 0'
385 // test: echo -e '(3 == 3) & (2 > 2)' | calc.exe | grep -q '=> 0'
386 // test: echo -e '(3 == 4) & (2 > 2)' | calc.exe | grep -q '=> 0'
387 // test: echo -e '(3 == 3) | (2 > 1)' | calc.exe | grep -q '=> 1'
388 // test: echo -e '(3 == 4) | (2 > 1)' | calc.exe | grep -q '=> 1'
389 // test: echo -e '(3 == 3) | (2 > 2)' | calc.exe | grep -q '=> 1'
390 // test: echo -e '(3 == 4) | (2 > 2)' | calc.exe | grep -q '=> 0'
391 // test: echo -e '!(3 == 4)' | calc.exe | grep -q '=> 1'
392 // test: echo -e '!(3 == 3)' | calc.exe | grep -q '=> 0'
393 // test: echo -e '1 & 1\n1 | 1\n!1\nquit' | calc.exe -n -v 3 | grep -qv error
394 // test: echo -e '(3 == 3) & (4 > 2)' | calc.exe | grep -q '=> 1'
395 // test: echo -e '3 == 3 & 4 > 2' | calc.exe | grep -q '=> 1'
396 // test: echo -e '1 + quit' | calc.exe | grep -q error
397 // test: echo -e 'cos (quit)' | calc.exe | grep -q error
398 // test: echo -e '(quit)' | calc.exe | grep -q error
399 // test: echo -e 'cos 3.14\n!\n! 3 4' | calc.exe | grep -c error | xargs test 3 =
400 // test: echo -e 'sto (2, 3)\ncond (rcl (2) > 2, ln (64), exp (75 / 10))' | calc.exe | grep -q '=> 4\.15888'
401 // test: echo -e 'sto (2, 1)\ncond (rcl (2) > 2, ln (64), exp (75 / 10))' | calc.exe | grep -q '=> 1808\.04'
402 // test: echo -e 'sto (2, 1)\ncond (rcl (2) > 2, ln (64))' | calc.exe | grep -q '=> 0'
403 // test: echo -e 'cond (0, 1, 2)\nquit' | calc.exe -v 3 | grep -q Cond
404 // test: echo -e 'cond\ncond (\ncond (1 >0,'| calc.exe | grep -c error | xargs test 3 =
405 // test: echo -e 'sto (1, 4)\ninc (1)\ninc (1)\ndec (1)\ninc (1)\nrcl (1) == 6\nquit' | calc.exe -v 3 | grep -q '=> 1'
406 // test: echo -e 'inc\ninc (\ndec\ndec (' | calc.exe | grep -c error | xargs test 4 =
407 // test: echo -e 'inc (11)\ndec (0)' | calc.exe | grep -c error | xargs test 2 =
408 // test: echo -e 'while (inc (1) < 100, sto (2, rcl (1) + rcl (2)))' | calc.exe | grep -q '=> 4950'
409 // test: echo -e 'while\nwhile (inc (1) < 3,\nwhile (inc (1) < 100, sto (2, rcl (1) + rcl (2))' | calc.exe | grep -c error | xargs test 3 =
410 // test: echo -e 'while (0, 1)\nquit' | calc.exe -v 3 | grep -q While
411 // test: echo -e '{sto (1, 1 + 1), rcl (1) * 3}\nquit' | calc.exe -v 3 | grep -q 'Code'
412 // test: echo -e '{sto (1, 1 + 1), rcl (1) * 3}' | calc.exe | grep -q '=> 6'
413 // test: echo -e '{\n{}\n{1, 2\n{sto (1, 1 + 1),\npow(2, {sto (1, 1 + 2), 2}, {rcl(2)})\n2 {sto (1, 1 + 1)}' | calc.exe | grep -c error | xargs test 6 =
414 // test: echo -e '1 }\n1 )\n1 , 2\n ' | calc.exe | grep -c error | xargs test 3 =
415 // test: echo -e 'print (1)\nquit' | calc.exe -v 3 | grep -q Print
416 // test: echo -e 'si\t\t (pi / 2)' | calc.exe | grep -q '=> 1'
417 // test: echo -e '\t\t' | calc.exe | grep -q 'print'
418 // test: echo -e '1 + 1;\nans + 1' | calc.exe | grep -qv 2
419 // test: echo -e 'mem\nmem (3)\nsto (4, pi)' | calc.exe | grep -q "error out of bound"
420 // test: echo -e 'mem (-1)' | calc.exe | grep -q "error"
421 // test: echo -e 'sto (2, 3)\nmem (2)\ndisp' | calc.exe | grep -q 'storage: 0 3$'
422 // test: echo -e 'disp' | calc.exe | grep -q "storage: 0 0 0 0 0 0 0 0 0 0"
423 // test: echo -e 'sto (3, 10)\ndisp' | calc.exe | grep -q "storage: 0 0 10 0 0 0 0 0 0 0"
424 // test: echo -e 'rcl (3)\ndisp' | calc.exe | grep -q "storage: 0 0 0 0 0 0 0 0 0 0"
425 // test: echo -e 'inc (2)\ndisp' | calc.exe | grep -q "storage: 0 1 0 0 0 0 0 0 0 0"
426 // test: echo -e 'dec (2)\ndisp' | calc.exe | grep -q "storage: 0 -1 0 0 0 0 0 0 0 0"
427 // test: echo -e 'clr\nsto (3, pi)\nclr\ndisp' | calc.exe | grep -q "storage: 0 0 0 0 0 0 0 0 0 0"
428 // test: echo -e 'mem (3)\nclr\nquit' | calc.exe -v 3 | grep -q Clear
429 // test: echo -e 'prog (2, {arg (2) - arg (1)})\nprog (1, {cos (arg (1)^2)})\ncall (1, pi/6)\nprog (2, {arg (1) * 3})\ncall (2, 1, 2)\nls' | calc.exe | grep -q 'programs: 2 1'
430 // test: echo -e 'prog (1, {arg (2) - arg (1)})\ncall (1, 2, 3)\nls\nedit (1)\nprog (1, {arg (2) + arg (1)})\nedit (1)\ndel (1)\nquit' | calc.exe -v 3 | grep -q bye
431 // test: echo -e 'prog (2, {arg (2) - arg (1)})\nprog (3, cos(arg (1) * pi / 3))\ncall (1, 2, 3)\ncall (2, 1)\nls\nedit (1)\ndel (1)\ndel (3)\ndel (2)\ncall (2, 1, 4)' | calc.exe | grep -c error | xargs test 5 =
432 // test: echo -e 'prog (2, {arg (2) - arg (1)})\nprog (3, cos(arg (1) * pi / 3))\ndel (2)\ndel (3)\nls' | calc.exe | grep -q '^programs:$'
433 // test: echo -e 'erf (1)\nerfc (1)\nquit' | calc.exe -v 3 | grep -q bye
434 // test: echo -e 'erf ()\nerfc ()' | calc.exe | grep -c error | xargs test 2 =
435 // test: echo -e 'set (1, 2, 3, 3.11, pi, 4)\nget (4)' | calc.exe | grep -q '=> 3.11'
436 // test: echo -e 'set (1, 2, 3, 3.11, pi, 4)\npop\npop\n5\npush\nshow' | calc.exe | grep -q 'stack: 1 2 3 3.11 5'
437 // test: echo -e 'set (1, 2, 3, 3.11, pi, 4)\nset\nput (3, 4)\nshow' | calc.exe | grep -q 'stack: 0 0 4'
438 // test: echo -e 'set (0, -1)\nset (1, 2, 3, 3.11, pi, 4)\nlen' | calc.exe | grep -q '=> 6'
439 // test: echo -e 'set (1, 2)\npop\npush (3)\nput (5, -1)\nlen\nshow\nget (3)\nquit' | calc.exe -n -v 3 | grep -q bye
440 // test: echo -e 'put\nget\nget (1)\npop\nput (0)' | calc.exe | grep -c 'error' | xargs test 5 =
441 // test: echo -e 'push (2)' | calc.exe | grep -q '=> 2'
442 // test: echo -e 'prog (1, {set (1, 2), push (arg (1)), show})\ncall (1, 10)\nprog (1, {mem (1), sto (1, cos (arg (1)))})\ncall (1, pi / 2)\ndel (1)' | calc.exe -n | grep -q 'stack: 1 2 10'
443 // test: echo -e 'prog (1, {set (1, 2), push (arg (1)), show});\ncall (1, 10);\nshow\ndel (1)' | calc.exe -n | grep -q 'stack:$'
444 // test: echo -e 'prog (1, {set (1, 2), push (arg (1)), show});\ncall (1, 10);\nlen' | calc.exe -n | grep -q '=> 0'
445 // test: echo -e 'prog (1, {mem (2), sto (1, arg (1) - rcl (1) / 2)})\ncall (1, 1)\ncall (1, 2)\ncall (1, 3)\nprog (1, {mem (2), sto (2, rcl (1)), sto (1, arg (1)), rcl (2)})\ncall (1, 10)' | calc.exe -n | grep -q '=> 2.25'
446 // test: echo -e 'set (1, 2, -5, 6, -8, 9, -2, 23, 4)\nord\nshow' | calc.exe | grep -q 'stack: -8 -5 -2 1 2 4 6 9 23'
447 // test: echo -e 'set (1, 2, -5, 6, -8, 9, -2, 23, 4)\nmin (5, -3)\nmax (-1)\nmean (1, 2)\nvar (1, 2)\nmin\nmean\nmed\nmax\nprod\nsum\nvar' | calc.exe | awk 'BEGIN { split("9 -3 -1 1.5 0.5 -8 3.33333 2 23 -794880 30 73.3333", v) } /=>/ { for (i in v) if ($2 == v[i]) n++ } END { exit n != 12 }'
448 // test: echo -e 'set (1, 2, -5, 6, -8, 9, -2, 23, 4)\nmin (5, -3)\nmax (-1)\nmin\nmean\nmed\nmax\nord\nprod\nsum\nvar\nquit' | calc.exe -n -v 3 | grep -q bye
449 // test: echo -e 'min\nmean\nmed\nmax\nprod\nsum\nvar\nord\nset (1)\nord' | calc.exe -n | grep -c error | xargs test 9 =
450 // test: echo -e 'prog (1, cos(pi * arg (1))) / 4' | calc.exe | grep -c error | xargs test 1 =
451 // test: echo -e 'format\n.12345678901' | calc.exe | grep -n '=> 6'
452 // test: echo -e 'format (8)\n.12345678901' | calc.exe | grep -n '=> 0.12345679'
453 // test: echo -e 'format (12)\n.12345678901' | calc.exe | grep -n '=> 0.12345678901'
454 // test: echo -e 'format (4)\n.12345678901\format' | calc.exe | grep -n '=> 4'
455 // test: echo -e 'format (0)' | calc.exe | grep -n 'error'
456 // test: echo -e 'ff + ff' | calc.exe -b 16 | grep -q '=> 1fe'
457 // test: echo -e '60 / 4' | calc.exe -b 8 | grep -q '=> 14'
458 // test: echo -e 'z00-z0+1-2*z+20x' | calc.exe -b 36 | grep -q '=> 1000'
459 // test: echo -e '255' | calc.exe -b 10,16 | grep -q '=> ff'
460 // test: echo -e 'base (-2)\nbase (16, 0)' | calc.exe | grep -c error | xargs test 2 =
461 // test: echo -e 'base (10, 16)\n255' | calc.exe | grep -q '=> ff'
462 // test: echo -e 'base' | calc.exe | grep -q 'base (I/O): 10/10'
463
464 // Gauss sequence
465 // test: echo -e '{sto (1, 0), sto (10, 0), while (inc (10) <= 100, {sto (1, rcl (1) + rcl (10)), print (rcl (1))})};' | calc.exe | grep -q '=> 5050'
466
467 // Fibonacci sequence
468 // test: echo -e '{sto (1, 1), sto (2, 1), sto (10, 1), while (inc (10) <= 12 - 1, {sto (3, rcl (1) + rcl (2)), sto (1, rcl (2)), print (sto (2, rcl (3)))})};' | calc.exe | grep -q '=> 144'
469
470 // Gold number
471 // test: echo -e '{sto (1, 1), sto (2, 1), sto (10, 1), while (inc (10) < 15 - 1, {sto (3, rcl (1) + rcl (2)), sto (1, rcl (2)), print (sto (2, rcl (3)) / rcl (1))})};' | calc.exe | grep -q '=> 1.61803'
472
473 // Factorial sequence
474 // test: echo -e 'prog (1, cond (arg (1) > 1, arg (1) * call (1, arg (1) - 1), 1))\ncall (1, 10)' | calc.exe | grep -q '=> 3.6288e+06'
475
476 /* vim: set ts=4 sw=4 et: */