113keys[i] = keys[j]; 114keys[j] = key; 124a[i] = a[j]; 125a[j] = t; 264keys[lo + i - 1] = keys[lo + child - 1]; 268keys[lo + i - 1] = d; 280keys[j + 1] = keys[j]; 284keys[j + 1] = t; 472SwapIfGreater(ref keys[zeroIndex], ref keys[middleIndex]); 473SwapIfGreater(ref keys[zeroIndex], ref keys[lastIndex]); 474SwapIfGreater(ref keys[middleIndex], ref keys[lastIndex]); 479Swap(ref keys[middleIndex], ref keys[nextToLastIndex]); 515Swap(ref keys[leftIndex], ref keys[rightIndex]); 521Swap(ref keys[leftIndex], ref keys[nextToLastIndex]); 539Swap(ref keys[0], ref keys[i - 1]); 553if (child < n && (keys[lo + child - 1] == null || LessThan(ref keys[lo + child - 1], ref keys[lo + child]))) 558if (keys[lo + child - 1] == null || !LessThan(ref d, ref keys[lo + child - 1])) 561keys[lo + i - 1] = keys[lo + child - 1]; 565keys[lo + i - 1] = d; 575while (j >= 0 && (t == null || LessThan(ref t, ref keys[j]))) 577keys[j + 1] = keys[j]; 581keys[j + 1] = t!; 697keys[i] = keys[j]; 698keys[j] = key; 712keys[i] = keys[j]; 713keys[j] = k; 860keys[lo + i - 1] = keys[lo + child - 1]; 865keys[lo + 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; 1105if (child < n && (keys[lo + child - 1] == null || LessThan(ref keys[lo + child - 1], ref keys[lo + child]))) 1110if (keys[lo + child - 1] == null || !LessThan(ref d, ref keys[lo + child - 1])) 1113keys[lo + i - 1] = keys[lo + child - 1]; 1118keys[lo + i - 1] = d; 1130while (j >= 0 && (t == null || LessThan(ref t, ref keys[j]))) 1132keys[j + 1] = keys[j]; 1137keys[j + 1] = t!; 1251keys[left] = keys[i]; 1252keys[i] = temp;

110if (comparer(keys[i], keys[j]) > 0) 112T key = keys[i]; 113keys[i] = keys[j]; 123T t = a[i]; 124a[i] = a[j]; 198T pivot = keys[middle]; 252T d = keys[lo + i - 1]; 256if (child < n && comparer!(keys[lo + child - 1], keys[lo + child]) < 0) 261if (!(comparer!(d, keys[lo + child - 1]) < 0)) 264keys[lo + i - 1] = keys[lo + child - 1]; 275T t = keys[i + 1]; 278while (j >= 0 && comparer(t, keys[j]) < 0) 280keys[j + 1] = keys[j]; 478T pivot = keys[middleIndex]; 549T d = keys[lo + i - 1]; 553if (child < n && (keys[lo + child - 1] == null || LessThan(ref keys[lo + child - 1], ref keys[lo + child]))) 558if (keys[lo + child - 1] == null || !LessThan(ref d, ref keys[lo + child - 1])) 561keys[lo + i - 1] = keys[lo + child - 1]; 572T t = keys[i + 1]; 577keys[j + 1] = keys[j]; 694if (comparer!.Compare(keys[i], keys[j]) > 0) 696TKey key = keys[i]; 697keys[i] = keys[j]; 711TKey k = keys[i]; 712keys[i] = keys[j]; 792TKey pivot = keys[middle]; 846TKey d = keys[lo + i - 1]; 852if (child < n && comparer!.Compare(keys[lo + child - 1], keys[lo + child]) < 0) 857if (!(comparer!.Compare(d, keys[lo + child - 1]) < 0)) 860keys[lo + i - 1] = keys[lo + 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]; 1099TKey d = keys[lo + i - 1]; 1105if (child < n && (keys[lo + child - 1] == null || LessThan(ref keys[lo + child - 1], ref keys[lo + child]))) 1110if (keys[lo + child - 1] == null || !LessThan(ref d, ref keys[lo + child - 1])) 1113keys[lo + i - 1] = keys[lo + child - 1]; 1126TKey t = keys[i + 1]; 1132keys[j + 1] = keys[j]; 1243if ((typeof(TKey) == typeof(double) && double.IsNaN((double)(object)keys[i])) 1244|| (typeof(TKey) == typeof(float) && float.IsNaN((float)(object)keys[i])) 1250TKey temp = keys[left]; 1251keys[left] = keys[i];