How to use

swap

method

in

it.unimi.dsi.fastutil.booleans.BooleanArrays

private static void swap(final boolean[] x, final boolean[] y, int a, int b, final int n) {
  for (int i = 0; i < n; i++, a++, b++)
    swap(x, y, a, b);
}

private static void vecSwap( final boolean[] x, int a, int b, final int n ) {
for( int i = 0; i < n; i++, a++, b++ ) swap( x, a, b );
}
private static int med3( final boolean x[], final int a, final int b, final int c, BooleanComparator comp ) {

/**
 * Swaps two sequences of elements of an array.
 *
 * @param x
 *            an array.
 * @param a
 *            a position in {@code x}.
 * @param b
 *            another position in {@code x}.
 * @param n
 *            the number of elements to exchange starting at {@code a} and
 *            {@code b}.
 */
public static void swap(final boolean[] x, int a, int b, final int n) {
  for (int i = 0; i < n; i++, a++, b++)
    swap(x, a, b);
}
private static int med3(final boolean x[], final int a, final int b, final int c, BooleanComparator comp) {

  while (b <= c && (comparison = (Boolean.compare((x[b]), (v)))) <= 0) {
    if (comparison == 0)
      swap(x, a++, b);
    b++;
      swap(x, c, d--);
    c--;
  swap(x, b++, c--);
swap(x, from, b - s, s);
s = Math.min(d - c, to - d - 1);
swap(x, b, to - s, s);

  while (b <= c && (comparison = (Boolean.compare((x[b]), (v)))) <= 0) {
    if (comparison == 0)
      swap(x, a++, b);
    b++;
      swap(x, c, d--);
    c--;
  swap(x, b++, c--);
swap(x, from, b - s, s);
s = Math.min(d - c, to - d - 1);
swap(x, b, to - s, s);

  while (b <= c && (comparison = comp.compare(x[b], v)) <= 0) {
    if (comparison == 0)
      swap(x, a++, b);
    b++;
      swap(x, c, d--);
    c--;
  swap(x, b++, c--);
swap(x, from, b - s, s);
s = Math.min(d - c, to - d - 1);
swap(x, b, to - s, s);

  while (b <= c && (comparison = comp.compare(x[b], v)) <= 0) {
    if (comparison == 0)
      swap(x, a++, b);
    b++;
      swap(x, c, d--);
    c--;
  swap(x, b++, c--);
swap(x, from, b - s, s);
s = Math.min(d - c, to - d - 1);
swap(x, b, to - s, s);

      : t) <= 0) {
    if (comparison == 0)
      swap(x, y, a++, b);
    b++;
      : t) >= 0) {
    if (comparison == 0)
      swap(x, y, c, d--);
    c--;
  swap(x, y, b++, c--);
swap(x, y, from, b - s, s);
s = Math.min(d - c, to - d - 1);
swap(x, y, b, to - s, s);

int comparison;
while ( b <= c && ( comparison = ( !(x[ b ]) && (v) ? -1 : ( (x[ b ]) == (v) ? 0 : 1 ) ) ) <= 0 ) {
if ( comparison == 0 ) swap( x, a++, b );
b++;
if ( comparison == 0 ) swap( x, c, d-- );
c--;
swap( x, b++, c-- );

int comparison;
while ( b <= c && ( comparison = comp.compare( x[ b ], v ) ) <= 0 ) {
if ( comparison == 0 ) swap( x, a++, b );
b++;
if ( comparison == 0 ) swap( x, c, d-- );
c--;
swap( x, b++, c-- );