benchmarks/sieve/src/main/java/org/apidesign/benchmark/sieve/Primes.java
author Jaroslav Tulach <jaroslav.tulach@apidesign.org>
Sun, 24 Jan 2016 12:08:45 +0100
changeset 1854 826eb936c9a8
permissions -rw-r--r--
The sieve benchmark makes the testing more real than the fake matrix multiplication
     1 /**
     2  * Back 2 Browser Bytecode Translator
     3  * Copyright (C) 2012-2015 Jaroslav Tulach <jaroslav.tulach@apidesign.org>
     4  *
     5  * This program is free software: you can redistribute it and/or modify
     6  * it under the terms of the GNU General Public License as published by
     7  * the Free Software Foundation, version 2 of the License.
     8  *
     9  * This program is distributed in the hope that it will be useful,
    10  * but WITHOUT ANY WARRANTY; without even the implied warranty of
    11  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    12  * GNU General Public License for more details.
    13  *
    14  * You should have received a copy of the GNU General Public License
    15  * along with this program. Look for COPYING file in the top folder.
    16  * If not, see http://opensource.org/licenses/GPL-2.0.
    17  */
    18 package org.apidesign.benchmark.sieve;
    19 
    20 abstract class Primes {
    21     private final Natural natural;
    22     private Filter filter;
    23 
    24     protected Primes() {
    25         this.natural = new Natural();
    26     }
    27 
    28     int next() {
    29         for (;;) {
    30             int n = natural.next();
    31             if (filter == null || filter.accept(n)) {
    32                 filter = new Filter(n, filter);
    33                 return n;
    34             }
    35         }
    36     }
    37 
    38     protected abstract void log(String msg);
    39 
    40     public final int compute(int count) {
    41         int cnt = 0;
    42         int res;
    43         for (;;) {
    44             res = next();
    45             cnt += 1;
    46             if (cnt % 1000 == 0) {
    47                 log("Computed " + cnt + " primes. Last one is " + res);
    48             }
    49             if (cnt >= count) {
    50                 break;
    51             }
    52         }
    53         return res;
    54     }
    55 }