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
|
--- fifo.h.orig Fri Aug 6 09:09:02 1999
+++ fifo.h Wed Aug 18 22:28:00 2004
@@ -4,7 +4,8 @@
#ifndef __FIFO_H__
#define __FIFO_H__
-#include <iostream.h>
+#include <iostream>
+using namespace std;
#include <stddef.h>
#ifndef NULL
#define NULL (void *) 0
@@ -19,8 +20,8 @@
const T *data;
struct queue *next;
} queue;
- struct queue *start;
- struct queue **end;
+ struct fifo<T>::queue *start;
+ struct fifo<T>::queue **end;
int length;
public:
@@ -61,7 +62,7 @@
template<class T>
void fifo<T>::clear(void)
{
- struct queue *ptr, *next;
+ struct fifo<T>::queue *ptr, *next;
ptr=start;
while (ptr!=NULL)
@@ -79,7 +80,7 @@
template<class T>
fifo<T>::~fifo(void)
{
- struct queue *ptr, *next;
+ struct fifo<T>::queue *ptr, *next;
ptr=start;
while (ptr!=NULL)
@@ -94,12 +95,12 @@
template<class T>
void fifo<T>::enqueue(const T *d)
{
- struct queue *q;
+ struct fifo<T>::queue *q;
#ifdef DEBUG_FIFO
cerr<<"Queue "<<(void *) d<<"\n";
#endif
- q=new(struct queue);
+ q=new(struct fifo<T>::queue);
q->next=NULL;
q->data=d;
*end=q;
@@ -110,7 +111,7 @@
template<class T>
void fifo<T>::insert(const T *d)
{
- struct queue *q;
+ struct fifo<T>::queue *q;
#ifdef CONSIST_CHECK
if (end==NULL)
{
@@ -119,7 +120,7 @@
}
#endif
- q=new(struct queue);
+ q=new(struct fifo<T>::queue);
q->next=start;
q->data=d;
start=q;
@@ -132,7 +133,7 @@
const T *fifo<T>::dequeue(void)
{
const T *d;
- struct queue *q;
+ struct fifo<T>::queue *q;
#ifdef CONSIST_CHECK
if (end==NULL)
{
@@ -206,7 +207,7 @@
template<class T>
void fifo<T>::rev(void)
{
- struct queue *p, *n, *hdr, **ep;
+ struct fifo<T>::queue *p, *n, *hdr, **ep;
#ifdef CONSIST_CHECK
if (end==NULL || d->end==NULL)
{
|
