@@ -79,7 +79,7 @@ discard block |
||
| 79 | 79 | */ |
| 80 | 80 | public static function toBytes($size) |
| 81 | 81 | { |
| 82 | - $callback = function ($matches) { |
|
| 82 | + $callback = function($matches) { |
|
| 83 | 83 | $sizeMap = [ |
| 84 | 84 | '' => 0, |
| 85 | 85 | 'b' => 0, // 为了简化正则 |
@@ -93,7 +93,7 @@ discard block |
||
| 93 | 93 | return $matches[1] * pow(1024, $sizeMap[strtolower($matches[2])]); |
| 94 | 94 | }; |
| 95 | 95 | |
| 96 | - return (int) preg_replace_callback('/(\d*)\s*([a-z]?)b?/i', $callback, $size, 1); |
|
| 96 | + return (int)preg_replace_callback('/(\d*)\s*([a-z]?)b?/i', $callback, $size, 1); |
|
| 97 | 97 | } |
| 98 | 98 | |
| 99 | 99 | /** |
@@ -156,7 +156,7 @@ discard block |
||
| 156 | 156 | if ($toBaseInput == '0123456789') { |
| 157 | 157 | $retval = 0; |
| 158 | 158 | for ($i = 1; $i <= $numberLen; $i++) { |
| 159 | - $retval = bcadd($retval, bcmul((string) array_search($number[$i - 1], $fromBase), bcpow($fromLen, $numberLen - $i))); |
|
| 159 | + $retval = bcadd($retval, bcmul((string)array_search($number[$i - 1], $fromBase), bcpow($fromLen, $numberLen - $i))); |
|
| 160 | 160 | } |
| 161 | 161 | |
| 162 | 162 | return $retval; |
@@ -95,7 +95,7 @@ discard block |
||
| 95 | 95 | $arr = []; |
| 96 | 96 | for ($r = 0; $r < $row1; $r++) { |
| 97 | 97 | for ($c = 0; $c < $col2; $c++) { |
| 98 | - $arr[$r][$c] = array_sum(array_map(function ($a1, $a2) { |
|
| 98 | + $arr[$r][$c] = array_sum(array_map(function($a1, $a2) { |
|
| 99 | 99 | return $a1 * $a2; |
| 100 | 100 | }, $array1[$r], Arrays::column($array2, $c))); |
| 101 | 101 | } |
@@ -144,7 +144,7 @@ discard block |
||
| 144 | 144 | public static function multinomial($number1) |
| 145 | 145 | { |
| 146 | 146 | $numbers = is_array($number1) ? $number1 : func_get_args(); |
| 147 | - return self::fact(array_sum($numbers)) / array_product(array_map(function ($num) { |
|
| 147 | + return self::fact(array_sum($numbers)) / array_product(array_map(function($num) { |
|
| 148 | 148 | return self::fact($num); |
| 149 | 149 | }, $numbers)); |
| 150 | 150 | } |
@@ -26,6 +26,6 @@ |
||
| 26 | 26 | if ($number % 2 == 0) { |
| 27 | 27 | $number += 1; |
| 28 | 28 | } |
| 29 | - return (int) $number; |
|
| 29 | + return (int)$number; |
|
| 30 | 30 | } |
| 31 | 31 | } |
@@ -24,7 +24,7 @@ discard block |
||
| 24 | 24 | */ |
| 25 | 25 | public static function fact($number) |
| 26 | 26 | { |
| 27 | - $number = (int) floor($number); |
|
| 27 | + $number = (int)floor($number); |
|
| 28 | 28 | if ($number == 0) { |
| 29 | 29 | return 1; |
| 30 | 30 | } |
@@ -52,7 +52,7 @@ discard block |
||
| 52 | 52 | } |
| 53 | 53 | $result = 1; |
| 54 | 54 | $isEven = $number % 2 == 0; |
| 55 | - foreach (Arrays::rangeGenerator($isEven ? 2 : 1, (int) $number, 2) as $num) { |
|
| 55 | + foreach (Arrays::rangeGenerator($isEven ? 2 : 1, (int)$number, 2) as $num) { |
|
| 56 | 56 | $result *= $num; |
| 57 | 57 | } |
| 58 | 58 | return $result; |
@@ -26,7 +26,7 @@ |
||
| 26 | 26 | if ($number % 2 == 1) { |
| 27 | 27 | $number += 1; |
| 28 | 28 | } |
| 29 | - return (int) $number; |
|
| 29 | + return (int)$number; |
|
| 30 | 30 | } |
| 31 | 31 | |
| 32 | 32 | /** |
@@ -32,7 +32,7 @@ discard block |
||
| 32 | 32 | */ |
| 33 | 33 | public static function rand() |
| 34 | 34 | { |
| 35 | - return mt_rand(0, (int) self::power(10, 10)) / self::power(10, 10); |
|
| 35 | + return mt_rand(0, (int)self::power(10, 10)) / self::power(10, 10); |
|
| 36 | 36 | } |
| 37 | 37 | |
| 38 | 38 | /** |
@@ -48,11 +48,11 @@ discard block |
||
| 48 | 48 | */ |
| 49 | 49 | public static function randarray($row = 1, $col = 1, $min = 0, $max = null, $isInt = false) |
| 50 | 50 | { |
| 51 | - null === $max && $max = (int) pow(10, 10); |
|
| 51 | + null === $max && $max = (int)pow(10, 10); |
|
| 52 | 52 | $array = []; |
| 53 | 53 | for ($i = 0; $i < $row; $i++) { |
| 54 | 54 | for ($j = 0; $j < $col; $j++) { |
| 55 | - $array[$i][$j] = mt_rand($min, $max) + ($isInt ? 0 : mt_rand(0, (int) pow(10, 10)) / pow(10, 10)); |
|
| 55 | + $array[$i][$j] = mt_rand($min, $max) + ($isInt ? 0 : mt_rand(0, (int)pow(10, 10)) / pow(10, 10)); |
|
| 56 | 56 | } |
| 57 | 57 | } |
| 58 | 58 | return $array; |
@@ -79,7 +79,7 @@ discard block |
||
| 79 | 79 | $k = 1; |
| 80 | 80 | for ($i = 0; $i < $row; $i++) { |
| 81 | 81 | for ($j = 0; $j < $col; $j++) { |
| 82 | - $array[$i][$j] = $start + ($k++ - 1) * $step; |
|
| 82 | + $array[$i][$j] = $start + ($k++ -1) * $step; |
|
| 83 | 83 | } |
| 84 | 84 | } |
| 85 | 85 | return $array; |
@@ -216,7 +216,7 @@ discard block |
||
| 216 | 216 | array_push($arr[$i], $array[$i]); |
| 217 | 217 | } |
| 218 | 218 | } |
| 219 | - return array_sum(array_map(function ($rows) { |
|
| 219 | + return array_sum(array_map(function($rows) { |
|
| 220 | 220 | return array_product($rows); |
| 221 | 221 | }, $arr)); |
| 222 | 222 | } |
@@ -231,7 +231,7 @@ discard block |
||
| 231 | 231 | public static function sumsq($number1) |
| 232 | 232 | { |
| 233 | 233 | $numbers = is_array($number1) ? $number1 : func_get_args(); |
| 234 | - return array_sum(array_map(function ($num) { |
|
| 234 | + return array_sum(array_map(function($num) { |
|
| 235 | 235 | return $num * $num; |
| 236 | 236 | }, $numbers)); |
| 237 | 237 | } |
@@ -23,6 +23,6 @@ |
||
| 23 | 23 | */ |
| 24 | 24 | public static function quotient($numberator, $denominator) |
| 25 | 25 | { |
| 26 | - return (int) ($numberator / $denominator); |
|
| 26 | + return (int)($numberator / $denominator); |
|
| 27 | 27 | } |
| 28 | 28 | } |