SquarefreeFactory
edu.jas.ufd

Class SquarefreeFactory

    • Method Detail

      • getImplementation

        public static SquarefreeAbstract<ModInteger> getImplementation(ModIntegerRing fac)
        Determine suitable implementation of factorization algorithm, case ModInteger.
        Parameters:
        fac - ModIntegerRing.
        Returns:
        squarefree factorization algorithm implementation.
      • getImplementation

        public static SquarefreeAbstract<ModLong> getImplementation(ModLongRing fac)
        Determine suitable implementation of factorization algorithm, case ModLong.
        Parameters:
        fac - ModLongRing.
        Returns:
        squarefree factorization algorithm implementation.
      • getImplementation

        public static SquarefreeAbstract<BigInteger> getImplementation(BigInteger fac)
        Determine suitable implementation of squarefree factorization algorithm, case BigInteger.
        Parameters:
        fac - BigInteger.
        Returns:
        squarefree factorization algorithm implementation.
      • getImplementation

        public static SquarefreeAbstract<BigRational> getImplementation(BigRational fac)
        Determine suitable implementation of squarefree factorization algorithms, case BigRational.
        Parameters:
        fac - BigRational.
        Returns:
        squarefree factorization algorithm implementation.
      • getImplementation

        public static <C extends GcdRingElem<C>> SquarefreeAbstract<AlgebraicNumber<C>> getImplementation(AlgebraicNumberRing<C> fac)
        Determine suitable implementation of squarefree factorization algorithms, case AlgebraicNumber<C>.
        Type Parameters:
        C - coefficient type, e.g. BigRational, ModInteger.
        Parameters:
        fac - AlgebraicNumberRing<C>.
        Returns:
        squarefree factorization algorithm implementation.
      • getImplementation

        public static <C extends GcdRingElem<C>> SquarefreeAbstract<Quotient<C>> getImplementation(QuotientRing<C> fac)
        Determine suitable implementation of squarefree factorization algorithms, case Quotient<C>.
        Type Parameters:
        C - coefficient type, e.g. BigRational, ModInteger.
        Parameters:
        fac - QuotientRing<C>.
        Returns:
        squarefree factorization algorithm implementation.
      • getImplementation

        public static <C extends GcdRingElem<C>> SquarefreeAbstract<C> getImplementation(GenPolynomialRing<C> fac)
        Determine suitable implementation of squarefree factorization algorithms, case GenPolynomial<C>.
        Type Parameters:
        C - coefficient type, e.g. BigRational, ModInteger.
        Parameters:
        fac - GenPolynomialRing<C>.
        Returns:
        squarefree factorization algorithm implementation.
      • getImplementation

        public static <C extends GcdRingElem<C>> SquarefreeAbstract<C> getImplementation(RingFactory<C> fac)
        Determine suitable implementation of squarefree factorization algorithms, other cases.
        Type Parameters:
        C - coefficient type
        Parameters:
        fac - RingFactory<C>.
        Returns:
        squarefree factorization algorithm implementation.

SCaVis 2.0 © jWork.ORG