blob: 287a78187a139921f84249e0a7ae3ce80b5402fe (
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
121
122
123
124
125
126
127
128
129
130
|
// 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>VQueue_h
#ifdef __GNUG__
#pragma interface
#endif
#define _<T>VQueue_h 1
#include "<T>.Queue.h"
class <T>VQueue : public <T>Queue
{
protected:
int size;
int cnt;
int inp;
int outp;
<T>* s;
public:
<T>VQueue(int sz = DEFAULT_INITIAL_CAPACITY);
<T>VQueue(<T>VQueue&);
inline ~<T>VQueue();
void operator = (<T>VQueue&);
inline void enq(<T&> item);
inline <T> deq();
inline <T>& front();
inline void del_front();
inline int length();
inline int empty();
inline int full();
int capacity();
void resize(int sz);
inline void clear();
int OK();
};
inline <T>VQueue::<T>VQueue(int sz)
{
s = new <T> [size = sz];
cnt = inp = outp = 0;
}
inline <T>VQueue::~<T>VQueue()
{
delete [] s;
}
inline void <T>VQueue::clear()
{
inp = outp = 0;
cnt = 0;
}
inline int <T>VQueue::empty()
{
return cnt <= 0;
}
inline int <T>VQueue::capacity()
{
return size;
}
inline int <T>VQueue::full()
{
return cnt >= size;
}
inline int <T>VQueue::length()
{
return cnt;
}
inline void <T>VQueue::enq(<T&> item)
{
if (cnt >= size) error("enq to full Queue.");
++cnt;
s[inp] = item;
if (++inp == size) inp = 0;
}
inline <T> <T>VQueue::deq()
{
if (cnt <= 0) error("deq from empty Queue.");
--cnt;
int i = outp;
if (++outp == size) outp = 0;
return s[i];
}
inline void <T>VQueue::del_front()
{
if (cnt <= 0) error("delete from empty Queue.");
--cnt;
if (++outp == size) outp = 0;
}
inline <T>& <T>VQueue::front()
{
if (empty()) error("top from empty Queue.");
return s[outp];
}
#endif
|