-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathstack.h
39 lines (34 loc) · 1.17 KB
/
stack.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
/**
* Header file for implementation of stack data structure.
*
*/
#ifndef STACK
#define STACK
// Macro functions
#define stackEmpty(stack) ((stack)->head == NULL)
#define stackSize(stack) ((stack)->size)
#define isStackTop(stack, item) ((item) == (stack)->head)
#define destroyStackItem(stack, item) (((stack)->destroy)((item)->data))
typedef struct stackitem_ {
void *data;
struct stackitem_ *previous;
} StackItem;
typedef struct stack_ {
int size;
int (*destroy)(void *data); // specifies how to deallocate
char *(*toString)(void *data); // specifies how to print data
int (*compare)(void *key1, void *key2);
StackItem *head;
} Stack;
Stack *initStack(int (*destroy)(void *data), char *(*toString)(void *data),
int (*compare)(void *key1, void *key2));
StackItem *initStackItem(void *data);
void push(Stack *stack, void *data);
void *pop(Stack *stack);
void *peekStack(Stack *stack);
StackItem *freeStackItem(Stack *stack, StackItem *stackItem);
void freeStack(Stack *stack);
void stackItemPrint(Stack *stack, StackItem *stackItem);
void printStackTop(Stack *stack);
void stackPrint(Stack *stack);
#endif