Lines Matching refs:left
607 the middle element of a partition to be the same as the right or left -
627 /* hold left and right index values of a partition waiting to be sorted (the
628 partition includes both left and right - right is NOT one past the end or
632 int left;
795 uncompared sets during the scan - one to the left of the pc
798 u_right - the rightmost index of the left side's uncompared set
801 The leftmost index of the left sides's uncompared set
807 We know there are no uncompared elements on the left once we
814 the left side and greater than the pivot value on the right
852 Some versions of qsort like to use the left middle and right as
867 u_left). The values of the left, center, and right elements
969 /* Scan the uncompared values on the left. If I find a value
1017 /* I know I have a value on the left side which needs to be
1033 /* I have an out of position value on the left, but the
1035 and any less-than values left one to make room for the
1041 and the right end of the pivot chunk into the left end
1057 position value on the right, but the left is fully
1059 for the right value on the left.
1081 what to do with the stuff to the left and right of the pivot
1129 /* There are elements on the left which need more processing.
1141 /* stack the right partition, process the left */
1142 partition_stack[next_stack_entry].left = pc_right + 1;
1149 /* stack the left partition, process the right */
1150 partition_stack[next_stack_entry].left = part_left;
1160 /* The elements on the left are the only remaining elements
1180 part_left = partition_stack[next_stack_entry].left;
1228 part_left = partition_stack[next_stack_entry].left;
1744 #define tryCALL_AMAGICbin(left,right,meth,svp) STMT_START { \
1747 if (SvAMAGIC(left)||SvAMAGIC(right))\
1748 *svp = amagic_call(left, \