@@ -11,6 +11,10 @@ |
||
11 | 11 | |
12 | 12 | use SphericalCoordinateTrait; |
13 | 13 | |
14 | + /** |
|
15 | + * @param double $theta |
|
16 | + * @param double $phi |
|
17 | + */ |
|
14 | 18 | public function __construct($theta, $phi, $rho) |
15 | 19 | { |
16 | 20 | $this->theta = Numbers::makeOrDont(Numbers::IMMUTABLE, $theta); |
@@ -52,14 +52,14 @@ |
||
52 | 52 | throw new \InvalidArgumentException('Cannot operate on two cartesians of different dimensionality.'); |
53 | 53 | } |
54 | 54 | |
55 | - for ($i = 0;$i < $this->dimensions->getValue();$i++) { |
|
55 | + for ($i = 0; $i < $this->dimensions->getValue(); $i++) { |
|
56 | 56 | yield $function($this->getAxis($i), $cartesian->getAxis($i)); |
57 | 57 | } |
58 | 58 | } |
59 | 59 | |
60 | 60 | public function performOperation(callable $function) |
61 | 61 | { |
62 | - for ($i = 0;$i < $this->dimensions->getValue();$i++) { |
|
62 | + for ($i = 0; $i < $this->dimensions->getValue(); $i++) { |
|
63 | 63 | yield $function($this->getAxis($i)); |
64 | 64 | } |
65 | 65 | } |
@@ -24,7 +24,7 @@ |
||
24 | 24 | |
25 | 25 | if (!is_null($start)) { |
26 | 26 | if ($end->getDimensions()->getValue() == $start->getDimensions()->getValue()) { |
27 | - for ($i = 0;$i < $end->getDimensions()->getValue();$i++) { |
|
27 | + for ($i = 0; $i < $end->getDimensions()->getValue(); $i++) { |
|
28 | 28 | $dimensions[] = $end->getAxis($i)->subtract($start->getAxis($i)); |
29 | 29 | } |
30 | 30 | } else { |
@@ -23,7 +23,7 @@ discard block |
||
23 | 23 | public function __construct($value, $precision = null, $base = 10) |
24 | 24 | { |
25 | 25 | $this->base = $base; |
26 | - $this->value = (string)$value; |
|
26 | + $this->value = (string) $value; |
|
27 | 27 | |
28 | 28 | if (!is_null($precision)) { |
29 | 29 | $this->precision = $precision; |
@@ -132,7 +132,7 @@ discard block |
||
132 | 132 | $curVal = $this->getValue(); |
133 | 133 | $calcVal = Numbers::make(Numbers::IMMUTABLE, 1); |
134 | 134 | |
135 | - for ($i = 1;$i <= $curVal;$i++) { |
|
135 | + for ($i = 1; $i <= $curVal; $i++) { |
|
136 | 136 | $calcVal = $calcVal->multiply($i); |
137 | 137 | } |
138 | 138 | |
@@ -147,19 +147,19 @@ discard block |
||
147 | 147 | |
148 | 148 | if ($val->modulo(2)->equals(1)) { |
149 | 149 | $m = Numbers::make(Numbers::IMMUTABLE, $val->add(1)->divide(2)); |
150 | - $term = function ($n) { |
|
150 | + $term = function($n) { |
|
151 | 151 | return Numbers::make(Numbers::IMMUTABLE, 2)->multiply($n); |
152 | 152 | }; |
153 | 153 | } else { |
154 | 154 | $m = Numbers::make(Numbers::IMMUTABLE, $val->divide(2)); |
155 | - $term = function ($n) { |
|
155 | + $term = function($n) { |
|
156 | 156 | return Numbers::make(Numbers::IMMUTABLE, 2)->multiply($n)->subtract(1); |
157 | 157 | }; |
158 | 158 | } |
159 | 159 | |
160 | 160 | $newVal = Numbers::makeOne(); |
161 | 161 | |
162 | - for ($i = 1;$m->greaterThanOrEqualTo($i);$i++) { |
|
162 | + for ($i = 1; $m->greaterThanOrEqualTo($i); $i++) { |
|
163 | 163 | $newVal = $newVal->multiply($term($i)); |
164 | 164 | } |
165 | 165 | |
@@ -222,15 +222,15 @@ discard block |
||
222 | 222 | return $this->setValue( |
223 | 223 | SeriesProvider::maclaurinSeries( |
224 | 224 | $modulo, |
225 | - function ($n) { |
|
225 | + function($n) { |
|
226 | 226 | $negOne = Numbers::make(Numbers::IMMUTABLE, -1); |
227 | 227 | |
228 | 228 | return $negOne->pow($n); |
229 | 229 | }, |
230 | - function ($n) { |
|
230 | + function($n) { |
|
231 | 231 | return SequenceProvider::nthOddNumber($n); |
232 | 232 | }, |
233 | - function ($n) { |
|
233 | + function($n) { |
|
234 | 234 | return SequenceProvider::nthOddNumber($n)->factorial(); |
235 | 235 | }, |
236 | 236 | 0, |
@@ -263,13 +263,13 @@ discard block |
||
263 | 263 | return $this->setValue( |
264 | 264 | SeriesProvider::maclaurinSeries( |
265 | 265 | $modulo, |
266 | - function ($n) { |
|
266 | + function($n) { |
|
267 | 267 | return SequenceProvider::nthPowerNegativeOne($n); |
268 | 268 | }, |
269 | - function ($n) { |
|
269 | + function($n) { |
|
270 | 270 | return SequenceProvider::nthEvenNumber($n); |
271 | 271 | }, |
272 | - function ($n) { |
|
272 | + function($n) { |
|
273 | 273 | return SequenceProvider::nthEvenNumber($n)->factorial(); |
274 | 274 | }, |
275 | 275 | 0, |
@@ -299,18 +299,18 @@ discard block |
||
299 | 299 | return $this->setValue( |
300 | 300 | SeriesProvider::maclaurinSeries( |
301 | 301 | $modulo, |
302 | - function ($n) { |
|
302 | + function($n) { |
|
303 | 303 | $four = Numbers::make(Numbers::IMMUTABLE, 4); |
304 | 304 | $n = Numbers::makeOrDont(Numbers::IMMUTABLE, $n); |
305 | 305 | |
306 | 306 | return SequenceProvider::nthBernoulliNumber($n->multiply(2)->getValue(), -4)->pow($n)->multiply(Numbers::makeOne()->subtract($four->pow($n))); |
307 | 307 | }, |
308 | - function ($n) { |
|
308 | + function($n) { |
|
309 | 309 | $n = Numbers::makeOrDont(Numbers::IMMUTABLE, $n); |
310 | 310 | |
311 | 311 | return $n->multiply(2)->subtract(1); |
312 | 312 | }, |
313 | - function ($n) { |
|
313 | + function($n) { |
|
314 | 314 | return SequenceProvider::nthEvenNumber($n)->factorial(); |
315 | 315 | }, |
316 | 316 | 1, |
@@ -33,7 +33,7 @@ discard block |
||
33 | 33 | $cumulative = Numbers::makeZero(); |
34 | 34 | $x = Numbers::makeOrDont(Numbers::IMMUTABLE, $x); |
35 | 35 | |
36 | - for ($i = 0;$x->greaterThanOrEqualTo($i);$i++) { |
|
36 | + for ($i = 0; $x->greaterThanOrEqualTo($i); $i++) { |
|
37 | 37 | $cumulative = $cumulative->add($this->pmf($i)); |
38 | 38 | } |
39 | 39 | |
@@ -62,7 +62,7 @@ discard block |
||
62 | 62 | |
63 | 63 | $cumulative = Numbers::makeZero(); |
64 | 64 | |
65 | - for (;$larger->greaterThanOrEqualTo($smaller);$smaller->add(1)) { |
|
65 | + for (;$larger->greaterThanOrEqualTo($smaller); $smaller->add(1)) { |
|
66 | 66 | $cumulative = $cumulative->add($this->pmf($smaller)); |
67 | 67 | } |
68 | 68 | |
@@ -96,7 +96,7 @@ discard block |
||
96 | 96 | |
97 | 97 | while ($p->lessThan($L)) { |
98 | 98 | $k = $k->add(1); |
99 | - $u = $randFactory->getMediumStrengthGenerator()->generateInt() / PHP_INT_MAX; |
|
99 | + $u = $randFactory->getMediumStrengthGenerator()->generateInt()/PHP_INT_MAX; |
|
100 | 100 | $p = $p->multiply($u); |
101 | 101 | } |
102 | 102 |
@@ -69,7 +69,7 @@ |
||
69 | 69 | |
70 | 70 | $t = Numbers::makeZero(); |
71 | 71 | |
72 | - for ($k = 0;$m->greaterThanOrEqualTo($k);$k++) { |
|
72 | + for ($k = 0; $m->greaterThanOrEqualTo($k); $k++) { |
|
73 | 73 | $kNum = Numbers::make(Numbers::IMMUTABLE, $k); |
74 | 74 | $combination = $m->factorial()->divide($kNum->factorial()->multiply($m->subtract($k)->factorial())); |
75 | 75 | $t = $t->add($combination->multiply(self::nthBernoulliNumber($k, $n))->divide($m->subtract($k)->add(1))); |