1 write to Length
Microsoft.CodeAnalysis.Collections.Package (1)
Internal\SegmentedArraySegment`1.cs (1)
17Length = length;
50 references to Length
Microsoft.CodeAnalysis.Collections.Package (50)
Internal\ArraySortHelper.cs (46)
134if (keys.Length > 1) 136IntroSort(keys, 2 * (SegmentedArraySortUtils.Log2((uint)keys.Length) + 1), comparer!); 145Debug.Assert(keys.Length > 0); 149int partitionSize = keys.Length; 190Debug.Assert(keys.Length >= SegmentedArrayHelper.IntrosortSizeThreshold); 193int hi = keys.Length - 1; 236Debug.Assert(keys.Length > 0); 238int n = keys.Length; 276for (int i = 0; i < keys.Length - 1; i++) 301if (keys.Length > 1) 314if (nanLeft == keys.Length) 321IntroSort(keys, 2 * (SegmentedArraySortUtils.Log2((uint)keys.Length) + 1)); 425Debug.Assert(keys.Length > 0); 428int partitionSize = keys.Length; 472Debug.Assert(keys.Length >= SegmentedArrayHelper.IntrosortSizeThreshold); 476int lastIndex = keys.Length - 1; 477int middleIndex = (keys.Length - 1) >> 1; 483int nextToLastIndex = keys.Length - 2; 535Debug.Assert(keys.Length > 0); 537int n = keys.Length; 573for (int i = 0; i < keys.Length - 1; i++) 692Debug.Assert(0 <= i && i < keys.Length && i < values.Length); 693Debug.Assert(0 <= j && j < keys.Length && j < values.Length); 725Debug.Assert(keys.Length == values.Length); 727if (keys.Length > 1) 729IntroSort(keys, values, 2 * (SegmentedArraySortUtils.Log2((uint)keys.Length) + 1), comparer!); 735Debug.Assert(keys.Length > 0); 736Debug.Assert(values.Length == keys.Length); 740int partitionSize = keys.Length; 781Debug.Assert(keys.Length >= SegmentedArrayHelper.IntrosortSizeThreshold); 784int hi = keys.Length - 1; 827Debug.Assert(keys.Length > 0); 829int n = keys.Length; 873for (int i = 0; i < keys.Length - 1; i++) 903if (keys.Length > 1) 916if (nanLeft == keys.Length) 924IntroSort(keys, values, 2 * (SegmentedArraySortUtils.Log2((uint)keys.Length) + 1)); 975Debug.Assert(keys.Length > 0); 976Debug.Assert(values.Length == keys.Length); 979int partitionSize = keys.Length; 1020Debug.Assert(keys.Length >= SegmentedArrayHelper.IntrosortSizeThreshold); 1022int hi = keys.Length - 1; 1079Debug.Assert(keys.Length > 0); 1081int n = keys.Length; 1121for (int i = 0; i < keys.Length - 1; i++) 1237for (int i = 0; i < keys.Length; i++)
Internal\SegmentedArraySegment`1.cs (4)
24if ((uint)index >= (uint)Length) 33if ((uint)start >= (uint)Length) 36return new SegmentedArraySegment<T>(Array, Start + start, Length - start); 46if ((uint)start + (ulong)(uint)length > (uint)Length)