< prev index next >

test/micro/org/openjdk/bench/java/util/stream/tasks/IntegerDuplicate/IntegerDuplicateProblem.java

Print this page

13  * accompanied this code).
14  *
15  * You should have received a copy of the GNU General Public License version
16  * 2 along with this work; if not, write to the Free Software Foundation,
17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18  *
19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20  * or visit www.oracle.com if you need additional information or have any
21  * questions.
22  */
23 package org.openjdk.bench.java.util.stream.tasks.IntegerDuplicate;
24 
25 import java.util.Random;
26 
27 public class IntegerDuplicateProblem {
28 
29     private static final int DATA_SIZE = Integer.getInteger("bench.problemSize", 10*1024*1024);
30 
31     private final Integer[] data = new Integer[DATA_SIZE];
32 

33     public IntegerDuplicateProblem() {
34         // use fixed seed to reduce run-to-run variance
35         Random rand = new Random(0x30052012);
36 
37         for (int i = 0; i < data.length; i++) {
38             data[i] = rand.nextInt();
39         }
40     }
41 
42     public Integer[] get() {
43         return data;
44     }
45 }

13  * accompanied this code).
14  *
15  * You should have received a copy of the GNU General Public License version
16  * 2 along with this work; if not, write to the Free Software Foundation,
17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18  *
19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20  * or visit www.oracle.com if you need additional information or have any
21  * questions.
22  */
23 package org.openjdk.bench.java.util.stream.tasks.IntegerDuplicate;
24 
25 import java.util.Random;
26 
27 public class IntegerDuplicateProblem {
28 
29     private static final int DATA_SIZE = Integer.getInteger("bench.problemSize", 10*1024*1024);
30 
31     private final Integer[] data = new Integer[DATA_SIZE];
32 
33     @SuppressWarnings("initialization")
34     public IntegerDuplicateProblem() {
35         // use fixed seed to reduce run-to-run variance
36         Random rand = new Random(0x30052012);
37 
38         for (int i = 0; i < data.length; i++) {
39             data[i] = rand.nextInt();
40         }
41     }
42 
43     public Integer[] get() {
44         return data;
45     }
46 }
< prev index next >