C ＃ implements queue structure definition, incoming and outgoing operations

In this paper, C# Implement queue structure definition 、 The team 、 Out of line operation
1、 Queue structure definition
///
/// Queue structure definition
///
public struct SqQueue {
public int[] data;// Queued elements
public int front, real;// Team leader and team leader
}

2、 Queue initialization
///
/// Queue initialization
///
///
static void InitQueue(ref SqQueue Q) {
Q.real = Q.front=0;
}
3、 Determines if the queue is empty
///
/// Determines if the queue is empty
///
///
///
static bool isEmpty( SqQueue Q) {
if (Q.front == Q.real) { return true; }
else return false;
}
4、 The team
///
/// The team
///
///
///
///
static bool EnQueue(ref SqQueue Q,int x) {
if ((Q.real+1)%MAXSizeQ.front) { return false; }
Q.data[Q.real] = x;
Q.real = (Q.real + 1) % MAXSize;
return true;
}
5、 Out of the team
static bool DeQueue(ref SqQueue Q, ref int x) {
if (Q.realQ.front) { return false; }
x = Q.data[Q.front];
Q.front = (Q.front + 1) % MAXSize;
return true;
}
6、 actual main Function test
static void Main(string[] args)
{
SqQueue Q = new SqQueue();
Q.data = new int[MAXSize];
int x = 0;
// Initialize queue
InitQueue(ref Q);
while (x!=999) {
Console.WriteLine(“ Please enter the team entry element ：”);
x = int.Parse(Console.ReadLine());
if ((Q.real+1)%MAXSize==Q.front) {
Console.WriteLine(“ The queue is full .”);
break;
}
if (x!=999) EnQueue(ref Q, x);
}
// Out of the team
Console.WriteLine(“ The output elements are as follows ：”);
while (!isEmpty(Q)) {
DeQueue(ref Q,ref x);
Console.WriteLine(x);
}

        Console.ReadLine();

    }