请教队列（queue)

[jefson]

1.fatal.h
#include <stdio.h>
#include <stdlib.h>

#define Error( Str ) FatalError( Str )
#define FatalError( Str ) fprintf( stderr, "%s\n", Str ), exit( 1 )

2.queue.h
typedef int ElementType;
/* START: fig3_57.txt */
#ifndef _Queue_h
#define _Queue_h

struct QueueRecord;
typedef struct QueueRecord *Queue;

int IsEmpty( Queue Q );
int IsFull( Queue Q );
Queue CreateQueue( int MaxElements );
void DisposeQueue( Queue Q );
void MakeEmpty( Queue Q );
void Enqueue( ElementType X, Queue Q );
ElementType Front( Queue Q );
void Dequeue( Queue Q );
ElementType FrontAndDequeue( Queue Q );

#endif /* _Queue_h */
/* END */


3.queue.cpp
#include "queue.h"
#include "fatal.h"
#include <stdlib.h>

#define MinQueueSize ( 5 )

struct QueueRecord
{
int Capacity;
int Front;
int Rear;
int Size;
ElementType *Array;
};

/* START: fig3_58.txt */
int
IsEmpty( Queue Q )
{
return Q->Size == 0;
}
/* END */

int
IsFull( Queue Q )
{
return Q->Size == Q->Capacity;
}

Queue
CreateQueue( int MaxElements )
{
Queue Q;

/* 1*/ if( MaxElements < MinQueueSize )
/* 2*/ Error( "Queue size is too small" );

/* 3*/ Q =(QueueRecord*) malloc( sizeof( struct QueueRecord ) );
/* 4*/ if( Q == NULL )
/* 5*/ FatalError( "Out of space!!!" );

/* 6*/ Q->Array = (ElementType*)malloc( sizeof( ElementType ) * MaxElements );
/* 7*/ if( Q->Array == NULL )
/* 8*/ FatalError( "Out of space!!!" );
/* 9*/ Q->Capacity = MaxElements;
/*10*/ MakeEmpty( Q );

/*11*/ return Q;
}

/* START: fig3_59.txt */
void
MakeEmpty( Queue Q )
{
Q->Size = 0;
Q->Front = 1;
Q->Rear = 0;
}
/* END */

void
DisposeQueue( Queue Q )
{
if( Q != NULL )
{
free( Q->Array );
free( Q );
}
}

/* START: fig3_60.txt */

static int
Succ( int Value, Queue Q )
{
if( ++Value == Q->Capacity )
Value = 0;
return Value;
}

void
Enqueue( ElementType X, Queue Q )
{
if( IsFull( Q ) )
Error( "Full queue" );
else
{
Q->Size++;
Q->Rear = Succ( Q->Rear, Q );
Q->Array[ Q->Rear ] = X;
}
}
/* END */



ElementType
Front( Queue Q )
{
if( !IsEmpty( Q ) )
return Q->Array[ Q->Front ];
Error( "Empty queue" );
return 0; /* Return value used to avoid warning */
}

void
Dequeue( Queue Q )
{
if( IsEmpty( Q ) )
Error( "Empty queue" );
else
{
Q->Size--;
Q->Front = Succ( Q->Front, Q );
}
}

ElementType
FrontAndDequeue( Queue Q )
{
ElementType X = 0;

if( IsEmpty( Q ) )
Error( "Empty queue" );
else
{
Q->Size--;
X = Q->Array[ Q->Front ];
Q->Front = Succ( Q->Front, Q );
}
return X;
}

4.vc.cpp
#include <iostream>
#include "queue.h"
using namespace std;

int main( )
{
Queue Q;
int i;

Q = CreateQueue( 12 );

for( i = 0; i < 10; i++ )
Enqueue( i, Q );
//cout<<endl<< Q->Array[1 ]<<"haha"<<endl;
//就是加了这行有错误
while( !IsEmpty( Q ) )
{
printf( "%d\n", Front( Q ) );
Dequeue( Q );
}
for( i = 0; i < 10; i++ )
Enqueue( i, Q );

while( !IsEmpty( Q ) )
{
printf( "%d\n", Front( Q ) );
Dequeue( Q );
}

DisposeQueue( Q );

system("pause");
return 0;
}

[lei001]

将queue.cpp中的
struct QueueRecord
{
int Capacity;
int Front;
int Rear;
int Size;
ElementType *Array;
};
移到queue.h中,这样vc.cpp中就认识了,

vc环境下输出为：
0haha
0
1
2
3
4
5
6
7
8
9
0
1
2
3
4
5
6
7
8
9
请按任意键继续. . .

[jefson]

谢谢，大侠！