StatsProvider::binomialCoefficient() - Code Metrics - Inspection of "Adding badges to README.md" - JordanRL/Fermat - Measure and Improve Code Quality continuously with Scrutinizer

Passed
Pull Request — dev (#38)

by Jordan
created 2019-03-30 00:06 UTC
StatsProvider::binomialCoefficient() A

↳ Parent: StatsProvider
Complexity

Conditions	5
Paths	3
Size

Total Lines	23
Code Lines	13
Duplication

Lines	0
Ratio	0 %
Code Coverage

Tests	0
CRAP Score	30
Importance

Changes
Metric	Value
cc	5
eloc	13
nc	3
nop	2
dl	0
loc	23
ccs	0
cts	14
cp	0
crap	30
rs	9.5222
c	0
b	0
f	0
<?php

namespace Samsara\Fermat\Provider;

use Samsara\Exceptions\UsageError\IntegrityConstraint;
use Samsara\Exceptions\SystemError\LogicalError\IncompatibleObjectState;
use Samsara\Fermat\Numbers;
use Samsara\Fermat\Types\Base\NumberInterface;
use Samsara\Fermat\Types\Base\DecimalInterface;
use Samsara\Fermat\Types\Base\FractionInterface;
use Samsara\Fermat\Values\ImmutableNumber;

class StatsProvider
{

    /**
     * @param $x
     *
     * @return NumberInterface
     * @throws IntegrityConstraint
     */
    public static function normalCDF($x)
    {
        $x = Numbers::makeOrDont(Numbers::IMMUTABLE, $x);

        $pi = Numbers::makePi();
        $e = Numbers::makeE();
        $one = Numbers::makeOne();

        $eExponent = Numbers::make(Numbers::IMMUTABLE, $x->getValue());
        $eExponent = $eExponent->pow(2)->divide(2)->multiply(-1);

        $answer = Numbers::make(Numbers::IMMUTABLE, 0.5);
        $answer = $answer->add(
            $one->divide($pi->multiply(2)->sqrt())
            $one->divide($pi->multiply(2)->/** @scrutinizer ignore-call */ sqrt())
                ->multiply($e->pow($eExponent))
                ->multiply(SeriesProvider::maclaurinSeries(
                    $x,
                    function ($n) {
                    function (/** @scrutinizer ignore-unused */ $n) {
                        return Numbers::makeOne();
                    },
                    function ($n) {
                        return SequenceProvider::nthOddNumber($n);
                    },
                    function ($n) {
                        return SequenceProvider::nthOddNumber($n)->doubleFactorial();
                        return SequenceProvider::nthOddNumber($n)->/** @scrutinizer ignore-call */ doubleFactorial();
                    }
                ))
        );

        return $answer;

    }

    /**
     * @param $x
     *
     * @return DecimalInterface|NumberInterface
     * @throws IntegrityConstraint
     */
    public static function complementNormalCDF($x)
    {
        $p = self::normalCDF($x);
        $one = Numbers::makeOne();

        return $one->subtract($p);
    }

    /**
     * @param $x
     *
     * @return DecimalInterface|FractionInterface|NumberInterface|ImmutableNumber
     * @throws IntegrityConstraint
     */
    public static function gaussErrorFunction($x)
    {

        $x = Numbers::makeOrDont(Numbers::IMMUTABLE, $x);
        $answer = Numbers::makeOne();
        $pi = Numbers::makePi();

        $answer = $answer->multiply(2)->divide($pi->sqrt());
        $answer = $answer->multiply(2)->divide($pi->/** @scrutinizer ignore-call */ sqrt());

        $answer = $answer->multiply(
            SeriesProvider::maclaurinSeries(
                $x,
                function ($n) {
                    $negOne = Numbers::make(Numbers::IMMUTABLE, -1);

                    return $negOne->pow($n);
                    return $negOne->/** @scrutinizer ignore-call */ pow($n);
                },
                function ($n) {
                    return SequenceProvider::nthOddNumber($n);
                },
                function ($n) {
                    $n = Numbers::makeOrDont(Numbers::IMMUTABLE, $n);

                    return $n->factorial()->multiply(SequenceProvider::nthOddNumber($n));
                    return $n->/** @scrutinizer ignore-call */ factorial()->multiply(SequenceProvider::nthOddNumber($n));
                }
            )
        );

        return $answer;

    }

    /**
     * @param     $p
     * @param int $precision
     *
     * @return DecimalInterface|NumberInterface|ImmutableNumber
     * @throws IntegrityConstraint
     */
    public static function inverseNormalCDF($p, int $precision = 10)
    {
        $pi = Numbers::makePi();
        $r2pi = $pi->multiply(2)->sqrt();
        $r2pi = $pi->multiply(2)->/** @scrutinizer ignore-call */ sqrt();
        $e = Numbers::makeE();
        $p = Numbers::makeOrDont(Numbers::IMMUTABLE, $p);

        $continue = true;

        $xCur = Numbers::make(Numbers::IMMUTABLE, $p);

        while ($continue) {

            $cumulative = self::normalCDF($xCur);
            $dx = $cumulative->subtract($p)->divide(
                $r2pi->multiply(
                       multiply(
                    $e->pow(
                        $xCur->pow(2)
                    )->divide(-2)
                    )->/** @scrutinizer ignore-call */ divide(-2)
                )
            );
            $xCur = $xCur->subtract($dx);
            $xCur = $xCur->subtract($dx);

            if ($dx->numberOfLeadingZeros() > $precision) {
            if ($dx->/** @scrutinizer ignore-call */ numberOfLeadingZeros() > $precision) {
                $continue = false;
            }

        }

        if ($p->isLessThan(0.5)) {
            return $xCur->multiply(-1);
        } else {
            return $xCur;
        }
    }

    /**
     * @param $n
     * @param $k
     *
     * @return DecimalInterface|NumberInterface|ImmutableNumber
     * @throws IntegrityConstraint
     * @throws IncompatibleObjectState
     */
    public static function binomialCoefficient($n, $k)
    {

        $n = Numbers::makeOrDont(Numbers::IMMUTABLE, $n);
        $k = Numbers::makeOrDont(Numbers::IMMUTABLE, $k);

        if ($k->isLessThan(0) || $n->isLessThan($k)) {
            throw new IntegrityConstraint(
                '$k must be larger or equal to 0 and less than or equal to $n',
                'Provide valid $n and $k values such that 0 <= $k <= $n',
                'For $n choose $k, the values of $n and $k must satisfy the inequality 0 <= $k <= $n'
            );
        }

        if (!$n->isInt() || !$k->isInt()) {
        if (!$n->/** @scrutinizer ignore-call */ isInt() || !$k->isInt()) {
            throw new IntegrityConstraint(
                '$k and $n must be whole numbers',
                'Provide whole numbers for $n and $k',
                'For $n choose $k, the values $n and $k must be whole numbers'
            );
        }

        return $n->factorial()->divide($k->factorial()->multiply($n->subtract($k)->factorial()));
        return $n->factorial()->divide($k->factorial()->multiply($n->subtract($k)->/** @scrutinizer ignore-call */ factorial()));

    }

    /**
     * @param     $z
     * @param int $precision
     *
     * @return DecimalInterface|NumberInterface|ImmutableNumber
     * @throws IntegrityConstraint
     */
    public static function gammaFunction($z, int $precision = 10)
    {
        $z = Numbers::makeOrDont(Numbers::IMMUTABLE, $z);

        if ($z->isInt()) {
            if ($z->isNegative() || $z->isEqual(0)) {
                throw new IntegrityConstraint(
                    'Non-positive integers are not valid gamma function arguments',
                    'Do not provide non-positive integers to this function',
                    'The gamma function is not defined for zero or negative integers, but is continuous for all other values'
                );
            }
            return $z->subtract(1)->factorial();
        }

        $x = Numbers::makeZero();
        $e = Numbers::makeE();
        $gamma = Numbers::makeZero();

        $continue = true;

        while ($continue) {

            $adjustment = $x->pow(
                $z->subtract(1)
            )->multiply(
                $e->pow(
                    $x->multiply(-1)
                )
            );

            $gamma = $gamma->add($adjustment);

            if ($adjustment->numberOfLeadingZeros() > $precision) {
                $continue = false;
            }

        }

        return $gamma;
    }

}
JordanRL / Fermat

Pull Request — dev (#38)

StatsProvider::binomialCoefficient() A

Complexity

Size

Duplication

Code Coverage

Importance

Duplication Side-by-Side

Filter issues like
