From 5e7591a2f684bba637e120497a2ba0fdd3db8dda Mon Sep 17 00:00:00 2001 From: Kirill Petrashin Date: Sun, 29 Mar 2026 14:52:47 +0300 Subject: Make the stack dynamic --- stack.h | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) (limited to 'stack.h') diff --git a/stack.h b/stack.h index 68fdb78..2105c7c 100644 --- a/stack.h +++ b/stack.h @@ -4,20 +4,20 @@ #include #include "structs.h" -/* So, the implementation of the stack is array-based, for hyperspeed. - * For bigger maps we have to increase the STACK_SIZE, but it should - * work fine most of the time. I guess */ -#define STACK_SIZE 4096 +#define STACK_INITIAL_CAPACITY 4096 +#define STACK_SIZE_COEFFICIENT 2 struct PositionStack_s { - Position arr[STACK_SIZE]; /* The array with all the values */ + Position *arr; /* The array with all the values */ + size_t capacity; size_t top; /* Shows where the top of the stack is */ }; typedef struct PositionStack_s PositionStack; PositionStack ps_new(void); /* Returns an empty position stack */ -int ps_push(PositionStack *ps, Position pos); /* Returns -1 if overflow */ +int ps_push(PositionStack *ps, Position pos); /* Returns -1 if failed to realloc() */ Position ps_pop(PositionStack *ps); Position ps_peek(PositionStack ps); +void ps_free(PositionStack ps); #endif /* STACK_H_ */ -- cgit v1.2.3