1943this.keys = keys;

1952if (comparer.Compare(keys[a], keys[b]) > 0) 1954Object temp = keys[a]; 1955keys[a] = keys[b]; 1956keys[b] = temp; 1969Object t = keys[i]; 1970keys[i] = keys[j]; 1971keys[j] = t; 2045Object x = keys[middle]; 2052while (comparer.Compare(keys[i], x) < 0) i++; 2053while (comparer.Compare(x, keys[j]) < 0) j--; 2067Object key = keys[i]; 2068keys[i] = keys[j]; 2069keys[j] = key; 2106IntroSort(left, length + left - 1, 2 * IntrospectiveSortUtilities.FloorLog2(keys.Length)); 2168Object pivot = keys[mid]; 2174while (comparer.Compare(keys[++left], pivot) < 0) ; 2175while (comparer.Compare(pivot, keys[--right]) < 0) ; 2205Object d = keys[lo + i - 1]; 2211if (child < n && comparer.Compare(keys[lo + child - 1], keys[lo + child]) < 0) 2215if (!(comparer.Compare(d, keys[lo + child - 1]) < 0)) 2217keys[lo + i - 1] = keys[lo + child - 1]; 2222keys[lo + i - 1] = d; 2234t = keys[i + 1]; 2236while (j >= lo && comparer.Compare(t, keys[j]) < 0) 2238keys[j + 1] = keys[j]; 2243keys[j + 1] = t;