Changeset 4a2260e in git for libpolys/polys/ext_fields


Ignore:
Timestamp:
May 19, 2011, 4:45:26 PM (13 years ago)
Author:
Frank Seelisch <seelisch@…>
Branches:
(u'spielwiese', '5b153614cbc72bfa198d75b1e9e33dab2645d9fe')
Children:
37c7fc12531c0affe2e7abfce3be0590304fc0da
Parents:
c28ecf1b368527a9ec9e39a3db43a7b75040f036
git-author:
Frank Seelisch <seelisch@mathematik.uni-kl.de>2011-05-19 16:45:26+02:00
git-committer:
Mohamed Barakat <mohamed.barakat@rwth-aachen.de>2011-11-09 12:36:13+01:00
Message:
more tests run (alg ext fields); some omCheck problems in longrat.cc yet to be resolved
File:
1 edited

Legend:

Unmodified
Added
Removed
  • libpolys/polys/ext_fields/algext.cc

    rc28ecf r4a2260e  
    8181#endif
    8282
    83 void heuristicReduce(poly p, poly reducer, const coeffs cf);
    84 void definiteReduce(poly p, poly reducer, const coeffs cf);
     83void heuristicReduce(poly &p, poly reducer, const coeffs cf);
     84void definiteReduce(poly &p, poly reducer, const coeffs cf);
    8585
    8686BOOLEAN naIsZero(number a, const coeffs cf)
     
    336336   the decision is made based on the following heuristic
    337337   (which should also only be changed here in this method):
    338       if (deg(p) > 10*deg(reducer) then perform reduction */
    339 void heuristicReduce(poly p, poly reducer, const coeffs cf)
     338      if (deg(p) > 10*deg(reducer) then perform reduction;
     339   modifies p */
     340void heuristicReduce(poly &p, poly reducer, const coeffs cf)
    340341{
    341342  #ifdef LDEBUG
     
    425426
    426427/* performs polynomial division and overrides p by the remainder
    427    of division of p by the reducer */
    428 void definiteReduce(poly p, poly reducer, const coeffs cf)
     428   of division of p by the reducer;
     429   modifies p */
     430void definiteReduce(poly &p, poly reducer, const coeffs cf)
    429431{
    430432  #ifdef LDEBUG
     
    448450  poly aFactor = NULL; poly mFactor = NULL;
    449451  poly theGcd = p_ExtGcd((poly)a, aFactor, naMinpoly, mFactor, naRing);
     452  naTest((number)theGcd); naTest((number)aFactor); naTest((number)mFactor);
    450453  /* the gcd must be 1 since naMinpoly is irreducible and a != NULL: */
    451454  assume(naIsOne((number)theGcd, cf));     
Note: See TracChangeset for help on using the changeset viewer.