Example usage for org.apache.commons.lang3 ArrayUtils toPrimitive

Introduction

In this page you can find the example usage for org.apache.commons.lang3 ArrayUtils toPrimitive.

Prototype

public static boolean[] toPrimitive(final Boolean[] array)

Source Link

Document

Converts an array of object Booleans to primitives.

This method returns null for a null input array.

Usage

From source file:com.github.jessemull.microflex.math.mathinteger.AdditionIntegerTest.java

/**
 * Tests the addition of an array to a well using indices.
 */// w w  w  . jav  a 2  s  .  co  m
@Test
public void testWellArrayIndices() {

    PlateInteger[] plates1 = arrays1.get(0);
    PlateInteger[] plates2 = arrays2.get(0);
    PlateInteger[] unevenPlates = uneven.get(0);

    for (int i = 0; i < plates1.length; i++) {

        WellInteger[] well1 = plates1[i].dataSet().toWellArray();
        WellInteger[] well2 = plates2[i].dataSet().toWellArray();
        WellInteger[] wellUneven = unevenPlates[i].dataSet().toWellArray();

        for (int j = 0; j < well1.length; j++) {

            List<Integer> list1 = well1[j].data();
            List<Integer> list2 = well2[j].data();
            int[] array = ArrayUtils.toPrimitive(list2.toArray(new Integer[list2.size()]));
            List<Integer> unevenList = wellUneven[j].data();
            int[] arrayUneven = ArrayUtils.toPrimitive(unevenList.toArray(new Integer[unevenList.size()]));

            int begin = 1 + random.nextInt(list1.size() - 1);
            int end = begin + random.nextInt(list1.size() - begin);

            List<Integer> result = new ArrayList<Integer>();
            List<Integer> resultUneven = new ArrayList<Integer>();
            List<Integer> returned = addition.wells(well1[j], array, begin, end - begin);
            List<Integer> returnedUneven = addition.wells(well1[j], arrayUneven, begin, end - begin);

            for (int k = begin; k < end; k++) {
                result.add(list1.get(k) + array[k]);
                resultUneven.add(list1.get(k) + arrayUneven[k]);
            }

            for (int l = list1.size(); l < end; l++) {
                resultUneven.add(arrayUneven[l]);
            }

            assertEquals(result, returned);
            assertEquals(resultUneven, returnedUneven);
        }

    }

}

From source file:com.github.jessemull.microflex.math.mathinteger.DivisionIntegerTest.java

/**
 * Tests the division of an array to a well using indices.
 *//*  w  ww .java  2s.  co m*/
@Test
public void testWellArrayIndices() {

    PlateInteger[] plates1 = arrays1.get(0);
    PlateInteger[] plates2 = arrays2.get(0);
    PlateInteger[] unevenPlates = uneven.get(0);

    for (int i = 0; i < plates1.length; i++) {

        WellInteger[] well1 = plates1[i].dataSet().toWellArray();
        WellInteger[] well2 = plates2[i].dataSet().toWellArray();
        WellInteger[] wellUneven = unevenPlates[i].dataSet().toWellArray();

        for (int j = 0; j < well1.length; j++) {

            List<Integer> list1 = well1[j].data();
            List<Integer> list2 = well2[j].data();
            int[] array = ArrayUtils.toPrimitive(list2.toArray(new Integer[list2.size()]));
            List<Integer> unevenList = wellUneven[j].data();
            int[] arrayUneven = ArrayUtils.toPrimitive(unevenList.toArray(new Integer[unevenList.size()]));

            int begin = 1 + random.nextInt(list1.size() - 1);
            int end = begin + random.nextInt(list1.size() - begin);

            List<Integer> result = new ArrayList<Integer>();
            List<Integer> resultUneven = new ArrayList<Integer>();
            List<Integer> returned = division.wells(well1[j], array, begin, end - begin);
            List<Integer> returnedUneven = division.wells(well1[j], arrayUneven, begin, end - begin);

            for (int k = begin; k < end; k++) {
                result.add(list1.get(k) / array[k]);
                resultUneven.add(list1.get(k) / arrayUneven[k]);
            }

            for (int l = list1.size(); l < end; l++) {
                resultUneven.add(arrayUneven[l]);
            }

            assertEquals(result, returned);
            assertEquals(resultUneven, returnedUneven);
        }

    }

}

From source file:com.github.jessemull.microflex.math.mathinteger.ModulusIntegerTest.java

