4 writes to _array
System (4)
compmod\system\collections\generic\queue.cs (4)
52
_array
= _emptyArray;
63
_array
= new T[capacity];
78
_array
= new T[_DefaultCapacity];
324
_array
= newarray;
41 references to _array
System (41)
compmod\system\collections\generic\queue.cs (41)
113
Array.Clear(
_array
, _head, _size);
115
Array.Clear(
_array
, _head,
_array
.Length - _head);
116
Array.Clear(
_array
, 0, _tail);
147
int firstPart = (
_array
.Length - _head < numToCopy) ?
_array
.Length - _head : numToCopy;
148
Array.Copy(
_array
, _head, array, arrayIndex, firstPart);
151
Array.Copy(
_array
, 0, array, arrayIndex+
_array
.Length - _head, numToCopy);
182
int firstPart = (
_array
.Length - _head < numToCopy) ?
_array
.Length - _head : numToCopy;
183
Array.Copy(
_array
, _head, array, index, firstPart);
187
Array.Copy(
_array
, 0, array, index+
_array
.Length - _head, numToCopy);
199
if (_size ==
_array
.Length) {
200
int newcapacity = (int)((long)
_array
.Length * (long)_GrowFactor / 100);
201
if (newcapacity <
_array
.Length + _MinimumGrow) {
202
newcapacity =
_array
.Length + _MinimumGrow;
207
_array
[_tail] = item;
208
_tail = (_tail + 1) %
_array
.Length;
241
T removed =
_array
[_head];
242
_array
[_head] = default(T);
243
_head = (_head + 1) %
_array
.Length;
257
return
_array
[_head];
272
if (((Object)
_array
[index]) == null)
275
else if (
_array
[index] != null && c.Equals(
_array
[index], item)) {
278
index = (index + 1) %
_array
.Length;
286
return
_array
[(_head + i) %
_array
.Length];
301
Array.Copy(
_array
, _head, arr, 0, _size);
303
Array.Copy(
_array
, _head, arr, 0,
_array
.Length - _head);
304
Array.Copy(
_array
, 0, arr,
_array
.Length - _head, _tail);
317
Array.Copy(
_array
, _head, newarray, 0, _size);
319
Array.Copy(
_array
, _head, newarray, 0,
_array
.Length - _head);
320
Array.Copy(
_array
, 0, newarray,
_array
.Length - _head, _tail);
331
int threshold = (int)(((double)
_array
.Length) * 0.9);