-
Notifications
You must be signed in to change notification settings - Fork 4
/
Copy pathstack.c
152 lines (126 loc) · 2.43 KB
/
stack.c
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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
/* a facility for saving pointers in a push pop stack */
#include <stdio.h>
#include <stdlib.h>
#include "stack.h"
/* private functions */
STACK *stack_new();
int stack_print();
STACK *stack_new()
{
STACK *tmp;
tmp = (STACK *) malloc(sizeof(STACK));
tmp->saved = NULL;
tmp->next = NULL;
tmp->count = 0;
return(tmp);
}
int stack_depth(STACK **stack)
{
if (*stack == NULL) {
return(0);
} else {
return((*stack)->count);
}
}
void stack_push(STACK **stack, char *pointer)
{
STACK *tmp;
tmp = stack_new();
tmp->saved = pointer;
if (*stack == NULL) { /* first call */
tmp->next = NULL;
tmp->count = 1;
} else { /* subsequent calls */
tmp->next = *stack;
tmp->count = (*stack)->count+1;
}
*stack = tmp;
/* stack_print(stack); */
}
char *stack_pop(STACK **stack)
{
char *s;
STACK *tmp;
if (*stack == NULL) { /* empty stack */
return(NULL);
} else { /* subsequent calls */
tmp = *stack;
s = (*stack)->saved;
*stack = (*stack)->next;
free(tmp);
return(s);
}
}
void stack_free(STACK **stack)
{
STACK *s;
if (*stack == NULL) {
return;
}
while ((s=(STACK *)stack_pop(stack)) != NULL) {
;
}
}
int stack_print(STACK **stack)
{
int i=0;
STACK *sp;
if (stack == NULL) {
return(0);
}
sp = *stack;
while(sp != NULL) {
if (sp->saved != NULL) {
printf("stack #%d: %s\n", i++, sp->saved);
}
sp = sp->next;
}
return(0);
}
char *stack_top(STACK **stack) /* return top of stack w/o pop */
{
char *p;
if (*stack == NULL) {
return NULL;
}
if (*stack != NULL) {
p = (*stack)->saved;
} else {
p = NULL;
}
return p;
}
char *stack_walk(STACK **stack) /* each call returns a new entry, modifies stack */
{
char *p;
if (*stack == NULL) {
return NULL;
}
if (*stack != NULL) {
p = (*stack)->saved;
*stack = (*stack)->next;
}
return p;
}
/*
int main() {
STACK *stack;
STACK *tmp;
char *s;
stack=NULL;
stack_push(&stack, "hello");
stack_push(&stack, "world");
stack_push(&stack, "this");
stack_push(&stack, "is");
stack_push(&stack, "a");
stack_push(&stack, "test");
tmp=stack;
while (tmp!=NULL) {
printf("%s\n", stack_walk(&tmp));
}
while ((s=stack_pop(&stack))!=NULL) {
printf("%s\n",s);
}
return(1);
}
*/