@@ -49,7 +49,7 @@ discard block |
||
| 49 | 49 | |
| 50 | 50 | $this->base = $base; |
| 51 | 51 | |
| 52 | - $value = $value instanceof NumberInterface ? $value->getValue(NumberBase::Ten) : (string)$value; |
|
| 52 | + $value = $value instanceof NumberInterface ? $value->getValue(NumberBase::Ten) : (string) $value; |
|
| 53 | 53 | |
| 54 | 54 | if (str_contains($value, 'i')) { |
| 55 | 55 | $this->imaginary = true; |
@@ -107,14 +107,14 @@ discard block |
||
| 107 | 107 | if ($exp > 0) { |
| 108 | 108 | $exp -= strlen($right); |
| 109 | 109 | if ($exp >= 0) { |
| 110 | - $right = str_pad($right, $exp - 1, '0').'.0'; |
|
| 110 | + $right = str_pad($right, $exp-1, '0').'.0'; |
|
| 111 | 111 | } else { |
| 112 | - $right = substr($right, 0, strlen($right) + abs($exp)).'.'.substr($right, strlen($right) + abs($exp) + 1); |
|
| 112 | + $right = substr($right, 0, strlen($right)+abs($exp)).'.'.substr($right, strlen($right)+abs($exp)+1); |
|
| 113 | 113 | } |
| 114 | 114 | } else { |
| 115 | 115 | $exp += strlen($left); |
| 116 | 116 | if ($exp >= 0) { |
| 117 | - $left = substr($left, 0, $exp).'.'.substr($left, $exp + 1); |
|
| 117 | + $left = substr($left, 0, $exp).'.'.substr($left, $exp+1); |
|
| 118 | 118 | } else { |
| 119 | 119 | $left = '0.'.str_pad($left, abs($exp)+1, '0', STR_PAD_LEFT); |
| 120 | 120 | } |
@@ -259,7 +259,7 @@ discard block |
||
| 259 | 259 | * @param NumberBase $base |
| 260 | 260 | * @return DecimalInterface|NumberInterface |
| 261 | 261 | */ |
| 262 | - public function setBase(NumberBase $base): DecimalInterface|NumberInterface |
|
| 262 | + public function setBase(NumberBase $base): DecimalInterface | NumberInterface |
|
| 263 | 263 | { |
| 264 | 264 | $this->base = $base; |
| 265 | 265 | |
@@ -271,7 +271,7 @@ discard block |
||
| 271 | 271 | * |
| 272 | 272 | * @return DecimalInterface|NumberInterface |
| 273 | 273 | */ |
| 274 | - public function abs(): DecimalInterface|NumberInterface |
|
| 274 | + public function abs(): DecimalInterface | NumberInterface |
|
| 275 | 275 | { |
| 276 | 276 | $newValue = $this->absValue(); |
| 277 | 277 | |
@@ -282,7 +282,7 @@ discard block |
||
| 282 | 282 | * @param DecimalInterface $num |
| 283 | 283 | * @return float|int |
| 284 | 284 | */ |
| 285 | - protected static function translateToNative(DecimalInterface $num): float|int |
|
| 285 | + protected static function translateToNative(DecimalInterface $num): float | int |
|
| 286 | 286 | { |
| 287 | 287 | return ($num->isInt() ? $num->asInt() : $num->asFloat()); |
| 288 | 288 | } |
@@ -341,7 +341,7 @@ discard block |
||
| 341 | 341 | * @param NumberInterface|string|int|float $mod |
| 342 | 342 | * @return DecimalInterface |
| 343 | 343 | */ |
| 344 | - abstract public function continuousModulo(NumberInterface|string|int|float $mod): DecimalInterface; |
|
| 344 | + abstract public function continuousModulo(NumberInterface | string | int | float $mod): DecimalInterface; |
|
| 345 | 345 | |
| 346 | 346 | /** |
| 347 | 347 | * @param string $decimalPart |
@@ -105,8 +105,8 @@ |
||
| 105 | 105 | $runningTotal = Numbers::make(Numbers::IMMUTABLE, $startVal->getAsBaseTenRealNumber()); |
| 106 | 106 | while ($runningTotal->isGreaterThan(0)) { |
| 107 | 107 | $current = gmp_div_qr($runningTotal->getAsBaseTenRealNumber(), $baseNum->getAsBaseTenRealNumber()); |
| 108 | - $mod = (int)$current[1]; |
|
| 109 | - $stringVal = self::$chars[$mod] . $stringVal; |
|
| 108 | + $mod = (int) $current[1]; |
|
| 109 | + $stringVal = self::$chars[$mod].$stringVal; |
|
| 110 | 110 | $runningTotal = Numbers::make(Numbers::IMMUTABLE, $current[0]); |
| 111 | 111 | } |
| 112 | 112 | } else { |
@@ -114,7 +114,7 @@ discard block |
||
| 114 | 114 | * @return ImmutableDecimal|MutableDecimal|NumberInterface|ImmutableDecimal[]|MutableDecimal[]|NumberInterface[] |
| 115 | 115 | * @throws IntegrityConstraint |
| 116 | 116 | */ |
| 117 | - public static function makeOrDont(string|object $type, mixed $value, ?int $scale = null, NumberBase $base = NumberBase::Ten) |
|
| 117 | + public static function makeOrDont(string | object $type, mixed $value, ?int $scale = null, NumberBase $base = NumberBase::Ten) |
|
| 118 | 118 | {
|
| 119 | 119 | |
| 120 | 120 | if (is_object($value)) {
|
@@ -236,7 +236,7 @@ discard block |
||
| 236 | 236 | } |
| 237 | 237 | |
| 238 | 238 | if ($scale > 100) {
|
| 239 | - $pi = self::make(self::IMMUTABLE, ConstantProvider::makePi($scale+2), $scale + 2); |
|
| 239 | + $pi = self::make(self::IMMUTABLE, ConstantProvider::makePi($scale+2), $scale+2); |
|
| 240 | 240 | /** @var ImmutableDecimal */ |
| 241 | 241 | return $pi->multiply(2)->truncateToScale($scale); |
| 242 | 242 | } |
@@ -147,7 +147,7 @@ discard block |
||
| 147 | 147 | $total = strlen($fractional); |
| 148 | 148 | $fractional = ltrim($fractional, '0'); |
| 149 | 149 | |
| 150 | - return ($total - strlen($fractional)); |
|
| 150 | + return ($total-strlen($fractional)); |
|
| 151 | 151 | } |
| 152 | 152 | |
| 153 | 153 | /** |
@@ -157,7 +157,7 @@ discard block |
||
| 157 | 157 | */ |
| 158 | 158 | public function numberOfTotalDigits(): int |
| 159 | 159 | { |
| 160 | - return $this->numberOfDecimalDigits() + $this->numberOfIntDigits(); |
|
| 160 | + return $this->numberOfDecimalDigits()+$this->numberOfIntDigits(); |
|
| 161 | 161 | } |
| 162 | 162 | |
| 163 | 163 | /** |
@@ -220,7 +220,7 @@ discard block |
||
| 220 | 220 | public function isFloat(): bool |
| 221 | 221 | { |
| 222 | 222 | |
| 223 | - return (bool)ArithmeticProvider::compare($this->getDecimalPart(), '0'); |
|
| 223 | + return (bool) ArithmeticProvider::compare($this->getDecimalPart(), '0'); |
|
| 224 | 224 | |
| 225 | 225 | } |
| 226 | 226 | |
@@ -229,7 +229,7 @@ discard block |
||
| 229 | 229 | */ |
| 230 | 230 | public function asFloat(): float |
| 231 | 231 | { |
| 232 | - return (float)$this->asReal(); |
|
| 232 | + return (float) $this->asReal(); |
|
| 233 | 233 | } |
| 234 | 234 | |
| 235 | 235 | /** |
@@ -53,7 +53,7 @@ discard block |
||
| 53 | 53 | $curVal = $this->getValue(NumberBase::Ten); |
| 54 | 54 | $calcVal = Numbers::make(Numbers::IMMUTABLE, 1); |
| 55 | 55 | |
| 56 | - for ($i = 1;$i <= $curVal;$i++) { |
|
| 56 | + for ($i = 1; $i <= $curVal; $i++) { |
|
| 57 | 57 | $calcVal = $calcVal->multiply($i); |
| 58 | 58 | } |
| 59 | 59 | |
@@ -247,7 +247,7 @@ discard block |
||
| 247 | 247 | } |
| 248 | 248 | |
| 249 | 249 | if (function_exists('gmp_prob_prime') && $this->extensions) { |
| 250 | - return (bool)gmp_prob_prime($this->getValue(NumberBase::Ten), $certainty); |
|
| 250 | + return (bool) gmp_prob_prime($this->getValue(NumberBase::Ten), $certainty); |
|
| 251 | 251 | } |
| 252 | 252 | |
| 253 | 253 | $thisNum = Numbers::makeOrDont(Numbers::IMMUTABLE, $this, $this->getScale()); |
@@ -263,15 +263,15 @@ discard block |
||
| 263 | 263 | |
| 264 | 264 | $r = $r->subtract(1); |
| 265 | 265 | |
| 266 | - for ($i = 0;$i < $certainty;$i++) { |
|
| 266 | + for ($i = 0; $i < $certainty; $i++) { |
|
| 267 | 267 | $a = RandomProvider::randomInt(2, $s, RandomMode::Speed); |
| 268 | - $x = Numbers::make(Numbers::IMMUTABLE, (string)gmp_powm($a->getAsBaseTenRealNumber(), $d->getAsBaseTenRealNumber(), $thisNum->getAsBaseTenRealNumber())); |
|
| 268 | + $x = Numbers::make(Numbers::IMMUTABLE, (string) gmp_powm($a->getAsBaseTenRealNumber(), $d->getAsBaseTenRealNumber(), $thisNum->getAsBaseTenRealNumber())); |
|
| 269 | 269 | |
| 270 | 270 | if ($x->isEqual(1) || $x->isEqual($s)) { |
| 271 | 271 | continue; |
| 272 | 272 | } |
| 273 | 273 | |
| 274 | - for ($j = 0;$j < $r->asInt();$j++) { |
|
| 274 | + for ($j = 0; $j < $r->asInt(); $j++) { |
|
| 275 | 275 | $x = $x->pow(2)->modulo($thisNum); |
| 276 | 276 | if ($x->isEqual($s)) { |
| 277 | 277 | continue 2; |
@@ -87,7 +87,7 @@ |
||
| 87 | 87 | $thisNum = Numbers::make(Numbers::IMMUTABLE, $this->getValue(NumberBase::Ten), $scale); |
| 88 | 88 | $thatNum = Numbers::make(Numbers::IMMUTABLE, $num->getValue(NumberBase::Ten), $scale); |
| 89 | 89 | $exponent = $thatNum->multiply($thisNum->ln($scale)); |
| 90 | - return $exponent->exp($scale)->truncateToScale($scale - 2)->getValue(NumberBase::Ten); |
|
| 90 | + return $exponent->exp($scale)->truncateToScale($scale-2)->getValue(NumberBase::Ten); |
|
| 91 | 91 | } |
| 92 | 92 | |
| 93 | 93 | return ArithmeticProvider::pow($this->asReal(), $num->asReal(), $scale+1); |
@@ -38,8 +38,8 @@ discard block |
||
| 38 | 38 | |
| 39 | 39 | $thisNum = Numbers::make(Numbers::IMMUTABLE, $this->getValue(NumberBase::Ten), $modScale); |
| 40 | 40 | |
| 41 | - $twoPi = Numbers::make2Pi($modScale + 2); |
|
| 42 | - $pi = Numbers::makePi( $scale + 2 ); |
|
| 41 | + $twoPi = Numbers::make2Pi($modScale+2); |
|
| 42 | + $pi = Numbers::makePi($scale+2); |
|
| 43 | 43 | |
| 44 | 44 | if ($pi->truncate($scale)->isEqual($thisNum->truncate($scale)) || $twoPi->truncate($scale)->isEqual($thisNum->truncate($scale))) { |
| 45 | 45 | return '0'; |
@@ -51,14 +51,14 @@ discard block |
||
| 51 | 51 | |
| 52 | 52 | $answer = SeriesProvider::maclaurinSeries( |
| 53 | 53 | $modulo, |
| 54 | - function ($n) use ($scale, $negOne, $one) { |
|
| 54 | + function($n) use ($scale, $negOne, $one) { |
|
| 55 | 55 | |
| 56 | - return $n % 2 ? $negOne : $one; |
|
| 56 | + return $n%2 ? $negOne : $one; |
|
| 57 | 57 | }, |
| 58 | - function ($n) { |
|
| 58 | + function($n) { |
|
| 59 | 59 | return SequenceProvider::nthOddNumber($n); |
| 60 | 60 | }, |
| 61 | - function ($n) { |
|
| 61 | + function($n) { |
|
| 62 | 62 | return SequenceProvider::nthOddNumber($n)->factorial(); |
| 63 | 63 | }, |
| 64 | 64 | 0, |
@@ -88,8 +88,8 @@ discard block |
||
| 88 | 88 | |
| 89 | 89 | $thisNum = Numbers::make(Numbers::IMMUTABLE, $this->getValue(NumberBase::Ten), $modScale); |
| 90 | 90 | |
| 91 | - $twoPi = Numbers::make2Pi($modScale + 2); |
|
| 92 | - $pi = Numbers::makePi( $intScale ); |
|
| 91 | + $twoPi = Numbers::make2Pi($modScale+2); |
|
| 92 | + $pi = Numbers::makePi($intScale); |
|
| 93 | 93 | |
| 94 | 94 | if ($twoPi->truncate($scale)->isEqual($thisNum->truncate($scale))) { |
| 95 | 95 | return '1'; |
@@ -105,14 +105,14 @@ discard block |
||
| 105 | 105 | |
| 106 | 106 | $answer = SeriesProvider::maclaurinSeries( |
| 107 | 107 | $modulo, |
| 108 | - function ($n) use ($negOne, $one) { |
|
| 108 | + function($n) use ($negOne, $one) { |
|
| 109 | 109 | |
| 110 | - return $n % 2 ? $negOne : $one; |
|
| 110 | + return $n%2 ? $negOne : $one; |
|
| 111 | 111 | }, |
| 112 | - function ($n) use ($intScale) { |
|
| 112 | + function($n) use ($intScale) { |
|
| 113 | 113 | return SequenceProvider::nthEvenNumber($n, $intScale); |
| 114 | 114 | }, |
| 115 | - function ($n) use ($intScale) { |
|
| 115 | + function($n) use ($intScale) { |
|
| 116 | 116 | return SequenceProvider::nthEvenNumber($n, $intScale)->factorial(); |
| 117 | 117 | }, |
| 118 | 118 | 0, |
@@ -131,7 +131,7 @@ discard block |
||
| 131 | 131 | protected function tanScale(int $scale = null): string |
| 132 | 132 | { |
| 133 | 133 | $scale = $scale ?? $this->getScale(); |
| 134 | - $intScale = $scale + 4; |
|
| 134 | + $intScale = $scale+4; |
|
| 135 | 135 | if (extension_loaded('decimal')) { |
| 136 | 136 | $intScale = $intScale+$this->numberOfIntDigits(); |
| 137 | 137 | } |
@@ -279,7 +279,7 @@ discard block |
||
| 279 | 279 | |
| 280 | 280 | if ($mod2Pi->isEqual(0)) { |
| 281 | 281 | return static::INFINITY; |
| 282 | - } elseif($modPi->isEqual(0)) { |
|
| 282 | + } elseif ($modPi->isEqual(0)) { |
|
| 283 | 283 | return static::NEG_INFINITY; |
| 284 | 284 | } |
| 285 | 285 | |