1 /* 2 * Copyright (c) 2014, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. 8 * 9 * This code is distributed in the hope that it will be useful, but WITHOUT 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12 * version 2 for more details (a copy is included in the LICENSE file that 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.PrimesSieve; 24 25 public class PrimesSieveProblem { 26 27 private static final int DATA_SIZE = Integer.getInteger("bench.problemSize", 10*1024); 28 29 private final Integer[] data = new Integer[DATA_SIZE]; 30 31 public PrimesSieveProblem() { 32 for (int i = 0; i < data.length; i++) { 33 data[i] = i; 34 } 35 } 36 37 public Integer[] get() { 38 return data; 39 } 40 41 public static boolean isNotDivisible(int i, int d) { 42 return (i % d) != 0; 43 } 44 }