edu.jas.ufd

Class GCDFactory

java.lang.Object

edu.jas.ufd.GCDFactory

public class GCDFactory
extends java.lang.Object

Greatest common divisor algorithms factory. Select appropriate GCD engine based on the coefficient types.

See Also:

Todo: Base decision also on degree vectors and number of variables of polynomials. Incorporate also number of CPUs / threads available (done with GCDProxy).

Method Summary

Modifier and Type	Method and Description
static GreatestCommonDivisorAbstract<BigInteger>	getImplementation(BigInteger fac) Determine suitable implementation of gcd algorithms, case BigInteger.
static GreatestCommonDivisorAbstract<BigRational>	getImplementation(BigRational fac) Determine suitable implementation of gcd algorithms, case BigRational.
static GreatestCommonDivisorAbstract<ModInteger>	getImplementation(ModIntegerRing fac) Determine suitable implementation of gcd algorithms, case ModInteger.
static GreatestCommonDivisorAbstract<ModLong>	getImplementation(ModLongRing fac) Determine suitable implementation of gcd algorithms, case ModLong.
static <C extends GcdRingElem<C>> GreatestCommonDivisorAbstract<C>	getImplementation(RingFactory<C> fac) Determine suitable implementation of gcd algorithms, other cases.
static GreatestCommonDivisorAbstract<BigInteger>	getProxy(BigInteger fac) Determine suitable procy for gcd algorithms, case BigInteger.
static GreatestCommonDivisorAbstract<BigRational>	getProxy(BigRational fac) Determine suitable proxy for gcd algorithms, case BigRational.
static GreatestCommonDivisorAbstract<ModInteger>	getProxy(ModIntegerRing fac) Determine suitable proxy for gcd algorithms, case ModInteger.
static GreatestCommonDivisorAbstract<ModLong>	getProxy(ModLongRing fac) Determine suitable proxy for gcd algorithms, case ModLong.
static <C extends GcdRingElem<C>> GreatestCommonDivisorAbstract<C>	getProxy(RingFactory<C> fac) Determine suitable proxy for gcd algorithms, other cases.

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Method Detail

getImplementation

public static GreatestCommonDivisorAbstract<ModLong> getImplementation(ModLongRing fac)

Determine suitable implementation of gcd algorithms, case ModLong.

Parameters:

fac - ModLongRing.

Returns:

gcd algorithm implementation.

getProxy

public static GreatestCommonDivisorAbstract<ModLong> getProxy(ModLongRing fac)

Determine suitable proxy for gcd algorithms, case ModLong.

Parameters:

fac - ModLongRing.

Returns:

gcd algorithm implementation.

getImplementation

public static GreatestCommonDivisorAbstract<ModInteger> getImplementation(ModIntegerRing fac)

Determine suitable implementation of gcd algorithms, case ModInteger.

Parameters:

fac - ModIntegerRing.

Returns:

gcd algorithm implementation.

getProxy

public static GreatestCommonDivisorAbstract<ModInteger> getProxy(ModIntegerRing fac)

Determine suitable proxy for gcd algorithms, case ModInteger.

Parameters:

fac - ModIntegerRing.

Returns:

gcd algorithm implementation.

getImplementation

public static GreatestCommonDivisorAbstract<BigInteger> getImplementation(BigInteger fac)

Determine suitable implementation of gcd algorithms, case BigInteger.

Parameters:

fac - BigInteger.

Returns:

gcd algorithm implementation.

getProxy

public static GreatestCommonDivisorAbstract<BigInteger> getProxy(BigInteger fac)

Determine suitable procy for gcd algorithms, case BigInteger.

Parameters:

fac - BigInteger.

Returns:

gcd algorithm implementation.

getImplementation

public static GreatestCommonDivisorAbstract<BigRational> getImplementation(BigRational fac)

Determine suitable implementation of gcd algorithms, case BigRational.

Parameters:

fac - BigRational.

Returns:

gcd algorithm implementation.

getProxy

public static GreatestCommonDivisorAbstract<BigRational> getProxy(BigRational fac)

Determine suitable proxy for gcd algorithms, case BigRational.

Parameters:

fac - BigRational.

Returns:

gcd algorithm implementation.

getImplementation

public static <C extends GcdRingElem<C>> GreatestCommonDivisorAbstract<C> getImplementation(RingFactory<C> fac)

Determine suitable implementation of gcd algorithms, other cases.

Parameters:

fac - RingFactory<C>.

Returns:

gcd algorithm implementation.

getProxy

public static <C extends GcdRingElem<C>> GreatestCommonDivisorAbstract<C> getProxy(RingFactory<C> fac)

Determine suitable proxy for gcd algorithms, other cases.

Parameters:

fac - RingFactory<C>.

Returns:

gcd algorithm implementation. Note: This method contains a hack for Google app engine to not use threads.

See Also:

ComputerThreads.NO_THREADS