-
Notifications
You must be signed in to change notification settings - Fork 0
/
stack.c
57 lines (49 loc) · 1.14 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
/* Copyright 2024 Oğuz İsmail Uysal <[email protected]>
*
* This file is part of Rachel.
*
* Rachel is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
#include <assert.h>
#include "stack.h"
static void *a[8];
static size_t n;
void
push(void *x) {
assert(n < sizeof a/sizeof a[0]);
a[n++] = x;
}
struct node *
pop(void) {
assert(n > 0);
return a[--n];
}
const struct node *
peek(void) {
assert(n > 0);
return a[n-1];
}
const struct node *
lift(void) {
assert(n > 1);
return a[n-2];
}
size_t
stack_size(void) {
return n;
}
void
clear(void) {
n = 0;
}