+#include <math.h>
#include <stdio.h>
#include "debug.h"
double push (double val)
{
- return push_tab (stack, -1, val);
+ double ret = NAN;
+ if (stack) {
+ ret = push_tab (stack, -1, val);
+ } else {
+ stack = resize_tab (stack, 1);
+ ret = set_tab (stack, 1, val);
+ }
+ return ret;
}
double put (int n, double val)
void show (void)
{
int i, n = size_tab (stack);
- fprintf (stdout, "stack:");
+ printf ("stack:");
for (i = 0; i < n; i++) {
- fprintf (stdout, " ");
- fprintf (stdout, minform, get_tab (stack, i + 1));
+ printf (" ");
+ printl (get_tab (stack, i + 1));
}
- fprintf (stdout, "\n");
+ printf ("\n");
}
/* stack functions */
void order ()
{
- int n = size_tab (stack);
- if (n < 3) {
- VERBOSE (WARNING, fprintf (stdout, "error not enough element in stack (%d)\n", n));
- } else {
- order_tab (stack);
- }
+ order_tab (stack);
}
double median ()