-
Notifications
You must be signed in to change notification settings - Fork 0
/
stack.c
68 lines (63 loc) · 1.61 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
/*****************************************************************************
* Copyright (C) Vijesh B.G. vijay.ghandare@gmail.com
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation; either version 2.1 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program; if not, write to the Free Software Foundation,
* Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301, USA.
*****************************************************************************/
#include<stdio.h>
#include"stack.h"
void init(stack *s){
s->i = 0 ;
}
void push(stack *s,Integer num){
s->arr[s->i] = num;
(s->i)++;
}
Integer pop(stack *s){
Integer x;
x = s->arr[(s->i)-1];
(s->i)--;
return x;
}
int isempty(stack *s) {
return s->i;
}
int isfull(stack *s) {
return s->i == MAX - 1;
}
Integer top(stack *s){
return s->arr[(s->i)-1];
}
void cinit(cstack *t){
t->i = 0 ;
}
void cpush(cstack *t,char c){
t->carr[t->i] = c;
(t->i)++;
}
char cpop(cstack *t){
char x;
x = t->carr[(t->i)-1];
(t->i)--;
return x;
}
int cisempty(cstack *t) {
return t->i;
}
int cisfull(cstack *t) {
return t->i == MAX - 1;
}
char* ctop(cstack *t){
return &(t->carr[(t->i)-1]);
}