-
Notifications
You must be signed in to change notification settings - Fork 0
/
stack.cpp
150 lines (115 loc) · 3.28 KB
/
stack.cpp
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
/********************************************************************
Copyright 2005 John M. Boyer
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
********************************************************************/
#include "appconst.h"
#include "stack.h"
#include <stdlib.h>
stackP sp_New(int Size)
{
stackP theStack;
theStack = (stackP) malloc(sizeof(stack));
if (theStack != NULL)
{
theStack->S = (int *) malloc(Size*sizeof(int));
if (theStack->S == NULL)
{
free(theStack);
theStack = NULL;
}
}
if (theStack != NULL)
{
theStack->Size = Size;
sp_ClearStack(theStack);
}
return theStack;
}
void sp_Free(stackP *pStack)
{
if (pStack == NULL || *pStack == NULL) return;
(*pStack)->Size = (*pStack)->Top = 0;
if ((*pStack)->S != NULL)
free((*pStack)->S);
(*pStack)->S = NULL;
free(*pStack);
*pStack = NULL;
}
int sp_Copy(stackP stackDst, stackP stackSrc)
{
stackP newStack = NULL;
int I, *p;
if (stackDst->Size == stackSrc->Size)
{
for (I=0; I < stackSrc->Top; I++)
stackDst->S[I] = stackSrc->S[I];
}
else
{
newStack = sp_New(stackSrc->Size);
if (newStack == NULL) return NOTOK;
for (I=0; I < stackSrc->Top; I++)
newStack->S[I] = stackSrc->S[I];
p = stackDst->S;
stackDst->S = newStack->S;
newStack->S = p;
newStack->Size = stackDst->Size;
sp_Free(&newStack);
}
stackDst->Top = stackSrc->Top;
stackDst->Size = stackSrc->Size;
return OK;
}
#ifndef SPEED_MACROS
int sp_ClearStack(stackP theStack)
{
theStack->Top = 0;
return OK;
}
int sp_IsEmpty(stackP theStack)
{
return !theStack->Top;
}
int sp_NonEmpty(stackP theStack)
{
return theStack->Top;
}
int sp_Push(stackP theStack, int a)
{
// if (theStack->Top >= theStack->Size)
// return NOTOK;
theStack->S[theStack->Top++] = a;
return OK;
}
int sp_Push2(stackP theStack, int a, int b)
{
// if (theStack->Top + 1 >= theStack->Size)
// return NOTOK;
theStack->S[theStack->Top++] = a;
theStack->S[theStack->Top++] = b;
return OK;
}
int sp__Pop(stackP theStack, int *pA)
{
// if (theStack->Top <= 0)
// return NOTOK;
*pA = theStack->S[--theStack->Top];
return OK;
}
int sp__Pop2(stackP theStack, int *pA, int *pB)
{
// if (theStack->Top <= 1)
// return NOTOK;
*pB = theStack->S[--theStack->Top];
*pA = theStack->S[--theStack->Top];
return OK;
}
#endif // SPEED_MACROS