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