|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectchoco.kernel.common.util.tools.ArrayUtils
public final class ArrayUtils
Method Summary | ||
---|---|---|
static
|
append(T[]... toAppend)
Append two Arrays |
|
static
|
contains(T[] array,
T obj)
|
|
static int[] |
createNonRedundantSortedValues(gnu.trove.TIntArrayList values)
|
|
static int[] |
flatten(int[][] matrix)
|
|
static
|
flatten(T[][] matrix)
|
|
static
|
flattenSubMatrix(int iMin,
int iLength,
int jMin,
int jLength,
T[][] matrix)
|
|
static
|
get(int index,
List<T>... arrays)
|
|
static
|
get(int index,
T[]... arrays)
|
|
static
|
getColumn(T[][] array,
int column)
|
|
static
|
getNonRedundantObjects(Class classe,
V[] all)
|
|
static
|
getNonRedundantObjects(V[] all)
|
|
static int[] |
getNonRedundantSortedValues(int[] values)
create a new array which contains sorted distinct values; |
|
static int[] |
getNonRedundantSortedValues(gnu.trove.TIntArrayList values)
create an array which contains sorted distinct values. do not modify the original list |
|
static void |
inverseSign(int[] tab)
Reverse all signs of the a given int table. |
|
static
|
length(T[]... arrays)
|
|
static int[] |
linspace(int begin,
int end)
|
|
static int[] |
oneToN(int n)
|
|
static
|
permutation(int[] permutation,
T[] tab)
apply a permuation on an array |
|
static void |
reverse(int[] tab)
|
|
static
|
reverse(T[] tab)
|
|
static
|
sort(Set<T> set)
|
|
static int[][][] |
swallowCopy(int[][][] arr)
|
|
static int[][][][] |
swallowCopy(int[][][][] arr)
|
|
static
|
toArray(ArrayList<T> list)
|
|
static
|
toArray(Class c,
List<T> list)
|
|
static
|
toList(T[] array)
|
|
static int[][] |
transpose(int[][] matrix)
|
|
static
|
transpose(T[][] matrix)
|
|
static int[] |
zeroToN(int n)
|
|
static int[] |
zeroToNShuffle(int nb)
|
|
static int[] |
zeroToNShuffle(int nb,
long seed)
|
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Method Detail |
---|
public static int[] zeroToN(int n)
public static int[] oneToN(int n)
public static int[] linspace(int begin, int end)
public static <T> T[] getColumn(T[][] array, int column)
public static <T> int length(T[]... arrays)
public static <T> boolean contains(T[] array, T obj)
public static <T> T get(int index, T[]... arrays)
public static <T> T get(int index, List<T>... arrays)
public static <T> T[] append(T[]... toAppend)
toAppend
- array of arrays to append
public static void inverseSign(int[] tab)
tab
- array to inversepublic static void reverse(int[] tab)
public static <T> void reverse(T[] tab)
public static <T> void permutation(int[] permutation, T[] tab)
public static <T> List<T> toList(T[] array)
public static <T> T[] toArray(Class c, List<T> list)
public static <T> T[] toArray(ArrayList<T> list)
public static <T> T[][] transpose(T[][] matrix)
public static int[][] transpose(int[][] matrix)
public static <T> T[] flatten(T[][] matrix)
public static <T> T[] flattenSubMatrix(int iMin, int iLength, int jMin, int jLength, T[][] matrix)
public static int[] flatten(int[][] matrix)
public static int[] getNonRedundantSortedValues(int[] values)
values
-
public static int[] getNonRedundantSortedValues(gnu.trove.TIntArrayList values)
public static int[] createNonRedundantSortedValues(gnu.trove.TIntArrayList values)
public static <V extends IIndex> V[] getNonRedundantObjects(V[] all)
public static <V extends IIndex> V[] getNonRedundantObjects(Class classe, V[] all)
public static <T extends Comparable<T>> T[] sort(Set<T> set)
public static int[][][][] swallowCopy(int[][][][] arr)
public static int[][][] swallowCopy(int[][][] arr)
public static int[] zeroToNShuffle(int nb)
public static int[] zeroToNShuffle(int nb, long seed)
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |