Changeset b12a68 in git


Ignore:
Timestamp:
Mar 16, 2011, 10:22:03 AM (13 years ago)
Author:
Frank Seelisch <seelisch@…>
Branches:
(u'fieker-DuVal', '117eb8c30fc9e991c4decca4832b1d19036c4c65')(u'spielwiese', 'b4f17ed1d25f93d46dbe29e4b499baecc2fd51bb')
Children:
2f6ca63579dbf5195f7dbd177e9e67afbfb66dfa
Parents:
ddbc222c9c9055770463cb321791c38c081d78ef
Message:
removed old switch HAVE_ZERODIVISORS

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

Legend:

Unmodified
Added
Removed
  • kernel/p_Minus_mm_Mult_qq__T.cc

    rddbc22 rb12a68  
    6767  Equal:   // qm equals p
    6868  tb = n_Mult(pGetCoeff(q), tm, r);
    69 #ifdef HAVE_ZERODIVISORS
     69#ifdef HAVE_RINGS
    7070  if (!nIsZero(tb)) {
    7171#endif
     
    8686    p = p_LmFreeAndNext(p, r);
    8787  }
    88 #ifdef HAVE_ZERODIVISORS
     88#ifdef HAVE_RINGS
    8989  }
    9090  else
     
    101101
    102102  Greater:
    103 #ifdef HAVE_ZERODIVISORS
     103#ifdef HAVE_RINGS
    104104  tb = n_Mult(pGetCoeff(q), tneg, r);
    105105  if (!nIsZero(tb))
     
    108108    pSetCoeff0(qm, n_Mult(pGetCoeff(q), tneg, r));
    109109    a = pNext(a) = qm;       // append qm to result and advance q
    110 #ifdef HAVE_ZERODIVISORS
     110#ifdef HAVE_RINGS
    111111  }
    112112  else
  • kernel/p_Mult_mm__T.cc

    rddbc22 rb12a68  
    3030  pAssume(!n_IsZero(ln,ri));
    3131
    32 #ifdef HAVE_ZERODIVISORS
     32#ifdef HAVE_RINGS
    3333  poly before = p;
    3434#endif
     
    3737    pn = pGetCoeff(p);
    3838    number tmp = n_Mult(ln, pn, ri);
    39 #ifdef HAVE_ZERODIVISORS
     39#ifdef HAVE_RINGS
    4040    if (n_IsZero(tmp, ri))
    4141    {
     
    6060      p_MemAdd(p->exp, m_e, length);
    6161      p_MemAddAdjust(p, ri);
    62 #ifdef HAVE_ZERODIVISORS
     62#ifdef HAVE_RINGS
    6363      before = p;
    6464#endif
  • kernel/p_Mult_nn__T.cc

    rddbc22 rb12a68  
    2323
    2424  poly q = p;
    25 #ifdef HAVE_ZERODIVISORS
     25#ifdef HAVE_RINGS
    2626  poly old = NULL;
    2727#endif
    2828  while (p != NULL)
    2929  {
    30 #ifndef HAVE_ZERODIVISORS
     30#ifndef HAVE_RINGS
    3131    number nc = pGetCoeff(p);
    3232    pSetCoeff0(p, n_Mult(n, nc, r));
  • kernel/p_Procs_Generate.cc

    rddbc22 rb12a68  
    120120  }
    121121#endif
    122 #ifdef HAVE_RINGS
    123   if (strcmp(s_field, "RingGeneral") == 0)
    124     printf("#define HAVE_ZERODIVISORS\n");
    125 #endif
    126122  i = 0;
    127123  while (macros_field[i] != NULL)
     
    196192  printf("#include <kernel/%s__T.cc>\n", s_what);
    197193  printf("#undef %s\n", s_what);
    198 #ifdef HAVE_RINGS
    199   if (strcmp(s_field, "RingGeneral") == 0)
    200     printf("#undef HAVE_ZERODIVISORS\n");
    201 #endif
    202194#ifndef p_Procs_Static
    203195  printf("#endif // p_Procs_[Kernel|Field*]\n");
  • kernel/pp_Mult_mm__T.cc

    rddbc22 rb12a68  
    2626  }
    2727  spolyrec rp;
    28 #ifdef HAVE_ZERODIVISORS
     28#ifdef HAVE_RINGS
    2929  rp.next = NULL;
    3030#endif
     
    4141  {
    4242    tmp = n_Mult(ln, pGetCoeff(p), ri);
    43 #ifdef HAVE_ZERODIVISORS
     43#ifdef HAVE_RINGS
    4444    if (! n_IsZero(tmp, ri))
    4545    {
     
    5050      p_MemSum(q->exp, p->exp, m_e, length);
    5151      p_MemAddAdjust(q, ri);
    52 #ifdef HAVE_ZERODIVISORS
     52#ifdef HAVE_RINGS
    5353    }
    5454    else n_Delete(&tmp, ri);
  • kernel/pp_Mult_nn__T.cc

    rddbc22 rb12a68  
    2222  if (p == NULL) return NULL;
    2323  spolyrec rp;
    24 #ifdef HAVE_ZERODIVISORS
     24#ifdef HAVE_RINGS
    2525  rp.next = NULL;
    2626#endif
     
    2828  omBin bin = r->PolyBin;
    2929  DECLARE_LENGTH(const unsigned long length = r->ExpL_Size);
    30 
    3130  do
    3231  {
    33 #ifndef HAVE_ZERODIVISORS
     32#ifndef HAVE_RINGS
    3433    p_AllocBin(pNext(q), bin, r);
    3534    pIter(q);
Note: See TracChangeset for help on using the changeset viewer.