1 write to Length
Microsoft.Build.Framework (1)
SegmentedArraySegment`1.cs (1)
17Length = length;
54 references to Length
Microsoft.Build.Framework (54)
ArraySortHelper.cs (50)
132if (keys.Length > 1) 134IntroSort(keys, 2 * (SegmentedArraySortUtils.Log2((uint)keys.Length) + 1), comparer!); 140Debug.Assert(keys.Length > 0); 144int partitionSize = keys.Length; 185Debug.Assert(keys.Length >= SegmentedArrayHelper.IntrosortSizeThreshold); 188int hi = keys.Length - 1; 231Debug.Assert(keys.Length > 0); 233int n = keys.Length; 250Debug.Assert(lo < keys.Length); 273for (int i = 0; i < keys.Length - 1; i++) 298if (keys.Length > 1) 311if (nanLeft == keys.Length) 318IntroSort(keys, 2 * (SegmentedArraySortUtils.Log2((uint)keys.Length) + 1)); 419Debug.Assert(keys.Length > 0); 422int partitionSize = keys.Length; 466Debug.Assert(keys.Length >= SegmentedArrayHelper.IntrosortSizeThreshold); 470int lastIndex = keys.Length - 1; 471int middleIndex = (keys.Length - 1) >> 1; 477int nextToLastIndex = keys.Length - 2; 529Debug.Assert(keys.Length > 0); 531int n = keys.Length; 547Debug.Assert(lo < keys.Length); 570for (int i = 0; i < keys.Length - 1; i++) 690Debug.Assert(0 <= i && i < keys.Length && i < values.Length); 691Debug.Assert(0 <= j && j < keys.Length && j < values.Length); 723Debug.Assert(keys.Length == values.Length); 725if (keys.Length > 1) 727IntroSort(keys, values, 2 * (SegmentedArraySortUtils.Log2((uint)keys.Length) + 1), comparer!); 733Debug.Assert(keys.Length > 0); 734Debug.Assert(values.Length == keys.Length); 738int partitionSize = keys.Length; 779Debug.Assert(keys.Length >= SegmentedArrayHelper.IntrosortSizeThreshold); 782int hi = keys.Length - 1; 825Debug.Assert(keys.Length > 0); 827int n = keys.Length; 844Debug.Assert(lo < 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; 1097Debug.Assert(lo < keys.Length); 1124for (int i = 0; i < keys.Length - 1; i++) 1241for (int i = 0; i < keys.Length; i++)
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)