-
Notifications
You must be signed in to change notification settings - Fork 0
/
stack.h
50 lines (39 loc) · 1.49 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
40
41
42
43
44
45
46
47
48
49
50
/* stack.h: declarations for the Stack class (for deduction stack); from Prata
Copyright 2011 Kenneth S. Brown.
This file is part of Toddcox.
Toddcox 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 (GPLv3+).
Toddcox 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 Toddcox; if not, see <http://gnu.org/licenses/>.
Written by Ken Brown <kbrown@cornell.edu>. */
#ifndef STACK_H_
#define STACK_H_
typedef struct
{
int c; /* coset */
int x; /* generator */
} deduction;
typedef deduction Item;
class Stack
{
private:
enum {MAX = 1024};
Item items[MAX]; // holds stack items
int top; // index just beyond end of stack
public:
Stack () { top = 0; };
bool is_empty () const { return top == 0; };
bool is_full () const { return top == MAX; };
// push() returns false if stack already is full, true otherwise
bool push (const Item & item);
// pop() returns false if stack already is empty, true otherwise
bool pop (Item & item); // pop top into item
void erase () { top = 0; };
};
#endif /* STACK_H */