aboutsummaryrefslogtreecommitdiff
path: root/stack.h
diff options
context:
space:
mode:
authorKirill Petrashin <kirill8201@yandex.ru>2026-03-14 14:42:14 +0300
committerKirill Petrashin <kirill8201@yandex.ru>2026-03-14 14:42:14 +0300
commit528841328da0114981ee6e8c6dbdde72b64fb284 (patch)
treee127cdab3debaa7e1a8e8b825c07ca85502681d2 /stack.h
parent365f1baabae9b2ccb3df1b4a4821bff58611f2de (diff)
Fix stack + implement rbt_maze_map()
Diffstat (limited to 'stack.h')
-rw-r--r--stack.h5
1 files changed, 3 insertions, 2 deletions
diff --git a/stack.h b/stack.h
index a83a135..68fdb78 100644
--- a/stack.h
+++ b/stack.h
@@ -1,6 +1,7 @@
#ifndef STACK_H_
#define STACK_H_
+#include <stddef.h>
#include "structs.h"
/* So, the implementation of the stack is array-based, for hyperspeed.
@@ -15,8 +16,8 @@ struct PositionStack_s {
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 */
-Position ps_pop(PositionStack ps);
+int ps_push(PositionStack *ps, Position pos); /* Returns -1 if overflow */
+Position ps_pop(PositionStack *ps);
Position ps_peek(PositionStack ps);
#endif /* STACK_H_ */