13 writes to _size
Microsoft.CodeAnalysis.CodeStyle (13)
src\Dependencies\Collections\SegmentedList`1.cs (13)
81
_size
= segmentedList._size;
99
_size
= count;
255
_size
= size + 1;
271
_size
= size + 1;
327
_size
+= count;
396
_size
= 0;
441
list.
_size
= _size;
764
list.
_size
= count;
867
_size
++;
939
_size
+= count;
1121
_size
= freeIndex;
1134
_size
--;
1166
_size
-= count;
89 references to _size
Microsoft.CodeAnalysis.CodeStyle (89)
src\Dependencies\Collections\SegmentedList`1.cs (89)
81
_size = segmentedList.
_size
;
129
if (value <
_size
)
179
public int Count =>
_size
;
200
if ((uint)index >= (uint)
_size
)
209
if ((uint)index >= (uint)
_size
)
252
var size =
_size
;
268
Debug.Assert(
_size
== _items.Length);
269
var size =
_size
;
307
if (_items.Length -
_size
< count)
309
Grow(checked(
_size
+ count));
314
SegmentedArray.Copy(list._items, 0, _items,
_size
, list.Count);
318
SegmentedArray.Copy(array, 0, _items,
_size
, array.Length);
322
var targetIndex =
_size
;
370
if (
_size
- index < count)
395
var size =
_size
;
417
return
_size
!= 0 && IndexOf(item) >= 0;
436
var list = new SegmentedList<TOutput>(
_size
);
437
for (var i = 0; i <
_size
; i++)
441
list._size =
_size
;
462
SegmentedArray.Copy(_items, 0, array!, arrayIndex,
_size
);
476
if (
_size
- index < count)
488
SegmentedArray.Copy(_items, 0, array, arrayIndex,
_size
);
581
for (var i = 0; i <
_size
; i++)
599
for (var i = 0; i <
_size
; i++)
610
=> FindIndex(0,
_size
, match);
613
=> FindIndex(startIndex,
_size
- startIndex, match);
617
if ((uint)startIndex > (uint)
_size
)
622
if (count < 0 || startIndex >
_size
- count)
648
for (var i =
_size
- 1; i >= 0; i--)
659
=> FindLastIndex(
_size
- 1,
_size
, match);
671
if (
_size
== 0)
682
if ((uint)startIndex >= (uint)
_size
)
714
for (var i = 0; i <
_size
; i++)
757
if (
_size
- index < count)
791
=> SegmentedArray.IndexOf(_items, item, 0,
_size
);
813
if (index >
_size
)
815
return SegmentedArray.IndexOf(_items, item, index,
_size
- index);
829
if (index >
_size
)
832
if (count < 0 || index >
_size
- count)
840
if (index >
_size
)
843
if (count < 0 || index >
_size
- count)
856
if ((uint)index > (uint)
_size
)
860
if (
_size
== _items.Length)
861
Grow(
_size
+ 1);
862
if (index <
_size
)
864
SegmentedArray.Copy(_items, index, _items, index + 1,
_size
- index);
897
if ((uint)index > (uint)
_size
)
907
if (_items.Length -
_size
< count)
909
Grow(checked(
_size
+ count));
911
if (index <
_size
)
913
SegmentedArray.Copy(_items, index, _items, index + count,
_size
- index);
922
SegmentedArray.Copy(_items, index + count, _items, index * 2,
_size
- index);
963
if (
_size
== 0)
969
return LastIndexOf(item,
_size
- 1,
_size
);
984
if (index >=
_size
)
1000
if (
_size
== 0)
1016
if (index >=
_size
)
1031
if (
_size
== 0)
1047
if (index >=
_size
)
1094
while (freeIndex <
_size
&& !match(_items[freeIndex]))
1096
if (freeIndex >=
_size
)
1100
while (current <
_size
)
1103
while (current <
_size
&& match(_items[current]))
1106
if (current <
_size
)
1117
SegmentedArray.Clear(_items, freeIndex,
_size
- freeIndex); // Clear the elements so that the gc can reclaim the references.
1120
var result =
_size
- freeIndex;
1130
if ((uint)index >= (uint)
_size
)
1135
if (index <
_size
)
1137
SegmentedArray.Copy(_items, index + 1, _items, index,
_size
- index);
1143
_items[
_size
] = default!;
1161
if (
_size
- index < count)
1167
if (index <
_size
)
1169
SegmentedArray.Copy(_items, index + count, _items, index,
_size
- index);
1177
SegmentedArray.Clear(_items,
_size
, count);
1203
if (
_size
- index < count)
1243
if (
_size
- index < count)
1260
if (
_size
> 1)
1262
var segment = new SegmentedArraySegment<T>(_items, 0,
_size
);
1272
if (
_size
== 0)
1277
var array = new T[
_size
];
1278
SegmentedArray.Copy(_items, array,
_size
);
1294
if (
_size
< threshold)
1296
Capacity =
_size
;
1307
for (var i = 0; i <
_size
; i++)
1340
if (_version == localList._version && ((uint)_index < (uint)localList.
_size
))
1356
_index = _list.
_size
+ 1;
1367
if (_index == 0 || _index == _list.
_size
+ 1)