38 writes to
Microsoft.CodeAnalysis.Threading.Package (38)
src\Dependencies\Collections\Internal\SegmentedArraySegment`1.cs (1)
29
return ref Array
[
index + Start];
src\Dependencies\Collections\Segmented\ImmutableSegmentedList`1.cs (1)
137
return ref self._list._items
[
index];
src\Dependencies\Collections\Segmented\ImmutableSegmentedList`1+ValueBuilder.cs (1)
69
return ref ReadOnlyList._items
[
index];
src\Dependencies\Collections\Segmented\SegmentedArray.cs (2)
357
array
[
firstIndex] = array[lastIndex];
358
array
[
lastIndex] = temp;
src\Dependencies\Collections\Segmented\SegmentedArray`1.cs (2)
135
set => this
[
index] = value;
141
set => this
[
index] = (T)value!;
src\Dependencies\Collections\Segmented\SegmentedDictionary`2.cs (8)
430
entry = ref entries
[
i];
462
entry = ref entries
[
i];
720
ref var entry = ref entries
[
i];
797
ref var entry = ref entries
[
i];
1028
ref var entry = ref newEntries
[
newCount];
1203
ref var entry = ref _dictionary._entries
[
_index++];
1458
ref var entry = ref _dictionary._entries
[
_index++];
1666
ref var entry = ref _dictionary._entries
[
_index++];
src\Dependencies\Collections\Segmented\SegmentedHashSet`1.cs (14)
181
ref var entry = ref entries
[
i];
241
ref var entry = ref entries
[
i];
263
ref var entry = ref entries
[
i];
313
ref var entry = ref entries
[
i];
824
ref var entry = ref entries
[
i];
845
ref var entry = ref entries
[
i];
914
ref var entry = ref entries
[
i];
974
ref var entry = ref entries
[
count];
1045
ref var entry = ref entries
[
i];
1069
ref var entry = ref entries
[
i];
1108
ref var entry = ref entries
[
index];
1152
ref var entry = ref entries
[
i];
1198
ref var entry = ref _entries
[
i];
1414
ref var entry = ref _hashSet._entries
[
_index++];
src\Dependencies\Collections\Segmented\SegmentedList`1.cs (9)
215
_items
[
index] = value;
258
array
[
size] = item;
274
_items
[
size] = item;
326
_items
[
targetIndex++] = item;
441
list._items
[
i] = converter(_items[i]);
868
_items
[
index] = item;
938
_items
[
targetIndex++] = item;
1111
_items
[
freeIndex++] = _items[current++];
1145
_items
[
_size] = default!;
84 references to
Microsoft.CodeAnalysis.Threading.Package (84)
src\Dependencies\Collections\Internal\ArraySortHelper.cs (3)
93
int order = comparer.Compare(array
[
i], value);
374
if (array
[
i] == null)
380
order = array
[
i].CompareTo(value!);
src\Dependencies\Collections\Segmented\SegmentedArray.cs (5)
247
if (comparer.Equals(array
[
i], value))
318
if (EqualityComparer<T>.Default.Equals(array
[
i], value))
327
if (comparer.Equals(array
[
i], value))
356
var temp = array
[
firstIndex];
357
array[firstIndex] = array
[
lastIndex];
src\Dependencies\Collections\Segmented\SegmentedArray`1.cs (8)
130
T IReadOnlyList<T>.this[int index] => this
[
index];
134
get => this
[
index];
140
get => this
[
index];
320
var result = comparer.Compare(this
[
i], o
[
i]);
344
if (!comparer.Equals(this
[
i], o
[
i]))
363
ret = unchecked((ret * (int)0xA5555529) + comparer.GetHashCode(this
[
i]!));
src\Dependencies\Collections\Segmented\SegmentedDictionary`2.cs (44)
184
if (oldEntries
[
i]._next >= -1)
186
Add(oldEntries
[
i]._key, oldEntries
[
i]._value);
323
if (entries
[
i]._next >= -1 && entries
[
i]._value == null)
334
if (entries
[
i]._next >= -1 && EqualityComparer<TValue>.Default.Equals(entries
[
i]._value, value))
348
if (entries
[
i]._next >= -1 && defaultComparer.Equals(entries
[
i]._value, value))
379
if (entries
[
i]._next >= -1)
381
array[index++] = new KeyValuePair<TKey, TValue>(entries
[
i]._key, entries
[
i]._value);
545
if (entries
[
i]._hashCode == hashCode && EqualityComparer<TKey>.Default.Equals(entries
[
i]._key, key))
549
entries
[
i]._value = value;
561
i = entries
[
i]._next;
584
if (entries
[
i]._hashCode == hashCode && comparer!.Equals(entries
[
i]._key, key))
588
entries
[
i]._value = value;
600
i = entries
[
i]._next;
616
Debug.Assert((StartOfFreeList - entries
[
_freeList]._next) >= -1, "shouldn't overflow because `next` cannot underflow");
617
_freeList = StartOfFreeList - entries
[
_freeList]._next;
661
if (entries
[
i]._next >= -1)
663
ref var bucket = ref GetBucket(entries
[
i]._hashCode);
664
entries
[
i]._next = bucket - 1; // Value in _buckets is 1-based
731
entries
[
last]._next = entry._next;
808
entries
[
last]._next = entry._next;
911
if (entries
[
i]._next >= -1)
913
dictEntryArray[index++] = new DictionaryEntry(entries
[
i]._key, entries
[
i]._value);
931
if (entries
[
i]._next >= -1)
933
objects[index++] = new KeyValuePair<TKey, TValue>(entries
[
i]._key, entries
[
i]._value);
1025
var hashCode = entries
[
i]._hashCode;
1026
if (entries
[
i]._next >= -1)
1029
entry = entries
[
i];
1334
if (entries
[
i]._next >= -1)
1335
array[index++] = entries
[
i]._key;
1415
if (entries
[
i]._next >= -1)
1416
objects[index++] = entries
[
i]._key;
1542
if (entries
[
i]._next >= -1)
1543
array[index++] = entries
[
i]._value;
1623
if (entries
[
i]._next >= -1)
1624
objects[index++] = entries
[
i]._value!;
src\Dependencies\Collections\Segmented\SegmentedHashSet`1.cs (8)
323
entries
[
last]._next = entry._next;
405
actualValue = _entries
[
index]._value;
971
var hashCode = oldEntries
[
i]._hashCode; // At this point, we know we have entries.
972
if (oldEntries
[
i]._next >= -1)
975
entry = oldEntries
[
i];
1091
Debug.Assert((StartOfFreeList - entries
[
_freeList]._next) >= -1, "shouldn't overflow because `next` cannot underflow");
1092
_freeList = StartOfFreeList - entries
[
_freeList]._next;
1286
Remove(_entries
[
i]._value);
src\Dependencies\Collections\Segmented\SegmentedList`1.cs (16)
206
return _items
[
index];
441
list._items[i] = converter(_items
[
i]);
585
if (match(_items
[
i]))
587
return _items
[
i];
603
if (match(_items
[
i]))
605
list.Add(_items
[
i]);
637
if (match(_items
[
i]))
652
if (match(_items
[
i]))
654
return _items
[
i];
699
if (match(_items
[
i]))
722
action(_items
[
i]);
1096
while (freeIndex < _size && !match(_items
[
freeIndex]))
1105
while (current < _size && match(_items
[
current]))
1111
_items[freeIndex++] = _items
[
current++];
1311
if (!match(_items
[
i]))
1344
_current = localList._items
[
_index];