-
Notifications
You must be signed in to change notification settings - Fork 0
/
PrimaryBench.php
executable file
·210 lines (179 loc) · 4.28 KB
/
PrimaryBench.php
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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
<?php
/**
* Class GeneratorBench
*
* @Iterations(100)
* @Revs(200)
*/
final class PrimaryBench
{
const PRIME_COUNT = 200;
function isPrime($num) {
//1 is not prime. See: http://en.wikipedia.org/wiki/Prime_number#Primality_of_one
if($num == 1)
return false;
//2 is prime (the only even number that is prime)
if($num == 2)
return true;
/**
* if the number is divisible by two, then it's not prime and it's no longer
* needed to check other even numbers
*/
if($num % 2 == 0) {
return false;
}
/**
* Checks the odd numbers. If any of them is a factor, then it returns false.
* The sqrt can be an aproximation, hence just for the sake of
* security, one rounds it to the next highest integer value.
*/
for($i = 3; $i <= ceil(sqrt($num)); $i = $i + 2) {
if($num % $i == 0)
return false;
}
return true;
}
/**
* @Iterations(1000)
*/
public function benchPrimeNormal()
{
$self = $this;
$tgen = function($v) use ($self) {
while (!$self->isPrime(++$v));
return $v;
};
$i = 7;
for ($a = 0; $a < self::PRIME_COUNT; $a++) {
$i = $tgen($i);
}
}
/**
* @Iterations(1000)
*/
public function benchPrimeOldNormalWhile()
{
$self = $this;
$tgen = function($v) use ($self) {
while (true) {
if ($self->isPrime(++$v)) {
return $v;
}
};
};
$i = 7;
for ($a = 0; $a < self::PRIME_COUNT; $a++) {
$i = $tgen($i);
}
}
/**
* @Iterations(1000)
*/
public function benchPrimeOldNormalFor()
{
$self = $this;
$tgen = function($v) use ($self) {
for(;;) {
if ($self->isPrime(++$v)) {
return $v;
}
};
};
$i = 7;
for ($a = 0; $a < self::PRIME_COUNT; $a++) {
$i = $tgen($i);
}
}
/**
* @Iterations(1000)
*/
public function benchPrimeOldNormalGoto()
{
$self = $this;
$tgen = function($v) use ($self) {
start:
if ($self->isPrime(++$v)) {
return $v;
}
goto start;
};
$i = 7;
for ($a = 0; $a < self::PRIME_COUNT; $a++) {
$i = $tgen($i);
}
}
/**
* @Iterations(1000)
*/
public function benchPrimeNormalWhileInline()
{
$self = $this;
$tgen = function($v) use ($self) {
while(!$self->isPrime(++$v));
return $v;
};
$i = 7;
for ($a = 0; $a < self::PRIME_COUNT; $a++) {
$i = $tgen($i);
}
}
/**
* @Iterations(1000)
*/
public function benchPrimeGenerator()
{
$self = $this;
$tgen = function($v) use ($self) {
while(true) {
while (!$self->isPrime(++$v));
yield $v;
}
};
$i = 7;
$gen = $tgen($i);
for ($a = 0; $a < self::PRIME_COUNT; $a++) {
$gen->next();
$b = $gen->current();
}
}
/**
* @Iterations(1000)
*/
public function benchPrimeGeneratorIf()
{
$self = $this;
$tgen = function($v) use ($self) {
while (true) {
if($self->isPrime(++$v)) {
yield $v;
}
};
};
$i = 7;
$gen = $tgen($i);
for ($a = 0; $a < self::PRIME_COUNT; $a++) {
$gen->next();
$b = $gen->current();
}
}
/**
* @Iterations(1000)
*/
public function benchPrimeGeneratorGoto()
{
$self = $this;
$tgen = function($v) use ($self) {
start2:
if($self->isPrime(++$v)) {
yield $v;
}
goto start2;
};
$i = 7;
$gen = $tgen($i);
for ($a = 0; $a < self::PRIME_COUNT; $a++) {
$gen->next();
$b = $gen->current();
}
}
}