Changeset 093f30e in git
- Timestamp:
- Feb 8, 2008, 11:11:30 AM (15 years ago)
- Branches:
- (u'spielwiese', '0d6b7fcd9813a1ca1ed4220cfa2b104b97a0a003')
- Children:
- 60544db1dc67a36a012f9f3809c0e8d260f9bad0
- Parents:
- ecededc1c7ef7a762ce55b72be0707700967ceab
- Location:
- kernel
- Files:
-
- 8 edited
Legend:
- Unmodified
- Added
- Removed
-
kernel/kstd1.cc
recededc r093f30e 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: kstd1.cc,v 1.3 1 2008-02-06 09:12:46wienand Exp $ */4 /* $Id: kstd1.cc,v 1.32 2008-02-08 10:11:28 wienand Exp $ */ 5 5 /* 6 6 * ABSTRACT: … … 1023 1023 #ifdef HAVE_RINGS //TODO Oliver 1024 1024 if (rField_is_Ring(currRing)) { 1025 strat->red = redRing 2toM;1025 strat->red = redRing; 1026 1026 } 1027 1027 #endif … … 1084 1084 #ifdef HAVE_RINGS //TODO Oliver 1085 1085 else if (rField_is_Ring(currRing)) 1086 strat->red = redRing 2toM;1086 strat->red = redRing; 1087 1087 #endif 1088 1088 else … … 1925 1925 #ifdef HAVE_RINGS //TODO Oliver 1926 1926 if (rField_is_Ring(currRing)) { 1927 strat->red = redRing 2toM;1927 strat->red = redRing; 1928 1928 } 1929 1929 #endif -
kernel/kstd2.cc
recededc r093f30e 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: kstd2.cc,v 1. 59 2008-02-07 09:36:17wienand Exp $ */4 /* $Id: kstd2.cc,v 1.60 2008-02-08 10:11:29 wienand Exp $ */ 5 5 /* 6 6 * ABSTRACT - Kernel: alg. of Buchberger … … 275 275 * reduction procedure for the ring Z/2^m 276 276 */ 277 int redRing 2toM(LObject* h,kStrategy strat)277 int redRing (LObject* h,kStrategy strat) 278 278 { 279 279 if (h->p == NULL && h->t_p == NULL) return 0; // spoly is zero (can only occure with zero divisors) -
kernel/kutil.cc
recededc r093f30e 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: kutil.cc,v 1.8 2 2008-02-07 13:56:44wienand Exp $ */4 /* $Id: kutil.cc,v 1.83 2008-02-08 10:11:29 wienand Exp $ */ 5 5 /* 6 6 * ABSTRACT: kernel: utils for kStd … … 2641 2641 void enterExtendedSpoly(poly h,kStrategy strat) 2642 2642 { 2643 if (nIsOne(pGetCoeff(h))) return; 2643 2644 number gcd; 2644 2645 bool go = false; -
kernel/kutil.h
recededc r093f30e 4 4 * Computer Algebra System SINGULAR * 5 5 ****************************************/ 6 /* $Id: kutil.h,v 1. 29 2008-01-30 09:01:37wienand Exp $ */6 /* $Id: kutil.h,v 1.30 2008-02-08 10:11:30 wienand Exp $ */ 7 7 /* 8 8 * ABSTRACT: kernel: utils for kStd … … 396 396 int redHoney (LObject* h, kStrategy strat); 397 397 #ifdef HAVE_RINGS 398 int redRing 2toM(LObject* h,kStrategy strat);398 int redRing (LObject* h,kStrategy strat); 399 399 void enterExtendedSpoly(poly h,kStrategy strat); 400 400 void superenterpairs (poly h,int k,int ecart,int pos,kStrategy strat, int atR = -1); -
kernel/p_Mult_q.cc
recededc r093f30e 7 7 * Author: obachman (Olaf Bachmann) 8 8 * Created: 8/00 9 * Version: $Id: p_Mult_q.cc,v 1. 6 2008-01-30 18:56:37wienand Exp $9 * Version: $Id: p_Mult_q.cc,v 1.7 2008-02-08 10:11:30 wienand Exp $ 10 10 *******************************************************************/ 11 11 #include "mod2.h" … … 69 69 assume(p != NULL && pNext(p) != NULL && q != NULL && pNext(q) != NULL); 70 70 pAssume1(! pHaveCommonMonoms(p, q)); 71 #ifdef HAVE_RINGS 72 assume(!rField_is_Domain(currRing)); 73 #endif 71 74 assume(lp >= 1 && lq >= 1); 72 75 p_Test(p, r); … … 74 77 75 78 poly res = pp_Mult_mm(p,q,r); // holds initially q1*p 76 #ifdef HAVE_RINGS77 if (rField_is_Ring(currRing))78 WarnS("_p_Mult_q_Bucket not ring testet !!!");79 #endif80 79 poly qq = pNext(q); // we iter of this 81 80 poly qn = pp_Mult_mm(qq, p,r); // holds p1*qi -
kernel/pp_Mult_mm__T.cc
recededc r093f30e 7 7 * Author: obachman (Olaf Bachmann) 8 8 * 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 $ 10 10 *******************************************************************/ 11 11 … … 52 52 #ifdef HAVE_ZERODIVISORS 53 53 } 54 else n_Delete(&tmp, ri); 54 55 #endif 55 56 p = pNext(p); -
kernel/rmodulo2m.cc
recededc r093f30e 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: rmodulo2m.cc,v 1.1 5 2008-02-07 13:30:37wienand Exp $ */4 /* $Id: rmodulo2m.cc,v 1.16 2008-02-08 10:11:30 wienand Exp $ */ 5 5 /* 6 6 * ABSTRACT: numbers modulo 2^m … … 199 199 BOOLEAN nr2mDivBy (number a,number b) 200 200 { 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; 202 205 /* 203 206 if ((NATNUMBER) a == 0) return TRUE; … … 397 400 else 398 401 { 399 nr2mExp=0; 400 nr2mModul=0; 401 } 402 // PrintS("Modul: "); 403 // Print("%d\n", nr2mModul); 402 nr2mExp=2; 403 nr2mModul=4; 404 } 404 405 } 405 406 406 407 void nr2mInitExp(int m, ring r) 407 408 { 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"); 423 411 } 424 412 -
kernel/rmodulon.cc
recededc r093f30e 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: rmodulon.cc,v 1.2 1 2008-02-07 13:48:05wienand Exp $ */4 /* $Id: rmodulon.cc,v 1.22 2008-02-08 10:11:30 wienand Exp $ */ 5 5 /* 6 6 * ABSTRACT: numbers modulo n … … 369 369 { 370 370 nrnSetExp(m, r); 371 371 372 if (mpz_cmp_ui(nrnModul,2) <= 0) 372 373 { 373 WarnS("n InitExp failed");374 WarnS("nrnInitExp failed"); 374 375 } 375 376 }
Note: See TracChangeset
for help on using the changeset viewer.