- fprintf (stdout, "\n");
-}
-
-/* stack functions */
-
-double max ()
-{
- double ret = 0;
- int i;
- if (stack_size < 1) {
- VERBOSE (WARNING, fprintf (stdout, "error not enough element in stack (%d)\n", stack_size));
- return 0;
- }
- ret = stack[0];
- for (i = 1; i < stack_size; i++) {
- if (stack[i] > ret) {
- ret = stack[i];
- }
- }
- return ret;
-}
-
-double mean ()
-{
- double ret = 0;
- int i;
- if (stack_size < 1) {
- VERBOSE (WARNING, fprintf (stdout, "error not enough element in stack (%d)\n", stack_size));
- return 0;
- }
- for (i = 0; i < stack_size; i++) {
- ret += stack[i];
- }
- return ret / stack_size;
-}
-
-double min ()
-{
- double ret = 0;
- int i;
- if (stack_size < 1) {
- VERBOSE (WARNING, fprintf (stdout, "error not enough element in stack (%d)\n", stack_size));
- return 0;
- }
- ret = stack[0];
- for (i = 1; i < stack_size; i++) {
- if (stack[i] < ret) {
- ret = stack[i];
- }
- }
- return ret;
-}
-
-void order ()
-{
- int i, j;
- if (stack_size < 1) {
- VERBOSE (WARNING, fprintf (stdout, "error not enough element in stack (%d)\n", stack_size));
- return;
- }
- for (i = 0; i < stack_size - 1; i++) {
- int done = 0;
- for (j = 0; j < stack_size - 1; j++) {
- if (stack[j] > stack[j + 1]) {
- double tmp = stack[j];
- stack[j] = stack[j + 1];
- stack[j + 1] = tmp;
- done = 1;
- }
- }
- if (done == 0) {
- break;
- }
- }
-}
-
-double median ()
-{
- double ret = 0;
- if (stack_size < 3) {
- VERBOSE (WARNING, fprintf (stdout, "error not enough element in stack (%d)\n", stack_size));
- return 0;
- }
- double *tmp = (double *) callocordie (stack_size, sizeof (double));
- memcpy (tmp, stack, stack_size * sizeof (double));
- order ();
- ret = stack[(stack_size - 1)/ 2];
- memcpy (stack, tmp, stack_size * sizeof (double));
- free (tmp);
- return ret;
-}
-
-double prod ()
-{
- double ret = 1;
- int i;
- if (stack_size < 1) {
- VERBOSE (WARNING, fprintf (stdout, "error not enough element in stack (%d)\n", stack_size));
- return 0;
- }
- for (i = 0; i < stack_size; i++) {
- ret *= stack[i];
- }
- return ret;
-}
-
-double sum ()
-{
- double ret = 0;
- int i;
- if (stack_size < 1) {
- VERBOSE (WARNING, fprintf (stdout, "error not enough element in stack (%d)\n", stack_size));
- return 0;
- }
- for (i = 0; i < stack_size; i++) {
- ret += stack[i];
- }
- return ret;
-}
-
-double variance ()
-{
- double ret = 0;
- double m = 0;
- int i;
- if (stack_size < 2) {
- VERBOSE (WARNING, fprintf (stdout, "error not enough element in stack (%d)\n", stack_size));
- return 0;
- }
- m = mean ();
- for (i = 0; i < stack_size; i++) {
- ret += (stack[i] - m) * (stack[i] - m);
- }
- return ret / stack_size;
-}
-
-
-/* help message */
-
-void help (void)
-{
- fprintf (stdout, "calc is a simple calculator\n\n");
- fprintf (stdout, "arithmetic op.:");
- fprintf (stdout, " + - * / %% ^\n");
- fprintf (stdout, "comparison op.:");
- fprintf (stdout, " == != >= <= > <\n");
- fprintf (stdout, "logical op.:");
- fprintf (stdout, " & | !\n");
- fprintf (stdout, "mathematic func.:");
- fprintf (stdout, " exp ln log pow sqrt\n");
- fprintf (stdout, "trigonometric func.:");
- fprintf (stdout, " acos asin atan cos sin tan\n");
- fprintf (stdout, "error functions:");
- fprintf (stdout, " erf erfc\n");
- fprintf (stdout, "miscellaneous func.:");
- fprintf (stdout, " abs ceil floor\n");
- fprintf (stdout, "storage func.:");
- fprintf (stdout, " clear dec disp inc mem rcl sto\n");
- fprintf (stdout, "control flow prim.:");
- fprintf (stdout, " cond print while {} ;\n");
- fprintf (stdout, "program management:");
- fprintf (stdout, " arg call del edit ls prog\n");
- fprintf (stdout, "stack management:");
- fprintf (stdout, " get len pop push put set show\n");
- fprintf (stdout, "stack func.:");
- fprintf (stdout, " max mean med min ord prod sum var\n");
- fprintf (stdout, "control management:");
- fprintf (stdout, " help quit\n");
- fprintf (stdout, "constants:");
- fprintf (stdout, " ans e pi\n");