mirror of
https://github.com/Karaka-Management/phpOMS.git
synced 2026-01-11 17:58:41 +00:00
321 lines
6.3 KiB
PHP
321 lines
6.3 KiB
PHP
<?php
|
|
/**
|
|
* Orange Management
|
|
*
|
|
* PHP Version 7.2
|
|
*
|
|
* @package phpOMS\Math\Functions
|
|
* @copyright Dennis Eichhorn
|
|
* @license OMS License 1.0
|
|
* @version 1.0.0
|
|
* @link https://orange-management.org
|
|
*/
|
|
declare(strict_types=1);
|
|
|
|
namespace phpOMS\Math\Functions;
|
|
|
|
/**
|
|
* Well known functions and helpers class.
|
|
*
|
|
* @package phpOMS\Math\Functions
|
|
* @license OMS License 1.0
|
|
* @link https://orange-management.org
|
|
* @since 1.0.0
|
|
*/
|
|
final class Functions
|
|
{
|
|
/**
|
|
* Constructor.
|
|
*
|
|
* @since 1.0.0
|
|
* @codeCoverageIgnore
|
|
*/
|
|
private function __construct()
|
|
{
|
|
|
|
}
|
|
|
|
/**
|
|
* Calculate gammar function value.
|
|
*
|
|
* Example: (7, 2)
|
|
*
|
|
* @param int $n Factorial upper bound
|
|
* @param int $start Factorial starting value
|
|
*
|
|
* @return int
|
|
*
|
|
* @since 1.0.0
|
|
*/
|
|
public static function fact(int $n, int $start = 1) : int
|
|
{
|
|
$fact = 1;
|
|
|
|
for ($i = $start; $i < $n + 1; ++$i) {
|
|
$fact *= $i;
|
|
}
|
|
|
|
return $fact;
|
|
}
|
|
|
|
/**
|
|
* Calculate binomial coefficient
|
|
*
|
|
* Algorithm optimized for large factorials without the use of big int or string manipulation.
|
|
*
|
|
* Example: (7, 2)
|
|
*
|
|
* @param int $n n
|
|
* @param int $k k
|
|
*
|
|
* @return int
|
|
*
|
|
* @since 1.0.0
|
|
*/
|
|
public static function binomialCoefficient(int $n, int $k) : int
|
|
{
|
|
$max = \max([$k, $n - $k]);
|
|
$min = \min([$k, $n - $k]);
|
|
|
|
$fact = 1;
|
|
$range = \array_reverse(\range(1, $min));
|
|
|
|
for ($i = $max + 1; $i < $n + 1; ++$i) {
|
|
$div = 1;
|
|
foreach ($range as $key => $d) {
|
|
if ($i % $d === 0) {
|
|
$div = $d;
|
|
|
|
unset($range[$key]);
|
|
break;
|
|
}
|
|
}
|
|
|
|
$fact *= $i / $div;
|
|
}
|
|
|
|
$fact2 = 1;
|
|
|
|
foreach ($range as $d) {
|
|
$fact2 *= $d;
|
|
}
|
|
|
|
return (int) ($fact / $fact2);
|
|
}
|
|
|
|
/**
|
|
* Calculate ackermann function.
|
|
*
|
|
* @param int $m m
|
|
* @param int $n n
|
|
*
|
|
* @return int
|
|
*
|
|
* @since 1.0.0
|
|
*/
|
|
public static function ackermann(int $m, int $n) : int
|
|
{
|
|
if ($m === 0) {
|
|
return $n + 1;
|
|
} elseif ($n === 0) {
|
|
return self::ackermann($m - 1, 1);
|
|
}
|
|
|
|
return self::ackermann($m - 1, self::ackermann($m, $n - 1));
|
|
}
|
|
|
|
/**
|
|
* Applying abs to every array value
|
|
*
|
|
* @param array<float|int> $values Numeric values
|
|
*
|
|
* @return array<float|int>
|
|
*
|
|
* @since 1.0.0
|
|
*/
|
|
public static function abs(array $values) : array
|
|
{
|
|
$abs = [];
|
|
|
|
foreach ($values as $value) {
|
|
$abs[] = \abs($value);
|
|
}
|
|
|
|
return $abs;
|
|
}
|
|
|
|
/**
|
|
* Calculate inverse modular.
|
|
*
|
|
* @param int $a a
|
|
* @param int $n Modulo
|
|
*
|
|
* @return int
|
|
*
|
|
* @since 1.0.0
|
|
*/
|
|
public static function invMod(int $a, int $n) : int
|
|
{
|
|
if ($n < 0) {
|
|
$n = -$n;
|
|
}
|
|
|
|
if ($a < 0) {
|
|
$a = $n - (-$a % $n);
|
|
}
|
|
|
|
$t = 0;
|
|
$nt = 1;
|
|
$r = $n;
|
|
$nr = $a % $n;
|
|
|
|
while ($nr != 0) {
|
|
$quot = (int) ($r / $nr);
|
|
$tmp = $nt;
|
|
$nt = $t - $quot * $nt;
|
|
$t = $tmp;
|
|
$tmp = $nr;
|
|
$nr = $r - $quot * $nr;
|
|
$r = $tmp;
|
|
}
|
|
|
|
if ($r > 1) {
|
|
return -1;
|
|
}
|
|
|
|
if ($t < 0) {
|
|
$t += $n;
|
|
}
|
|
|
|
return $t;
|
|
}
|
|
|
|
/**
|
|
* Modular implementation for negative values.
|
|
*
|
|
* @param int $a a
|
|
* @param int $b b
|
|
*
|
|
* @return int
|
|
*
|
|
* @since 1.0.0
|
|
*/
|
|
public static function mod($a, $b) : int
|
|
{
|
|
if ($a < 0) {
|
|
return ($a + $b) % $b;
|
|
}
|
|
|
|
return $a % $b;
|
|
}
|
|
|
|
/**
|
|
* Check if value is odd.
|
|
*
|
|
* @param int $a Value to test
|
|
*
|
|
* @return bool
|
|
*
|
|
* @since 1.0.0
|
|
*/
|
|
public static function isOdd($a) : bool
|
|
{
|
|
return (bool) ($a & 1);
|
|
}
|
|
|
|
/**
|
|
* Check if value is even.
|
|
*
|
|
* @param int $a Value to test
|
|
*
|
|
* @return bool
|
|
*
|
|
* @since 1.0.0
|
|
*/
|
|
public static function isEven($a) : bool
|
|
{
|
|
return !((bool) ($a & 1));
|
|
}
|
|
|
|
/**
|
|
* Power all values in array.
|
|
*
|
|
* @param array<float|int> $values Values to square
|
|
* @param float $exp Exponent
|
|
*
|
|
* @return array<float>
|
|
*
|
|
* @since 1.0.0
|
|
*/
|
|
public static function powerFloat(array $values, float $exp = 2.0) : array
|
|
{
|
|
$squared = [];
|
|
|
|
foreach ($values as $value) {
|
|
$squared[] = $value ** $exp;
|
|
}
|
|
|
|
return $squared;
|
|
}
|
|
|
|
/**
|
|
* Power all values in array.
|
|
*
|
|
* @param array<float|int> $values Values to square
|
|
* @param int $exp Exponent
|
|
*
|
|
* @return array<float|int>
|
|
*
|
|
* @since 1.0.0
|
|
*/
|
|
public static function powerInt(array $values, int $exp = 2) : array
|
|
{
|
|
$squared = [];
|
|
|
|
foreach ($values as $value) {
|
|
$squared[] = $value ** $exp;
|
|
}
|
|
|
|
return $squared;
|
|
}
|
|
|
|
/**
|
|
* Sqrt all values in array.
|
|
*
|
|
* @param array<float|int> $values Values to sqrt
|
|
*
|
|
* @return array<float|int>
|
|
*
|
|
* @since 1.0.0
|
|
*/
|
|
public static function sqrt(array $values) : array
|
|
{
|
|
$squared = [];
|
|
|
|
foreach ($values as $value) {
|
|
$squared[] = \sqrt($value);
|
|
}
|
|
|
|
return $squared;
|
|
}
|
|
|
|
/**
|
|
* Gets the relative position on a circular construct.
|
|
*
|
|
* @example The relative fiscal month (August) in a company where the fiscal year starts in July.
|
|
* @example 2 = getRelativeDegree(8, 12, 7);
|
|
*
|
|
* @param int $value Value to get degree
|
|
* @param int $length Circle size
|
|
* @param int $start Start value
|
|
*
|
|
* @return int Lowest value is 0 and highest value is length - 1
|
|
*
|
|
* @since 1.0.0
|
|
*/
|
|
public static function getRelativeDegree(int $value, int $length, int $start = 0) : int
|
|
{
|
|
return \abs(self::mod($value - $start, $length));
|
|
}
|
|
}
|