1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/benchmarks/sieve/src/main/java/org/apidesign/benchmark/sieve/Primes.java	Sun Jan 24 12:08:45 2016 +0100
     1.3 @@ -0,0 +1,55 @@
     1.4 +/**
     1.5 + * Back 2 Browser Bytecode Translator
     1.6 + * Copyright (C) 2012-2015 Jaroslav Tulach <jaroslav.tulach@apidesign.org>
     1.7 + *
     1.8 + * This program is free software: you can redistribute it and/or modify
     1.9 + * it under the terms of the GNU General Public License as published by
    1.10 + * the Free Software Foundation, version 2 of the License.
    1.11 + *
    1.12 + * This program is distributed in the hope that it will be useful,
    1.13 + * but WITHOUT ANY WARRANTY; without even the implied warranty of
    1.14 + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    1.15 + * GNU General Public License for more details.
    1.16 + *
    1.17 + * You should have received a copy of the GNU General Public License
    1.18 + * along with this program. Look for COPYING file in the top folder.
    1.19 + * If not, see http://opensource.org/licenses/GPL-2.0.
    1.20 + */
    1.21 +package org.apidesign.benchmark.sieve;
    1.22 +
    1.23 +abstract class Primes {
    1.24 +    private final Natural natural;
    1.25 +    private Filter filter;
    1.26 +
    1.27 +    protected Primes() {
    1.28 +        this.natural = new Natural();
    1.29 +    }
    1.30 +
    1.31 +    int next() {
    1.32 +        for (;;) {
    1.33 +            int n = natural.next();
    1.34 +            if (filter == null || filter.accept(n)) {
    1.35 +                filter = new Filter(n, filter);
    1.36 +                return n;
    1.37 +            }
    1.38 +        }
    1.39 +    }
    1.40 +
    1.41 +    protected abstract void log(String msg);
    1.42 +
    1.43 +    public final int compute(int count) {
    1.44 +        int cnt = 0;
    1.45 +        int res;
    1.46 +        for (;;) {
    1.47 +            res = next();
    1.48 +            cnt += 1;
    1.49 +            if (cnt % 1000 == 0) {
    1.50 +                log("Computed " + cnt + " primes. Last one is " + res);
    1.51 +            }
    1.52 +            if (cnt >= count) {
    1.53 +                break;
    1.54 +            }
    1.55 +        }
    1.56 +        return res;
    1.57 +    }
    1.58 +}