Simple static implementation of generic QUEUE in C#

?
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
public class CircularQueue<T>
{
    private const int InitialCapacity = 16;
 
    private T[] storage;
 
    private int capacity;
    private int startIndex;
    private int endIndex;
 
    public CircularQueue(int capacity = InitialCapacity)
    {
        this.Capacity = capacity;
        this.storage = new T[this.Capacity];
    }
 
    public int Count { get; private set; }
 
    private int Capacity
    {
        get
        {
            return this.capacity;
        }
 
        set
        {
            if (value <= 0)
            {
                throw new ArgumentOutOfRangeException(
                    nameof(value),
                    "Queue capacity should be a positive integer");
            }
 
            this.capacity = value;
        }
    }
 
    public void Enqueue(T element)
    {
        if (this.GrowNeeded())
        {
            this.Grow();
        }
 
        this.storage[this.endIndex] = element;
        this.endIndex = (this.endIndex + 1) % this.Capacity;
        this.Count++;
    }
 
    public T Dequeue()
    {
        if (this.Count <= 0)
        {
            throw new InvalidOperationException("Queue is empty.");
        }
 
        var element = this.storage[this.startIndex];
        this.storage[this.startIndex] = default(T);
        this.startIndex = (this.startIndex + 1) % this.Capacity;
        this.Count--;
 
        return element;
    }
 
    public T[] ToArray()
    {
        var resultArray = new T[this.Count];
        this.ResizeArrayStorage(resultArray);
 
        return resultArray;
    }
 
    private bool GrowNeeded()
    {
        var result = this.Count >= this.Capacity;
 
        return result;
    }
 
    private void Grow()
    {
        var newStorage = new T[this.Capacity * 2];
        this.ResizeArrayStorage(newStorage);
        this.startIndex = 0;
        this.endIndex = this.Capacity;
        this.Capacity *= 2;
 
        this.storage = newStorage;
    }
 
    private void ResizeArrayStorage(T[] array)
    {
        for (int i = 0; i < this.Count; i++)
        {
            var currentIndex = (this.startIndex + i) % this.Capacity;
            array[i] = this.storage[currentIndex];
        }
    }
}