53 writes to
Microsoft.CodeAnalysis.Workspaces (53)
src\Dependencies\Collections\Internal\ArraySortHelper.cs (53)
115keys[i] = keys[j]; 116keys[j] = key; 126a[i] = a[j]; 127a[j] = t; 267keys[i - 1] = keys[child - 1]; 271keys[i - 1] = d; 283keys[j + 1] = keys[j]; 287keys[j + 1] = t; 478SwapIfGreater(ref keys[zeroIndex], ref keys[middleIndex]); 479SwapIfGreater(ref keys[zeroIndex], ref keys[lastIndex]); 480SwapIfGreater(ref keys[middleIndex], ref keys[lastIndex]); 485Swap(ref keys[middleIndex], ref keys[nextToLastIndex]); 521Swap(ref keys[leftIndex], ref keys[rightIndex]); 527Swap(ref keys[leftIndex], ref keys[nextToLastIndex]); 545Swap(ref keys[0], ref keys[i - 1]); 556if (child < n && (keys[child - 1] == null || LessThan(ref keys[child - 1], ref keys[child]))) 561if (keys[child - 1] == null || !LessThan(ref d, ref keys[child - 1])) 564keys[i - 1] = keys[child - 1]; 568keys[i - 1] = d; 578while (j >= 0 && (t == null || LessThan(ref t, ref keys[j]))) 580keys[j + 1] = keys[j]; 584keys[j + 1] = t!; 699keys[i] = keys[j]; 700keys[j] = key; 714keys[i] = keys[j]; 715keys[j] = k; 860keys[i - 1] = keys[child - 1]; 865keys[i - 1] = d; 881keys[j + 1] = keys[j]; 886keys[j + 1] = t; 946ref TKey keyRef = ref keys[i]; 947if (keyRef != null && GreaterThan(ref keyRef, ref keys[j])) 950keys[i] = keys[j]; 951keys[j] = key; 965keys[i] = keys[j]; 966keys[j] = k; 1102if (child < n && (keys[child - 1] == null || LessThan(ref keys[child - 1], ref keys[child]))) 1107if (keys[child - 1] == null || !LessThan(ref d, ref keys[child - 1])) 1110keys[i - 1] = keys[child - 1]; 1115keys[i - 1] = d; 1127while (j >= 0 && (t == null || LessThan(ref t, ref keys[j]))) 1129keys[j + 1] = keys[j]; 1134keys[j + 1] = t!; 1247keys[left] = keys[i]; 1248keys[i] = temp;
51 references to
Microsoft.CodeAnalysis.Workspaces (51)
src\Dependencies\Collections\Internal\ArraySortHelper.cs (51)
112if (comparer(keys[i], keys[j]) > 0) 114T key = keys[i]; 115keys[i] = keys[j]; 125T t = a[i]; 126a[i] = a[j]; 203T pivot = keys[middle]; 255T d = keys[i - 1]; 259if (child < n && comparer!(keys[child - 1], keys[child]) < 0) 264if (!(comparer!(d, keys[child - 1]) < 0)) 267keys[i - 1] = keys[child - 1]; 278T t = keys[i + 1]; 281while (j >= 0 && comparer(t, keys[j]) < 0) 283keys[j + 1] = keys[j]; 484T pivot = keys[middleIndex]; 552T d = keys[i - 1]; 556if (child < n && (keys[child - 1] == null || LessThan(ref keys[child - 1], ref keys[child]))) 561if (keys[child - 1] == null || !LessThan(ref d, ref keys[child - 1])) 564keys[i - 1] = keys[child - 1]; 575T t = keys[i + 1]; 580keys[j + 1] = keys[j]; 696if (comparer!.Compare(keys[i], keys[j]) > 0) 698TKey key = keys[i]; 699keys[i] = keys[j]; 713TKey k = keys[i]; 714keys[i] = keys[j]; 794TKey pivot = keys[middle]; 846TKey d = keys[i - 1]; 852if (child < n && comparer!.Compare(keys[child - 1], keys[child]) < 0) 857if (!(comparer!.Compare(d, keys[child - 1]) < 0)) 860keys[i - 1] = keys[child - 1]; 875TKey t = keys[i + 1]; 879while (j >= 0 && comparer!.Compare(t, keys[j]) < 0) 881keys[j + 1] = keys[j]; 950keys[i] = keys[j]; 964TKey k = keys[i]; 965keys[i] = keys[j]; 1032TKey pivot = keys[middle]; 1096TKey d = keys[i - 1]; 1102if (child < n && (keys[child - 1] == null || LessThan(ref keys[child - 1], ref keys[child]))) 1107if (keys[child - 1] == null || !LessThan(ref d, ref keys[child - 1])) 1110keys[i - 1] = keys[child - 1]; 1123TKey t = keys[i + 1]; 1129keys[j + 1] = keys[j]; 1239if ((typeof(TKey) == typeof(double) && double.IsNaN((double)(object)keys[i])) 1240|| (typeof(TKey) == typeof(float) && float.IsNaN((float)(object)keys[i])) 1246TKey temp = keys[left]; 1247keys[left] = keys[i];