HuntnGather – Rev 1
?pathlinks?
///////////////////////////////////////////////////////////////////////////
// Copyright (C) 2021 Wizardry and Steamworks - License: MIT //
///////////////////////////////////////////////////////////////////////////
/* The stringStack structure with top being the index of the next element
* to be inserted in stack (the top-most element to be found at top - 1).
*/
typedef struct {
int size;
char **store;
int top;
} stringStack;
// Zero or one arguments for stringStackCreate_Internal.
#define stringStackIsEmpty(s) (s->top == 0)
#define stringStackSize(s) s->size
#define stringStackCount(s) s->top
extern stringStack* stringStackCreate(unsigned int size);
extern stringStack* stringStackClear(stringStack *s);
extern void stringStackPush(stringStack *s, char *e);
extern char *stringStackPop(stringStack *s);
extern void stringStackDestroy(stringStack *s);
extern void stringStackPrint(stringStack *s);