blob: c7f7631a4cc941da1a61934b782edfa1961fc5e6 (
plain)
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
|
// This may look like C code, but it is really -*- C++ -*-
/*
Copyright (C) 1988 Free Software Foundation
written by Doug Lea (dl@rocky.oswego.edu)
This file is part of the GNU C++ Library. This library is free
software; you can redistribute it and/or modify it under the terms of
the GNU Library General Public License as published by the Free
Software Foundation; either version 2 of the License, or (at your
option) any later version. This library 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 Library General Public License for more details.
You should have received a copy of the GNU Library General Public
License along with this library; if not, write to the Free Software
Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#ifndef _<T>VStack_h
#ifdef __GNUG__
#pragma interface
#endif
#define _<T>VStack_h 1
#include "<T>.Stack.h"
class <T>VStack : public <T>Stack
{
protected:
int size;
int ptr;
<T>* s;
public:
<T>VStack(int sz = DEFAULT_INITIAL_CAPACITY);
<T>VStack(<T>VStack&);
inline ~<T>VStack();
void operator = (<T>VStack&);
inline void push(<T&> item);
inline <T> pop();
inline <T>& top();
inline void del_top();
inline int length();
inline int empty();
inline int full();
inline void clear();
void resize(int sz);
int capacity();
int OK();
};
inline <T>VStack::<T>VStack(int sz)
{
s = new <T> [size = sz];
ptr = 0;
}
inline <T>VStack::~<T>VStack()
{
delete [] s;
}
inline void <T>VStack::clear()
{
ptr = 0;
}
inline int <T>VStack::capacity()
{
return size;
}
inline int <T>VStack::empty()
{
return ptr == 0;
}
inline int <T>VStack::full()
{
return ptr == size;
}
inline int <T>VStack::length()
{
return ptr;
}
inline void <T>VStack::push(<T&> item)
{
if (full()) error("push to full stack.");
s[ptr++] = item;
}
inline <T> <T>VStack::pop()
{
if (empty()) error("pop from empty stack.");
return s[--ptr];
}
inline void <T>VStack::del_top()
{
if (empty()) error("del_top from empty stack.");
--ptr;
}
inline <T>& <T>VStack::top()
{
if (empty()) error("top from empty stack.");
return s[ptr-1];
}
#endif
|