stack_adt: C exercise

Your mission

Write stack.c, a stack of int with no size limit that callers only reach through five functions, where the last value pushed is the first one popped.

See it in action

push 1, 2, 3, then pop three times: 3 2 1
int out = 7; stack_pop(empty, &out);: returns 0, out is still 7
push 4, push 9, pop, stack_size: 1

Your checklist

Define struct s_stack in stack.c and keep typedef struct s_stack Stack; and the five prototypes from the starter: Grademe declares them the same way. Use only malloc, free and realloc.
stack_new returns a new empty stack that shares nothing with any other stack, or NULL if allocation fails.
stack_push puts value on top of s and returns 0, or returns -1 if allocation fails. A stack has no fixed capacity: the tests push thousands of values.
stack_pop removes the top value of s, writes it to *out and returns 1. On an empty stack it returns 0 and leaves *out as it was.
stack_size returns the number of values on s.
stack_free releases s and every value still on it. stack_free(NULL) does nothing.

Constraints

Expected file: stack.c
Allowed functions: mallocfreerealloc
Allowed headers: <stdlib.h>declares malloc, free and realloc<stddef.h>defines size_t and NULL

Your mission

Write stack.c, a stack of int with no size limit that callers only reach through five functions, where the last value pushed is the first one popped.

See it in action

push 1, 2, 3, then pop three times: 3 2 1
int out = 7; stack_pop(empty, &out);: returns 0, out is still 7
push 4, push 9, pop, stack_size: 1

Your checklist

Define struct s_stack in stack.c and keep typedef struct s_stack Stack; and the five prototypes from the starter: Grademe declares them the same way. Use only malloc, free and realloc.
stack_new returns a new empty stack that shares nothing with any other stack, or NULL if allocation fails.
stack_push puts value on top of s and returns 0, or returns -1 if allocation fails. A stack has no fixed capacity: the tests push thousands of values.
stack_pop removes the top value of s, writes it to *out and returns 1. On an empty stack it returns 0 and leaves *out as it was.
stack_size returns the number of values on s.
stack_free releases s and every value still on it. stack_free(NULL) does nothing.

Constraints

Expected file: stack.c
Allowed functions: mallocfreerealloc
Allowed headers: <stdlib.h>declares malloc, free and realloc<stddef.h>defines size_t and NULL

Your mission

Write stack.c, a stack of int with no size limit that callers only reach through five functions, where the last value pushed is the first one popped.

See it in action

push 1, 2, 3, then pop three times: 3 2 1
int out = 7; stack_pop(empty, &out);: returns 0, out is still 7
push 4, push 9, pop, stack_size: 1

Your checklist

Define struct s_stack in stack.c and keep typedef struct s_stack Stack; and the five prototypes from the starter: Grademe declares them the same way. Use only malloc, free and realloc.
stack_new returns a new empty stack that shares nothing with any other stack, or NULL if allocation fails.
stack_push puts value on top of s and returns 0, or returns -1 if allocation fails. A stack has no fixed capacity: the tests push thousands of values.
stack_pop removes the top value of s, writes it to *out and returns 1. On an empty stack it returns 0 and leaves *out as it was.
stack_size returns the number of values on s.
stack_free releases s and every value still on it. stack_free(NULL) does nothing.

Constraints

Expected file: stack.c
Allowed functions: mallocfreerealloc
Allowed headers: <stdlib.h>declares malloc, free and realloc<stddef.h>defines size_t and NULL

Your mission

Write stack.c, a stack of int with no size limit that callers only reach through five functions, where the last value pushed is the first one popped.

See it in action

push 1, 2, 3, then pop three times: 3 2 1
int out = 7; stack_pop(empty, &out);: returns 0, out is still 7
push 4, push 9, pop, stack_size: 1

Your checklist

Define struct s_stack in stack.c and keep typedef struct s_stack Stack; and the five prototypes from the starter: Grademe declares them the same way. Use only malloc, free and realloc.
stack_new returns a new empty stack that shares nothing with any other stack, or NULL if allocation fails.
stack_push puts value on top of s and returns 0, or returns -1 if allocation fails. A stack has no fixed capacity: the tests push thousands of values.
stack_pop removes the top value of s, writes it to *out and returns 1. On an empty stack it returns 0 and leaves *out as it was.
stack_size returns the number of values on s.
stack_free releases s and every value still on it. stack_free(NULL) does nothing.

Constraints

Expected file: stack.c
Allowed functions: mallocfreerealloc
Allowed headers: <stdlib.h>declares malloc, free and realloc<stddef.h>defines size_t and NULL