42 writes to

Microsoft.CodeAnalysis.CodeStyle (42)

src\Dependencies\Collections\ImmutableSegmentedList`1.cs (1)

135return ref self._list._items[index];

src\Dependencies\Collections\ImmutableSegmentedList`1+ValueBuilder.cs (1)

67return ref ReadOnlyList._items[index];

src\Dependencies\Collections\Internal\SegmentedArraySegment`1.cs (1)

27return ref Array[index + Start];

src\Dependencies\Collections\SegmentedArray.cs (2)

355array[firstIndex] = array[lastIndex]; 356array[lastIndex] = temp;

src\Dependencies\Collections\SegmentedArray`1.cs (2)

133set => this[index] = value; 139set => this[index] = (T)value!;

src\Dependencies\Collections\SegmentedDictionary`2.cs (8)

428entry = ref entries[i]; 460entry = ref entries[i]; 718ref var entry = ref entries[i]; 795ref var entry = ref entries[i]; 1026ref var entry = ref newEntries[newCount]; 1201ref var entry = ref _dictionary._entries[_index++]; 1456ref var entry = ref _dictionary._entries[_index++]; 1664ref var entry = ref _dictionary._entries[_index++];

src\Dependencies\Collections\SegmentedHashSet`1.cs (14)

179ref var entry = ref entries[i]; 239ref var entry = ref entries[i]; 261ref var entry = ref entries[i]; 311ref var entry = ref entries[i]; 822ref var entry = ref entries[i]; 843ref var entry = ref entries[i]; 912ref var entry = ref entries[i]; 972ref var entry = ref entries[count]; 1043ref var entry = ref entries[i]; 1067ref var entry = ref entries[i]; 1106ref var entry = ref entries[index]; 1150ref var entry = ref entries[i]; 1196ref var entry = ref _entries[i]; 1412ref var entry = ref _hashSet._entries[_index++];

src\Dependencies\Collections\SegmentedList`1.cs (9)

213_items[index] = value; 256array[size] = item; 272_items[size] = item; 324_items[targetIndex++] = item; 439list._items[i] = converter(_items[i]); 866_items[index] = item; 936_items[targetIndex++] = item; 1109_items[freeIndex++] = _items[current++]; 1143_items[_size] = default!;

src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Collections\ImmutableIntervalTree`1.cs (3)

114destination[destinationIndex] = new(source[rootIndexInSource], destinationIndex); 243array[currentNodeIndex] = new Node(currentNode.Value, maxEndNodeIndex); 252array[currentNodeIndex] = new Node(currentNode.Value, maxEndNodeIndex);

src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Formatting\Engine\TokenStream.cs (1)

470_cachedOriginalTriviaInfo[pairIndex] = info;

108 references to

Microsoft.CodeAnalysis.CodeStyle (108)

src\Compilers\Core\Portable\InternalUtilities\StringTable.cs (17)

296e = arr[idx].Text; 297int hash = arr[idx].HashCode; 331e = arr[idx].Text; 332int hash = arr[idx].HashCode; 366e = arr[idx].Text; 367int hash = arr[idx].HashCode; 401e = arr[idx].Text; 435e = arr[idx].Text; 436int hash = arr[idx].HashCode; 470e = arr[idx].Text; 471int hash = arr[idx].HashCode; 546if (arr[curIdx].Text == null) 561arr[idx].HashCode = hashCode; 562Volatile.Write(ref arr[idx].Text, text); 635if (arr[curIdx].Text == null) 650arr[idx].HashCode = hashCode; 651Volatile.Write(ref arr[idx].Text, text);

src\Dependencies\Collections\Internal\ArraySortHelper.cs (3)

91int order = comparer.Compare(array[i], value); 372if (array[i] == null) 378order = array[i].CompareTo(value!);

src\Dependencies\Collections\SegmentedArray.cs (5)

245if (comparer.Equals(array[i], value)) 316if (EqualityComparer<T>.Default.Equals(array[i], value)) 325if (comparer.Equals(array[i], value)) 354var temp = array[firstIndex]; 355array[firstIndex] = array[lastIndex];

