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.microflexinteger.math.ANDTest.java

/**
 * Tests the strict AND operation using an array and a well.
 *///from   ww w. ja 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<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 = and.wellsStrict(well1[j], array);
            List<Integer> returnedUneven = and.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.microflexinteger.math.XORTest.java

/**
 * Tests the strict XOR operation using an array and a well.
 *///  www . j a  va2 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<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 = xor.wellsStrict(well1[j], array);
            List<Integer> returnedUneven = xor.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.microflexinteger.math.AdditionTest.java

/**
 * Tests the strict addition of an array to a well.
 *//*  w  w w. jav  a2s  . c o 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 = addition.wellsStrict(well1[j], array);
            List<Integer> 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);
        }

    }
}

---

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

/**
 * Tests the strict division of an array to a well.
 *//*from w  w w. jav  a  2  s  . com*/
@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 = division.wellsStrict(well1[j], array);
            List<Integer> 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.ModulusTest.java

/**
 * Tests the strict modulus operation using an array and a well.
 *///from   w ww .  ja va 2s  .  com
@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 = modulus.wellsStrict(well1[j], array);
            List<Double> returnedUneven = modulus.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.SubtractionTest.java

/**
 * Tests the strict subtraction of an array to a well.
 *///from   w w  w . ja v a  2  s.  c  o 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<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 = subtraction.wellsStrict(well1[j], array);
            List<Double> returnedUneven = subtraction.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.microflexinteger.math.ModulusTest.java

/**
 * Tests the strict modulus operation using an array and a well.
 *///from w  ww  .  j a va 2s . com
@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 = modulus.wellsStrict(well1[j], array);
            List<Integer> returnedUneven = modulus.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.microflexinteger.math.SubtractionTest.java

/**
 * Tests the strict subtraction of an array to a well.
 *//*from  w w w  . j  a v a2  s  . c  o  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 = subtraction.wellsStrict(well1[j], array);
            List<Integer> returnedUneven = subtraction.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.MultiplicationTest.java

/**
 * Tests the strict multiplication of an array to a well.
 *//*www .  j  ava2s . 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<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 = multiplication.wellsStrict(well1[j], array);
            List<Double> returnedUneven = multiplication.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.microflexinteger.math.MultiplicationTest.java

/**
 * Tests the strict multiplication of an array to a well.
 *//*  www .ja  v a 2  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 = multiplication.wellsStrict(well1[j], array);
            List<Integer> returnedUneven = multiplication.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);
        }

    }
}

---

• «
• 1
• 2
• 3
• 4
• 5
• 6
• 7
• 8
• 9
• 10
• 11
• 12
• 13
• 14
• 15
• 16
• 17
• 18
• 19
• 20
• 21
• 22
• 23
• 24
• 25
• 26
• 27
• 28
• 29
• 30
• 31
• 32
• 33
• 34
• 35
• 36
• 37
• 38
• 39
• 40
• 41
• 42
• 43
• 44
• 45
• 46
• »