<?php
/**
 * Orange Management
 *
 * PHP Version 7.4
 *
 * @package   tests
 * @copyright Dennis Eichhorn
 * @license   OMS License 1.0
 * @version   1.0.0
 * @link      https://orange-management.org
 */
declare(strict_types=1);

namespace phpOMS\tests\Math\Number;

use phpOMS\Math\Number\Integer;

/**
 * @testdox phpOMS\tests\Math\Number\IntegerTest: Integer operations
 *
 * @internal
 */
class IntegerTest extends \PHPUnit\Framework\TestCase
{
    /**
     * @testdox A value can be checked to be an integer
     * @covers phpOMS\Math\Number\Integer
     * @group framework
     */
    public function testIsInteger() : void
    {
        self::assertTrue(Integer::isInteger(4));
        self::assertFalse(Integer::isInteger(1.0));
        self::assertFalse(Integer::isInteger('3'));
    }

    /**
     * @testdox An integer can be factorized
     * @covers phpOMS\Math\Number\Integer
     * @group framework
     */
    public function testFactorization() : void
    {
        $arr      = [2, 2, 5, 5];
        $isSubset = true;
        $parent   = Integer::trialFactorization(100);
        foreach ($arr as $key => $value) {
            if (!isset($parent[$key]) || $parent[$key] !== $value) {
                $isSubset = false;
                break;
            }
        }
        self::assertTrue($isSubset);

        $arr      = [2];
        $isSubset = true;
        $parent   = Integer::trialFactorization(2);
        foreach ($arr as $key => $value) {
            if (!isset($parent[$key]) || $parent[$key] !== $value) {
                $isSubset = false;
                break;
            }
        }
        self::assertTrue($isSubset);

        self::assertEquals([], Integer::trialFactorization(1));
    }

    /**
     * @testdox The Pollard's Roh algorithm calculates a factor of an integer
     * @covers phpOMS\Math\Number\Integer
     * @group framework
     */
    public function testPollardsRho() : void
    {
        self::assertEquals(101, Integer::pollardsRho(10403, 2, 1, 2, 2));
    }

    /**
     * @testdox The Fermat factorization calculates a factor of an integer
     * @covers phpOMS\Math\Number\Integer
     * @group framework
     */
    public function testFermatFactor() : void
    {
        self::assertEquals([59, 101], Integer::fermatFactor(5959));
    }

    /**
     * @testdox A even number for the fermat factorization throws a InvalidArgumentException
     * @covers phpOMS\Math\Number\Integer
     * @group framework
     */
    public function testInvalidFermatParameter() : void
    {
        self::expectException(\InvalidArgumentException::class);

        Integer::fermatFactor(8);
    }

    /**
     * @testdox The greatest common divisor can be calculated
     * @covers phpOMS\Math\Number\Integer
     * @group framework
     */
    public function testGCD() : void
    {
        self::assertEquals(4, Integer::greatestCommonDivisor(4, 4));
        self::assertEquals(6, Integer::greatestCommonDivisor(54, 24));
        self::assertEquals(6, Integer::greatestCommonDivisor(24, 54));
        self::assertEquals(1, Integer::greatestCommonDivisor(7, 13));
    }
}