diff --git a/main.c b/main.c index 28bc37d3c95fc94c1a166bb7841d38d75cc82e25..722dd95a4de7cf960e3e459851a5afb493a993b0 100644 --- a/main.c +++ b/main.c @@ -2,18 +2,16 @@ int main(){ stack s; - int value = 0; + int value = 13; stack_init(&s); - for (int i = 0; i < s.capacity; i++){ - s.top += 1; - s.data[s.top] = i; - printf("push : %d\n", s.data[s.top]); - } + s.top += 1; + s.data[s.top] = value; + + s.top += 1; + s.data[s.top] = value+1; - // stack_is_empty(stack s) stack_pop(&s, &value); - stack_peek(s, &value); free(s.data); s.data = NULL; diff --git a/stack.c b/stack.c index feee0645dadad997f564dcc030bfd55b3f270210..8ccafcfdf044a54c8d5519ff377fbb7d26f643eb 100644 --- a/stack.c +++ b/stack.c @@ -14,6 +14,7 @@ void stack_peek(stack s, int *value){ if (!stack_is_empty(s)) { *value = s.data[s.top]; } + printf("peek : value %d, top : %d\n", s.data[s.top],s.top); } // depile @@ -29,10 +30,4 @@ void stack_pop(stack *s, int *value){ *value = s->data[s->top]; printf("pop : %d, top : %d\n", s->data[s->top],s->top); s->top -= 1; - - // // si capacite 2x trop grande, on la rend plus petite - // if (s->capacity > 2*s->top){ - // s->capacity = s->top; - // s->data = realloc(s, sizeof(int)*s->capacity); - // } }