Changeset 093f30e in git


Ignore:
Timestamp:
Feb 8, 2008, 11:11:30 AM (15 years ago)
Author:
Oliver Wienand <wienand@…>
Branches:
(u'spielwiese', '0d6b7fcd9813a1ca1ed4220cfa2b104b97a0a003')
Children:
60544db1dc67a36a012f9f3809c0e8d260f9bad0
Parents:
ecededc1c7ef7a762ce55b72be0707700967ceab
Message:
kstd1.cc, kstd2.cc:
redRing2toM --> redRing

kutil.*:
extendedspoly unit case

p_Mult_q.cc:
assume domain for bucket mult

pp_Mult_mm__T.cc:
free tmp memory

rmodulo2m.cc
rmodulon.cc


git-svn-id: file:///usr/local/Singular/svn/trunk@10573 2c84dea3-7e68-4137-9b89-c4e89433aadc
Location:
kernel
Files:
8 edited

Legend:

Unmodified
Added
Removed
  • kernel/kstd1.cc

    recededc r093f30e  
    22*  Computer Algebra System SINGULAR     *
    33****************************************/
    4 /* $Id: kstd1.cc,v 1.31 2008-02-06 09:12:46 wienand Exp $ */
     4/* $Id: kstd1.cc,v 1.32 2008-02-08 10:11:28 wienand Exp $ */
    55/*
    66* ABSTRACT:
     
    10231023#ifdef HAVE_RINGS  //TODO Oliver
    10241024  if (rField_is_Ring(currRing)) {
    1025     strat->red = redRing2toM;
     1025    strat->red = redRing;
    10261026  }
    10271027#endif
     
    10841084#ifdef HAVE_RINGS  //TODO Oliver
    10851085  else if (rField_is_Ring(currRing))
    1086     strat->red = redRing2toM;
     1086    strat->red = redRing;
    10871087#endif
    10881088  else
     
    19251925#ifdef HAVE_RINGS  //TODO Oliver
    19261926  if (rField_is_Ring(currRing)) {
    1927     strat->red = redRing2toM;
     1927    strat->red = redRing;
    19281928  }
    19291929#endif
  • kernel/kstd2.cc

    recededc r093f30e  
    22*  Computer Algebra System SINGULAR     *
    33****************************************/
    4 /* $Id: kstd2.cc,v 1.59 2008-02-07 09:36:17 wienand Exp $ */
     4/* $Id: kstd2.cc,v 1.60 2008-02-08 10:11:29 wienand Exp $ */
    55/*
    66*  ABSTRACT -  Kernel: alg. of Buchberger
     
    275275*  reduction procedure for the ring Z/2^m
    276276*/
    277 int redRing2toM (LObject* h,kStrategy strat)
     277int redRing (LObject* h,kStrategy strat)
    278278{
    279279  if (h->p == NULL && h->t_p == NULL) return 0; // spoly is zero (can only occure with zero divisors)
  • kernel/kutil.cc

    recededc r093f30e  
    22*  Computer Algebra System SINGULAR     *
    33****************************************/
    4 /* $Id: kutil.cc,v 1.82 2008-02-07 13:56:44 wienand Exp $ */
     4/* $Id: kutil.cc,v 1.83 2008-02-08 10:11:29 wienand Exp $ */
    55/*
    66* ABSTRACT: kernel: utils for kStd
     
    26412641void enterExtendedSpoly(poly h,kStrategy strat)
    26422642{
     2643  if (nIsOne(pGetCoeff(h))) return;
    26432644  number gcd;
    26442645  bool go = false;
  • kernel/kutil.h

    recededc r093f30e  
    44*  Computer Algebra System SINGULAR     *
    55****************************************/
    6 /* $Id: kutil.h,v 1.29 2008-01-30 09:01:37 wienand Exp $ */
     6/* $Id: kutil.h,v 1.30 2008-02-08 10:11:30 wienand Exp $ */
    77/*
    88* ABSTRACT: kernel: utils for kStd
     
    396396int redHoney (LObject* h, kStrategy strat);
    397397#ifdef HAVE_RINGS
    398 int redRing2toM (LObject* h,kStrategy strat);
     398int redRing (LObject* h,kStrategy strat);
    399399void enterExtendedSpoly(poly h,kStrategy strat);
    400400void superenterpairs (poly h,int k,int ecart,int pos,kStrategy strat, int atR = -1);
  • kernel/p_Mult_q.cc

    recededc r093f30e  
    77 *  Author:  obachman (Olaf Bachmann)
    88 *  Created: 8/00
    9  *  Version: $Id: p_Mult_q.cc,v 1.6 2008-01-30 18:56:37 wienand Exp $
     9 *  Version: $Id: p_Mult_q.cc,v 1.7 2008-02-08 10:11:30 wienand Exp $
    1010 *******************************************************************/
    1111#include "mod2.h"
     
    6969  assume(p != NULL && pNext(p) != NULL && q != NULL && pNext(q) != NULL);
    7070  pAssume1(! pHaveCommonMonoms(p, q));
     71#ifdef HAVE_RINGS
     72  assume(!rField_is_Domain(currRing));
     73#endif
    7174  assume(lp >= 1 && lq >= 1);
    7275  p_Test(p, r);
     
    7477
    7578  poly res = pp_Mult_mm(p,q,r);     // holds initially q1*p
    76 #ifdef HAVE_RINGS
    77   if (rField_is_Ring(currRing))
    78     WarnS("_p_Mult_q_Bucket not ring testet !!!");
    79 #endif
    8079  poly qq = pNext(q);               // we iter of this
    8180  poly qn = pp_Mult_mm(qq, p,r);    // holds p1*qi
  • kernel/pp_Mult_mm__T.cc

    recededc r093f30e  
    77 *  Author:  obachman (Olaf Bachmann)
    88 *  Created: 8/00
    9  *  Version: $Id: pp_Mult_mm__T.cc,v 1.6 2008-02-07 08:41:00 wienand Exp $
     9 *  Version: $Id: pp_Mult_mm__T.cc,v 1.7 2008-02-08 10:11:30 wienand Exp $
    1010 *******************************************************************/
    1111
     
    5252#ifdef HAVE_ZERODIVISORS
    5353    }
     54    else n_Delete(&tmp, ri);
    5455#endif
    5556    p = pNext(p);
  • kernel/rmodulo2m.cc

    recededc r093f30e  
    22*  Computer Algebra System SINGULAR     *
    33****************************************/
    4 /* $Id: rmodulo2m.cc,v 1.15 2008-02-07 13:30:37 wienand Exp $ */
     4/* $Id: rmodulo2m.cc,v 1.16 2008-02-08 10:11:30 wienand Exp $ */
    55/*
    66* ABSTRACT: numbers modulo 2^m
     
    199199BOOLEAN nr2mDivBy (number a,number b)
    200200{
    201   return ((NATNUMBER) a % (NATNUMBER) b) == 0;
     201  if (a == NULL)
     202    return (nr2mModul % (NATNUMBER) b) == 0;
     203  else
     204    return ((NATNUMBER) a % (NATNUMBER) b) == 0;
    202205  /*
    203206  if ((NATNUMBER) a == 0) return TRUE;
     
    397400  else
    398401  {
    399     nr2mExp=0;
    400     nr2mModul=0;
    401   }
    402 //  PrintS("Modul: ");
    403 //  Print("%d\n", nr2mModul);
     402    nr2mExp=2;
     403    nr2mModul=4;
     404  }
    404405}
    405406
    406407void nr2mInitExp(int m, ring r)
    407408{
    408   int i, w;
    409 
    410   if (m>1)
    411   {
    412     nr2mExp = m;
    413     nr2mModul = 2;
    414     for (int i = 1; i < m; i++) {
    415       nr2mModul = nr2mModul * 2;
    416 
    417     }
    418   }
    419   else
    420   {
    421     WarnS("nInitExp failed");
    422   }
     409  nr2mSetExp(m, r);
     410  if (m<2) WarnS("nInitExp failed: using Z/2^2");
    423411}
    424412
  • kernel/rmodulon.cc

    recededc r093f30e  
    22*  Computer Algebra System SINGULAR     *
    33****************************************/
    4 /* $Id: rmodulon.cc,v 1.21 2008-02-07 13:48:05 wienand Exp $ */
     4/* $Id: rmodulon.cc,v 1.22 2008-02-08 10:11:30 wienand Exp $ */
    55/*
    66* ABSTRACT: numbers modulo n
     
    369369{
    370370  nrnSetExp(m, r);
     371
    371372  if (mpz_cmp_ui(nrnModul,2) <= 0)
    372373  {
    373     WarnS("nInitExp failed");
     374    WarnS("nrnInitExp failed");
    374375  }
    375376}
Note: See TracChangeset for help on using the changeset viewer.