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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
|
// Copyright (c) AlphaSierraPapa for the SharpDevelop Team (for details please see \doc\copyright.txt)
// This code is distributed under the GNU LGPL (for details please see \doc\license.txt)
using System;
using System.Collections.Generic;
using System.Diagnostics;
namespace Tango.Scripting.Editors.Utils
{
/// <summary>
/// Double-ended queue.
/// </summary>
[System.Diagnostics.CodeAnalysis.SuppressMessage("Microsoft.Naming", "CA1710:IdentifiersShouldHaveCorrectSuffix")]
[Serializable]
public sealed class Deque<T> : ICollection<T>
{
T[] arr = Empty<T>.Array;
int size, head, tail;
/// <inheritdoc/>
public int Count {
get { return size; }
}
/// <inheritdoc/>
public void Clear()
{
arr = Empty<T>.Array;
size = 0;
head = 0;
tail = 0;
}
/// <summary>
/// Gets/Sets an element inside the deque.
/// </summary>
public T this[int index] {
get {
ThrowUtil.CheckInRangeInclusive(index, "index", 0, size - 1);
return arr[(head + index) % arr.Length];
}
set {
ThrowUtil.CheckInRangeInclusive(index, "index", 0, size - 1);
arr[(head + index) % arr.Length] = value;
}
}
/// <summary>
/// Adds an element to the end of the deque.
/// </summary>
[System.Diagnostics.CodeAnalysis.SuppressMessage("Microsoft.Naming", "CA1702:CompoundWordsShouldBeCasedCorrectly", MessageId = "PushBack")]
public void PushBack(T item)
{
if (size == arr.Length)
SetCapacity(Math.Max(4, arr.Length * 2));
arr[tail++] = item;
if (tail == arr.Length) tail = 0;
size++;
}
/// <summary>
/// Pops an element from the end of the deque.
/// </summary>
public T PopBack()
{
if (size == 0)
throw new InvalidOperationException();
if (tail == 0)
tail = arr.Length - 1;
else
tail--;
T val = arr[tail];
arr[tail] = default(T); // allow GC to collect the element
size--;
return val;
}
/// <summary>
/// Adds an element to the front of the deque.
/// </summary>
public void PushFront(T item)
{
if (size == arr.Length)
SetCapacity(Math.Max(4, arr.Length * 2));
if (head == 0)
head = arr.Length - 1;
else
head--;
arr[head] = item;
size++;
}
/// <summary>
/// Pops an element from the end of the deque.
/// </summary>
public T PopFront()
{
if (size == 0)
throw new InvalidOperationException();
T val = arr[head];
arr[head] = default(T); // allow GC to collect the element
head++;
if (head == arr.Length) head = 0;
size--;
return val;
}
void SetCapacity(int capacity)
{
T[] newArr = new T[capacity];
CopyTo(newArr, 0);
head = 0;
tail = (size == capacity) ? 0 : size;
arr = newArr;
}
/// <inheritdoc/>
public IEnumerator<T> GetEnumerator()
{
if (head < tail) {
for (int i = head; i < tail; i++)
yield return arr[i];
} else {
for (int i = head; i < arr.Length; i++)
yield return arr[i];
for (int i = 0; i < tail; i++)
yield return arr[i];
}
}
System.Collections.IEnumerator System.Collections.IEnumerable.GetEnumerator()
{
return this.GetEnumerator();
}
bool ICollection<T>.IsReadOnly {
get { return false; }
}
void ICollection<T>.Add(T item)
{
PushBack(item);
}
/// <inheritdoc/>
public bool Contains(T item)
{
EqualityComparer<T> comparer = EqualityComparer<T>.Default;
foreach (T element in this)
if (comparer.Equals(item, element))
return true;
return false;
}
/// <inheritdoc/>
public void CopyTo(T[] array, int arrayIndex)
{
if (array == null)
throw new ArgumentNullException("array");
if (head < tail) {
Array.Copy(arr, head, array, arrayIndex, tail - head);
} else {
int num1 = arr.Length - head;
Array.Copy(arr, head, array, arrayIndex, num1);
Array.Copy(arr, 0, array, arrayIndex + num1, tail);
}
}
bool ICollection<T>.Remove(T item)
{
throw new NotSupportedException();
}
}
}
|
