DownHeap()

void System.Array.SorterObjectArray.DownHeap ( int i, int n, int lo )

inlineprivate

Definition at line 171 of file Array.cs.

        {
            object obj = keys[lo + i - 1];
            object[] array = items;
            object obj2 = ((array != null) ? array[lo + i - 1] : null);
            while (i <= n / 2)
            {
                int num = 2 * i;
                if (num < n && comparer.Compare(keys[lo + num - 1], keys[lo + num]) < 0)
                {
                    num++;
                }
                if (comparer.Compare(obj, keys[lo + num - 1]) >= 0)
                {
                    break;
                }
                keys[lo + i - 1] = keys[lo + num - 1];
                if (items != null)
                {
                    items[lo + i - 1] = items[lo + num - 1];
                }
                i = num;
            }
            keys[lo + i - 1] = obj;
            if (items != null)
            {
                items[lo + i - 1] = obj2;
            }
        }

References System.array, System.Collections.Generic.IComparer< in T >.Compare(), System.Array.SorterObjectArray.comparer, System.Array.SorterObjectArray.items, System.Array.SorterObjectArray.keys, and System.obj.

Referenced by System.Array.SorterObjectArray.Heapsort().