/**
 * Tests the modulus operation using an array, a well and indices.
 *//*from w  w  w . ja v  a  2s  .co m*/
@Test
public void testWellArrayIndices() {

    PlateInteger[] plates1 = arrays1.get(0);
    PlateInteger[] plates2 = arrays2.get(0);
    PlateInteger[] unevenPlates = uneven.get(0);

    for (int i = 0; i < plates1.length; i++) {

        WellInteger[] well1 = plates1[i].dataSet().toWellArray();
        WellInteger[] well2 = plates2[i].dataSet().toWellArray();
        WellInteger[] wellUneven = unevenPlates[i].dataSet().toWellArray();

        for (int j = 0; j < well1.length; j++) {

            List<Integer> list1 = well1[j].data();
            List<Integer> list2 = well2[j].data();
            int[] array = ArrayUtils.toPrimitive(list2.toArray(new Integer[list2.size()]));
            List<Integer> unevenList = wellUneven[j].data();
            int[] arrayUneven = ArrayUtils.toPrimitive(unevenList.toArray(new Integer[unevenList.size()]));

            int begin = 1 + random.nextInt(list1.size() - 1);
            int end = begin + random.nextInt(list1.size() - begin);

            List<Integer> result = new ArrayList<Integer>();
            List<Integer> resultUneven = new ArrayList<Integer>();
            List<Integer> returned = modulus.wells(well1[j], array, begin, end - begin);
            List<Integer> returnedUneven = modulus.wells(well1[j], arrayUneven, begin, end - begin);

            for (int k = begin; k < end; k++) {
                result.add(list1.get(k) % array[k]);
                resultUneven.add(list1.get(k) % arrayUneven[k]);
            }

            for (int l = list1.size(); l < end; l++) {
                resultUneven.add(arrayUneven[l]);
            }

            assertEquals(result, returned);
            assertEquals(resultUneven, returnedUneven);
        }

    }

}

From source file:com.github.jessemull.microflex.math.mathdouble.MultiplicationDoubleTest.java

/**
 * Tests the multiplication of an array to a well using indices.
 *//*from www .j av  a 2s .  c om*/
@Test
public void testWellArrayIndices() {

    PlateDouble[] plates1 = arrays1.get(0);
    PlateDouble[] plates2 = arrays2.get(0);
    PlateDouble[] unevenPlates = uneven.get(0);

    for (int i = 0; i < plates1.length; i++) {

        WellDouble[] well1 = plates1[i].dataSet().toWellArray();
        WellDouble[] well2 = plates2[i].dataSet().toWellArray();
        WellDouble[] wellUneven = unevenPlates[i].dataSet().toWellArray();

        for (int j = 0; j < well1.length; j++) {

            List<Double> list1 = well1[j].data();
            List<Double> list2 = well2[j].data();
            double[] array = ArrayUtils.toPrimitive(list2.toArray(new Double[list2.size()]));
            List<Double> unevenList = wellUneven[j].data();
            double[] arrayUneven = ArrayUtils.toPrimitive(unevenList.toArray(new Double[unevenList.size()]));

            int begin = 1 + random.nextInt(list1.size() - 1);
            int end = begin + random.nextInt(list1.size() - begin);

            List<Double> result = new ArrayList<Double>();
            List<Double> resultUneven = new ArrayList<Double>();
            List<Double> returned = multiplication.wells(well1[j], array, begin, end - begin);
            List<Double> returnedUneven = multiplication.wells(well1[j], arrayUneven, begin, end - begin);

            for (int k = begin; k < end; k++) {
                result.add(list1.get(k) * array[k]);
                resultUneven.add(list1.get(k) * arrayUneven[k]);
            }

            for (int l = list1.size(); l < end; l++) {
                resultUneven.add(arrayUneven[l]);
            }

            assertEquals(result, returned);
            assertEquals(resultUneven, returnedUneven);
        }

    }

}

From source file:com.github.jessemull.microflex.math.mathinteger.SubtractionIntegerTest.java

/**
 * Tests the subtraction of an array to a well using indices.
 *///from  w w w . j  a  v a 2 s  .  c o m
