Changeset fa7ed7 in git for factory/cf_gcd_charp.cc


Ignore:
Timestamp:
Oct 31, 2007, 3:46:26 PM (17 years ago)
Author:
Hans Schönemann <hannes@…>
Branches:
(u'spielwiese', '2a584933abf2a2d3082034c7586d38bb6de1a30a')
Children:
7b315e648c3fac140aad7f9b5e282500f5e0975d
Parents:
dbf1aedaa68841be4041c565965714d2822574c7
Message:
*hannes: syntax


git-svn-id: file:///usr/local/Singular/svn/trunk@10364 2c84dea3-7e68-4137-9b89-c4e89433aadc
File:
1 edited

Legend:

Unmodified
Added
Removed

  • factory/cf_gcd_charp.cc

    rdbf1ae rfa7ed7  
    1111static CanonicalForm newtonInterp(CFList &alpha, CFList &u, const Variable & x);
    1212static CanonicalForm simpleGCD(const CanonicalForm & A, const CanonicalForm & B);
    13 static CanonicalForm newGCD(const CanonicalForm & A, const CanonicalForm & B);
     13CanonicalForm newGCD(CanonicalForm A, CanonicalForm B);
    1414static CanonicalForm GFPowDown(const CanonicalForm & A, int k);
    1515static CanonicalForm GFPowUp(const CanonicalForm & A, int k);
    … …  
    241241}
    242242
    243 static CanonicalForm
    244 newGCD(const CanonicalForm & A, const CanonicalForm & B)
     243CanonicalForm
     244newGCD(CanonicalForm A, CanonicalForm B)
    245245// Computes the GCD of two polynomials over a prime field.
    246246// Based on Algorithm 7.2 from "Algorithms for Computer Algebra"
Note: See TracChangeset for help on using the changeset viewer.