src\Dependencies\Collections\SegmentedArray`1.cs (8)

128T IReadOnlyList<T>.this[int index] => this[index]; 132get => this[index]; 138get => this[index]; 318var result = comparer.Compare(this[i], o[i]); 342if (!comparer.Equals(this[i], o[i])) 361ret = unchecked((ret * (int)0xA5555529) + comparer.GetHashCode(this[i]!));

src\Dependencies\Collections\SegmentedDictionary`2.cs (44)

182if (oldEntries[i]._next >= -1) 184Add(oldEntries[i]._key, oldEntries[i]._value); 321if (entries[i]._next >= -1 && entries[i]._value == null) 332if (entries[i]._next >= -1 && EqualityComparer<TValue>.Default.Equals(entries[i]._value, value)) 346if (entries[i]._next >= -1 && defaultComparer.Equals(entries[i]._value, value)) 377if (entries[i]._next >= -1) 379array[index++] = new KeyValuePair<TKey, TValue>(entries[i]._key, entries[i]._value); 543if (entries[i]._hashCode == hashCode && EqualityComparer<TKey>.Default.Equals(entries[i]._key, key)) 547entries[i]._value = value; 559i = entries[i]._next; 582if (entries[i]._hashCode == hashCode && comparer!.Equals(entries[i]._key, key)) 586entries[i]._value = value; 598i = entries[i]._next; 614Debug.Assert((StartOfFreeList - entries[_freeList]._next) >= -1, "shouldn't overflow because `next` cannot underflow"); 615_freeList = StartOfFreeList - entries[_freeList]._next; 659if (entries[i]._next >= -1) 661ref var bucket = ref GetBucket(entries[i]._hashCode); 662entries[i]._next = bucket - 1; // Value in _buckets is 1-based 729entries[last]._next = entry._next; 806entries[last]._next = entry._next; 909if (entries[i]._next >= -1) 911dictEntryArray[index++] = new DictionaryEntry(entries[i]._key, entries[i]._value); 929if (entries[i]._next >= -1) 931objects[index++] = new KeyValuePair<TKey, TValue>(entries[i]._key, entries[i]._value); 1023var hashCode = entries[i]._hashCode; 1024if (entries[i]._next >= -1) 1027entry = entries[i]; 1332if (entries[i]._next >= -1) 1333array[index++] = entries[i]._key; 1413if (entries[i]._next >= -1) 1414objects[index++] = entries[i]._key; 1540if (entries[i]._next >= -1) 1541array[index++] = entries[i]._value; 1621if (entries[i]._next >= -1) 1622objects[index++] = entries[i]._value!;

src\Dependencies\Collections\SegmentedHashSet`1.cs (8)

321entries[last]._next = entry._next; 403actualValue = _entries[index]._value; 969var hashCode = oldEntries[i]._hashCode; // At this point, we know we have entries. 970if (oldEntries[i]._next >= -1) 973entry = oldEntries[i]; 1089Debug.Assert((StartOfFreeList - entries[_freeList]._next) >= -1, "shouldn't overflow because `next` cannot underflow"); 1090_freeList = StartOfFreeList - entries[_freeList]._next; 1284Remove(_entries[i]._value);

src\Dependencies\Collections\SegmentedList`1.cs (16)

204return _items[index]; 439list._items[i] = converter(_items[i]); 583if (match(_items[i])) 585return _items[i]; 601if (match(_items[i])) 603list.Add(_items[i]); 635if (match(_items[i])) 650if (match(_items[i])) 652return _items[i]; 697if (match(_items[i])) 720action(_items[i]); 1094while (freeIndex < _size && !match(_items[freeIndex])) 1103while (current < _size && match(_items[current])) 1109_items[freeIndex++] = _items[current++]; 1309if (!match(_items[i])) 1342_current = localList._items[_index];

src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Collections\ImmutableIntervalTree`1.cs (5)

226var currentNode = array[currentNodeIndex]; 242var maxEndNodeIndex = array[leftChildIndex].MaxEndNodeIndex; 251var maxEndNodeIndex = array[rightChildIndex].MaxEndNodeIndex; 291=> tree._array[node].Value; 294=> tree._array[node].MaxEndNodeIndex;

src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Formatting\Engine\TokenStream.cs (2)

467if (_cachedOriginalTriviaInfo[pairIndex] == null) 473return _cachedOriginalTriviaInfo[pairIndex];