Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $
You can buy this project and download/modify it how often you want.
com.landawn.abacus.util.Array Maven / Gradle / Ivy
/*
* Copyright (c) 2015, Haiyang Li.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.landawn.abacus.util;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.Comparator;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.List;
import java.util.ListIterator;
import java.util.Map;
import java.util.Map.Entry;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.RandomAccess;
import java.util.concurrent.TimeUnit;
import java.util.concurrent.atomic.AtomicInteger;
import com.landawn.abacus.annotation.NullSafe;
import com.landawn.abacus.util.u.Holder;
/**
*
* @since 0.8
*
* @author Haiyang Li
*
* @see java.lang.reflect.Array
*/
public final class Array {
static final AsyncExecutor parallelSortExecutor = new AsyncExecutor(64, 300L, TimeUnit.SECONDS);
static volatile int CPU_CORES = IOUtil.CPU_CORES;
static final int MIN_ARRAY_SORT_GRAN = 8192;
static final int BINARYSEARCH_THRESHOLD = 64;
private Array() {
}
public static T newInstance(final Class componentType, final int length) throws NegativeArraySizeException {
if (length == 0) {
Object result = N.CLASS_EMPTY_ARRAY.get(componentType);
if (result == null) {
result = java.lang.reflect.Array.newInstance(componentType, length);
N.CLASS_EMPTY_ARRAY.put(componentType, result);
}
return (T) result;
}
return (T) java.lang.reflect.Array.newInstance(componentType, length);
}
@SafeVarargs
public static T newInstance(final Class componentType, final int... dimensions) throws IllegalArgumentException, NegativeArraySizeException {
return (T) java.lang.reflect.Array.newInstance(componentType, dimensions);
}
public static int getLength(final Object array) throws IllegalArgumentException {
return java.lang.reflect.Array.getLength(array);
}
public static T get(final Object array, final int index) throws IllegalArgumentException, ArrayIndexOutOfBoundsException {
return (T) java.lang.reflect.Array.get(array, index);
}
public static boolean getBoolean(final Object array, final int index) throws IllegalArgumentException, ArrayIndexOutOfBoundsException {
return java.lang.reflect.Array.getBoolean(array, index);
}
public static byte getByte(final Object array, final int index) throws IllegalArgumentException, ArrayIndexOutOfBoundsException {
return java.lang.reflect.Array.getByte(array, index);
}
public static char getChar(final Object array, final int index) throws IllegalArgumentException, ArrayIndexOutOfBoundsException {
return java.lang.reflect.Array.getChar(array, index);
}
public static short getShort(final Object array, final int index) throws IllegalArgumentException, ArrayIndexOutOfBoundsException {
return java.lang.reflect.Array.getShort(array, index);
}
public static int getInt(final Object array, final int index) throws IllegalArgumentException, ArrayIndexOutOfBoundsException {
return java.lang.reflect.Array.getInt(array, index);
}
public static long getLong(final Object array, final int index) throws IllegalArgumentException, ArrayIndexOutOfBoundsException {
return java.lang.reflect.Array.getLong(array, index);
}
public static float getFloat(final Object array, final int index) throws IllegalArgumentException, ArrayIndexOutOfBoundsException {
return java.lang.reflect.Array.getFloat(array, index);
}
public static double getDouble(final Object array, final int index) throws IllegalArgumentException, ArrayIndexOutOfBoundsException {
return java.lang.reflect.Array.getDouble(array, index);
}
public static void set(final Object array, final int index, final Object value) throws IllegalArgumentException, ArrayIndexOutOfBoundsException {
java.lang.reflect.Array.set(array, index, value);
}
public static void setBoolean(final Object array, final int index, final boolean z) throws IllegalArgumentException, ArrayIndexOutOfBoundsException {
java.lang.reflect.Array.setBoolean(array, index, z);
}
public static void setByte(final Object array, final int index, final byte b) throws IllegalArgumentException, ArrayIndexOutOfBoundsException {
java.lang.reflect.Array.setByte(array, index, b);
}
public static void setChar(final Object array, final int index, final char c) throws IllegalArgumentException, ArrayIndexOutOfBoundsException {
java.lang.reflect.Array.setChar(array, index, c);
}
public static void setShort(final Object array, final int index, final short s) throws IllegalArgumentException, ArrayIndexOutOfBoundsException {
java.lang.reflect.Array.setShort(array, index, s);
}
public static void setInt(final Object array, final int index, final int i) throws IllegalArgumentException, ArrayIndexOutOfBoundsException {
java.lang.reflect.Array.setInt(array, index, i);
}
public static void setLong(final Object array, final int index, final long l) throws IllegalArgumentException, ArrayIndexOutOfBoundsException {
java.lang.reflect.Array.setLong(array, index, l);
}
public static void setFloat(final Object array, final int index, final float f) throws IllegalArgumentException, ArrayIndexOutOfBoundsException {
java.lang.reflect.Array.setFloat(array, index, f);
}
public static void setDouble(final Object array, final int index, final double d) throws IllegalArgumentException, ArrayIndexOutOfBoundsException {
java.lang.reflect.Array.setDouble(array, index, d);
}
/**
* Returns a fixed-size list backed by the specified array if it's not null or empty, otherwise an immutable empty list is returned.
*
* @param a
* @return
* @see Arrays#asList(Object...)
*/
@SafeVarargs
@NullSafe
public static List asList(T... a) {
return N.isNullOrEmpty(a) ? N. emptyList() : Arrays.asList(a);
}
/**
* Returns the input array
*
* @param a
* @return
*/
@SafeVarargs
public static boolean[] of(final boolean... a) {
return a;
}
/**
* Returns the input array
*
* @param a
* @return
*/
@SafeVarargs
public static char[] of(final char... a) {
return a;
}
/**
* Returns the input array
*
* @param a
* @return
*/
@SafeVarargs
public static byte[] of(final byte... a) {
return a;
}
/**
* Returns the input array
*
* @param a
* @return
*/
@SafeVarargs
public static short[] of(final short... a) {
return a;
}
/**
* Returns the input array
*
* @param a
* @return
*/
@SafeVarargs
public static int[] of(final int... a) {
return a;
}
/**
* Returns the input array
*
* @param a
* @return
*/
@SafeVarargs
public static long[] of(final long... a) {
return a;
}
/**
* Returns the input array
*
* @param a
* @return
*/
@SafeVarargs
public static float[] of(final float... a) {
return a;
}
/**
* Returns the input array
*
* @param a
* @return
*/
@SafeVarargs
public static double[] of(final double... a) {
return a;
}
/**
* Returns the input array
*
* @param a
* @return
*/
@SafeVarargs
public static String[] of(final String... a) {
return a;
}
/**
* Returns the input array
*
* @param a
* @return
*/
@SafeVarargs
public static T[] oF(final T... a) {
return a;
}
// /**
// * Returns the input array
// *
// * @param a
// * @return
// */
// @SafeVarargs
// public static BigInteger[] of(final BigInteger... a) {
// return a;
// }
//
// /**
// * Returns the input array
// *
// * @param a
// * @return
// */
// @SafeVarargs
// public static BigDecimal[] of(final BigDecimal... a) {
// return a;
// }
//
// /**
// * Returns the input array
// *
// * @param a
// * @return
// */
// public static > T[] of(final T... a) {
// return a;
// }
//
// /**
// * Returns the input array
// *
// * @param a
// * @return
// */
// public static T[] of(final T... a) {
// return a;
// }
//
// /**
// * Returns the input array
// *
// * @param a
// * @return
// */
// public static T[] of(final T... a) {
// return a;
// }
//
// /**
// * Returns the input array
// *
// * @param a
// * @return
// */
// public static T[] of(final T... a) {
// return a;
// }
//
// /**
// * Returns the input array
// *
// * @param a
// * @return
// */
// public static > T[] of(final T... a) {
// return a;
// }
//
// /**
// * Returns the input array
// *
// * @param a
// * @return
// */
// @SuppressWarnings("rawtypes")
// public static Class[] of(final Class... a) {
// return a;
// }
//
// /**
// * Returns the input array
// *
// * @param a
// * @return
// */
// public static T[] of(final T... a) {
// return a;
// }
//
// /**
// * Returns the input array
// *
// * @param a
// * @return
// */
// public static T[] of(final T... a) {
// return a;
// }
//
// /**
// * Returns the input array
// *
// * @param a
// * @return
// */
// public static T[] of(final T... a) {
// return a;
// }
//
// /**
// * Returns the input array
// *
// * @param a
// * @return
// */
// public static > T[] of(final T... a) {
// return a;
// }
//
// /**
// * Returns the input array
// *
// * @param a
// * @return
// */
// public static > T[] of(final T... a) {
// return a;
// }
//
// /**
// * Returns the input array
// *
// * @param a
// * @return
// */
// public static > T[] of(final T... a) {
// return a;
// }
//
// /**
// * Returns the input array
// *
// * @param a
// * @return
// */
// public static > T[] of(final T... a) {
// return a;
// }
//
// /**
// * Returns the input array
// *
// * @param a
// * @return
// */
// public static > T[] of(final T... a) {
// return a;
// }
// // Only for Java 8. it's ambiguous in the Java version before 8.
// /**
// * Returns the input array
// *
// * @param a
// * @return
// */
// public static T[] of(final T... a) {
// return a;
// }
public static char[] range(char startInclusive, final char endExclusive) {
if (startInclusive >= endExclusive) {
return N.EMPTY_CHAR_ARRAY;
}
final char[] a = new char[endExclusive * 1 - startInclusive];
for (int i = 0, len = a.length; i < len; i++) {
a[i] = startInclusive++;
}
return a;
}
public static byte[] range(byte startInclusive, final byte endExclusive) {
if (startInclusive >= endExclusive) {
return N.EMPTY_BYTE_ARRAY;
}
final byte[] a = new byte[endExclusive * 1 - startInclusive];
for (int i = 0, len = a.length; i < len; i++) {
a[i] = startInclusive++;
}
return a;
}
public static short[] range(short startInclusive, final short endExclusive) {
if (startInclusive >= endExclusive) {
return N.EMPTY_SHORT_ARRAY;
}
final short[] a = new short[endExclusive * 1 - startInclusive];
for (int i = 0, len = a.length; i < len; i++) {
a[i] = startInclusive++;
}
return a;
}
public static int[] range(int startInclusive, final int endExclusive) {
if (startInclusive >= endExclusive) {
return N.EMPTY_INT_ARRAY;
}
if (endExclusive * 1L - startInclusive > Integer.MAX_VALUE) {
throw new IllegalArgumentException("overflow");
}
final int[] a = new int[endExclusive - startInclusive];
for (int i = 0, len = a.length; i < len; i++) {
a[i] = startInclusive++;
}
return a;
}
public static long[] range(long startInclusive, final long endExclusive) {
if (startInclusive >= endExclusive) {
return N.EMPTY_LONG_ARRAY;
}
if (endExclusive - startInclusive < 0 || endExclusive - startInclusive > Integer.MAX_VALUE) {
throw new IllegalArgumentException("overflow");
}
final long[] a = new long[(int) (endExclusive - startInclusive)];
for (int i = 0, len = a.length; i < len; i++) {
a[i] = startInclusive++;
}
return a;
}
// // Doesn't work as expected due to precision issue. "3.3d - 1.1d != 2.2d". Refer to: https://en.wikipedia.org/wiki/IEEE_floating_point
// // http://stackoverflow.com/questions/15625556/java-adding-and-subtracting-doubles-are-giving-strange-results
// static float[] range(float startInclusive, final float endExclusive) {
// if (endExclusive == startInclusive) {
// return N.EMPTY_FLOAT_ARRAY;
// }
//
// int tmp = (int) (endExclusive - startInclusive);
// final float[] a = new float[(startInclusive + tmp == endExclusive) ? tmp : tmp + 1];
//
// for (int i = 0, len = a.length; i < len; i++) {
// a[i] = startInclusive++;
// }
//
// return a;
// }
//
// // Doesn't work as expected due to precision issue. "3.3d - 1.1d != 2.2d". Refer to: https://en.wikipedia.org/wiki/IEEE_floating_point
// // http://stackoverflow.com/questions/15625556/java-adding-and-subtracting-doubles-are-giving-strange-results
// static double[] range(double startInclusive, final double endExclusive) {
// if (endExclusive == startInclusive) {
// return N.EMPTY_DOUBLE_ARRAY;
// }
//
// int tmp = (int) (endExclusive - startInclusive);
// final double[] a = new double[(startInclusive + tmp == endExclusive) ? tmp : tmp + 1];
//
// for (int i = 0, len = a.length; i < len; i++) {
// a[i] = startInclusive++;
// }
//
// return a;
// }
public static char[] range(char startInclusive, final char endExclusive, final int by) {
if (by == 0) {
throw new IllegalArgumentException("The input parameter 'by' can't be zero");
}
if (endExclusive == startInclusive || endExclusive > startInclusive != by > 0) {
return N.EMPTY_CHAR_ARRAY;
}
// if (endExclusive > startInclusive != by > 0) {
// throw new IllegalArgumentException(
// "The input 'startInclusive' (" + startInclusive + ") and 'endExclusive' (" + endExclusive + ") are not consistent with by (" + by + ").");
// }
final int len = (endExclusive * 1 - startInclusive) / by + ((endExclusive * 1 - startInclusive) % by == 0 ? 0 : 1);
final char[] a = new char[len];
for (int i = 0; i < len; i++, startInclusive += by) {
a[i] = startInclusive;
}
return a;
}
public static byte[] range(byte startInclusive, final byte endExclusive, final byte by) {
if (by == 0) {
throw new IllegalArgumentException("The input parameter 'by' can't be zero");
}
if (endExclusive == startInclusive || endExclusive > startInclusive != by > 0) {
return N.EMPTY_BYTE_ARRAY;
}
// if (endExclusive > startInclusive != by > 0) {
// throw new IllegalArgumentException(
// "The input 'startInclusive' (" + startInclusive + ") and 'endExclusive' (" + endExclusive + ") are not consistent with by (" + by + ").");
// }
final int len = (endExclusive * 1 - startInclusive) / by + ((endExclusive * 1 - startInclusive) % by == 0 ? 0 : 1);
final byte[] a = new byte[len];
for (int i = 0; i < len; i++, startInclusive += by) {
a[i] = startInclusive;
}
return a;
}
public static short[] range(short startInclusive, final short endExclusive, final short by) {
if (by == 0) {
throw new IllegalArgumentException("The input parameter 'by' can't be zero");
}
if (endExclusive == startInclusive || endExclusive > startInclusive != by > 0) {
return N.EMPTY_SHORT_ARRAY;
}
// if (endExclusive > startInclusive != by > 0) {
// throw new IllegalArgumentException(
// "The input 'startInclusive' (" + startInclusive + ") and 'endExclusive' (" + endExclusive + ") are not consistent with by (" + by + ").");
// }
final int len = (endExclusive * 1 - startInclusive) / by + ((endExclusive * 1 - startInclusive) % by == 0 ? 0 : 1);
final short[] a = new short[len];
for (int i = 0; i < len; i++, startInclusive += by) {
a[i] = startInclusive;
}
return a;
}
public static int[] range(int startInclusive, final int endExclusive, final int by) {
if (by == 0) {
throw new IllegalArgumentException("The input parameter 'by' can't be zero");
}
if (endExclusive == startInclusive || endExclusive > startInclusive != by > 0) {
return N.EMPTY_INT_ARRAY;
}
// if (endExclusive > startInclusive != by > 0) {
// throw new IllegalArgumentException(
// "The input 'startInclusive' (" + startInclusive + ") and 'endExclusive' (" + endExclusive + ") are not consistent with by (" + by + ").");
// }
final long len = (endExclusive * 1L - startInclusive) / by + ((endExclusive * 1L - startInclusive) % by == 0 ? 0 : 1);
if (len > Integer.MAX_VALUE) {
throw new IllegalArgumentException("overflow");
}
final int[] a = new int[(int) len];
for (int i = 0; i < len; i++, startInclusive += by) {
a[i] = startInclusive;
}
return a;
}
public static long[] range(long startInclusive, final long endExclusive, final long by) {
if (by == 0) {
throw new IllegalArgumentException("The input parameter 'by' can't be zero");
}
if (endExclusive == startInclusive || endExclusive > startInclusive != by > 0) {
return N.EMPTY_LONG_ARRAY;
}
// if (endExclusive > startInclusive != by > 0) {
// throw new IllegalArgumentException(
// "The input 'startInclusive' (" + startInclusive + ") and 'endExclusive' (" + endExclusive + ") are not consistent with by (" + by + ").");
// }
long len = 0;
if ((by > 0 && endExclusive - startInclusive < 0) || (by < 0 && startInclusive - endExclusive < 0)) {
final BigInteger m = BigInteger.valueOf(endExclusive).subtract(BigInteger.valueOf(startInclusive)).divide(BigInteger.valueOf(by));
if (m.compareTo(BigInteger.valueOf(Integer.MAX_VALUE)) > 0) {
throw new IllegalArgumentException("overflow");
}
len = m.multiply(BigInteger.valueOf(by)).add(BigInteger.valueOf(startInclusive)).equals(BigInteger.valueOf(endExclusive)) ? m.longValue()
: m.longValue() + 1;
} else {
len = (endExclusive - startInclusive) / by + ((endExclusive - startInclusive) % by == 0 ? 0 : 1);
}
if (len > Integer.MAX_VALUE) {
throw new IllegalArgumentException("overflow");
}
final long[] a = new long[(int) len];
for (int i = 0; i < len; i++, startInclusive += by) {
a[i] = startInclusive;
}
return a;
}
// // Doesn't work as expected due to precision issue. "3.3d - 1.1d != 2.2d". Refer to: https://en.wikipedia.org/wiki/IEEE_floating_point
// // http://stackoverflow.com/questions/15625556/java-adding-and-subtracting-doubles-are-giving-strange-results
// static float[] range(float startInclusive, final float endExclusive, final float by) {
// if (by == 0) {
// throw new IllegalArgumentException("The input parameter 'by' can't be zero");
// }
//
// if (endExclusive == startInclusive) {
// return N.EMPTY_FLOAT_ARRAY;
// }
//
// if (endExclusive > startInclusive != by > 0) {
// throw new IllegalArgumentException(
// "The input 'startInclusive' (" + startInclusive + ") and 'endExclusive' (" + endExclusive + ") are not consistent with by (" + by + ").");
// }
//
// final int tmp = (int) ((endExclusive - startInclusive) / by);
// final int len = startInclusive + (tmp * by) == endExclusive ? tmp : tmp + 1;
// final float[] a = new float[len];
//
// for (int i = 0; i < len; i++, startInclusive += by) {
// a[i] = startInclusive;
// }
//
// return a;
// }
//
// // Doesn't work as expected due to precision issue. "3.3d - 1.1d != 2.2d". Refer to: https://en.wikipedia.org/wiki/IEEE_floating_point
// // http://stackoverflow.com/questions/15625556/java-adding-and-subtracting-doubles-are-giving-strange-results
// static double[] range(double startInclusive, final double endExclusive, final double by) {
// if (by == 0) {
// throw new IllegalArgumentException("The input parameter 'by' can't be zero");
// }
//
// if (endExclusive == startInclusive) {
// return N.EMPTY_DOUBLE_ARRAY;
// }
//
// if (endExclusive > startInclusive != by > 0) {
// throw new IllegalArgumentException(
// "The input 'startInclusive' (" + startInclusive + ") and 'endExclusive' (" + endExclusive + ") are not consistent with by (" + by + ").");
// }
//
// final int tmp = (int) ((endExclusive - startInclusive) / by);
// final int len = startInclusive + (tmp * by) == endExclusive ? tmp : tmp + 1;
// final double[] a = new double[len];
//
// for (int i = 0; i < len; i++, startInclusive += by) {
// a[i] = startInclusive;
// }
//
// return a;
// }
public static char[] rangeClosed(char startInclusive, final char endInclusive) {
if (startInclusive > endInclusive) {
return N.EMPTY_CHAR_ARRAY;
} else if (startInclusive == endInclusive) {
return Array.of(startInclusive);
}
final char[] a = new char[endInclusive * 1 - startInclusive + 1];
for (int i = 0, len = a.length; i < len; i++) {
a[i] = startInclusive++;
}
return a;
}
public static byte[] rangeClosed(byte startInclusive, final byte endInclusive) {
if (startInclusive > endInclusive) {
return N.EMPTY_BYTE_ARRAY;
} else if (startInclusive == endInclusive) {
return Array.of(startInclusive);
}
final byte[] a = new byte[endInclusive * 1 - startInclusive + 1];
for (int i = 0, len = a.length; i < len; i++) {
a[i] = startInclusive++;
}
return a;
}
public static short[] rangeClosed(short startInclusive, final short endInclusive) {
if (startInclusive > endInclusive) {
return N.EMPTY_SHORT_ARRAY;
} else if (startInclusive == endInclusive) {
return Array.of(startInclusive);
}
final short[] a = new short[endInclusive * 1 - startInclusive + 1];
for (int i = 0, len = a.length; i < len; i++) {
a[i] = startInclusive++;
}
return a;
}
public static int[] rangeClosed(int startInclusive, final int endInclusive) {
if (startInclusive > endInclusive) {
return N.EMPTY_INT_ARRAY;
} else if (startInclusive == endInclusive) {
return Array.of(startInclusive);
}
if (endInclusive * 1L - startInclusive + 1 > Integer.MAX_VALUE) {
throw new IllegalArgumentException("overflow");
}
final int[] a = new int[endInclusive - startInclusive + 1];
for (int i = 0, len = a.length; i < len; i++) {
a[i] = startInclusive++;
}
return a;
}
public static long[] rangeClosed(long startInclusive, final long endInclusive) {
if (startInclusive > endInclusive) {
return N.EMPTY_LONG_ARRAY;
} else if (startInclusive == endInclusive) {
return Array.of(startInclusive);
}
if (endInclusive - startInclusive + 1 <= 0 || endInclusive - startInclusive + 1 > Integer.MAX_VALUE) {
throw new IllegalArgumentException("overflow");
}
final long[] a = new long[(int) (endInclusive - startInclusive + 1)];
for (int i = 0, len = a.length; i < len; i++) {
a[i] = startInclusive++;
}
return a;
}
// // Doesn't work as expected due to precision issue. "3.3d - 1.1d != 2.2d". Refer to: https://en.wikipedia.org/wiki/IEEE_floating_point
// // http://stackoverflow.com/questions/15625556/java-adding-and-subtracting-doubles-are-giving-strange-results
// static float[] rangeClosed(float startInclusive, final float endInclusive) {
// final float[] a = new float[(int) (endInclusive - startInclusive) + 1];
//
// for (int i = 0, len = a.length; i < len; i++) {
// a[i] = startInclusive++;
// }
//
// return a;
// }
//
// // Doesn't work as expected due to precision issue. "3.3d - 1.1d != 2.2d". Refer to: https://en.wikipedia.org/wiki/IEEE_floating_point
// // http://stackoverflow.com/questions/15625556/java-adding-and-subtracting-doubles-are-giving-strange-results
// static double[] rangeClosed(double startInclusive, final double endInclusive) {
// final double[] a = new double[(int) (endInclusive - startInclusive) + 1];
//
// for (int i = 0, len = a.length; i < len; i++) {
// a[i] = startInclusive++;
// }
//
// return a;
// }
public static char[] rangeClosed(char startInclusive, final char endInclusive, final int by) {
if (by == 0) {
throw new IllegalArgumentException("The input parameter 'by' can't be zero");
}
if (endInclusive == startInclusive) {
return new char[] { startInclusive };
} else if (endInclusive > startInclusive != by > 0) {
return N.EMPTY_CHAR_ARRAY;
}
// if (endInclusive > startInclusive != by > 0) {
// throw new IllegalArgumentException(
// "The input 'startInclusive' (" + startInclusive + ") and 'endInclusive' (" + endInclusive + ") are not consistent with by (" + by + ").");
// }
final int len = (endInclusive * 1 - startInclusive) / by + 1;
final char[] a = new char[len];
for (int i = 0; i < len; i++, startInclusive += by) {
a[i] = startInclusive;
}
return a;
}
public static byte[] rangeClosed(byte startInclusive, final byte endInclusive, final byte by) {
if (by == 0) {
throw new IllegalArgumentException("The input parameter 'by' can't be zero");
}
if (endInclusive == startInclusive) {
return new byte[] { startInclusive };
} else if (endInclusive > startInclusive != by > 0) {
return N.EMPTY_BYTE_ARRAY;
}
// if (endInclusive > startInclusive != by > 0) {
// throw new IllegalArgumentException(
// "The input 'startInclusive' (" + startInclusive + ") and 'endInclusive' (" + endInclusive + ") are not consistent with by (" + by + ").");
// }
final int len = (endInclusive * 1 - startInclusive) / by + 1;
final byte[] a = new byte[len];
for (int i = 0; i < len; i++, startInclusive += by) {
a[i] = startInclusive;
}
return a;
}
public static short[] rangeClosed(short startInclusive, final short endInclusive, final short by) {
if (by == 0) {
throw new IllegalArgumentException("The input parameter 'by' can't be zero");
}
if (endInclusive == startInclusive) {
return new short[] { startInclusive };
} else if (endInclusive > startInclusive != by > 0) {
return N.EMPTY_SHORT_ARRAY;
}
// if (endInclusive > startInclusive != by > 0) {
// throw new IllegalArgumentException(
// "The input 'startInclusive' (" + startInclusive + ") and 'endInclusive' (" + endInclusive + ") are not consistent with by (" + by + ").");
// }
final int len = (endInclusive * 1 - startInclusive) / by + 1;
final short[] a = new short[len];
for (int i = 0; i < len; i++, startInclusive += by) {
a[i] = startInclusive;
}
return a;
}
public static int[] rangeClosed(int startInclusive, final int endInclusive, final int by) {
if (by == 0) {
throw new IllegalArgumentException("The input parameter 'by' can't be zero");
}
if (endInclusive == startInclusive) {
return new int[] { startInclusive };
} else if (endInclusive > startInclusive != by > 0) {
return N.EMPTY_INT_ARRAY;
}
// if (endInclusive > startInclusive != by > 0) {
// throw new IllegalArgumentException(
// "The input 'startInclusive' (" + startInclusive + ") and 'endInclusive' (" + endInclusive + ") are not consistent with by (" + by + ").");
// }
final long len = (endInclusive * 1L - startInclusive) / by + 1;
if (len > Integer.MAX_VALUE) {
throw new IllegalArgumentException("overflow");
}
final int[] a = new int[(int) len];
for (int i = 0; i < len; i++, startInclusive += by) {
a[i] = startInclusive;
}
return a;
}
public static long[] rangeClosed(long startInclusive, final long endInclusive, final long by) {
if (by == 0) {
throw new IllegalArgumentException("The input parameter 'by' can't be zero");
}
if (endInclusive == startInclusive) {
return new long[] { startInclusive };
} else if (endInclusive > startInclusive != by > 0) {
return N.EMPTY_LONG_ARRAY;
}
// if (endInclusive > startInclusive != by > 0) {
// throw new IllegalArgumentException(
// "The input 'startInclusive' (" + startInclusive + ") and 'endInclusive' (" + endInclusive + ") are not consistent with by (" + by + ").");
// }
long len = 0;
if ((by > 0 && endInclusive - startInclusive < 0) || (by < 0 && startInclusive - endInclusive < 0) || ((endInclusive - startInclusive) / by + 1 <= 0)) {
final BigInteger m = BigInteger.valueOf(endInclusive).subtract(BigInteger.valueOf(startInclusive)).divide(BigInteger.valueOf(by));
if (m.compareTo(BigInteger.valueOf(Integer.MAX_VALUE)) > 0) {
throw new IllegalArgumentException("overflow");
}
len = m.longValue() + 1;
} else {
len = (endInclusive - startInclusive) / by + 1;
}
if (len > Integer.MAX_VALUE) {
throw new IllegalArgumentException("overflow");
}
final long[] a = new long[(int) len];
for (int i = 0; i < len; i++, startInclusive += by) {
a[i] = startInclusive;
}
return a;
}
// // Doesn't work as expected due to precision issue. "3.3d - 1.1d != 2.2d". Refer to: https://en.wikipedia.org/wiki/IEEE_floating_point
// // http://stackoverflow.com/questions/15625556/java-adding-and-subtracting-doubles-are-giving-strange-results
// static float[] rangeClosed(float startInclusive, final float endExclusive, final float by) {
// if (by == 0) {
// throw new IllegalArgumentException("The input parameter 'by' can't be zero");
// }
//
// if (endExclusive == startInclusive) {
// return new float[] { startInclusive };
// }
//
// if (endExclusive > startInclusive != by > 0) {
// throw new IllegalArgumentException(
// "The input 'startInclusive' (" + startInclusive + ") and 'endExclusive' (" + endExclusive + ") are not consistent with by (" + by + ").");
// }
//
// final int len = (int) (((double) endExclusive - (double) startInclusive) / by) + 1;
// final float[] a = new float[len];
//
// for (int i = 0; i < len; i++, startInclusive += by) {
// a[i] = startInclusive;
// }
//
// return a;
// }
//
// // Doesn't work as expected due to precision issue. "3.3d - 1.1d != 2.2d". Refer to: https://en.wikipedia.org/wiki/IEEE_floating_point
// // http://stackoverflow.com/questions/15625556/java-adding-and-subtracting-doubles-are-giving-strange-results
// static double[] rangeClosed(double startInclusive, final double endExclusive, final double by) {
// if (by == 0) {
// throw new IllegalArgumentException("The input parameter 'by' can't be zero");
// }
//
// if (endExclusive == startInclusive) {
// return new double[] { startInclusive };
// }
//
// if (endExclusive > startInclusive != by > 0) {
// throw new IllegalArgumentException(
// "The input 'startInclusive' (" + startInclusive + ") and 'endExclusive' (" + endExclusive + ") are not consistent with by (" + by + ").");
// }
//
// final int len = (int) ((endExclusive - startInclusive) / by) + 1;
// final double[] a = new double[len];
//
// for (int i = 0; i < len; i++, startInclusive += by) {
// a[i] = startInclusive;
// }
//
// return a;
// }
public static boolean[] repeat(final boolean element, final int n) {
final boolean[] a = new boolean[n];
N.fill(a, element);
return a;
}
public static char[] repeat(final char element, final int n) {
final char[] a = new char[n];
N.fill(a, element);
return a;
}
public static byte[] repeat(final byte element, final int n) {
final byte[] a = new byte[n];
N.fill(a, element);
return a;
}
public static short[] repeat(final short element, final int n) {
final short[] a = new short[n];
N.fill(a, element);
return a;
}
public static int[] repeat(final int element, final int n) {
final int[] a = new int[n];
N.fill(a, element);
return a;
}
public static long[] repeat(final long element, final int n) {
final long[] a = new long[n];
N.fill(a, element);
return a;
}
public static float[] repeat(final float element, final int n) {
final float[] a = new float[n];
N.fill(a, element);
return a;
}
public static double[] repeat(final double element, final int n) {
final double[] a = new double[n];
N.fill(a, element);
return a;
}
/**
*
* @param element
* @param n
* @return
* @throws NullPointerException if the specified {@code element} is null.
*/
public static T[] repeat(final T element, final int n) throws NullPointerException {
final T[] a = N.newArray(element.getClass(), n);
N.fill(a, element);
return a;
}
public static boolean[][] concat(final boolean[][] a, final boolean[][] b) {
if (N.isNullOrEmpty(a)) {
return N.isNullOrEmpty(b) ? new boolean[0][] : N.clone(b);
} else if (N.isNullOrEmpty(b)) {
return N.clone(a);
}
final int maxLen = N.max(N.len(a), N.len(b));
final boolean[][] result = new boolean[maxLen][];
for (int i = 0, aLen = N.len(a), bLen = N.len(b); i < maxLen; i++) {
result[i] = N.concat(i < aLen ? a[i] : null, i < bLen ? b[i] : null);
}
return result;
}
public static boolean[][][] concat(final boolean[][][] a, final boolean[][][] b) {
if (N.isNullOrEmpty(a)) {
return N.isNullOrEmpty(b) ? new boolean[0][][] : N.clone(b);
} else if (N.isNullOrEmpty(b)) {
return N.clone(a);
}
final int maxLen = N.max(N.len(a), N.len(b));
final boolean[][][] result = new boolean[maxLen][][];
for (int i = 0, aLen = N.len(a), bLen = N.len(b); i < maxLen; i++) {
result[i] = concat(i < aLen ? a[i] : null, i < bLen ? b[i] : null);
}
return result;
}
public static char[][] concat(final char[][] a, final char[][] b) {
if (N.isNullOrEmpty(a)) {
return N.isNullOrEmpty(b) ? new char[0][] : N.clone(b);
} else if (N.isNullOrEmpty(b)) {
return N.clone(a);
}
final int maxLen = N.max(N.len(a), N.len(b));
final char[][] result = new char[maxLen][];
for (int i = 0, aLen = N.len(a), bLen = N.len(b); i < maxLen; i++) {
result[i] = N.concat(i < aLen ? a[i] : null, i < bLen ? b[i] : null);
}
return result;
}
public static char[][][] concat(final char[][][] a, final char[][][] b) {
if (N.isNullOrEmpty(a)) {
return N.isNullOrEmpty(b) ? new char[0][][] : N.clone(b);
} else if (N.isNullOrEmpty(b)) {
return N.clone(a);
}
final int maxLen = N.max(N.len(a), N.len(b));
final char[][][] result = new char[maxLen][][];
for (int i = 0, aLen = N.len(a), bLen = N.len(b); i < maxLen; i++) {
result[i] = concat(i < aLen ? a[i] : null, i < bLen ? b[i] : null);
}
return result;
}
public static byte[][] concat(final byte[][] a, final byte[][] b) {
if (N.isNullOrEmpty(a)) {
return N.isNullOrEmpty(b) ? new byte[0][] : N.clone(b);
} else if (N.isNullOrEmpty(b)) {
return N.clone(a);
}
final int maxLen = N.max(N.len(a), N.len(b));
final byte[][] result = new byte[maxLen][];
for (int i = 0, aLen = N.len(a), bLen = N.len(b); i < maxLen; i++) {
result[i] = N.concat(i < aLen ? a[i] : null, i < bLen ? b[i] : null);
}
return result;
}
public static byte[][][] concat(final byte[][][] a, final byte[][][] b) {
if (N.isNullOrEmpty(a)) {
return N.isNullOrEmpty(b) ? new byte[0][][] : N.clone(b);
} else if (N.isNullOrEmpty(b)) {
return N.clone(a);
}
final int maxLen = N.max(N.len(a), N.len(b));
final byte[][][] result = new byte[maxLen][][];
for (int i = 0, aLen = N.len(a), bLen = N.len(b); i < maxLen; i++) {
result[i] = concat(i < aLen ? a[i] : null, i < bLen ? b[i] : null);
}
return result;
}
public static short[][] concat(final short[][] a, final short[][] b) {
if (N.isNullOrEmpty(a)) {
return N.isNullOrEmpty(b) ? new short[0][] : N.clone(b);
} else if (N.isNullOrEmpty(b)) {
return N.clone(a);
}
final int maxLen = N.max(N.len(a), N.len(b));
final short[][] result = new short[maxLen][];
for (int i = 0, aLen = N.len(a), bLen = N.len(b); i < maxLen; i++) {
result[i] = N.concat(i < aLen ? a[i] : null, i < bLen ? b[i] : null);
}
return result;
}
public static short[][][] concat(final short[][][] a, final short[][][] b) {
if (N.isNullOrEmpty(a)) {
return N.isNullOrEmpty(b) ? new short[0][][] : N.clone(b);
} else if (N.isNullOrEmpty(b)) {
return N.clone(a);
}
final int maxLen = N.max(N.len(a), N.len(b));
final short[][][] result = new short[maxLen][][];
for (int i = 0, aLen = N.len(a), bLen = N.len(b); i < maxLen; i++) {
result[i] = concat(i < aLen ? a[i] : null, i < bLen ? b[i] : null);
}
return result;
}
public static int[][] concat(final int[][] a, final int[][] b) {
if (N.isNullOrEmpty(a)) {
return N.isNullOrEmpty(b) ? new int[0][] : N.clone(b);
} else if (N.isNullOrEmpty(b)) {
return N.clone(a);
}
final int maxLen = N.max(N.len(a), N.len(b));
final int[][] result = new int[maxLen][];
for (int i = 0, aLen = N.len(a), bLen = N.len(b); i < maxLen; i++) {
result[i] = N.concat(i < aLen ? a[i] : null, i < bLen ? b[i] : null);
}
return result;
}
public static int[][][] concat(final int[][][] a, final int[][][] b) {
if (N.isNullOrEmpty(a)) {
return N.isNullOrEmpty(b) ? new int[0][][] : N.clone(b);
} else if (N.isNullOrEmpty(b)) {
return N.clone(a);
}
final int maxLen = N.max(N.len(a), N.len(b));
final int[][][] result = new int[maxLen][][];
for (int i = 0, aLen = N.len(a), bLen = N.len(b); i < maxLen; i++) {
result[i] = concat(i < aLen ? a[i] : null, i < bLen ? b[i] : null);
}
return result;
}
public static long[][] concat(final long[][] a, final long[][] b) {
if (N.isNullOrEmpty(a)) {
return N.isNullOrEmpty(b) ? new long[0][] : N.clone(b);
} else if (N.isNullOrEmpty(b)) {
return N.clone(a);
}
final int maxLen = N.max(N.len(a), N.len(b));
final long[][] result = new long[maxLen][];
for (int i = 0, aLen = N.len(a), bLen = N.len(b); i < maxLen; i++) {
result[i] = N.concat(i < aLen ? a[i] : null, i < bLen ? b[i] : null);
}
return result;
}
public static long[][][] concat(final long[][][] a, final long[][][] b) {
if (N.isNullOrEmpty(a)) {
return N.isNullOrEmpty(b) ? new long[0][][] : N.clone(b);
} else if (N.isNullOrEmpty(b)) {
return N.clone(a);
}
final int maxLen = N.max(N.len(a), N.len(b));
final long[][][] result = new long[maxLen][][];
for (int i = 0, aLen = N.len(a), bLen = N.len(b); i < maxLen; i++) {
result[i] = concat(i < aLen ? a[i] : null, i < bLen ? b[i] : null);
}
return result;
}
public static float[][] concat(final float[][] a, final float[][] b) {
if (N.isNullOrEmpty(a)) {
return N.isNullOrEmpty(b) ? new float[0][] : N.clone(b);
} else if (N.isNullOrEmpty(b)) {
return N.clone(a);
}
final int maxLen = N.max(N.len(a), N.len(b));
final float[][] result = new float[maxLen][];
for (int i = 0, aLen = N.len(a), bLen = N.len(b); i < maxLen; i++) {
result[i] = N.concat(i < aLen ? a[i] : null, i < bLen ? b[i] : null);
}
return result;
}
public static float[][][] concat(final float[][][] a, final float[][][] b) {
if (N.isNullOrEmpty(a)) {
return N.isNullOrEmpty(b) ? new float[0][][] : N.clone(b);
} else if (N.isNullOrEmpty(b)) {
return N.clone(a);
}
final int maxLen = N.max(N.len(a), N.len(b));
final float[][][] result = new float[maxLen][][];
for (int i = 0, aLen = N.len(a), bLen = N.len(b); i < maxLen; i++) {
result[i] = concat(i < aLen ? a[i] : null, i < bLen ? b[i] : null);
}
return result;
}
public static double[][] concat(final double[][] a, final double[][] b) {
if (N.isNullOrEmpty(a)) {
return N.isNullOrEmpty(b) ? new double[0][] : N.clone(b);
} else if (N.isNullOrEmpty(b)) {
return N.clone(a);
}
final int maxLen = N.max(N.len(a), N.len(b));
final double[][] result = new double[maxLen][];
for (int i = 0, aLen = N.len(a), bLen = N.len(b); i < maxLen; i++) {
result[i] = N.concat(i < aLen ? a[i] : null, i < bLen ? b[i] : null);
}
return result;
}
public static double[][][] concat(final double[][][] a, final double[][][] b) {
if (N.isNullOrEmpty(a)) {
return N.isNullOrEmpty(b) ? new double[0][][] : N.clone(b);
} else if (N.isNullOrEmpty(b)) {
return N.clone(a);
}
final int maxLen = N.max(N.len(a), N.len(b));
final double[][][] result = new double[maxLen][][];
for (int i = 0, aLen = N.len(a), bLen = N.len(b); i < maxLen; i++) {
result[i] = concat(i < aLen ? a[i] : null, i < bLen ? b[i] : null);
}
return result;
}
public static T[][] concatt(final T[][] a, final T[][] b) {
if (N.isNullOrEmpty(a)) {
return N.clone(b);
} else if (N.isNullOrEmpty(b)) {
return N.clone(a);
}
final int maxLen = N.max(N.len(a), N.len(b));
final T[][] result = newInstance(a.getClass().getComponentType(), maxLen);
for (int i = 0, aLen = N.len(a), bLen = N.len(b); i < maxLen; i++) {
result[i] = N.concat(i < aLen ? a[i] : null, i < bLen ? b[i] : null);
}
return result;
}
public static T[][][] concatt(final T[][][] a, final T[][][] b) {
if (N.isNullOrEmpty(a)) {
return N.clone(b);
} else if (N.isNullOrEmpty(b)) {
return N.clone(a);
}
final int maxLen = N.max(N.len(a), N.len(b));
final T[][][] result = newInstance(a.getClass().getComponentType(), maxLen);
for (int i = 0, aLen = N.len(a), bLen = N.len(b); i < maxLen; i++) {
result[i] = concatt(i < aLen ? a[i] : null, i < bLen ? b[i] : null);
}
return result;
}
static void sort(final boolean[] a) {
if (N.isNullOrEmpty(a)) {
return;
}
int numOfFalse = 0;
for (int i = 0, len = a.length; i < len; i++) {
if (a[i] == false) {
numOfFalse++;
}
}
N.fill(a, 0, numOfFalse, false);
N.fill(a, numOfFalse, a.length, true);
}
static void reverseSort(final boolean[] a) {
if (N.isNullOrEmpty(a)) {
return;
}
int numOfTrue = 0;
for (int i = 0, len = a.length; i < len; i++) {
if (a[i]) {
numOfTrue++;
}
}
N.fill(a, 0, numOfTrue, true);
N.fill(a, numOfTrue, a.length, false);
}
static void sort(final char[] a) {
if (N.isNullOrEmpty(a)) {
return;
}
Arrays.sort(a);
}
static void sort(final char[] a, final int fromIndex, final int toIndex) {
N.checkFromToIndex(fromIndex, toIndex, a == null ? 0 : a.length);
if (N.isNullOrEmpty(a) || fromIndex == toIndex) {
return;
}
Arrays.sort(a, fromIndex, toIndex);
}
static void sort(final byte[] a) {
if (N.isNullOrEmpty(a)) {
return;
}
Arrays.sort(a);
}
static void sort(final byte[] a, final int fromIndex, final int toIndex) {
N.checkFromToIndex(fromIndex, toIndex, a == null ? 0 : a.length);
if (N.isNullOrEmpty(a) || fromIndex == toIndex) {
return;
}
Arrays.sort(a, fromIndex, toIndex);
}
static void sort(final short[] a) {
if (N.isNullOrEmpty(a)) {
return;
}
Arrays.sort(a);
}
static void sort(final short[] a, final int fromIndex, final int toIndex) {
N.checkFromToIndex(fromIndex, toIndex, a == null ? 0 : a.length);
if (N.isNullOrEmpty(a) || fromIndex == toIndex) {
return;
}
Arrays.sort(a, fromIndex, toIndex);
}
static void sort(final int[] a) {
if (N.isNullOrEmpty(a)) {
return;
}
Arrays.sort(a);
}
static void sort(final int[] a, final int fromIndex, final int toIndex) {
N.checkFromToIndex(fromIndex, toIndex, a == null ? 0 : a.length);
if (N.isNullOrEmpty(a) || fromIndex == toIndex) {
return;
}
Arrays.sort(a, fromIndex, toIndex);
}
static void sort(final long[] a) {
if (N.isNullOrEmpty(a)) {
return;
}
Arrays.sort(a);
}
static void sort(final long[] a, final int fromIndex, final int toIndex) {
N.checkFromToIndex(fromIndex, toIndex, a == null ? 0 : a.length);
if (N.isNullOrEmpty(a) || fromIndex == toIndex) {
return;
}
Arrays.sort(a, fromIndex, toIndex);
}
static void sort(final float[] a) {
if (N.isNullOrEmpty(a)) {
return;
}
Arrays.sort(a);
}
static void sort(final float[] a, final int fromIndex, final int toIndex) {
N.checkFromToIndex(fromIndex, toIndex, a == null ? 0 : a.length);
if (N.isNullOrEmpty(a) || fromIndex == toIndex) {
return;
}
Arrays.sort(a, fromIndex, toIndex);
}
static void sort(final double[] a) {
if (N.isNullOrEmpty(a)) {
return;
}
Arrays.sort(a);
}
static void sort(final double[] a, final int fromIndex, final int toIndex) {
N.checkFromToIndex(fromIndex, toIndex, a == null ? 0 : a.length);
if (N.isNullOrEmpty(a) || fromIndex == toIndex) {
return;
}
Arrays.sort(a, fromIndex, toIndex);
}
static void sort(final Object[] a) {
if (N.isNullOrEmpty(a)) {
return;
}
sort(a, 0, a.length);
}
static void sort(final Object[] a, final int fromIndex, final int toIndex) {
sort(a, fromIndex, toIndex, Comparators.NATURAL_ORDER);
}
static void sort(final T[] a, final Comparator cmp) {
if (N.isNullOrEmpty(a)) {
return;
}
sort(a, 0, a.length, cmp);
}
static void sort(final T[] a, final int fromIndex, final int toIndex, final Comparator cmp) {
N.checkFromToIndex(fromIndex, toIndex, a == null ? 0 : a.length);
if (N.isNullOrEmpty(a) || fromIndex == toIndex) {
return;
}
Arrays.sort(a, fromIndex, toIndex, cmp);
}
static > void sort(final List c) {
if (N.isNullOrEmpty(c)) {
return;
}
sort(c, 0, c.size());
}
static > void sort(final List c, final int fromIndex, final int toIndex) {
sort(c, fromIndex, toIndex, Comparators.NATURAL_ORDER);
}
static void sort(final List list, final Comparator cmp) {
if (N.isNullOrEmpty(list)) {
return;
}
sort(list, 0, list.size(), cmp);
}
@SuppressWarnings("rawtypes")
static void sort(final List c, final int fromIndex, final int toIndex, final Comparator cmp) {
if ((N.isNullOrEmpty(c) && fromIndex == 0 && toIndex == 0) || fromIndex == toIndex) {
return;
}
if (N.isListElementDataFieldGettable && N.listElementDataField != null && c instanceof ArrayList) {
T[] array = null;
try {
array = (T[]) N.listElementDataField.get(c);
} catch (Throwable e) {
// ignore;
N.isListElementDataFieldGettable = false;
}
if (array != null) {
sort(array, fromIndex, toIndex, cmp);
return;
}
}
final T[] array = (T[]) c.toArray();
Arrays.sort(array, fromIndex, toIndex, cmp);
final ListIterator i = c.listIterator();
for (int j = 0; j < array.length; j++) {
i.next();
i.set(array[j]);
}
}
// ============================= Java 8 and above
// static void parallelSort(final char[] a) {
// if (N.isNullOrEmpty(a)) {
// return;
// }
//
// Arrays.parallelSort(a);
// }
//
// static void parallelSort(final char[] a, final int fromIndex, final int toIndex) {
// if (N.isNullOrEmpty(a)) {
// return;
// }
//
// Arrays.parallelSort(a, fromIndex, toIndex);
// }
//
// static void parallelSort(final byte[] a) {
// if (N.isNullOrEmpty(a)) {
// return;
// }
//
// Arrays.parallelSort(a);
// }
//
// static void parallelSort(final byte[] a, final int fromIndex, final int toIndex) {
// if (N.isNullOrEmpty(a)) {
// return;
// }
//
// Arrays.parallelSort(a, fromIndex, toIndex);
// }
//
// static void parallelSort(final short[] a) {
// if (N.isNullOrEmpty(a)) {
// return;
// }
//
// Arrays.parallelSort(a);
// }
//
// static void parallelSort(final short[] a, final int fromIndex, final int toIndex) {
// if (N.isNullOrEmpty(a)) {
// return;
// }
//
// Arrays.parallelSort(a, fromIndex, toIndex);
// }
//
// static void parallelSort(final int[] a) {
// if (N.isNullOrEmpty(a)) {
// return;
// }
//
// Arrays.parallelSort(a);
// }
//
// static void parallelSort(final int[] a, final int fromIndex, final int toIndex) {
// if (N.isNullOrEmpty(a)) {
// return;
// }
//
// Arrays.parallelSort(a, fromIndex, toIndex);
// }
//
// static void parallelSort(final long[] a) {
// if (N.isNullOrEmpty(a)) {
// return;
// }
//
// Arrays.parallelSort(a);
// }
//
// static void parallelSort(final long[] a, final int fromIndex, final int toIndex) {
// if (N.isNullOrEmpty(a)) {
// return;
// }
//
// Arrays.parallelSort(a, fromIndex, toIndex);
// }
//
// static void parallelSort(final float[] a) {
// if (N.isNullOrEmpty(a)) {
// return;
// }
//
// Arrays.parallelSort(a);
// }
//
// static void parallelSort(final float[] a, final int fromIndex, final int toIndex) {
// if (N.isNullOrEmpty(a)) {
// return;
// }
//
// Arrays.parallelSort(a, fromIndex, toIndex);
// }
//
// static void parallelSort(final double[] a) {
// if (N.isNullOrEmpty(a)) {
// return;
// }
//
// Arrays.parallelSort(a);
// }
//
// static void parallelSort(final double[] a, final int fromIndex, final int toIndex) {
// if (N.isNullOrEmpty(a)) {
// return;
// }
//
// Arrays.parallelSort(a, fromIndex, toIndex);
// }
//
// static void parallelSort(Object[] a) {
// if (N.isNullOrEmpty(a)) {
// return;
// }
//
// Arrays.parallelSort(a, N.OBJECT_COMPARATOR);
// }
//
// static void parallelSort(Object[] a, int fromIndex, int toIndex) {
// if (N.isNullOrEmpty(a)) {
// return;
// }
//
// Arrays.parallelSort(a, fromIndex, toIndex, N.OBJECT_COMPARATOR);
// }
//
// static void parallelSort(final T[] a, final Comparator cmp) {
// if (N.isNullOrEmpty(a)) {
// return;
// }
//
// Arrays.parallelSort(a, cmp);
// }
//
// static void parallelSort(final T[] a, final int fromIndex, final int toIndex, final Comparator cmp) {
// if (N.isNullOrEmpty(a)) {
// return;
// }
//
// Arrays.parallelSort(a, fromIndex, toIndex, cmp);
// }
static void parallelSort(final char[] array) {
if (N.isNullOrEmpty(array)) {
return;
}
parallelSort(array, 0, array.length);
}
static void parallelSort(final char[] a, final int fromIndex, final int toIndex) {
N.checkFromToIndex(fromIndex, toIndex, a == null ? 0 : a.length);
if (N.isNullOrEmpty(a) || fromIndex == toIndex) {
return;
}
final int len = toIndex - fromIndex;
if (len < MIN_ARRAY_SORT_GRAN || CPU_CORES == 1) {
sort(a, fromIndex, toIndex);
return;
}
final Queue> subArrayIndexQueue = new LinkedList<>();
final AtomicInteger activeThreadNum = new AtomicInteger();
final Holder errorHolder = new Holder<>();
final int lenOfSubArray = len % CPU_CORES == 0 ? len / CPU_CORES : (len / CPU_CORES) + 1;
for (int i = 0; i < CPU_CORES; i++) {
final int start = fromIndex + i * lenOfSubArray;
final int end = toIndex - start < lenOfSubArray ? toIndex : start + lenOfSubArray;
subArrayIndexQueue.add(Pair.of(start, end));
activeThreadNum.incrementAndGet();
parallelSortExecutor.execute(new Try.Runnable() {
@Override
public void run() {
try {
if (errorHolder.value() != null) {
return;
}
Arrays.sort(a, start, end);
} catch (Exception e) {
setError(errorHolder, e);
} finally {
activeThreadNum.decrementAndGet();
}
}
});
}
while (activeThreadNum.get() > 0) {
N.sleep(1);
}
if (errorHolder.value() != null) {
throw N.toRuntimeException(errorHolder.value());
}
while (subArrayIndexQueue.size() > 1 && errorHolder.value() == null) {
for (int i = 0, size = subArrayIndexQueue.size(); i < size;) {
final Pair pairA = subArrayIndexQueue.poll();
if (++i == size) {
subArrayIndexQueue.add(pairA);
} else {
i++;
final Pair pairB = subArrayIndexQueue.poll();
subArrayIndexQueue.offer(Pair.of(pairA.left, pairB.right));
activeThreadNum.incrementAndGet();
parallelSortExecutor.execute(new Try.Runnable() {
@Override
public void run() {
try {
if (errorHolder.value() != null) {
return;
}
merge(N.copyOfRange(a, pairA.left, pairA.right), 0, pairA.right - pairA.left, a, pairB.left, pairB.right, pairA.left);
} catch (Exception e) {
setError(errorHolder, e);
} finally {
activeThreadNum.decrementAndGet();
}
}
});
}
}
while (activeThreadNum.get() > 0) {
N.sleep(1);
}
if (errorHolder.value() != null) {
throw N.toRuntimeException(errorHolder.value());
}
}
if (errorHolder.value() != null) {
throw N.toRuntimeException(errorHolder.value());
}
}
static void merge(final char[] a, int fromIndexA, int toIndexA, final char[] b, int fromIndexB, int toIndexB, int fromIndex) {
while (fromIndexA < toIndexA && fromIndexB < toIndexB) {
if (a[fromIndexA] <= b[fromIndexB]) {
b[fromIndex++] = a[fromIndexA++];
} else {
b[fromIndex++] = b[fromIndexB++];
}
}
if (fromIndexA < toIndexA) {
N.copy(a, fromIndexA, b, fromIndex, toIndexA - fromIndexA);
fromIndex += toIndexA - fromIndexA;
}
}
static void parallelSort(final byte[] array) {
if (N.isNullOrEmpty(array)) {
return;
}
parallelSort(array, 0, array.length);
}
static void parallelSort(final byte[] a, final int fromIndex, final int toIndex) {
N.checkFromToIndex(fromIndex, toIndex, a == null ? 0 : a.length);
if (N.isNullOrEmpty(a) || fromIndex == toIndex) {
return;
}
final int len = toIndex - fromIndex;
if (len < MIN_ARRAY_SORT_GRAN || CPU_CORES == 1) {
sort(a, fromIndex, toIndex);
return;
}
final Queue> subArrayIndexQueue = new LinkedList<>();
final AtomicInteger activeThreadNum = new AtomicInteger();
final Holder errorHolder = new Holder<>();
final int lenOfSubArray = len % CPU_CORES == 0 ? len / CPU_CORES : (len / CPU_CORES) + 1;
for (int i = 0; i < CPU_CORES; i++) {
final int start = fromIndex + i * lenOfSubArray;
final int end = toIndex - start < lenOfSubArray ? toIndex : start + lenOfSubArray;
subArrayIndexQueue.add(Pair.of(start, end));
activeThreadNum.incrementAndGet();
parallelSortExecutor.execute(new Try.Runnable() {
@Override
public void run() {
try {
if (errorHolder.value() != null) {
return;
}
Arrays.sort(a, start, end);
} catch (Exception e) {
setError(errorHolder, e);
} finally {
activeThreadNum.decrementAndGet();
}
}
});
}
while (activeThreadNum.get() > 0) {
N.sleep(1);
}
if (errorHolder.value() != null) {
throw N.toRuntimeException(errorHolder.value());
}
while (subArrayIndexQueue.size() > 1 && errorHolder.value() == null) {
for (int i = 0, size = subArrayIndexQueue.size(); i < size;) {
final Pair pairA = subArrayIndexQueue.poll();
if (++i == size) {
subArrayIndexQueue.add(pairA);
} else {
i++;
final Pair pairB = subArrayIndexQueue.poll();
subArrayIndexQueue.offer(Pair.of(pairA.left, pairB.right));
activeThreadNum.incrementAndGet();
parallelSortExecutor.execute(new Try.Runnable() {
@Override
public void run() {
try {
if (errorHolder.value() != null) {
return;
}
merge(N.copyOfRange(a, pairA.left, pairA.right), 0, pairA.right - pairA.left, a, pairB.left, pairB.right, pairA.left);
} catch (Exception e) {
setError(errorHolder, e);
} finally {
activeThreadNum.decrementAndGet();
}
}
});
}
}
while (activeThreadNum.get() > 0) {
N.sleep(1);
}
if (errorHolder.value() != null) {
throw N.toRuntimeException(errorHolder.value());
}
}
if (errorHolder.value() != null) {
throw N.toRuntimeException(errorHolder.value());
}
}
static void merge(final byte[] a, int fromIndexA, int toIndexA, final byte[] b, int fromIndexB, int toIndexB, int fromIndex) {
while (fromIndexA < toIndexA && fromIndexB < toIndexB) {
if (a[fromIndexA] <= b[fromIndexB]) {
b[fromIndex++] = a[fromIndexA++];
} else {
b[fromIndex++] = b[fromIndexB++];
}
}
if (fromIndexA < toIndexA) {
N.copy(a, fromIndexA, b, fromIndex, toIndexA - fromIndexA);
fromIndex += toIndexA - fromIndexA;
}
}
static void parallelSort(final short[] array) {
if (N.isNullOrEmpty(array)) {
return;
}
parallelSort(array, 0, array.length);
}
static void parallelSort(final short[] a, final int fromIndex, final int toIndex) {
N.checkFromToIndex(fromIndex, toIndex, a == null ? 0 : a.length);
if (N.isNullOrEmpty(a) || fromIndex == toIndex) {
return;
}
final int len = toIndex - fromIndex;
if (len < MIN_ARRAY_SORT_GRAN || CPU_CORES == 1) {
sort(a, fromIndex, toIndex);
return;
}
final Queue> subArrayIndexQueue = new LinkedList<>();
final AtomicInteger activeThreadNum = new AtomicInteger();
final Holder errorHolder = new Holder<>();
final int lenOfSubArray = len % CPU_CORES == 0 ? len / CPU_CORES : (len / CPU_CORES) + 1;
for (int i = 0; i < CPU_CORES; i++) {
final int start = fromIndex + i * lenOfSubArray;
final int end = toIndex - start < lenOfSubArray ? toIndex : start + lenOfSubArray;
subArrayIndexQueue.add(Pair.of(start, end));
activeThreadNum.incrementAndGet();
parallelSortExecutor.execute(new Try.Runnable() {
@Override
public void run() {
try {
if (errorHolder.value() != null) {
return;
}
Arrays.sort(a, start, end);
} catch (Exception e) {
setError(errorHolder, e);
} finally {
activeThreadNum.decrementAndGet();
}
}
});
}
while (activeThreadNum.get() > 0) {
N.sleep(1);
}
if (errorHolder.value() != null) {
throw N.toRuntimeException(errorHolder.value());
}
while (subArrayIndexQueue.size() > 1 && errorHolder.value() == null) {
for (int i = 0, size = subArrayIndexQueue.size(); i < size;) {
final Pair pairA = subArrayIndexQueue.poll();
if (++i == size) {
subArrayIndexQueue.add(pairA);
} else {
i++;
final Pair pairB = subArrayIndexQueue.poll();
subArrayIndexQueue.offer(Pair.of(pairA.left, pairB.right));
activeThreadNum.incrementAndGet();
parallelSortExecutor.execute(new Try.Runnable() {
@Override
public void run() {
try {
if (errorHolder.value() != null) {
return;
}
merge(N.copyOfRange(a, pairA.left, pairA.right), 0, pairA.right - pairA.left, a, pairB.left, pairB.right, pairA.left);
} catch (Exception e) {
setError(errorHolder, e);
} finally {
activeThreadNum.decrementAndGet();
}
}
});
}
}
while (activeThreadNum.get() > 0) {
N.sleep(1);
}
if (errorHolder.value() != null) {
throw N.toRuntimeException(errorHolder.value());
}
}
if (errorHolder.value() != null) {
throw N.toRuntimeException(errorHolder.value());
}
}
static void merge(final short[] a, int fromIndexA, int toIndexA, final short[] b, int fromIndexB, int toIndexB, int fromIndex) {
while (fromIndexA < toIndexA && fromIndexB < toIndexB) {
if (a[fromIndexA] <= b[fromIndexB]) {
b[fromIndex++] = a[fromIndexA++];
} else {
b[fromIndex++] = b[fromIndexB++];
}
}
if (fromIndexA < toIndexA) {
N.copy(a, fromIndexA, b, fromIndex, toIndexA - fromIndexA);
fromIndex += toIndexA - fromIndexA;
}
}
static void parallelSort(final int[] array) {
if (N.isNullOrEmpty(array)) {
return;
}
parallelSort(array, 0, array.length);
}
static void parallelSort(final int[] a, final int fromIndex, final int toIndex) {
N.checkFromToIndex(fromIndex, toIndex, a == null ? 0 : a.length);
if (N.isNullOrEmpty(a) || fromIndex == toIndex) {
return;
}
final int len = toIndex - fromIndex;
if (len < MIN_ARRAY_SORT_GRAN || CPU_CORES == 1) {
sort(a, fromIndex, toIndex);
return;
}
final Queue> subArrayIndexQueue = new LinkedList<>();
final AtomicInteger activeThreadNum = new AtomicInteger();
final Holder errorHolder = new Holder<>();
final int lenOfSubArray = len % CPU_CORES == 0 ? len / CPU_CORES : (len / CPU_CORES) + 1;
for (int i = 0; i < CPU_CORES; i++) {
final int start = fromIndex + i * lenOfSubArray;
final int end = toIndex - start < lenOfSubArray ? toIndex : start + lenOfSubArray;
subArrayIndexQueue.add(Pair.of(start, end));
activeThreadNum.incrementAndGet();
parallelSortExecutor.execute(new Try.Runnable() {
@Override
public void run() {
try {
if (errorHolder.value() != null) {
return;
}
Arrays.sort(a, start, end);
} catch (Exception e) {
setError(errorHolder, e);
} finally {
activeThreadNum.decrementAndGet();
}
}
});
}
while (activeThreadNum.get() > 0) {
N.sleep(1);
}
if (errorHolder.value() != null) {
throw N.toRuntimeException(errorHolder.value());
}
while (subArrayIndexQueue.size() > 1 && errorHolder.value() == null) {
for (int i = 0, size = subArrayIndexQueue.size(); i < size;) {
final Pair pairA = subArrayIndexQueue.poll();
if (++i == size) {
subArrayIndexQueue.add(pairA);
} else {
i++;
final Pair pairB = subArrayIndexQueue.poll();
subArrayIndexQueue.offer(Pair.of(pairA.left, pairB.right));
activeThreadNum.incrementAndGet();
parallelSortExecutor.execute(new Try.Runnable() {
@Override
public void run() {
try {
if (errorHolder.value() != null) {
return;
}
merge(N.copyOfRange(a, pairA.left, pairA.right), 0, pairA.right - pairA.left, a, pairB.left, pairB.right, pairA.left);
} catch (Exception e) {
setError(errorHolder, e);
} finally {
activeThreadNum.decrementAndGet();
}
}
});
}
}
while (activeThreadNum.get() > 0) {
N.sleep(1);
}
if (errorHolder.value() != null) {
throw N.toRuntimeException(errorHolder.value());
}
}
if (errorHolder.value() != null) {
throw N.toRuntimeException(errorHolder.value());
}
}
static void merge(final int[] a, int fromIndexA, int toIndexA, final int[] b, int fromIndexB, int toIndexB, int fromIndex) {
while (fromIndexA < toIndexA && fromIndexB < toIndexB) {
if (a[fromIndexA] <= b[fromIndexB]) {
b[fromIndex++] = a[fromIndexA++];
} else {
b[fromIndex++] = b[fromIndexB++];
}
}
if (fromIndexA < toIndexA) {
N.copy(a, fromIndexA, b, fromIndex, toIndexA - fromIndexA);
fromIndex += toIndexA - fromIndexA;
}
}
static void parallelSort(final long[] array) {
if (N.isNullOrEmpty(array)) {
return;
}
parallelSort(array, 0, array.length);
}
static void parallelSort(final long[] a, final int fromIndex, final int toIndex) {
N.checkFromToIndex(fromIndex, toIndex, a == null ? 0 : a.length);
if (N.isNullOrEmpty(a) || fromIndex == toIndex) {
return;
}
final int len = toIndex - fromIndex;
if (len < MIN_ARRAY_SORT_GRAN || CPU_CORES == 1) {
sort(a, fromIndex, toIndex);
return;
}
final Queue> subArrayIndexQueue = new LinkedList<>();
final AtomicInteger activeThreadNum = new AtomicInteger();
final Holder errorHolder = new Holder<>();
final int lenOfSubArray = len % CPU_CORES == 0 ? len / CPU_CORES : (len / CPU_CORES) + 1;
for (int i = 0; i < CPU_CORES; i++) {
final int start = fromIndex + i * lenOfSubArray;
final int end = toIndex - start < lenOfSubArray ? toIndex : start + lenOfSubArray;
subArrayIndexQueue.add(Pair.of(start, end));
activeThreadNum.incrementAndGet();
parallelSortExecutor.execute(new Try.Runnable() {
@Override
public void run() {
try {
if (errorHolder.value() != null) {
return;
}
Arrays.sort(a, start, end);
} catch (Exception e) {
setError(errorHolder, e);
} finally {
activeThreadNum.decrementAndGet();
}
}
});
}
while (activeThreadNum.get() > 0) {
N.sleep(1);
}
if (errorHolder.value() != null) {
throw N.toRuntimeException(errorHolder.value());
}
while (subArrayIndexQueue.size() > 1 && errorHolder.value() == null) {
for (int i = 0, size = subArrayIndexQueue.size(); i < size;) {
final Pair pairA = subArrayIndexQueue.poll();
if (++i == size) {
subArrayIndexQueue.add(pairA);
} else {
i++;
final Pair pairB = subArrayIndexQueue.poll();
subArrayIndexQueue.offer(Pair.of(pairA.left, pairB.right));
activeThreadNum.incrementAndGet();
parallelSortExecutor.execute(new Try.Runnable() {
@Override
public void run() {
try {
if (errorHolder.value() != null) {
return;
}
merge(N.copyOfRange(a, pairA.left, pairA.right), 0, pairA.right - pairA.left, a, pairB.left, pairB.right, pairA.left);
} catch (Exception e) {
setError(errorHolder, e);
} finally {
activeThreadNum.decrementAndGet();
}
}
});
}
}
while (activeThreadNum.get() > 0) {
N.sleep(1);
}
if (errorHolder.value() != null) {
throw N.toRuntimeException(errorHolder.value());
}
}
if (errorHolder.value() != null) {
throw N.toRuntimeException(errorHolder.value());
}
}
static void merge(final long[] a, int fromIndexA, int toIndexA, final long[] b, int fromIndexB, int toIndexB, int fromIndex) {
while (fromIndexA < toIndexA && fromIndexB < toIndexB) {
if (a[fromIndexA] <= b[fromIndexB]) {
b[fromIndex++] = a[fromIndexA++];
} else {
b[fromIndex++] = b[fromIndexB++];
}
}
if (fromIndexA < toIndexA) {
N.copy(a, fromIndexA, b, fromIndex, toIndexA - fromIndexA);
fromIndex += toIndexA - fromIndexA;
}
}
static void parallelSort(final float[] array) {
if (N.isNullOrEmpty(array)) {
return;
}
parallelSort(array, 0, array.length);
}
static void parallelSort(final float[] a, final int fromIndex, final int toIndex) {
N.checkFromToIndex(fromIndex, toIndex, a == null ? 0 : a.length);
if (N.isNullOrEmpty(a) || fromIndex == toIndex) {
return;
}
final int len = toIndex - fromIndex;
if (len < MIN_ARRAY_SORT_GRAN || CPU_CORES == 1) {
sort(a, fromIndex, toIndex);
return;
}
final Queue> subArrayIndexQueue = new LinkedList<>();
final AtomicInteger activeThreadNum = new AtomicInteger();
final Holder errorHolder = new Holder<>();
final int lenOfSubArray = len % CPU_CORES == 0 ? len / CPU_CORES : (len / CPU_CORES) + 1;
for (int i = 0; i < CPU_CORES; i++) {
final int start = fromIndex + i * lenOfSubArray;
final int end = toIndex - start < lenOfSubArray ? toIndex : start + lenOfSubArray;
subArrayIndexQueue.add(Pair.of(start, end));
activeThreadNum.incrementAndGet();
parallelSortExecutor.execute(new Try.Runnable() {
@Override
public void run() {
try {
if (errorHolder.value() != null) {
return;
}
Arrays.sort(a, start, end);
} catch (Exception e) {
setError(errorHolder, e);
} finally {
activeThreadNum.decrementAndGet();
}
}
});
}
while (activeThreadNum.get() > 0) {
N.sleep(1);
}
if (errorHolder.value() != null) {
throw N.toRuntimeException(errorHolder.value());
}
while (subArrayIndexQueue.size() > 1 && errorHolder.value() == null) {
for (int i = 0, size = subArrayIndexQueue.size(); i < size;) {
final Pair pairA = subArrayIndexQueue.poll();
if (++i == size) {
subArrayIndexQueue.add(pairA);
} else {
i++;
final Pair pairB = subArrayIndexQueue.poll();
subArrayIndexQueue.offer(Pair.of(pairA.left, pairB.right));
activeThreadNum.incrementAndGet();
parallelSortExecutor.execute(new Try.Runnable() {
@Override
public void run() {
try {
if (errorHolder.value() != null) {
return;
}
merge(N.copyOfRange(a, pairA.left, pairA.right), 0, pairA.right - pairA.left, a, pairB.left, pairB.right, pairA.left);
} catch (Exception e) {
setError(errorHolder, e);
} finally {
activeThreadNum.decrementAndGet();
}
}
});
}
}
while (activeThreadNum.get() > 0) {
N.sleep(1);
}
if (errorHolder.value() != null) {
throw N.toRuntimeException(errorHolder.value());
}
}
if (errorHolder.value() != null) {
throw N.toRuntimeException(errorHolder.value());
}
}
static void merge(final float[] a, int fromIndexA, int toIndexA, final float[] b, int fromIndexB, int toIndexB, int fromIndex) {
int numOfNaN = 0;
for (int i = toIndexA - 1; i >= fromIndexA && Float.isNaN(a[i]); i--) {
toIndexA--;
numOfNaN++;
}
for (int i = toIndexB - 1; i >= fromIndexB && Float.isNaN(b[i]); i--) {
toIndexB--;
numOfNaN++;
}
while (fromIndexA < toIndexA && fromIndexB < toIndexB) {
if (Float.compare(a[fromIndexA], b[fromIndexB]) <= 0) {
b[fromIndex++] = a[fromIndexA++];
} else {
b[fromIndex++] = b[fromIndexB++];
}
}
if (fromIndexA < toIndexA) {
N.copy(a, fromIndexA, b, fromIndex, toIndexA - fromIndexA);
fromIndex += toIndexA - fromIndexA;
} else if (fromIndexB < toIndexB && numOfNaN > 0) {
N.copy(b, fromIndexB, b, fromIndex, toIndexB - fromIndexB);
fromIndex += toIndexB - fromIndexB;
}
if (numOfNaN > 0) {
N.fill(b, fromIndex, fromIndex + numOfNaN, Float.NaN);
}
}
static void parallelSort(final double[] array) {
if (N.isNullOrEmpty(array)) {
return;
}
parallelSort(array, 0, array.length);
}
static void parallelSort(final double[] a, final int fromIndex, final int toIndex) {
N.checkFromToIndex(fromIndex, toIndex, a == null ? 0 : a.length);
if (N.isNullOrEmpty(a) || fromIndex == toIndex) {
return;
}
final int len = toIndex - fromIndex;
if (len < MIN_ARRAY_SORT_GRAN || CPU_CORES == 1) {
sort(a, fromIndex, toIndex);
return;
}
final Queue> subArrayIndexQueue = new LinkedList<>();
final AtomicInteger activeThreadNum = new AtomicInteger();
final Holder errorHolder = new Holder<>();
final int lenOfSubArray = len % CPU_CORES == 0 ? len / CPU_CORES : (len / CPU_CORES) + 1;
for (int i = 0; i < CPU_CORES; i++) {
final int start = fromIndex + i * lenOfSubArray;
final int end = toIndex - start < lenOfSubArray ? toIndex : start + lenOfSubArray;
subArrayIndexQueue.add(Pair.of(start, end));
activeThreadNum.incrementAndGet();
parallelSortExecutor.execute(new Try.Runnable() {
@Override
public void run() {
try {
if (errorHolder.value() != null) {
return;
}
Arrays.sort(a, start, end);
} catch (Exception e) {
setError(errorHolder, e);
} finally {
activeThreadNum.decrementAndGet();
}
}
});
}
while (activeThreadNum.get() > 0) {
N.sleep(1);
}
if (errorHolder.value() != null) {
throw N.toRuntimeException(errorHolder.value());
}
while (subArrayIndexQueue.size() > 1 && errorHolder.value() == null) {
for (int i = 0, size = subArrayIndexQueue.size(); i < size;) {
final Pair pairA = subArrayIndexQueue.poll();
if (++i == size) {
subArrayIndexQueue.add(pairA);
} else {
i++;
final Pair pairB = subArrayIndexQueue.poll();
subArrayIndexQueue.offer(Pair.of(pairA.left, pairB.right));
activeThreadNum.incrementAndGet();
parallelSortExecutor.execute(new Try.Runnable() {
@Override
public void run() {
try {
if (errorHolder.value() != null) {
return;
}
merge(N.copyOfRange(a, pairA.left, pairA.right), 0, pairA.right - pairA.left, a, pairB.left, pairB.right, pairA.left);
} catch (Exception e) {
setError(errorHolder, e);
} finally {
activeThreadNum.decrementAndGet();
}
}
});
}
}
while (activeThreadNum.get() > 0) {
N.sleep(1);
}
if (errorHolder.value() != null) {
throw N.toRuntimeException(errorHolder.value());
}
}
if (errorHolder.value() != null) {
throw N.toRuntimeException(errorHolder.value());
}
}
static void merge(final double[] a, int fromIndexA, int toIndexA, final double[] b, int fromIndexB, int toIndexB, int fromIndex) {
int numOfNaN = 0;
for (int i = toIndexA - 1; i >= fromIndexA && Double.isNaN(a[i]); i--) {
toIndexA--;
numOfNaN++;
}
for (int i = toIndexB - 1; i >= fromIndexB && Double.isNaN(b[i]); i--) {
toIndexB--;
numOfNaN++;
}
while (fromIndexA < toIndexA && fromIndexB < toIndexB) {
if (Double.compare(a[fromIndexA], b[fromIndexB]) <= 0) {
b[fromIndex++] = a[fromIndexA++];
} else {
b[fromIndex++] = b[fromIndexB++];
}
}
if (fromIndexA < toIndexA) {
N.copy(a, fromIndexA, b, fromIndex, toIndexA - fromIndexA);
fromIndex += toIndexA - fromIndexA;
} else if (fromIndexB < toIndexB && numOfNaN > 0) {
N.copy(b, fromIndexB, b, fromIndex, toIndexB - fromIndexB);
fromIndex += toIndexB - fromIndexB;
}
if (numOfNaN > 0) {
N.fill(b, fromIndex, fromIndex + numOfNaN, Double.NaN);
}
}
static void parallelSort(final Object[] a) {
if (N.isNullOrEmpty(a)) {
return;
}
parallelSort(a, 0, a.length);
}
static void parallelSort(final Object[] a, final int fromIndex, final int toIndex) {
parallelSort(a, fromIndex, toIndex, Comparators.NATURAL_ORDER);
}
static void parallelSort(final T[] a, final Comparator cmp) {
if (N.isNullOrEmpty(a)) {
return;
}
parallelSort(a, 0, a.length, cmp);
}
static void parallelSort(final T[] a, final int fromIndex, final int toIndex, Comparator cmp) {
N.checkFromToIndex(fromIndex, toIndex, a == null ? 0 : a.length);
if (N.isNullOrEmpty(a) || fromIndex == toIndex) {
return;
}
final Comparator comparator = cmp == null ? Comparators.NATURAL_ORDER : cmp;
final int len = toIndex - fromIndex;
if (len < MIN_ARRAY_SORT_GRAN || CPU_CORES == 1) {
sort(a, fromIndex, toIndex, comparator);
return;
}
final Queue> subArrayIndexQueue = new LinkedList<>();
final AtomicInteger activeThreadNum = new AtomicInteger();
final Holder errorHolder = new Holder<>();
final int lenOfSubArray = len % CPU_CORES == 0 ? len / CPU_CORES : (len / CPU_CORES) + 1;
for (int i = 0; i < CPU_CORES; i++) {
final int start = fromIndex + i * lenOfSubArray;
final int end = toIndex - start < lenOfSubArray ? toIndex : start + lenOfSubArray;
subArrayIndexQueue.add(Pair.of(start, end));
activeThreadNum.incrementAndGet();
parallelSortExecutor.execute(new Try.Runnable() {
@Override
public void run() {
try {
if (errorHolder.value() != null) {
return;
}
Arrays.sort(a, start, end, comparator);
} catch (Exception e) {
setError(errorHolder, e);
} finally {
activeThreadNum.decrementAndGet();
}
}
});
}
while (activeThreadNum.get() > 0) {
N.sleep(1);
}
if (errorHolder.value() != null) {
throw N.toRuntimeException(errorHolder.value());
}
while (subArrayIndexQueue.size() > 1 && errorHolder.value() == null) {
for (int i = 0, size = subArrayIndexQueue.size(); i < size;) {
final Pair pairA = subArrayIndexQueue.poll();
if (++i == size) {
subArrayIndexQueue.add(pairA);
} else {
i++;
final Pair pairB = subArrayIndexQueue.poll();
subArrayIndexQueue.offer(Pair.of(pairA.left, pairB.right));
activeThreadNum.incrementAndGet();
parallelSortExecutor.execute(new Try.Runnable() {
@Override
public void run() {
try {
if (errorHolder.value() != null) {
return;
}
merge(N.copyOfRange(a, pairA.left, pairA.right), 0, pairA.right - pairA.left, a, pairB.left, pairB.right, pairA.left,
comparator);
} catch (Exception e) {
setError(errorHolder, e);
} finally {
activeThreadNum.decrementAndGet();
}
}
});
}
}
while (activeThreadNum.get() > 0) {
N.sleep(1);
}
if (errorHolder.value() != null) {
throw N.toRuntimeException(errorHolder.value());
}
}
if (errorHolder.value() != null) {
throw N.toRuntimeException(errorHolder.value());
}
}
static void merge(final T[] a, int fromIndexA, int toIndexA, final T[] b, int fromIndexB, int toIndexB, int fromIndex, Comparator cmp) {
while (fromIndexA < toIndexA && fromIndexB < toIndexB) {
if (cmp.compare(a[fromIndexA], b[fromIndexB]) <= 0) {
b[fromIndex++] = a[fromIndexA++];
} else {
b[fromIndex++] = b[fromIndexB++];
}
}
if (fromIndexA < toIndexA) {
N.copy(a, fromIndexA, b, fromIndex, toIndexA - fromIndexA);
fromIndex += toIndexA - fromIndexA;
}
}
static > void parallelSort(final List c) {
if (N.isNullOrEmpty(c)) {
return;
}
parallelSort(c, 0, c.size());
}
static > void parallelSort(final List c, final int fromIndex, final int toIndex) {
parallelSort(c, fromIndex, toIndex, Comparators.NATURAL_ORDER);
}
static void parallelSort(final List list, final Comparator cmp) {
if (N.isNullOrEmpty(list)) {
return;
}
parallelSort(list, 0, list.size(), cmp);
}
@SuppressWarnings("rawtypes")
static void parallelSort(final List c, final int fromIndex, final int toIndex, final Comparator cmp) {
if ((N.isNullOrEmpty(c) && fromIndex == 0 && toIndex == 0) || fromIndex == toIndex) {
return;
}
if (N.isListElementDataFieldGettable && N.listElementDataField != null && c instanceof ArrayList) {
T[] array = null;
try {
array = (T[]) N.listElementDataField.get(c);
} catch (Throwable e) {
// ignore;
N.isListElementDataFieldGettable = false;
}
if (array != null) {
parallelSort(array, fromIndex, toIndex, cmp);
return;
}
}
final T[] array = (T[]) c.toArray();
parallelSort(array, fromIndex, toIndex, cmp);
final ListIterator it = (ListIterator) c.listIterator();
for (int i = 0, len = array.length; i < len; i++) {
it.next();
it.set(array[i]);
}
}
static void bucketSort(final int[] a) {
if (N.isNullOrEmpty(a)) {
return;
}
bucketSort(a, 0, a.length);
}
static void bucketSort(final int[] a, final int fromIndex, final int toIndex) {
N.checkFromToIndex(fromIndex, toIndex, a == null ? 0 : a.length);
if (N.isNullOrEmpty(a) || fromIndex == toIndex) {
return;
}
if (toIndex - fromIndex < 32) {
sort(a, fromIndex, toIndex);
return;
}
final Multiset multiset = new Multiset<>();
for (int i = fromIndex; i < toIndex; i++) {
multiset.add(a[i]);
}
final Map m = multiset.toMapSortedBy(new Comparator>() {
@Override
public int compare(Entry a, Entry b) {
return N.compare(a.getKey().intValue(), a.getKey().intValue());
}
});
int idx = fromIndex;
for (Map.Entry entry : m.entrySet()) {
N.fill(a, idx, idx + entry.getValue(), entry.getKey());
idx += entry.getValue();
}
}
static void bucketSort(final long[] a) {
if (N.isNullOrEmpty(a)) {
return;
}
bucketSort(a, 0, a.length);
}
static void bucketSort(final long[] a, final int fromIndex, final int toIndex) {
N.checkFromToIndex(fromIndex, toIndex, a == null ? 0 : a.length);
if (N.isNullOrEmpty(a) || fromIndex == toIndex) {
return;
}
if (toIndex - fromIndex < 32) {
sort(a, fromIndex, toIndex);
return;
}
final Multiset multiset = new Multiset<>();
for (int i = fromIndex; i < toIndex; i++) {
multiset.add(a[i]);
}
final Map m = multiset.toMapSortedBy(new Comparator>() {
@Override
public int compare(Entry a, Entry b) {
return N.compare(a.getKey().longValue(), a.getKey().longValue());
}
});
int idx = fromIndex;
for (Map.Entry entry : m.entrySet()) {
N.fill(a, idx, idx + entry.getValue(), entry.getKey());
idx += entry.getValue();
}
}
static void bucketSort(final float[] a) {
if (N.isNullOrEmpty(a)) {
return;
}
bucketSort(a, 0, a.length);
}
static void bucketSort(final float[] a, final int fromIndex, final int toIndex) {
N.checkFromToIndex(fromIndex, toIndex, a == null ? 0 : a.length);
if (N.isNullOrEmpty(a) || fromIndex == toIndex) {
return;
}
if (toIndex - fromIndex < 32) {
sort(a, fromIndex, toIndex);
return;
}
final Multiset multiset = new Multiset<>();
for (int i = fromIndex; i < toIndex; i++) {
multiset.add(a[i]);
}
final Map m = multiset.toMapSortedBy(new Comparator>() {
@Override
public int compare(Entry a, Entry b) {
return N.compare(a.getKey().floatValue(), a.getKey().floatValue());
}
});
int idx = fromIndex;
for (Map.Entry entry : m.entrySet()) {
N.fill(a, idx, idx + entry.getValue(), entry.getKey());
idx += entry.getValue();
}
}
static void bucketSort(final double[] a) {
if (N.isNullOrEmpty(a)) {
return;
}
bucketSort(a, 0, a.length);
}
static void bucketSort(final double[] a, final int fromIndex, final int toIndex) {
N.checkFromToIndex(fromIndex, toIndex, a == null ? 0 : a.length);
if (N.isNullOrEmpty(a) || fromIndex == toIndex) {
return;
}
if (toIndex - fromIndex < 32) {
sort(a, fromIndex, toIndex);
return;
}
final Multiset multiset = new Multiset<>();
for (int i = fromIndex; i < toIndex; i++) {
multiset.add(a[i]);
}
final Map m = multiset.toMapSortedBy(new Comparator>() {
@Override
public int compare(Entry a, Entry b) {
return N.compare(a.getKey().doubleValue(), a.getKey().doubleValue());
}
});
int idx = fromIndex;
for (Map.Entry entry : m.entrySet()) {
N.fill(a, idx, idx + entry.getValue(), entry.getKey());
idx += entry.getValue();
}
}
/**
* Note: All the objects with same value will be replaced with first element with the same value.
*
* @param a
*/
static void bucketSort(final Object[] a) {
if (N.isNullOrEmpty(a)) {
return;
}
bucketSort(a, 0, a.length);
}
/**
* Note: All the objects with same value will be replaced with first element with the same value.
*
* @param a the elements in the array must implements the Comparable interface.
* @param fromIndex
* @param toIndex
*/
static void bucketSort(final Object[] a, final int fromIndex, final int toIndex) {
bucketSort(a, fromIndex, toIndex, null);
}
static void bucketSort(final T[] a, final Comparator cmp) {
if (N.isNullOrEmpty(a)) {
return;
}
bucketSort(a, 0, a.length, cmp);
}
/**
* Note: All the objects with same value will be replaced with first element with the same value.
*
* @param a
* @param fromIndex
* @param toIndex
* @param cmp
*/
static void bucketSort(final T[] a, final int fromIndex, final int toIndex, final Comparator cmp) {
N.checkFromToIndex(fromIndex, toIndex, a == null ? 0 : a.length);
if (N.isNullOrEmpty(a) || fromIndex == toIndex) {
return;
}
if (toIndex - fromIndex < 32) {
sort(a, fromIndex, toIndex, cmp);
return;
}
final Comparator comparator = cmp == null ? Comparators.NATURAL_ORDER : cmp;
final Multiset multiset = new Multiset<>();
for (int i = fromIndex; i < toIndex; i++) {
multiset.add(a[i]);
}
final Map m = multiset.toMapSortedBy(new Comparator>() {
@Override
public int compare(Entry a, Entry b) {
return comparator.compare(a.getKey(), a.getKey());
}
});
int idx = fromIndex;
for (Map.Entry entry : m.entrySet()) {
N.fill(a, idx, idx + entry.getValue(), entry.getKey());
idx += entry.getValue();
}
}
/**
* Note: All the objects with same value will be replaced with first element with the same value.
*
* @param c
*/
static > void bucketSort(final List c) {
if (N.isNullOrEmpty(c)) {
return;
}
bucketSort(c, 0, c.size());
}
/**
* Note: All the objects with same value will be replaced with first element with the same value.
*
* @param c
* @param fromIndex
* @param toIndex
*/
static > void bucketSort(final List c, final int fromIndex, final int toIndex) {
bucketSort(c, fromIndex, toIndex, null);
}
/**
* Note: All the objects with same value will be replaced with first element with the same value.
*
* @param c
* @param cmp
*/
static void bucketSort(final List c, final Comparator cmp) {
if (N.isNullOrEmpty(c)) {
return;
}
bucketSort(c, 0, c.size(), cmp);
}
/**
* Note: All the objects with same value will be replaced with first element with the same value.
*
* @param c
* @param fromIndex
* @param toIndex
* @param cmp
*/
static void bucketSort(final List c, final int fromIndex, final int toIndex, final Comparator cmp) {
N.checkFromToIndex(fromIndex, toIndex, c == null ? 0 : c.size());
if ((N.isNullOrEmpty(c) && fromIndex == 0 && toIndex == 0) || fromIndex == toIndex) {
return;
}
if (toIndex - fromIndex < 32) {
sort(c, fromIndex, toIndex, cmp);
return;
}
final Comparator comparator = cmp == null ? Comparators.NATURAL_ORDER : cmp;
final Multiset multiset = new Multiset<>();
ListIterator itr = (ListIterator) c.listIterator(fromIndex);
int i = fromIndex;
while (itr.hasNext()) {
if (i++ >= toIndex) {
break;
}
multiset.add(itr.next());
}
final Map m = multiset.toMapSortedBy(new Comparator>() {
@Override
public int compare(Entry a, Entry b) {
return comparator.compare(a.getKey(), a.getKey());
}
});
itr = (ListIterator) c.listIterator(fromIndex);
for (Map.Entry entry : m.entrySet()) {
final T key = entry.getKey();
for (int j = 0; j < entry.getValue(); j++) {
itr.next();
itr.set(key);
}
}
}
/**
* {@link Arrays#binarySearch(boolean[], boolean)}
*
* @param a
* @param key
* @return
*/
static int binarySearch(final boolean[] a, final boolean key) {
if (N.isNullOrEmpty(a)) {
return N.INDEX_NOT_FOUND;
}
if (a[0] == key) {
return 0;
} else if (a[a.length - 1] != key) {
return N.INDEX_NOT_FOUND;
}
int left = 0, right = a.length - 1;
while (left < right) {
int mid = left + (right - left) / 2;
if (a[mid] == key) {
right = mid;
} else {
left = mid + 1;
}
}
return left;
}
/**
* {@link Arrays#binarySearch(char[], char)}
*
* @param a
* @param key
* @return
*/
static int binarySearch(final char[] a, final char key) {
if (N.isNullOrEmpty(a)) {
return N.INDEX_NOT_FOUND;
}
return Arrays.binarySearch(a, key);
}
/**
* {@link Arrays#binarySearch(char[], int, int, char)}
*
* @param a
* @param fromIndex
* @param toIndex
* @param key
* @return
*/
static int binarySearch(final char[] a, final int fromIndex, final int toIndex, final char key) {
if (N.isNullOrEmpty(a)) {
return N.INDEX_NOT_FOUND;
}
return Arrays.binarySearch(a, fromIndex, toIndex, key);
}
/**
* {@link Arrays#binarySearch(byte[], byte)}
*
* @param a
* @param key
* @return
*/
static int binarySearch(final byte[] a, final byte key) {
if (N.isNullOrEmpty(a)) {
return N.INDEX_NOT_FOUND;
}
return Arrays.binarySearch(a, key);
}
/**
* {@link Arrays#binarySearch(byte[], int, int, byte)}
*
* @param a
* @param fromIndex
* @param toIndex
* @param key
* @return
*/
static int binarySearch(final byte[] a, final int fromIndex, final int toIndex, final byte key) {
if (N.isNullOrEmpty(a)) {
return N.INDEX_NOT_FOUND;
}
return Arrays.binarySearch(a, fromIndex, toIndex, key);
}
/**
* {@link Arrays#binarySearch(short[], short)}
*
* @param a
* @param key
* @return
*/
static int binarySearch(final short[] a, final short key) {
if (N.isNullOrEmpty(a)) {
return N.INDEX_NOT_FOUND;
}
return Arrays.binarySearch(a, key);
}
/**
* {@link Arrays#binarySearch(short[], int, int, short)}
*
* @param a
* @param fromIndex
* @param toIndex
* @param key
* @return
*/
static int binarySearch(final short[] a, final int fromIndex, final int toIndex, final short key) {
if (N.isNullOrEmpty(a)) {
return N.INDEX_NOT_FOUND;
}
return Arrays.binarySearch(a, fromIndex, toIndex, key);
}
/**
* {@link Arrays#binarySearch(int[], int)}
*
* @param a
* @param key
* @return
*/
static int binarySearch(final int[] a, final int key) {
if (N.isNullOrEmpty(a)) {
return N.INDEX_NOT_FOUND;
}
return Arrays.binarySearch(a, key);
}
/**
* {@link Arrays#binarySearch(int[], int, int, int)}
*
* @param a
* @param fromIndex
* @param toIndex
* @param key
* @return
*/
static int binarySearch(final int[] a, final int fromIndex, final int toIndex, final int key) {
if (N.isNullOrEmpty(a)) {
return N.INDEX_NOT_FOUND;
}
return Arrays.binarySearch(a, fromIndex, toIndex, key);
}
/**
* {@link Arrays#binarySearch(long[], long)}
*
* @param a
* @param key
* @return
*/
static int binarySearch(final long[] a, final long key) {
if (N.isNullOrEmpty(a)) {
return N.INDEX_NOT_FOUND;
}
return Arrays.binarySearch(a, key);
}
/**
* {@link Arrays#binarySearch(long[], int, int, long)}
*
* @param a
* @param fromIndex
* @param toIndex
* @param key
* @return
*/
static int binarySearch(final long[] a, final int fromIndex, final int toIndex, final long key) {
if (N.isNullOrEmpty(a)) {
return N.INDEX_NOT_FOUND;
}
return Arrays.binarySearch(a, fromIndex, toIndex, key);
}
/**
* {@link Arrays#binarySearch(float[], float)}
*
* @param a
* @param key
* @return
*/
static int binarySearch(final float[] a, final float key) {
if (N.isNullOrEmpty(a)) {
return N.INDEX_NOT_FOUND;
}
return Arrays.binarySearch(a, key);
}
/**
* {@link Arrays#binarySearch(float[], int, int, float)}
*
* @param a
* @param fromIndex
* @param toIndex
* @param key
* @return
*/
static int binarySearch(final float[] a, final int fromIndex, final int toIndex, final float key) {
if (N.isNullOrEmpty(a)) {
return N.INDEX_NOT_FOUND;
}
return Arrays.binarySearch(a, fromIndex, toIndex, key);
}
/**
* {@link Arrays#binarySearch(double[], double)}
*
* @param a
* @param key
* @return
*/
static int binarySearch(final double[] a, final double key) {
if (N.isNullOrEmpty(a)) {
return N.INDEX_NOT_FOUND;
}
return Arrays.binarySearch(a, key);
}
/**
* {@link Arrays#binarySearch(double[], int, int, double)}
*
* @param a
* @param fromIndex
* @param toIndex
* @param key
* @return
*/
static int binarySearch(final double[] a, final int fromIndex, final int toIndex, final double key) {
if (N.isNullOrEmpty(a)) {
return N.INDEX_NOT_FOUND;
}
return Arrays.binarySearch(a, fromIndex, toIndex, key);
}
/**
* {@link Arrays#binarySearch(Object[], Object)}
*
* @param a
* @param key
* @return
*/
static int binarySearch(final Object[] a, final Object key) {
if (N.isNullOrEmpty(a)) {
return N.INDEX_NOT_FOUND;
}
return Arrays.binarySearch(a, key);
}
/**
* {@link Arrays#binarySearch(Object[], int, int, Object)}
*
* @param a
* @param fromIndex
* @param toIndex
* @param key
* @return
*/
static int binarySearch(final Object[] a, final int fromIndex, final int toIndex, final Object key) {
if (N.isNullOrEmpty(a)) {
return N.INDEX_NOT_FOUND;
}
return Arrays.binarySearch(a, fromIndex, toIndex, key);
}
/**
* {@link Arrays#binarySearch(Object[], Object, Comparator)}
*
* @param a
* @param key
* @param cmp
* @return
*/
static int binarySearch(final T[] a, final T key, final Comparator cmp) {
if (N.isNullOrEmpty(a)) {
return N.INDEX_NOT_FOUND;
}
return Arrays.binarySearch(a, key, cmp == null ? Comparators.NATURAL_ORDER : cmp);
}
/**
* {@link Arrays#binarySearch(Object[], int, int, Object, Comparator)}
*
* @param a
* @param fromIndex
* @param toIndex
* @param key
* @param c
* @return
*/
static int binarySearch(final T[] a, final int fromIndex, final int toIndex, final T key, final Comparator cmp) {
if (N.isNullOrEmpty(a)) {
return N.INDEX_NOT_FOUND;
}
return Arrays.binarySearch(a, key, cmp == null ? Comparators.NATURAL_ORDER : cmp);
}
/**
* {@link Collections#binarySearch(List, Object)}
*
* @param list
* @param key
* @return
*/
static > int binarySearch(final List list, final T key) {
if (N.isNullOrEmpty(list)) {
return N.INDEX_NOT_FOUND;
}
return binarySearch(list, 0, list.size(), key);
}
static > int binarySearch(final List list, final int fromIndex, final int toIndex, final T key) {
if (N.isNullOrEmpty(list)) {
return N.INDEX_NOT_FOUND;
}
return binarySearch(list, fromIndex, toIndex, key, Comparators.NATURAL_ORDER);
}
static int binarySearch(final List list, final T key, final Comparator cmp) {
if (N.isNullOrEmpty(list)) {
return N.INDEX_NOT_FOUND;
}
return binarySearch(list, 0, list.size(), key, cmp);
}
/**
*
* @param list
* @param key
* @param fromIndex
* @param toIndex
* @param cmp
* @return
* @see Collections#binarySearch(List, Object, Comparator)
*/
static int binarySearch(final List list, final int fromIndex, final int toIndex, final T key, final Comparator cmp) {
if (N.isNullOrEmpty(list)) {
return N.INDEX_NOT_FOUND;
}
if (N.isListElementDataFieldGettable && N.listElementDataField != null && list instanceof ArrayList) {
T[] array = null;
try {
array = (T[]) N.listElementDataField.get(list);
} catch (Throwable e) {
// ignore;
N.isListElementDataFieldGettable = false;
}
if (array != null) {
return binarySearch(array, fromIndex, toIndex, key, cmp == null ? Comparators.NATURAL_ORDER : cmp);
}
}
if (list instanceof RandomAccess || list.size() < BINARYSEARCH_THRESHOLD) {
return indexedBinarySearch(list, fromIndex, toIndex, key, cmp == null ? Comparators.NATURAL_ORDER : cmp);
} else {
return iteratorBinarySearch(list, fromIndex, toIndex, key, cmp == null ? Comparators.NATURAL_ORDER : cmp);
}
}
private static int indexedBinarySearch(final List l, final int fromIndex, final int toIndex, final T key,
final Comparator cmp) {
int low = fromIndex;
int high = toIndex - 1;
while (low <= high) {
int mid = (low + high) >>> 1;
T midVal = l.get(mid);
int res = cmp.compare(midVal, key);
if (res < 0) {
low = mid + 1;
} else if (res > 0) {
high = mid - 1;
} else {
return mid; // key found
}
}
return N.INDEX_NOT_FOUND; // key not found
}
private static int iteratorBinarySearch(final List l, final int fromIndex, final int toIndex, final T key,
final Comparator cmp) {
int low = fromIndex;
int high = toIndex - 1;
ListIterator iterator = l.listIterator();
while (low <= high) {
int mid = (low + high) >>> 1;
T midVal = get(iterator, mid);
int res = cmp.compare(midVal, key);
if (res < 0) {
low = mid + 1;
} else if (res > 0) {
high = mid - 1;
} else {
return mid; // key found
}
}
return N.INDEX_NOT_FOUND; // key not found
}
/**
* Gets the ith element from the given list by repositioning the specified
* list listIterator.
*/
private static T get(final ListIterator iterator, final int index) {
T obj = null;
int pos = iterator.nextIndex();
if (pos <= index) {
do {
obj = iterator.next();
} while (pos++ < index);
} else {
do {
obj = iterator.previous();
} while (--pos > index);
}
return obj;
}
static char kthLargest(final char[] a, int k) {
return kthLargest(a, 0, a.length, k);
}
static char kthLargest(final char[] a, final int fromIndex, final int toIndex, int k) {
N.checkFromToIndex(fromIndex, toIndex, a == null ? 0 : a.length);
N.checkArgument(k > 0 && k <= toIndex - fromIndex, "'k' (%s) is out of range %s", k, toIndex - fromIndex);
final int len = toIndex - fromIndex;
if (k == 1) {
return N.max(a, fromIndex, toIndex);
} else if (k == len) {
return N.min(a, fromIndex, toIndex);
}
Queue queue = null;
if (k <= len / 2) {
queue = new PriorityQueue<>(k);
for (int i = fromIndex; i < toIndex; i++) {
if (queue.size() < k) {
queue.add(a[i]);
} else {
if (a[i] > queue.peek().charValue()) {
queue.remove();
queue.add(a[i]);
}
}
}
} else {
k = len - k + 1;
queue = new PriorityQueue<>(k, new Comparator() {
@Override
public int compare(final Character o1, final Character o2) {
return o2.compareTo(o1);
}
});
for (int i = fromIndex; i < toIndex; i++) {
if (queue.size() < k) {
queue.add(a[i]);
} else {
if (a[i] < queue.peek().charValue()) {
queue.remove();
queue.add(a[i]);
}
}
}
}
return queue.peek();
}
static byte kthLargest(final byte[] a, int k) {
return kthLargest(a, 0, a.length, k);
}
static byte kthLargest(final byte[] a, final int fromIndex, final int toIndex, int k) {
N.checkFromToIndex(fromIndex, toIndex, a == null ? 0 : a.length);
N.checkArgument(k > 0 && k <= toIndex - fromIndex, "'k' (%s) is out of range %s", k, toIndex - fromIndex);
final int len = toIndex - fromIndex;
if (k == 1) {
return N.max(a, fromIndex, toIndex);
} else if (k == len) {
return N.min(a, fromIndex, toIndex);
}
Queue queue = null;
if (k <= len / 2) {
queue = new PriorityQueue<>(k);
for (int i = fromIndex; i < toIndex; i++) {
if (queue.size() < k) {
queue.add(a[i]);
} else {
if (a[i] > queue.peek().byteValue()) {
queue.remove();
queue.add(a[i]);
}
}
}
} else {
k = len - k + 1;
queue = new PriorityQueue<>(k, new Comparator() {
@Override
public int compare(final Byte o1, final Byte o2) {
return o2.compareTo(o1);
}
});
for (int i = fromIndex; i < toIndex; i++) {
if (queue.size() < k) {
queue.add(a[i]);
} else {
if (a[i] < queue.peek().byteValue()) {
queue.remove();
queue.add(a[i]);
}
}
}
}
return queue.peek();
}
static short kthLargest(final short[] a, int k) {
return kthLargest(a, 0, a.length, k);
}
static short kthLargest(final short[] a, final int fromIndex, final int toIndex, int k) {
N.checkFromToIndex(fromIndex, toIndex, a == null ? 0 : a.length);
N.checkArgument(k > 0 && k <= toIndex - fromIndex, "'k' (%s) is out of range %s", k, toIndex - fromIndex);
final int len = toIndex - fromIndex;
if (k == 1) {
return N.max(a, fromIndex, toIndex);
} else if (k == len) {
return N.min(a, fromIndex, toIndex);
}
Queue queue = null;
if (k <= len / 2) {
queue = new PriorityQueue<>(k);
for (int i = fromIndex; i < toIndex; i++) {
if (queue.size() < k) {
queue.add(a[i]);
} else {
if (a[i] > queue.peek().shortValue()) {
queue.remove();
queue.add(a[i]);
}
}
}
} else {
k = len - k + 1;
queue = new PriorityQueue<>(k, new Comparator() {
@Override
public int compare(final Short o1, final Short o2) {
return o2.compareTo(o1);
}
});
for (int i = fromIndex; i < toIndex; i++) {
if (queue.size() < k) {
queue.add(a[i]);
} else {
if (a[i] < queue.peek().shortValue()) {
queue.remove();
queue.add(a[i]);
}
}
}
}
return queue.peek();
}
static int kthLargest(final int[] a, int k) {
return kthLargest(a, 0, a.length, k);
}
static int kthLargest(final int[] a, final int fromIndex, final int toIndex, int k) {
N.checkFromToIndex(fromIndex, toIndex, a == null ? 0 : a.length);
N.checkArgument(k > 0 && k <= toIndex - fromIndex, "'k' (%s) is out of range %s", k, toIndex - fromIndex);
final int len = toIndex - fromIndex;
if (k == 1) {
return N.max(a, fromIndex, toIndex);
} else if (k == len) {
return N.min(a, fromIndex, toIndex);
}
Queue queue = null;
if (k <= len / 2) {
queue = new PriorityQueue<>(k);
for (int i = fromIndex; i < toIndex; i++) {
if (queue.size() < k) {
queue.add(a[i]);
} else {
if (a[i] > queue.peek().intValue()) {
queue.remove();
queue.add(a[i]);
}
}
}
} else {
k = len - k + 1;
queue = new PriorityQueue<>(k, new Comparator() {
@Override
public int compare(final Integer o1, final Integer o2) {
return o2.compareTo(o1);
}
});
for (int i = fromIndex; i < toIndex; i++) {
if (queue.size() < k) {
queue.add(a[i]);
} else {
if (a[i] < queue.peek().intValue()) {
queue.remove();
queue.add(a[i]);
}
}
}
}
return queue.peek();
}
static long kthLargest(final long[] a, int k) {
return kthLargest(a, 0, a.length, k);
}
static long kthLargest(final long[] a, final int fromIndex, final int toIndex, int k) {
N.checkFromToIndex(fromIndex, toIndex, a == null ? 0 : a.length);
N.checkArgument(k > 0 && k <= toIndex - fromIndex, "'k' (%s) is out of range %s", k, toIndex - fromIndex);
final int len = toIndex - fromIndex;
if (k == 1) {
return N.max(a, fromIndex, toIndex);
} else if (k == len) {
return N.min(a, fromIndex, toIndex);
}
Queue queue = null;
if (k <= len / 2) {
queue = new PriorityQueue<>(k);
for (int i = fromIndex; i < toIndex; i++) {
if (queue.size() < k) {
queue.add(a[i]);
} else {
if (a[i] > queue.peek().longValue()) {
queue.remove();
queue.add(a[i]);
}
}
}
} else {
k = len - k + 1;
queue = new PriorityQueue<>(k, new Comparator() {
@Override
public int compare(final Long o1, final Long o2) {
return o2.compareTo(o1);
}
});
for (int i = fromIndex; i < toIndex; i++) {
if (queue.size() < k) {
queue.add(a[i]);
} else {
if (a[i] < queue.peek().longValue()) {
queue.remove();
queue.add(a[i]);
}
}
}
}
return queue.peek();
}
static float kthLargest(final float[] a, int k) {
return kthLargest(a, 0, a.length, k);
}
static float kthLargest(final float[] a, final int fromIndex, final int toIndex, int k) {
N.checkFromToIndex(fromIndex, toIndex, a == null ? 0 : a.length);
N.checkArgument(k > 0 && k <= toIndex - fromIndex, "'k' (%s) is out of range %s", k, toIndex - fromIndex);
final int len = toIndex - fromIndex;
if (k == 1) {
return N.max(a, fromIndex, toIndex);
} else if (k == len) {
return N.min(a, fromIndex, toIndex);
}
Queue queue = null;
if (k <= len / 2) {
queue = new PriorityQueue<>(k);
for (int i = fromIndex; i < toIndex; i++) {
if (queue.size() < k) {
queue.add(a[i]);
} else {
if (Float.compare(a[i], queue.peek().floatValue()) > 0) {
queue.remove();
queue.add(a[i]);
}
}
}
} else {
k = len - k + 1;
queue = new PriorityQueue<>(k, new Comparator() {
@Override
public int compare(final Float o1, final Float o2) {
return o2.compareTo(o1);
}
});
for (int i = fromIndex; i < toIndex; i++) {
if (queue.size() < k) {
queue.add(a[i]);
} else {
if (Float.compare(a[i], queue.peek().floatValue()) < 0) {
queue.remove();
queue.add(a[i]);
}
}
}
}
return queue.peek();
}
static double kthLargest(final double[] a, int k) {
return kthLargest(a, 0, a.length, k);
}
static double kthLargest(final double[] a, final int fromIndex, final int toIndex, int k) {
N.checkFromToIndex(fromIndex, toIndex, a == null ? 0 : a.length);
N.checkArgument(k > 0 && k <= toIndex - fromIndex, "'k' (%s) is out of range %s", k, toIndex - fromIndex);
final int len = toIndex - fromIndex;
if (k == 1) {
return N.max(a, fromIndex, toIndex);
} else if (k == len) {
return N.min(a, fromIndex, toIndex);
}
Queue queue = null;
if (k <= len / 2) {
queue = new PriorityQueue<>(k);
for (int i = fromIndex; i < toIndex; i++) {
if (queue.size() < k) {
queue.add(a[i]);
} else {
if (Double.compare(a[i], queue.peek().doubleValue()) > 0) {
queue.remove();
queue.add(a[i]);
}
}
}
} else {
k = len - k + 1;
queue = new PriorityQueue<>(k, new Comparator() {
@Override
public int compare(final Double o1, final Double o2) {
return o2.compareTo(o1);
}
});
for (int i = fromIndex; i < toIndex; i++) {
if (queue.size() < k) {
queue.add(a[i]);
} else {
if (Double.compare(a[i], queue.peek().doubleValue()) < 0) {
queue.remove();
queue.add(a[i]);
}
}
}
}
return queue.peek();
}
static > T kthLargest(final T[] a, int k) {
return kthLargest(a, 0, a.length, k);
}
static > T kthLargest(final T[] a, final int fromIndex, final int toIndex, int k) {
return (T) kthLargest(a, fromIndex, toIndex, k, Comparators.NATURAL_ORDER);
}
static T kthLargest(final T[] a, int k, final Comparator cmp) {
return kthLargest(a, 0, a.length, k, cmp);
}
static T kthLargest(final T[] a, final int fromIndex, final int toIndex, int k, final Comparator cmp) {
N.checkFromToIndex(fromIndex, toIndex, a == null ? 0 : a.length);
N.checkArgument(k > 0 && k <= toIndex - fromIndex, "'k' (%s) is out of range %s", k, toIndex - fromIndex);
final Comparator comparator = cmp == null ? Comparators.NATURAL_ORDER : cmp;
final int len = toIndex - fromIndex;
if (k == 1) {
return N.max(a, fromIndex, toIndex, comparator);
} else if (k == len) {
return N.min(a, fromIndex, toIndex, comparator);
}
Queue queue = null;
if (k <= len / 2) {
queue = new PriorityQueue<>(k, comparator);
for (int i = fromIndex; i < toIndex; i++) {
if (queue.size() < k) {
queue.add(a[i]);
} else {
if (comparator.compare(a[i], queue.peek()) > 0) {
queue.remove();
queue.add(a[i]);
}
}
}
} else {
k = len - k + 1;
queue = new PriorityQueue<>(k, new Comparator() {
@Override
public int compare(final T o1, final T o2) {
return comparator.compare(o2, o1);
}
});
for (int i = fromIndex; i < toIndex; i++) {
if (queue.size() < k) {
queue.add(a[i]);
} else {
if (comparator.compare(a[i], queue.peek()) < 0) {
queue.remove();
queue.add(a[i]);
}
}
}
}
return queue.peek();
}
static > T kthLargest(final Collection c, int k) {
return kthLargest(c, 0, c.size(), k);
}
static > T kthLargest(final Collection c, final int fromIndex, final int toIndex, int k) {
return (T) kthLargest(c, fromIndex, toIndex, k, Comparators.NATURAL_ORDER);
}
static T kthLargest(final Collection c, int k, final Comparator cmp) {
return kthLargest(c, 0, c.size(), k, cmp);
}
static T kthLargest(final Collection c, final int fromIndex, final int toIndex, int k, final Comparator cmp) {
N.checkFromToIndex(fromIndex, toIndex, c == null ? 0 : c.size());
N.checkArgument(k > 0 && k <= toIndex - fromIndex, "'k' (%s) is out of range %s", k, toIndex - fromIndex);
final Comparator comparator = cmp == null ? Comparators.NATURAL_ORDER : cmp;
final int len = toIndex - fromIndex;
if (k == 1) {
return N.max(c, fromIndex, toIndex, comparator);
} else if (k == len) {
return N.min(c, fromIndex, toIndex, comparator);
}
final Iterator iter = c.iterator();
Queue queue = null;
if (k <= len / 2) {
queue = new PriorityQueue<>(k);
int cursor = 0;
while (cursor < fromIndex && iter.hasNext()) {
cursor++;
iter.next();
}
T e = null;
while (cursor < toIndex && iter.hasNext()) {
e = iter.next();
if (queue.size() < k) {
queue.add(e);
} else {
if (comparator.compare(e, queue.peek()) > 0) {
queue.remove();
queue.add(e);
}
}
cursor++;
}
} else {
k = len - k + 1;
queue = new PriorityQueue<>(k, new Comparator() {
@Override
public int compare(final T o1, final T o2) {
return comparator.compare(o2, o1);
}
});
int cursor = 0;
while (cursor < fromIndex && iter.hasNext()) {
cursor++;
iter.next();
}
T e = null;
while (cursor < toIndex && iter.hasNext()) {
e = iter.next();
if (queue.size() < k) {
queue.add(e);
} else {
if (comparator.compare(e, queue.peek()) < 0) {
queue.remove();
queue.add(e);
}
}
cursor++;
}
}
return queue.peek();
}
static void setError(final Holder errorHolder, Throwable e) {
synchronized (errorHolder) {
if (errorHolder.value() == null) {
errorHolder.setValue(e);
} else {
errorHolder.value().addSuppressed(e);
}
}
}
// static double medianOfTwoSortedArrays(final int[] a, final int[] b) {
// final int n = a.length;
// final int m = b.length;
//
// if (n > m) {
// return medianOfTwoSortedArrays(b, a);
// }
//
// int k = (n + m - 1) / 2;
// int l = 0, r = Math.min(k, n);
// while (l < r) {
// int mid1 = (l + r) / 2;
// int mid2 = k - mid1;
//
// if (a[mid1] < b[mid2]) {
// l = mid1 + 1;
// } else {
// r = mid1;
// }
// }
//
// int num1 = Math.max(l - 1 >= 0 ? a[l - 1] : Integer.MIN_VALUE, k - l >= 0 ? b[k - l] : Integer.MIN_VALUE);
//
// if ((n + m) % 2 != 0) {
// return num1;
// }
//
// int num2 = Math.min(l < n ? a[l] : Integer.MAX_VALUE, k - l + 1 < m ? b[k - l + 1] : Integer.MAX_VALUE);
//
// return (num1 + num2) / (double) 2;
// }
//
// static int theKthNumberOfTwoSortedArrays(final int[] a, final int[] b, final int k) {
// final int n = a.length;
// final int m = b.length;
//
// if (n > m) {
// return theKthNumberOfTwoSortedArrays(b, a, k);
// }
//
// int l = 0, r = Math.min(k, n);
// while (l < r) {
// int mid1 = (l + r) / 2;
// int mid2 = k - mid1;
//
// if (a[mid1] < b[mid2]) {
// l = mid1 + 1;
// } else {
// r = mid1;
// }
// }
//
// return Math.max(l - 1 >= 0 ? a[l - 1] : Integer.MIN_VALUE, k - l >= 0 ? b[k - l] : Integer.MIN_VALUE);
// }
//
// static long theKthNumberOfTwoSortedArrays(final long[] a, final long[] b, final int k) {
// final int n = a.length;
// final int m = b.length;
//
// if (n > m) {
// return theKthNumberOfTwoSortedArrays(b, a, k);
// }
//
// int l = 0, r = Math.min(k, n);
// while (l < r) {
// int mid1 = (l + r) / 2;
// int mid2 = k - mid1;
//
// if (a[mid1] < b[mid2]) {
// l = mid1 + 1;
// } else {
// r = mid1;
// }
// }
//
// return Math.max(l - 1 >= 0 ? a[l - 1] : Integer.MIN_VALUE, k - l >= 0 ? b[k - l] : Integer.MIN_VALUE);
// }
//
// static float theKthNumberOfTwoSortedArrays(final float[] a, final float[] b, final int k) {
// final int n = a.length;
// final int m = b.length;
//
// if (n > m) {
// return theKthNumberOfTwoSortedArrays(b, a, k);
// }
//
// int l = 0, r = Math.min(k, n);
// while (l < r) {
// int mid1 = (l + r) / 2;
// int mid2 = k - mid1;
//
// if (a[mid1] < b[mid2]) {
// l = mid1 + 1;
// } else {
// r = mid1;
// }
// }
//
// return Math.max(l - 1 >= 0 ? a[l - 1] : Integer.MIN_VALUE, k - l >= 0 ? b[k - l] : Integer.MIN_VALUE);
// }
//
// static double theKthNumberOfTwoSortedArrays(final double[] a, final double[] b, final int k) {
// final int n = a.length;
// final int m = b.length;
//
// if (n > m) {
// return theKthNumberOfTwoSortedArrays(b, a, k);
// }
//
// int l = 0, r = Math.min(k, n);
// while (l < r) {
// int mid1 = (l + r) / 2;
// int mid2 = k - mid1;
//
// if (a[mid1] < b[mid2]) {
// l = mid1 + 1;
// } else {
// r = mid1;
// }
// }
//
// return Math.max(l - 1 >= 0 ? a[l - 1] : Integer.MIN_VALUE, k - l >= 0 ? b[k - l] : Integer.MIN_VALUE);
// }
//
// static Collection> permutationsOf(final Collection elements) {
// return Collections2.permutations(elements);
// }
//
// static > Collection> orderedPermutationsOf(final Collection elements) {
// return Collections2.orderedPermutations(elements);
// }
//
// static Collection> orderedPermutationsOf(final Collection elements, final Comparator comparator) {
// return Collections2.orderedPermutations(elements, comparator);
// }
//
// private static final String[] tens = { "", "Ten", "Twenty", "Thirty", "Forty", "Fifty", "Sixty", "Seventy", "Eighty", "Ninety" };
// private static final String[] lessThan20 = { "", "One", "Two", "Three", "Four", "Five", "Six", "Seven", "Eight", "Nine", "Ten", "Eleven", "Twelve",
// "Thirteen", "Fourteen", "Fifteen", "Sixteen", "Seventeen", "Eighteen", "Nineteen" };
// private static final String[] thousands = { "", "Thousand", "Million", "Billion" };
//
// static String numberToWords(int num) {
// // https://leetcode.com/discuss/55462/my-clean-java-solution-very-easy-to-understand
// if (num == 0) {
// return "Zero";
// }
// int i = 0;
// String words = "";
//
// while (num > 0) {
// if (num % 1000 != 0) {
// words = numberToWordsHelper(num % 1000) + thousands[i] + " " + words;
// }
// num /= 1000;
// i++;
// }
//
// return words.trim();
// }
//
// private static String numberToWordsHelper(int num) {
// if (num == 0)
// return "";
// else if (num < 20)
// return lessThan20[num] + " ";
// else if (num < 100)
// return tens[num / 10] + " " + numberToWordsHelper(num % 10);
// else
// return lessThan20[num / 100] + " Hundred " + numberToWordsHelper(num % 100);
// }
//
// private static final String[] t = { "", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz" };
//
// static List letterCombinationsOfPhoneNum(final String digits) {
// List res = new ArrayList();
//
// if (digits == null || digits.length() == 0) {
// return res;
// }
//
// res.add("");
// for (int i = 0, len = digits.length(); i < len; i++) {
// String str = t[digits.charAt(i) - '0'];
// if (str.length() == 0) {
// continue;
// }
// int size = res.size();
// for (int j = 0; j < size; j++) {
// for (int k = 0; k < str.length(); k++) {
// res.add(res.get(j) + str.charAt(k));
// }
// }
//
// res = res.subList(size, res.size());
// }
// return res;
// }
//
// static boolean isPowerOfTwo(final int n) {
// return (n > 0 && (n & (n - 1)) == 0);
// }
//
// static int reverse(int x) {
// long res = 0;
// while (x != 0) {
// res = res * 10 + x % 10;
// x = x / 10;
// }
//
// return (res > Integer.MAX_VALUE || res < Integer.MIN_VALUE) ? 0 : (int) res;
// }
//
// static int reverse(long x) {
// long res = 0;
// while (x != 0) {
// res = res * 10 + x % 10;
// x = x / 10;
// }
//
// return (res > Long.MAX_VALUE || res < Long.MIN_VALUE) ? 0 : (int) res;
// }
//
// static boolean isPalindromeNumber(final int x) {
// if (x < 0) {
// return false;
// }
// if (x < 10) {
// return true;
// }
// int y = x;
// long z = 0;
// while (y != 0) {
// z = z * 10 + y % 10;
// y = y / 10;
// }
// return z == x;
// }
//
// /**
// * Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
// * The brackets must close in the correct order, "()" and "()[]{}" are all valid but "(]" and "([)]" are not.
// * @param str
// * @return
// */
// static boolean isValidParentheses(final String str) {
// if (str == null || str.length() == 0) {
// return true;
// }
//
// final Map m = new HashMap();
// m.put('(', ')');
// m.put('{', '}');
// m.put('[', ']');
//
// final Stack stack = new Stack<>();
// for (int i = 0, len = str.length(); i < len; i++) {
// char ch = str.charAt(i);
// Character p = m.get(ch);
//
// if (p == null) {
// if (stack.size() == 0 || m.get(stack.pop()) != ch) {
// return false;
// }
// } else {
// stack.push(ch);
// }
// }
//
// return stack.size() == 0;
// }
//
// static List generateParenthesis(final int n) {
// final List res = new ArrayList<>();
// generate(n, 0, 0, res, "");
// return res;
// }
//
// private static void generate(int n, int open, int close, List result, String current) {
// if (close == n && open == n) {
// result.add(current);
// } else {
// if (open < n) {
// generate(n, open + 1, close, result, current + "(");
// }
//
// if (close < open) {
// generate(n, open, close + 1, result, current + ")");
// }
// }
// }
//
// static void rotate90Degree(int[][] matrix) {
// int n = matrix.length;
//
// for (int i = 0; i < n / 2; ++i) {
// for (int j = i; j < n - 1 - i; ++j) {
// int tmp = matrix[i][j];
// matrix[i][j] = matrix[n - j - 1][i];
// matrix[n - j - 1][i] = matrix[n - i - 1][n - j - 1];
// matrix[n - i - 1][n - j - 1] = matrix[j][n - i - 1];
// matrix[j][n - i - 1] = tmp;
// }
// }
// }
}
