2262this.keys = keys;

2271if (comparer.Compare(keys.GetValue(a), keys.GetValue(b)) > 0) 2273Object key = keys.GetValue(a); 2274keys.SetValue(keys.GetValue(b), a); 2275keys.SetValue(key, b); 2288Object t1 = keys.GetValue(i); 2289keys.SetValue(keys.GetValue(j), i); 2290keys.SetValue(t1, j); 2362Object x = keys.GetValue(middle); 2369while (comparer.Compare(keys.GetValue(i), x) < 0) i++; 2370while (comparer.Compare(x, keys.GetValue(j)) < 0) j--; 2384Object key = keys.GetValue(i); 2385keys.SetValue(keys.GetValue(j), i); 2386keys.SetValue(key, j); 2423IntroSort(left, length + left - 1, 2 * IntrospectiveSortUtilities.FloorLog2(keys.Length)); 2485Object pivot = keys.GetValue(mid); 2491while (comparer.Compare(keys.GetValue(++left), pivot) < 0) ; 2492while (comparer.Compare(pivot, keys.GetValue(--right)) < 0) ; 2522Object d = keys.GetValue(lo + i - 1); 2528if (child < n && comparer.Compare(keys.GetValue(lo + child - 1), keys.GetValue(lo + child)) < 0) 2533if (!(comparer.Compare(d, keys.GetValue(lo + child - 1)) < 0)) 2536keys.SetValue(keys.GetValue(lo + child - 1), lo + i - 1); 2541keys.SetValue(d, lo + i - 1); 2553t = keys.GetValue(i + 1); 2556while (j >= lo && comparer.Compare(t, keys.GetValue(j)) < 0) 2558keys.SetValue(keys.GetValue(j), j + 1); 2564keys.SetValue(t, j + 1);