-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDotnetQueue.cs
71 lines (61 loc) · 1.43 KB
/
DotnetQueue.cs
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
using System;
using System.Collections.Generic;
using System.Linq;
using System.Threading.Tasks;
namespace DataStructBackend
{
public class DotnetQueue<T>
{
protected int maxSize;
protected T[] instanceArray;
public int front;
public int rear;
public int nItems;
public DotnetQueue(int size)
{
maxSize = size;
instanceArray = new T[maxSize];
front = 0;
rear = -1;
nItems = 0;
}
public virtual void Insert(T item)
{
if (rear == maxSize - 1) rear = -1;
instanceArray[++rear] = item;
}
// take item from front of queue:
public virtual T Remove()
{
T tempArray = instanceArray[front++];
if (front == maxSize) front = 0;
nItems--;
return tempArray;
}
public void Push(T value)
{
instanceArray[++front] = value;
nItems++;
}
public T PeekFront()
{
return instanceArray[front];
}
public T Pop()
{
return instanceArray[front--];
}
public bool IsEmpty()
{
return nItems == 0;
}
public bool IsFull()
{
return nItems == maxSize;
}
public int Size()
{
return nItems;
}
}
}