53 writes to
Microsoft.CodeAnalysis.Collections.Package (53)
Internal\ArraySortHelper.cs (53)
117keys[i] = keys[j];
118keys[j] = key;
128a[i] = a[j];
129a[j] = t;
269keys[i - 1] = keys[child - 1];
273keys[i - 1] = d;
285keys[j + 1] = keys[j];
289keys[j + 1] = t;
480SwapIfGreater(ref keys[zeroIndex], ref keys[middleIndex]);
481SwapIfGreater(ref keys[zeroIndex], ref keys[lastIndex]);
482SwapIfGreater(ref keys[middleIndex], ref keys[lastIndex]);
487Swap(ref keys[middleIndex], ref keys[nextToLastIndex]);
523Swap(ref keys[leftIndex], ref keys[rightIndex]);
529Swap(ref keys[leftIndex], ref keys[nextToLastIndex]);
547Swap(ref keys[0], ref keys[i - 1]);
558if (child < n && (keys[child - 1] == null || LessThan(ref keys[child - 1], ref keys[child])))
563if (keys[child - 1] == null || !LessThan(ref d, ref keys[child - 1]))
566keys[i - 1] = keys[child - 1];
570keys[i - 1] = d;
580while (j >= 0 && (t == null || LessThan(ref t, ref keys[j])))
582keys[j + 1] = keys[j];
586keys[j + 1] = t!;
701keys[i] = keys[j];
702keys[j] = key;
716keys[i] = keys[j];
717keys[j] = k;
862keys[i - 1] = keys[child - 1];
867keys[i - 1] = d;
883keys[j + 1] = keys[j];
888keys[j + 1] = t;
948ref TKey keyRef = ref keys[i];
949if (keyRef != null && GreaterThan(ref keyRef, ref keys[j]))
952keys[i] = keys[j];
953keys[j] = key;
967keys[i] = keys[j];
968keys[j] = k;
1104if (child < n && (keys[child - 1] == null || LessThan(ref keys[child - 1], ref keys[child])))
1109if (keys[child - 1] == null || !LessThan(ref d, ref keys[child - 1]))
1112keys[i - 1] = keys[child - 1];
1117keys[i - 1] = d;
1129while (j >= 0 && (t == null || LessThan(ref t, ref keys[j])))
1131keys[j + 1] = keys[j];
1136keys[j + 1] = t!;
1249keys[left] = keys[i];
1250keys[i] = temp;
51 references to
Microsoft.CodeAnalysis.Collections.Package (51)
Internal\ArraySortHelper.cs (51)
114if (comparer(keys[i], keys[j]) > 0)
116T key = keys[i];
117keys[i] = keys[j];
127T t = a[i];
128a[i] = a[j];
205T pivot = keys[middle];
257T d = keys[i - 1];
261if (child < n && comparer!(keys[child - 1], keys[child]) < 0)
266if (!(comparer!(d, keys[child - 1]) < 0))
269keys[i - 1] = keys[child - 1];
280T t = keys[i + 1];
283while (j >= 0 && comparer(t, keys[j]) < 0)
285keys[j + 1] = keys[j];
486T pivot = keys[middleIndex];
554T d = keys[i - 1];
558if (child < n && (keys[child - 1] == null || LessThan(ref keys[child - 1], ref keys[child])))
563if (keys[child - 1] == null || !LessThan(ref d, ref keys[child - 1]))
566keys[i - 1] = keys[child - 1];
577T t = keys[i + 1];
582keys[j + 1] = keys[j];
698if (comparer!.Compare(keys[i], keys[j]) > 0)
700TKey key = keys[i];
701keys[i] = keys[j];
715TKey k = keys[i];
716keys[i] = keys[j];
796TKey pivot = keys[middle];
848TKey d = keys[i - 1];
854if (child < n && comparer!.Compare(keys[child - 1], keys[child]) < 0)
859if (!(comparer!.Compare(d, keys[child - 1]) < 0))
862keys[i - 1] = keys[child - 1];
877TKey t = keys[i + 1];
881while (j >= 0 && comparer!.Compare(t, keys[j]) < 0)
883keys[j + 1] = keys[j];
952keys[i] = keys[j];
966TKey k = keys[i];
967keys[i] = keys[j];
1034TKey pivot = keys[middle];
1098TKey d = keys[i - 1];
1104if (child < n && (keys[child - 1] == null || LessThan(ref keys[child - 1], ref keys[child])))
1109if (keys[child - 1] == null || !LessThan(ref d, ref keys[child - 1]))
1112keys[i - 1] = keys[child - 1];
1125TKey t = keys[i + 1];
1131keys[j + 1] = keys[j];
1241if ((typeof(TKey) == typeof(double) && double.IsNaN((double)(object)keys[i]))
1242|| (typeof(TKey) == typeof(float) && float.IsNaN((float)(object)keys[i]))
1248TKey temp = keys[left];
1249keys[left] = keys[i];