1 write to Length
Microsoft.CodeAnalysis.CodeStyle (1)
src\Dependencies\Collections\Internal\SegmentedArraySegment`1.cs (1)
19Length = length;
50 references to Length
Microsoft.CodeAnalysis.CodeStyle (50)
src\Dependencies\Collections\Internal\ArraySortHelper.cs (46)
136if (keys.Length > 1) 138IntroSort(keys, 2 * (SegmentedArraySortUtils.Log2((uint)keys.Length) + 1), comparer!); 147Debug.Assert(keys.Length > 0); 151int partitionSize = keys.Length; 192Debug.Assert(keys.Length >= SegmentedArrayHelper.IntrosortSizeThreshold); 195int hi = keys.Length - 1; 238Debug.Assert(keys.Length > 0); 240int n = keys.Length; 278for (int i = 0; i < keys.Length - 1; i++) 303if (keys.Length > 1) 316if (nanLeft == keys.Length) 323IntroSort(keys, 2 * (SegmentedArraySortUtils.Log2((uint)keys.Length) + 1)); 427Debug.Assert(keys.Length > 0); 430int partitionSize = keys.Length; 474Debug.Assert(keys.Length >= SegmentedArrayHelper.IntrosortSizeThreshold); 478int lastIndex = keys.Length - 1; 479int middleIndex = (keys.Length - 1) >> 1; 485int nextToLastIndex = keys.Length - 2; 537Debug.Assert(keys.Length > 0); 539int n = keys.Length; 575for (int i = 0; i < keys.Length - 1; i++) 694Debug.Assert(0 <= i && i < keys.Length && i < values.Length); 695Debug.Assert(0 <= j && j < keys.Length && j < values.Length); 727Debug.Assert(keys.Length == values.Length); 729if (keys.Length > 1) 731IntroSort(keys, values, 2 * (SegmentedArraySortUtils.Log2((uint)keys.Length) + 1), comparer!); 737Debug.Assert(keys.Length > 0); 738Debug.Assert(values.Length == keys.Length); 742int partitionSize = keys.Length; 783Debug.Assert(keys.Length >= SegmentedArrayHelper.IntrosortSizeThreshold); 786int hi = keys.Length - 1; 829Debug.Assert(keys.Length > 0); 831int n = keys.Length; 875for (int i = 0; i < keys.Length - 1; i++) 905if (keys.Length > 1) 918if (nanLeft == keys.Length) 926IntroSort(keys, values, 2 * (SegmentedArraySortUtils.Log2((uint)keys.Length) + 1)); 977Debug.Assert(keys.Length > 0); 978Debug.Assert(values.Length == keys.Length); 981int partitionSize = keys.Length; 1022Debug.Assert(keys.Length >= SegmentedArrayHelper.IntrosortSizeThreshold); 1024int hi = keys.Length - 1; 1081Debug.Assert(keys.Length > 0); 1083int n = keys.Length; 1123for (int i = 0; i < keys.Length - 1; i++) 1239for (int i = 0; i < keys.Length; i++)
src\Dependencies\Collections\Internal\SegmentedArraySegment`1.cs (4)
26if ((uint)index >= (uint)Length) 35if ((uint)start >= (uint)Length) 38return new SegmentedArraySegment<T>(Array, Start + start, Length - start); 48if ((uint)start + (ulong)(uint)length > (uint)Length)