// test: echo -e 'rcl (3)\ndisp' | calc.exe | grep -q "storage: 0 0 0 0 0 0 0 0 0 0"
// test: echo -e 'inc (2)\ndisp' | calc.exe | grep -q "storage: 0 1 0 0 0 0 0 0 0 0"
// test: echo -e 'dec (2)\ndisp' | calc.exe | grep -q "storage: 0 -1 0 0 0 0 0 0 0 0"
+// test: echo -e 'sto (3, pi)\nclr\ndisp' | calc.exe | grep -q "storage: 0 0 0 0 0 0 0 0 0 0"
+// test: echo -e 'mem (3)\nclr' | calc.exe -v 3 | grep -q Clear
// Gauss sequence
// 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'
{ "|", Or, 2, 1, -2}
};
-#define NB_FUNCTIONS 25
+#define NB_FUNCTIONS 26
keyword_t functions[NB_FUNCTIONS] = {
{ "sqrt", Sqr, 1, 4, 5},
{ "pow", Pow, 2, 3, 5},
{ "dec", Dec, 1, 3, 5},
{ "disp", Disp, 0, 4, 9},
{ "mem", Mem, 1, 3, 9},
+ { "clr", Clear, 0, 3, 9},
{ "quit", Quit, 0, 4, 9},
{ "help", Help, 0, 4, 9},
{ "!", Not, 1, 1, 6},
case Dec: func = "Decrease"; break;
case Disp: func = "Display"; break;
case Mem: func = "Memory"; break;
+ case Clear: func = "Clear"; break;
case Quit: func = "Quit"; break;
case Help: func = "Help"; break;
case Ans: func = "Ans"; break;
fprintf (stdout, "\n");
}
+void clear ()
+{
+ int i;
+ for (i = 0; i < storage_size; i++) {
+ storage[i] = 0;
+ }
+}
+
/* While do function */
double while_do (element_t *cond, element_t *action)
}
break;
case Disp:
+ case Clear:
case Quit:
case Help:
case Ans:
case Dec: return decrease ((int)op0);
case Disp: display (); break;
case Mem: memory ((int)op0); break;
+ case Clear: clear (); break;
case Quit: quit (); break;
case Help: help (); break;
case Ans: return answer;
Cos, Sin, Tan, Acos, Asin, Atan,
Log, Exp,
Abs, Ceil, Floor,
- Store, Recall, Inc, Dec, Disp, Mem,
+ Store, Recall, Inc, Dec, Disp, Mem, Clear,
Quit, Help,
Ans, E, Pi,
Equal, Diff, Ge, Le, Gt, Lt,