Lines Matching refs:Byte
51 * If the length of a byte array to be sorted is greater than
1215 public static void sort(byte[] a) {
1232 public static void sort(byte[] a, int fromIndex, int toIndex) {
1237 /** The number of distinct byte values. */
1250 private static void doSort(byte[] a, int left, int right) {
1254 byte ai = a[i];
1266 count[a[i] - Byte.MIN_VALUE]++;
1269 byte value = (byte) (i + Byte.MIN_VALUE);
1288 private static void dualPivotQuicksort(byte[] a, int left, int right) {
1298 byte ae1 = a[e1], ae2 = a[e2], ae3 = a[e3], ae4 = a[e4], ae5 = a[e5];
1300 if (ae1 > ae2) { byte t = ae1; ae1 = ae2; ae2 = t; }
1301 if (ae4 > ae5) { byte t = ae4; ae4 = ae5; ae5 = t; }
1302 if (ae1 > ae3) { byte t = ae1; ae1 = ae3; ae3 = t; }
1303 if (ae2 > ae3) { byte t = ae2; ae2 = ae3; ae3 = t; }
1304 if (ae1 > ae4) { byte t = ae1; ae1 = ae4; ae4 = t; }
1305 if (ae3 > ae4) { byte t = ae3; ae3 = ae4; ae4 = t; }
1306 if (ae2 > ae5) { byte t = ae2; ae2 = ae5; ae5 = t; }
1307 if (ae2 > ae3) { byte t = ae2; ae2 = ae3; ae3 = t; }
1308 if (ae4 > ae5) { byte t = ae4; ae4 = ae5; ae5 = t; }
1323 byte pivot1 = ae2; a[e2] = a[left];
1324 byte pivot2 = ae4; a[e4] = a[right];
1354 byte ak = a[k];
1399 byte ak = a[k];
1480 byte ak = a[k];
