6 writes to _elements
System.Collections.Immutable (6)
System\Collections\Immutable\ImmutableArray_1.Builder.cs (6)
36
_elements
= new T[capacity];
72
_elements
= temp;
76
_elements
= ImmutableArray<T>.Empty.array!;
210
_elements
= ImmutableArray<T>.Empty.array!;
233
_elements
= ImmutableArray<T>.Empty.array!;
736
Array.Resize(ref
_elements
, newCapacity);
58 references to _elements
System.Collections.Immutable (58)
System\Collections\Immutable\ImmutableArray_1.Builder.cs (58)
54
get { return
_elements
.Length; }
62
if (value !=
_elements
.Length)
69
Array.Copy(
_elements
, temp, _count);
108
Array.Clear(
_elements
, value, _count - value);
114
_elements
[i] = default(T)!;
146
return
_elements
[index];
156
_elements
[index] = value;
174
return ref this.
_elements
[index];
209
T[] temp =
_elements
;
226
T[] result =
_elements
;
259
Array.Copy(
_elements
, index,
_elements
, index + 1, this.Count - index);
263
_elements
[index] = item;
281
Array.Copy(
_elements
, index,
_elements
, index + count, _count - index);
284
if (!items.TryCopyTo(
_elements
, index))
288
_elements
[index++] = item;
313
Array.Copy(
_elements
, index,
_elements
, index + items.Length, _count - index);
316
Array.Copy(items.array!, 0,
_elements
, index, items.Length);
329
_elements
[_count] = item;
346
if (items.TryCopyTo(
_elements
, _count))
370
Array.Copy(items, 0,
_elements
, offset, items.Length);
385
Array.Copy(items, 0,
_elements
, offset, items.Length);
401
Array.Copy(items, 0,
_elements
, offset, length);
437
items.CopyTo(new Span<T>(
_elements
, offset, items.Length));
450
var elements = new Span<T>(
_elements
, offset, items.Length);
477
this.AddRange(items.
_elements
, items.Count);
488
this.AddRange(items.
_elements
, items.Count);
547
if (match(
_elements
[i]))
570
Array.Copy(
_elements
, index + 1,
_elements
, index, this.Count - index - 1);
593
Array.Copy(
_elements
, index + length,
_elements
, index, this.Count - index - length);
658
_elements
[index] = newValue;
685
Array.Copy(
_elements
, result, this.Count);
698
Array.Copy(
_elements
, 0, array, index, this.Count);
708
Array.Copy(
_elements
, 0, destination, 0, this.Count);
724
Array.Copy(
_elements
, sourceIndex, destination, destinationIndex, length);
733
if (
_elements
.Length < capacity)
735
int newCapacity = Math.Max(
_elements
.Length * 2, capacity);
799
return Array.IndexOf(
_elements
, item, startIndex, count);
805
if (equalityComparer.Equals(
_elements
[i], item))
896
return Array.LastIndexOf(
_elements
, item, startIndex, count);
902
if (equalityComparer.Equals(item,
_elements
[i]))
917
Array.Reverse<T>(
_elements
, 0, _count);
927
Array.Sort(
_elements
, 0, this.Count, Comparer<T>.Default);
948
_elements
.AsSpan(0, _count).Sort(comparison);
967
Array.Sort(
_elements
, 0, _count, comparer);
986
Array.Sort(
_elements
, index, count, comparer);
997
new ReadOnlySpan<T>(
_elements
, 0, this.Count).CopyTo(destination);
1043
T[] nodes =
_elements
;
1066
Array.Copy(
_elements
, copied + removed,
_elements
, copied, copyLength);
1072
Array.Copy(
_elements
, copied + removed,
_elements
, copied,
_elements
.Length - (copied + removed));
1078
internal Memory<T> AsMemory() => new(
_elements
, 0, _count);