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