| 
| static int  | BinarySearch (T[] array, int index, int length, T value) | 
|   | 
| static void  | SwapIfGreater (ref T i, ref T j) | 
|   | 
| static void  | Swap (ref T i, ref T j) | 
|   | 
| static void  | IntroSort (Span< T > keys, int depthLimit) | 
|   | 
| static int  | PickPivotAndPartition (Span< T > keys) | 
|   | 
| static void  | HeapSort (Span< T > keys) | 
|   | 
| static void  | DownHeap (Span< T > keys, int i, int n) | 
|   | 
| static void  | InsertionSort (Span< T > keys) | 
|   | 
| static bool  | LessThan (ref T left, ref T right) | 
|   | 
| static bool  | GreaterThan (ref T left, ref T right) | 
|   | 
| static void  | SwapIfGreaterWithValues (Span< TKey > keys, Span< TValue > values, int i, int j) | 
|   | 
| static void  | Swap (Span< TKey > keys, Span< TValue > values, int i, int j) | 
|   | 
| static void  | IntroSort (Span< TKey > keys, Span< TValue > values, int depthLimit) | 
|   | 
| static int  | PickPivotAndPartition (Span< TKey > keys, Span< TValue > values) | 
|   | 
| static void  | HeapSort (Span< TKey > keys, Span< TValue > values) | 
|   | 
| static void  | DownHeap (Span< TKey > keys, Span< TValue > values, int i, int n) | 
|   | 
| static void  | InsertionSort (Span< TKey > keys, Span< TValue > values) | 
|   | 
| static bool  | LessThan (ref TKey left, ref TKey right) | 
|   | 
| static bool  | GreaterThan (ref TKey left, ref TKey right) | 
|   | 
Definition at line 492 of file GenericArraySortHelper.cs.