38 writes to
Microsoft.CodeAnalysis.Workspaces.MSBuild.BuildHost (38)
src\Dependencies\Collections\ImmutableSegmentedList`1.cs (1)
135
return ref self._list._items
[
index];
src\Dependencies\Collections\ImmutableSegmentedList`1+ValueBuilder.cs (1)
67
return ref ReadOnlyList._items
[
index];
src\Dependencies\Collections\Internal\SegmentedArraySegment`1.cs (1)
27
return ref Array
[
index + Start];
src\Dependencies\Collections\SegmentedArray.cs (2)
355
array
[
firstIndex] = array[lastIndex];
356
array
[
lastIndex] = temp;
src\Dependencies\Collections\SegmentedArray`1.cs (2)
133
set => this
[
index] = value;
139
set => this
[
index] = (T)value!;
src\Dependencies\Collections\SegmentedDictionary`2.cs (8)
428
entry = ref entries
[
i];
460
entry = ref entries
[
i];
718
ref var entry = ref entries
[
i];
795
ref var entry = ref entries
[
i];
1026
ref var entry = ref newEntries
[
newCount];
1201
ref var entry = ref _dictionary._entries
[
_index++];
1456
ref var entry = ref _dictionary._entries
[
_index++];
1664
ref var entry = ref _dictionary._entries
[
_index++];
src\Dependencies\Collections\SegmentedHashSet`1.cs (14)
179
ref var entry = ref entries
[
i];
239
ref var entry = ref entries
[
i];
261
ref var entry = ref entries
[
i];
311
ref var entry = ref entries
[
i];
822
ref var entry = ref entries
[
i];
843
ref var entry = ref entries
[
i];
912
ref var entry = ref entries
[
i];
972
ref var entry = ref entries
[
count];
1043
ref var entry = ref entries
[
i];
1067
ref var entry = ref entries
[
i];
1106
ref var entry = ref entries
[
index];
1150
ref var entry = ref entries
[
i];
1196
ref var entry = ref _entries
[
i];
1412
ref var entry = ref _hashSet._entries
[
_index++];
src\Dependencies\Collections\SegmentedList`1.cs (9)
213
_items
[
index] = value;
256
array
[
size] = item;
272
_items
[
size] = item;
324
_items
[
targetIndex++] = item;
439
list._items
[
i] = converter(_items[i]);
866
_items
[
index] = item;
936
_items
[
targetIndex++] = item;
1109
_items
[
freeIndex++] = _items[current++];
1143
_items
[
_size] = default!;
101 references to
Microsoft.CodeAnalysis.Workspaces.MSBuild.BuildHost (101)
src\Compilers\Core\Portable\InternalUtilities\StringTable.cs (17)
296
e = arr
[
idx].Text;
297
int hash = arr
[
idx].HashCode;
331
e = arr
[
idx].Text;
332
int hash = arr
[
idx].HashCode;
366
e = arr
[
idx].Text;
367
int hash = arr
[
idx].HashCode;
401
e = arr
[
idx].Text;
435
e = arr
[
idx].Text;
436
int hash = arr
[
idx].HashCode;
470
e = arr
[
idx].Text;
471
int hash = arr
[
idx].HashCode;
546
if (arr
[
curIdx].Text == null)
561
arr
[
idx].HashCode = hashCode;
562
Volatile.Write(ref arr
[
idx].Text, text);
635
if (arr
[
curIdx].Text == null)
650
arr
[
idx].HashCode = hashCode;
651
Volatile.Write(ref arr
[
idx].Text, text);
src\Dependencies\Collections\Internal\ArraySortHelper.cs (3)
91
int order = comparer.Compare(array
[
i], value);
372
if (array
[
i] == null)
378
order = array
[
i].CompareTo(value!);
src\Dependencies\Collections\SegmentedArray.cs (5)
245
if (comparer.Equals(array
[
i], value))
316
if (EqualityComparer<T>.Default.Equals(array
[
i], value))
325
if (comparer.Equals(array
[
i], value))
354
var temp = array
[
firstIndex];
355
array[firstIndex] = array
[
lastIndex];
src\Dependencies\Collections\SegmentedArray`1.cs (8)
128
T IReadOnlyList<T>.this[int index] => this
[
index];
132
get => this
[
index];
138
get => this
[
index];
318
var result = comparer.Compare(this
[
i], o
[
i]);
342
if (!comparer.Equals(this
[
i], o
[
i]))
359
ret = HashCode.Combine(comparer.GetHashCode(this
[
i]!), ret);
src\Dependencies\Collections\SegmentedDictionary`2.cs (44)
182
if (oldEntries
[
i]._next >= -1)
184
Add(oldEntries
[
i]._key, oldEntries
[
i]._value);
321
if (entries
[
i]._next >= -1 && entries
[
i]._value == null)
332
if (entries
[
i]._next >= -1 && EqualityComparer<TValue>.Default.Equals(entries
[
i]._value, value))
346
if (entries
[
i]._next >= -1 && defaultComparer.Equals(entries
[
i]._value, value))
377
if (entries
[
i]._next >= -1)
379
array[index++] = new KeyValuePair<TKey, TValue>(entries
[
i]._key, entries
[
i]._value);
543
if (entries
[
i]._hashCode == hashCode && EqualityComparer<TKey>.Default.Equals(entries
[
i]._key, key))
547
entries
[
i]._value = value;
559
i = entries
[
i]._next;
582
if (entries
[
i]._hashCode == hashCode && comparer!.Equals(entries
[
i]._key, key))
586
entries
[
i]._value = value;
598
i = entries
[
i]._next;
614
Debug.Assert((StartOfFreeList - entries
[
_freeList]._next) >= -1, "shouldn't overflow because `next` cannot underflow");
615
_freeList = StartOfFreeList - entries
[
_freeList]._next;
659
if (entries
[
i]._next >= -1)
661
ref var bucket = ref GetBucket(entries
[
i]._hashCode);
662
entries
[
i]._next = bucket - 1; // Value in _buckets is 1-based
729
entries
[
last]._next = entry._next;
806
entries
[
last]._next = entry._next;
909
if (entries
[
i]._next >= -1)
911
dictEntryArray[index++] = new DictionaryEntry(entries
[
i]._key, entries
[
i]._value);
929
if (entries
[
i]._next >= -1)
931
objects[index++] = new KeyValuePair<TKey, TValue>(entries
[
i]._key, entries
[
i]._value);
1023
var hashCode = entries
[
i]._hashCode;
1024
if (entries
[
i]._next >= -1)
1027
entry = entries
[
i];
1332
if (entries
[
i]._next >= -1)
1333
array[index++] = entries
[
i]._key;
1413
if (entries
[
i]._next >= -1)
1414
objects[index++] = entries
[
i]._key;
1540
if (entries
[
i]._next >= -1)
1541
array[index++] = entries
[
i]._value;
1621
if (entries
[
i]._next >= -1)
1622
objects[index++] = entries
[
i]._value!;
src\Dependencies\Collections\SegmentedHashSet`1.cs (8)
321
entries
[
last]._next = entry._next;
403
actualValue = _entries
[
index]._value;
969
var hashCode = oldEntries
[
i]._hashCode; // At this point, we know we have entries.
970
if (oldEntries
[
i]._next >= -1)
973
entry = oldEntries
[
i];
1089
Debug.Assert((StartOfFreeList - entries
[
_freeList]._next) >= -1, "shouldn't overflow because `next` cannot underflow");
1090
_freeList = StartOfFreeList - entries
[
_freeList]._next;
1284
Remove(_entries
[
i]._value);
src\Dependencies\Collections\SegmentedList`1.cs (16)
204
return _items
[
index];
439
list._items[i] = converter(_items
[
i]);
583
if (match(_items
[
i]))
585
return _items
[
i];
601
if (match(_items
[
i]))
603
list.Add(_items
[
i]);
635
if (match(_items
[
i]))
650
if (match(_items
[
i]))
652
return _items
[
i];
697
if (match(_items
[
i]))
720
action(_items
[
i]);
1094
while (freeIndex < _size && !match(_items
[
freeIndex]))
1103
while (current < _size && match(_items
[
current]))
1109
_items[freeIndex++] = _items
[
current++];
1309
if (!match(_items
[
i]))
1342
_current = localList._items
[
_index];