private static int med3(final boolean x[], final int a, final int b, final int c, BooleanComparator comp) { final int ab = comp.compare(x[a], x[b]); final int ac = comp.compare(x[a], x[c]); final int bc = comp.compare(x[b], x[c]); return (ab < 0 ? (bc < 0 ? b : ac < 0 ? c : a) : (bc > 0 ? b : ac > 0 ? c : a)); } private static void selectionSort(final boolean[] a, final int from, final int to, final BooleanComparator comp) {
private static int med3( final boolean x[], final int a, final int b, final int c, BooleanComparator comp ) { int ab = comp.compare( x[ a ], x[ b ] ); int ac = comp.compare( x[ a ], x[ c ] ); int bc = comp.compare( x[ b ], x[ c ] ); return ( ab < 0 ? ( bc < 0 ? b : ac < 0 ? c : a ) : ( bc > 0 ? b : ac > 0 ? c : a ) ); } private static void selectionSort( final boolean[] a, final int from, final int to, final BooleanComparator comp ) {
private static void selectionSort( final boolean[] a, final int from, final int to, final BooleanComparator comp ) { for( int i = from; i < to - 1; i++ ) { int m = i; for( int j = i + 1; j < to; j++ ) if ( comp.compare( a[ j ], a[ m ] ) < 0 ) m = j; if ( m != i ) { final boolean u = a[ i ]; a[ i ] = a[ m ]; a[ m ] = u; } } } private static void insertionSort( final boolean[] a, final int from, final int to, final BooleanComparator comp ) {
private static void selectionSort(final boolean[] a, final int from, final int to, final BooleanComparator comp) { for (int i = from; i < to - 1; i++) { int m = i; for (int j = i + 1; j < to; j++) if (comp.compare(a[j], a[m]) < 0) m = j; if (m != i) { final boolean u = a[i]; a[i] = a[m]; a[m] = u; } } } private static void insertionSort(final boolean[] a, final int from, final int to, final BooleanComparator comp) {
private static void insertionSort(final boolean[] a, final int from, final int to, final BooleanComparator comp) { for (int i = from; ++i < to;) { boolean t = a[i]; int j = i; for (boolean u = a[j - 1]; comp.compare(t, u) < 0; u = a[--j - 1]) { a[j] = u; if (from == j - 1) { --j; break; } } a[j] = t; } } /**
private static void insertionSort( final boolean[] a, final int from, final int to, final BooleanComparator comp ) { for ( int i = from; ++i < to; ) { boolean t = a[ i ]; int j = i; for ( boolean u = a[ j - 1 ]; comp.compare( t, u ) < 0; u = a[ --j - 1 ] ) { a[ j ] = u; if ( from == j - 1 ) { --j; break; } } a[ j ] = t; } } @SuppressWarnings("unchecked")
/** * {@inheritDoc} * <p> * This implementation delegates to the corresponding type-specific method. * * @deprecated Please use the corresponding type-specific method instead. */ @Deprecated @Override default int compare(Boolean ok1, Boolean ok2) { return compare(ok1.booleanValue(), ok2.booleanValue()); } }
private static long med3(final boolean x[][], final long a, final long b, final long c, BooleanComparator comp) { int ab = comp.compare(get(x, a), get(x, b)); int ac = comp.compare(get(x, a), get(x, c)); int bc = comp.compare(get(x, b), get(x, c)); return (ab < 0 ? (bc < 0 ? b : ac < 0 ? c : a) : (bc > 0 ? b : ac > 0 ? c : a)); } private static void selectionSort(final boolean[][] a, final long from, final long to,
private static void selectionSort(final boolean[][] a, final long from, final long to, final BooleanComparator comp) { for (long i = from; i < to - 1; i++) { long m = i; for (long j = i + 1; j < to; j++) if (comp.compare(BooleanBigArrays.get(a, j), BooleanBigArrays.get(a, m)) < 0) m = j; if (m != i) swap(a, i, m); } } /**