blob: 466cfee53b49d6b7b78ae836626f4ee4fdb85119 (
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
|
// 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>SLStack_h
#ifdef __GNUG__
#pragma interface
#endif
#define _<T>SLStack_h 1
#include "<T>.SLList.h"
#include "<T>.Stack.h"
class <T>SLStack : public <T>Stack
{
<T>SLList p;
public:
<T>SLStack();
<T>SLStack(const <T>SLStack& s);
inline ~<T>SLStack();
void operator = (const <T>SLStack&);
inline void push(<T&> item);
inline <T> pop();
inline <T>& top();
inline void del_top();
inline int empty();
inline int full();
inline int length();
inline void clear();
inline int OK();
};
inline <T>SLStack::<T>SLStack() :p() {}
inline <T>SLStack::<T>SLStack(const <T>SLStack& a) : p(a.p) {}
inline <T>SLStack::~<T>SLStack() {}
inline void <T>SLStack::push(<T&> item)
{
p.prepend(item);
}
inline <T> <T>SLStack::pop()
{
return p.remove_front();
}
inline <T>& <T>SLStack::top()
{
return p.front();
}
inline void <T>SLStack::del_top()
{
p.del_front();
}
inline void <T>SLStack::operator =(const <T>SLStack& s)
{
p = s.p;
}
inline int <T>SLStack::empty()
{
return p.empty();
}
inline int <T>SLStack::full()
{
return 0;
}
inline int <T>SLStack::length()
{
return p.length();
}
inline int <T>SLStack::OK()
{
return p.OK();
}
inline void <T>SLStack::clear()
{
p.clear();
}
#endif
|