GreatestCommonDivisor() [2/2]

static BigInteger System.Numerics.BigInteger.GreatestCommonDivisor ( uint[] leftBits, uint[] rightBits )

inlinestaticprivate

Definition at line 778 of file BigInteger.cs.

    {
        if (rightBits.Length == 1)
        {
            uint right = BigIntegerCalculator.Remainder(leftBits, rightBits[0]);
            return BigIntegerCalculator.Gcd(rightBits[0], right);
        }
        if (rightBits.Length == 2)
        {
            uint[] array = BigIntegerCalculator.Remainder(leftBits, rightBits);
            ulong left = ((ulong)rightBits[1] << 32) | rightBits[0];
            ulong right2 = ((ulong)array[1] << 32) | array[0];
            return BigIntegerCalculator.Gcd(left, right2);
        }
        uint[] array2 = BigIntegerCalculator.Gcd(leftBits, rightBits);
        return new BigInteger(array2, array2, negative: false);
    }

References System.Numerics.BigInteger.BigInteger(), System.array, System.Numerics.BigIntegerCalculator.Gcd(), and System.Numerics.BigIntegerCalculator.Remainder().