46 writes to
Microsoft.CodeAnalysis (40)
ImmutableSegmentedList`1.cs (1)
135return ref self._list._items[index];
ImmutableSegmentedList`1+ValueBuilder.cs (1)
67return ref ReadOnlyList._items[index];
SegmentedArray.cs (2)
349array[firstIndex] = array[lastIndex]; 350array[lastIndex] = temp;
SegmentedArray`1.cs (2)
136set => this[index] = value; 142set => this[index] = (T)value!;
SegmentedArraySegment`1.cs (1)
27return ref Array[index + Start];
SegmentedDictionary`2.cs (9)
359entry = ref entries[i]; 391entry = ref entries[i]; 423entry = ref entries[i]; 696ref var entry = ref entries[i]; 768ref var entry = ref entries[i]; 992ref var entry = ref entries[count]; 1167ref var entry = ref _dictionary._entries[_index++]; 1414ref var entry = ref _dictionary._entries[_index++]; 1614ref var entry = ref _dictionary._entries[_index++];
SegmentedHashSet`1.cs (16)
164ref var entry = ref entries[i]; 224ref var entry = ref entries[i]; 247ref var entry = ref entries[i]; 269ref var entry = ref entries[i]; 313ref var entry = ref entries[i]; 804ref var entry = ref entries[i]; 825ref var entry = ref entries[i]; 894ref var entry = ref entries[i]; 932ref var entry = ref entries[count]; 1002ref var entry = ref entries[i]; 1025ref var entry = ref entries[i]; 1049ref var entry = ref entries[i]; 1088ref var entry = ref entries[index]; 1150ref var entry = ref entries[i]; 1196ref var entry = ref _entries[i]; 1412ref var entry = ref _hashSet._entries[_index++];
SegmentedList`1.cs (8)
186_items[index] = value; 229array[size] = item; 244_items[size] = item; 368list._items[i] = converter(_items[i]); 717_items[index] = item; 784_items[targetIndex++] = item; 957_items[freeIndex++] = _items[current++]; 991_items[_size] = default!;
Microsoft.CodeAnalysis.UnitTests (6)
Collections\SegmentedArrayTests.cs (6)
36array[i] = (IntPtr)i; 145data[i] = (IntPtr)i; 155ref var value = ref data[i]; 167data[i] = IntPtr.Add(data[i], 1); 199data[i] = Guid.NewGuid(); 240segmented[i] = i;
96 references to
Microsoft.CodeAnalysis (88)
ArraySortHelper.cs (3)
89int order = comparer.Compare(array[i], value); 369if (array[i] == null) 375order = array[i].CompareTo(value!);
SegmentedArray.cs (5)
239if (comparer.Equals(array[i], value)) 310if (EqualityComparer<T>.Default.Equals(array[i], value)) 319if (comparer.Equals(array[i], value)) 348var temp = array[firstIndex]; 349array[firstIndex] = array[lastIndex];
SegmentedArray`1.cs (8)
131T IReadOnlyList<T>.this[int index] => this[index]; 135get => this[index]; 141get => this[index]; 321var result = comparer.Compare(this[i], o[i]); 345if (!comparer.Equals(this[i], o[i])) 362ret = HashCode.Combine(comparer.GetHashCode(this[i]!), ret);
SegmentedDictionary`2.cs (48)
124if (entries[i]._next >= -1) 126Add(entries[i]._key, entries[i]._value); 258if (entries[i]._next >= -1 && entries[i]._value == null) 269if (entries[i]._next >= -1 && EqualityComparer<TValue>.Default.Equals(entries[i]._value, value)) 283if (entries[i]._next >= -1 && defaultComparer.Equals(entries[i]._value, value)) 314if (entries[i]._next >= -1) 316array[index++] = new KeyValuePair<TKey, TValue>(entries[i]._key, entries[i]._value); 505if (entries[i]._hashCode == hashCode && EqualityComparer<TKey>.Default.Equals(entries[i]._key, key)) 509entries[i]._value = value; 521i = entries[i]._next; 547if (entries[i]._hashCode == hashCode && defaultComparer.Equals(entries[i]._key, key)) 551entries[i]._value = value; 563i = entries[i]._next; 586if (entries[i]._hashCode == hashCode && comparer.Equals(entries[i]._key, key)) 590entries[i]._value = value; 602i = entries[i]._next; 618Debug.Assert((StartOfFreeList - entries[_freeList]._next) >= -1, "shouldn't overflow because `next` cannot underflow"); 619_freeList = StartOfFreeList - entries[_freeList]._next; 663if (entries[i]._next >= -1) 665ref var bucket = ref GetBucket(entries[i]._hashCode); 666entries[i]._next = bucket - 1; // Value in _buckets is 1-based 706entries[last]._next = entry._next; 778entries[last]._next = entry._next; 881if (entries[i]._next >= -1) 883dictEntryArray[index++] = new DictionaryEntry(entries[i]._key, entries[i]._value); 901if (entries[i]._next >= -1) 903objects[index++] = new KeyValuePair<TKey, TValue>(entries[i]._key, entries[i]._value); 989var hashCode = oldEntries[i]._hashCode; // At this point, we know we have entries. 990if (oldEntries[i]._next >= -1) 993entry = oldEntries[i]; 1296if (entries[i]._next >= -1) 1297array[index++] = entries[i]._key; 1371if (entries[i]._next >= -1) 1372objects[index++] = entries[i]._key; 1496if (entries[i]._next >= -1) 1497array[index++] = entries[i]._value; 1571if (entries[i]._next >= -1) 1572objects[index++] = entries[i]._value!;
SegmentedHashSet`1.cs (8)
323entries[last]._next = entry._next; 398actualValue = _entries[index]._value; 929var hashCode = oldEntries[i]._hashCode; // At this point, we know we have entries. 930if (oldEntries[i]._next >= -1) 933entry = oldEntries[i]; 1071Debug.Assert((StartOfFreeList - entries[_freeList]._next) >= -1, "shouldn't overflow because `next` cannot underflow"); 1072_freeList = StartOfFreeList - entries[_freeList]._next; 1284Remove(_entries[i]._value);
SegmentedList`1.cs (16)
177return _items[index]; 368list._items[i] = converter(_items[i]); 452if (match(_items[i])) 454return _items[i]; 470if (match(_items[i])) 472list.Add(_items[i]); 504if (match(_items[i])) 519if (match(_items[i])) 521return _items[i]; 566if (match(_items[i])) 589action(_items[i]); 942while (freeIndex < _size && !match(_items[freeIndex])) 951while (current < _size && match(_items[current])) 957_items[freeIndex++] = _items[current++]; 1156if (!match(_items[i])) 1189_current = localList._items[_index];
Microsoft.CodeAnalysis.UnitTests (8)
Collections\SegmentedArrayTests.cs (8)
150Assert.Equal((IntPtr)i, data[i]); 156Assert.Equal((IntPtr)i, data[i]); 160Assert.Equal((IntPtr)(i + 1), data[i]); 167data[i] = IntPtr.Add(data[i], 1); 175((IList<IntPtr>)data)[i] = IntPtr.Add(data[i], 1); 183((IList)data)[i] = IntPtr.Add(data[i], 1); 200Assert.NotEqual(Guid.Empty, data[i]); 206Assert.Equal(guid, data[index++]);