@Test
public void testWellArrayIndices() {

    PlateInteger[] plates1 = arrays1.get(0);
    PlateInteger[] plates2 = arrays2.get(0);
    PlateInteger[] unevenPlates = uneven.get(0);

    for (int i = 0; i < plates1.length; i++) {

        WellInteger[] well1 = plates1[i].dataSet().toWellArray();
        WellInteger[] well2 = plates2[i].dataSet().toWellArray();
        WellInteger[] wellUneven = unevenPlates[i].dataSet().toWellArray();

        for (int j = 0; j < well1.length; j++) {

            List<Integer> list1 = well1[j].data();
            List<Integer> list2 = well2[j].data();
            int[] array = ArrayUtils.toPrimitive(list2.toArray(new Integer[list2.size()]));
            List<Integer> unevenList = wellUneven[j].data();
            int[] arrayUneven = ArrayUtils.toPrimitive(unevenList.toArray(new Integer[unevenList.size()]));

            int begin = 1 + random.nextInt(list1.size() - 1);
            int end = begin + random.nextInt(list1.size() - begin);

            List<Integer> result = new ArrayList<Integer>();
            List<Integer> resultUneven = new ArrayList<Integer>();
            List<Integer> returned = subtraction.wells(well1[j], array, begin, end - begin);
            List<Integer> returnedUneven = subtraction.wells(well1[j], arrayUneven, begin, end - begin);

            for (int k = begin; k < end; k++) {
                result.add(list1.get(k) - array[k]);
                resultUneven.add(list1.get(k) - arrayUneven[k]);
            }

            for (int l = list1.size(); l < end; l++) {
                resultUneven.add(arrayUneven[l]);
            }

            assertEquals(result, returned);
            assertEquals(resultUneven, returnedUneven);
        }

    }

}

From source file:com.github.jessemull.microflex.math.mathinteger.MultiplicationIntegerTest.java

/**
 * Tests the multiplication of an array to a well using indices.
 *//*from w  w w  . ja v  a 2 s .  c o  m*/
@Test
public void testWellArrayIndices() {

    PlateInteger[] plates1 = arrays1.get(0);
    PlateInteger[] plates2 = arrays2.get(0);
    PlateInteger[] unevenPlates = uneven.get(0);

    for (int i = 0; i < plates1.length; i++) {

        WellInteger[] well1 = plates1[i].dataSet().toWellArray();
        WellInteger[] well2 = plates2[i].dataSet().toWellArray();
        WellInteger[] wellUneven = unevenPlates[i].dataSet().toWellArray();

        for (int j = 0; j < well1.length; j++) {

            List<Integer> list1 = well1[j].data();
            List<Integer> list2 = well2[j].data();
            int[] array = ArrayUtils.toPrimitive(list2.toArray(new Integer[list2.size()]));
            List<Integer> unevenList = wellUneven[j].data();
            int[] arrayUneven = ArrayUtils.toPrimitive(unevenList.toArray(new Integer[unevenList.size()]));

            int begin = 1 + random.nextInt(list1.size() - 1);
            int end = begin + random.nextInt(list1.size() - begin);

            List<Integer> result = new ArrayList<Integer>();
            List<Integer> resultUneven = new ArrayList<Integer>();
            List<Integer> returned = multiplication.wells(well1[j], array, begin, end - begin);
            List<Integer> returnedUneven = multiplication.wells(well1[j], arrayUneven, begin, end - begin);

            for (int k = begin; k < end; k++) {
                result.add(list1.get(k) * array[k]);
                resultUneven.add(list1.get(k) * arrayUneven[k]);
            }

            for (int l = list1.size(); l < end; l++) {
                resultUneven.add(arrayUneven[l]);
            }

            assertEquals(result, returned);
            assertEquals(resultUneven, returnedUneven);
        }

    }

}

From source file:com.google.cloud.dataflow.examples.opinionanalysis.IndexerPipelineUtils.java

public static byte[] extractRecordDelimiters(String paramValue) {
    String[] delimiters = paramValue.split(",");
    ArrayList<Byte> resList = new ArrayList<Byte>();
    for (String d : delimiters)
        resList.add(Byte.parseByte(d));
    Byte[] resArray = new Byte[resList.size()];
    resList.toArray(resArray);/*  w w w.  j  ava 2  s .  c o m*/
    byte[] result = ArrayUtils.toPrimitive(resArray);
    return result;
}

From source file:com.github.jessemull.microflexinteger.math.ORTest.java

/**
 * Tests the strict OR operation using an array and a well.
 *//*from www .j a  v a2 s .co m*/
