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.  Oracle designates this
   8  * particular file as subject to the "Classpath" exception as provided
   9  * by Oracle in the LICENSE file that accompanied this code.
  10  *
  11  * This code is distributed in the hope that it will be useful, but WITHOUT
  12  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  13  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  14  * version 2 for more details (a copy is included in the LICENSE file that
  15  * accompanied this code).
  16  *
  17  * You should have received a copy of the GNU General Public License version
  18  * 2 along with this work; if not, write to the Free Software Foundation,
  19  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  20  *
  21  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  22  * or visit www.oracle.com if you need additional information or have any
  23  * questions.
  24  */
  25 package org.openjdk.bench.java.util.stream.tasks.PrimesSieve;
  26 
  27 public class PrimesSieveProblem {
  28 
  29     private static final int DATA_SIZE = Integer.getInteger("bench.problemSize", 10*1024);
  30 
  31     private final Integer[] data = new Integer[DATA_SIZE];
  32 
  33     public PrimesSieveProblem() {
  34         for (int i = 0; i < data.length; i++) {
  35             data[i] = i;
  36         }
  37     }
  38 
  39     public Integer[] get() {
  40         return data;
  41     }
  42 
  43     public static boolean isNotDivisible(int i, int d) {
  44         return (i % d) != 0;
  45     }
  46 }