@Test
public void testWellStrictArray() {

    Plate[] plates1 = arrays1.get(0);
    Plate[] plates2 = arrays2.get(0);
    Plate[] unevenPlates = uneven.get(0);

    for (int i = 0; i < plates1.length; i++) {

        Well[] well1 = plates1[i].dataSet().toWellArray();
        Well[] well2 = plates2[i].dataSet().toWellArray();
        Well[] wellUneven = unevenPlates[i].dataSet().toWellArray();

        for (int j = 0; j < well1.length; j++) {

            List<Integer> list1 = well1[j].data();
            List<Integer> list2 = well2[j].data();
            int[] array = ArrayUtils.toPrimitive(list2.toArray(new Integer[list2.size()]));
            List<Integer> unevenList = wellUneven[j].data();
            int[] arrayUneven = ArrayUtils.toPrimitive(unevenList.toArray(new Integer[unevenList.size()]));

            List<Integer> result = new ArrayList<Integer>();
            List<Integer> resultUneven = new ArrayList<Integer>();
            List<Integer> returned = or.wellsStrict(well1[j], array);
            List<Integer> returnedUneven = or.wellsStrict(well1[j], arrayUneven);

            for (int k = 0; k < list1.size(); k++) {
                result.add(list1.get(k) | array[k]);
                resultUneven.add(list1.get(k) | arrayUneven[k]);
            }

            assertEquals(result, returned);
            assertEquals(resultUneven, returnedUneven);
        }

    }
}

From source file:com.github.jessemull.microflexdouble.math.DivisionTest.java

/**
 * Tests the strict division of an array to a well.
 *//*from ww  w .j a va2s.  c om*/
@Test
public void testWellStrictArray() {

    Plate[] plates1 = arrays1.get(0);
    Plate[] plates2 = arrays2.get(0);
    Plate[] unevenPlates = uneven.get(0);

    for (int i = 0; i < plates1.length; i++) {

        Well[] well1 = plates1[i].dataSet().toWellArray();
        Well[] well2 = plates2[i].dataSet().toWellArray();
        Well[] wellUneven = unevenPlates[i].dataSet().toWellArray();

        for (int j = 0; j < well1.length; j++) {

            List<Double> list1 = well1[j].data();
            List<Double> list2 = well2[j].data();
            double[] array = ArrayUtils.toPrimitive(list2.toArray(new Double[list2.size()]));
            List<Double> unevenList = wellUneven[j].data();
            double[] arrayUneven = ArrayUtils.toPrimitive(unevenList.toArray(new Double[unevenList.size()]));

            List<Double> result = new ArrayList<Double>();
            List<Double> resultUneven = new ArrayList<Double>();
            List<Double> returned = division.wellsStrict(well1[j], array);
            List<Double> returnedUneven = division.wellsStrict(well1[j], arrayUneven);

            for (int k = 0; k < list1.size(); k++) {
                result.add(list1.get(k) / array[k]);
                resultUneven.add(list1.get(k) / arrayUneven[k]);
            }

            assertEquals(result, returned);
            assertEquals(resultUneven, returnedUneven);
        }

    }
}

From source file:com.github.jessemull.microflexdouble.math.AdditionTest.java

/**
 * Tests the strict addition of an array to a well.
 *//*from ww w  .  j a va  2 s . c  om*/
@Test
public void testWellStrictArray() {

    Plate[] plates1 = arrays1.get(0);
    Plate[] plates2 = arrays2.get(0);
    Plate[] unevenPlates = uneven.get(0);

    for (int i = 0; i < plates1.length; i++) {

        Well[] well1 = plates1[i].dataSet().toWellArray();
        Well[] well2 = plates2[i].dataSet().toWellArray();
        Well[] wellUneven = unevenPlates[i].dataSet().toWellArray();

        for (int j = 0; j < well1.length; j++) {

            List<Double> list1 = well1[j].data();
            List<Double> list2 = well2[j].data();
            double[] array = ArrayUtils.toPrimitive(list2.toArray(new Double[list2.size()]));
            List<Double> unevenList = wellUneven[j].data();
            double[] arrayUneven = ArrayUtils.toPrimitive(unevenList.toArray(new Double[unevenList.size()]));

            List<Double> result = new ArrayList<Double>();
            List<Double> resultUneven = new ArrayList<Double>();
            List<Double> returned = addition.wellsStrict(well1[j], array);
            List<Double> returnedUneven = addition.wellsStrict(well1[j], arrayUneven);

            for (int k = 0; k < list1.size(); k++) {
                result.add(list1.get(k) + array[k]);
                resultUneven.add(list1.get(k) + arrayUneven[k]);
            }

            assertEquals(result, returned);
            assertEquals(resultUneven, returnedUneven);
        }

    }
}