Changeset 151000 in git
- Timestamp:
- Jun 10, 2008, 4:35:41 PM (15 years ago)
- Branches:
- (u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'a800fe4b3e9d37a38c5a10cc0ae9dfa0c15a4ee6')
- Children:
- 8011515489f6a2db930bf758ec82b4a8248d9397
- Parents:
- 9cd0ce7b59c2eddfba7d22e2cd1fe036d85c1187
- Location:
- kernel
- Files:
-
- 5 edited
Legend:
- Unmodified
- Added
- Removed
-
kernel/gring.cc
r9cd0ce r151000 7 7 * Author: levandov (Viktor Levandovsky) 8 8 * Created: 8/00 - 11/00 9 * Version: $Id: gring.cc,v 1.5 4 2008-06-10 10:17:31motsak Exp $9 * Version: $Id: gring.cc,v 1.55 2008-06-10 14:35:40 motsak Exp $ 10 10 *******************************************************************/ 11 11 … … 101 101 /*2 102 102 * returns the LCM of the head terms of a and b 103 * without coefficient!!! 103 104 */ 104 105 poly p_Lcm(const poly a, const poly b, const long lCompM, const ring r) 105 106 { 106 poly m = p_ISet(1, r); 107 poly m = // p_ISet(1, r); 108 p_Init(r); 107 109 108 110 const int pVariables = r->N; … … 121 123 122 124 #ifdef PDEBUG 123 p_Test(m,r); 124 #endif 125 // p_Test(m,r); 126 #endif 127 128 n_New(&(p_GetCoeff(m, r)), r); 125 129 126 130 return(m); … … 140 144 141 145 #ifdef PDEBUG 142 p_Test(m,r);146 // p_Test(m,r); 143 147 #endif 144 148 return(m); … … 1470 1474 poly pL = p_Lcm(p1,p2,r); // pL = lcm( lm(p1), lm(p2) ) 1471 1475 1472 // p_Setm(pL,r); 1473 1474 #ifdef PDEBUG 1475 p_Test(pL,r); 1476 1477 #ifdef PDEBUG 1478 // p_Test(pL,r); 1476 1479 #endif 1477 1480 … … 1532 1535 #endif 1533 1536 1534 1535 1536 1537 p_Delete(&pL,r); 1537 1538 … … 1768 1769 { 1769 1770 #ifdef PDEBUG 1770 Werror("nc_CreateShortSpoly: exponent mismatch!"); // !!!!1771 Werror("nc_CreateShortSpoly: wrong module components!"); // !!!! 1771 1772 #endif 1772 1773 return(NULL); 1773 1774 } 1774 1775 1775 constpoly m = p_Lcm(p1, p2, si_max(lCompP1, lCompP2), r);1776 1777 n_Delete(&p_GetCoeff(m, r), r);1778 pSetCoeff0(m, NULL);1779 1780 #ifdef PDEBUG 1781 p_Test(m,r);1776 poly m = p_Lcm(p1, p2, si_max(lCompP1, lCompP2), r); 1777 1778 // n_Delete(&p_GetCoeff(m, r), r); 1779 // pSetCoeff0(m, NULL); 1780 1781 #ifdef PDEBUG 1782 // p_Test(m,r); 1782 1783 #endif 1783 1784 -
kernel/gring.h
r9cd0ce r151000 4 4 * Computer Algebra System SINGULAR * 5 5 ****************************************/ 6 /* $Id: gring.h,v 1.2 1 2008-06-10 10:17:31 motsak Exp $ */6 /* $Id: gring.h,v 1.22 2008-06-10 14:35:41 motsak Exp $ */ 7 7 /* 8 8 * ABSTRACT additional defines etc for --with-plural … … 111 111 112 112 113 // returns the LCM of the head terms of a and b with given component 113 // returns the LCM of the head terms of a and b with the given component 114 // NOTE: coeff will be created but remains undefined(zero?) 114 115 poly p_Lcm(const poly a, const poly b, const long lCompM, const ring r); 115 116 116 117 // returns the LCM of the head terms of a and b with component = max comp. of a & b 118 // NOTE: coeff will be created but remains undefined(zero?) 117 119 poly p_Lcm(const poly a, const poly b, const ring r); 118 120 -
kernel/kutil.cc
r9cd0ce r151000 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: kutil.cc,v 1.9 1 2008-06-10 10:17:32motsak Exp $ */4 /* $Id: kutil.cc,v 1.92 2008-06-10 14:35:41 motsak Exp $ */ 5 5 /* 6 6 * ABSTRACT: kernel: utils for kStd … … 1552 1552 } 1553 1553 else 1554 Lp.p = nc_CreateSpoly(strat->S[i],p,currRing); 1555 // nc_CreateShortSpoly(strat->S[i], p, strat->tailRing); // how to mark a short spoly? 1556 } 1557 else Lp.p = nc_CreateSpoly(strat->S[i],p,currRing); 1558 // nc_CreateShortSpoly(strat->S[i], p, strat->tailRing); // how to mark a short spoly? 1554 Lp.p = // nc_CreateSpoly(strat->S[i],p,currRing); 1555 nc_CreateShortSpoly(strat->S[i], p, currRing); 1556 } 1557 else 1558 Lp.p = // nc_CreateSpoly(strat->S[i],p,currRing); 1559 nc_CreateShortSpoly(strat->S[i], p, currRing); 1559 1560 1560 1561 … … 1573 1574 { 1574 1575 assume(!rIsPluralRing(currRing)); 1575 Lp.p = ksCreateShortSpoly(strat->S[i], p, strat->tailRing);1576 Lp.p = ksCreateShortSpoly(strat->S[i], p, strat->tailRing); 1576 1577 #if MYTEST 1577 1578 if (TEST_OPT_DEBUG) … … 1609 1610 Lp.p2 = p; 1610 1611 1611 if ( !bIsPluralRing ) 1612 pNext(Lp.p) = strat->tail; 1612 // if ( !bIsPluralRing ) // !!!! 1613 assume(pNext(Lp.p)==NULL); 1614 pNext(Lp.p) = strat->tail; // !!! 1613 1615 1614 1616 if (atR >= 0) … … 1646 1648 //PrintS("prod-crit\n"); 1647 1649 #ifdef HAVE_PLURAL 1648 if( !rIsPluralRing(currRing) || (rIsSCA(currRing) && strat->homog))1650 if((!rIsPluralRing(currRing)) || (rIsSCA(currRing) && strat->homog)) 1649 1651 #endif 1650 1652 { … … 1710 1712 Lp.i_r2 = -1; 1711 1713 } 1714 assume(pNext(Lp.p) == NULL); 1712 1715 pNext(Lp.p) = strat->tail; 1713 1716 strat->initEcartPair(&Lp,strat->S[i],p,strat->ecartS[i],ecart); -
kernel/numbers.h
r9cd0ce r151000 4 4 * Computer Algebra System SINGULAR * 5 5 ****************************************/ 6 /* $Id: numbers.h,v 1.1 2 2008-03-19 17:44:10 SingularExp $ */6 /* $Id: numbers.h,v 1.13 2008-06-10 14:35:41 motsak Exp $ */ 7 7 /* 8 8 * ABSTRACT: interface to coefficient aritmetics … … 35 35 #define n_Power(a, b, res, r) (r)->cf->nPower(a,b,res) 36 36 #define n_Size(n,r) (r)->cf->nSize(n) 37 38 #define n_New(n, r) (r)->cf->nNew(n) 37 39 38 40 /* variables */ -
kernel/sca.cc
r9cd0ce r151000 7 7 * Author: motsak (Oleksandr Motsak) 8 8 * Created: 2006/12/18 9 * Version: $Id: sca.cc,v 1.1 6 2008-06-10 10:17:33motsak Exp $9 * Version: $Id: sca.cc,v 1.17 2008-06-10 14:35:41 motsak Exp $ 10 10 *******************************************************************/ 11 11 … … 734 734 poly m1 = p_ISet(1, r); 735 735 p_ExpVectorDiff(m1, pL, p1, r); // m1 = pL / lm(p1) 736 736 737 //p_SetComp(m1,0,r); 737 738 //p_Setm(m1,r); … … 1657 1658 1658 1659 strat->P.p = nc_CreateSpoly(strat->P.p1, strat->P.p2, currRing); 1659 1660 /*1661 strat->P.p = NULL;1662 1663 1664 poly m1 = NULL, m2 = NULL;1665 1666 // check that spoly creation is ok1667 while (strat->tailRing != currRing &&1668 !kCheckSpolyCreation(&(strat->P), strat, m1, m2))1669 {1670 assume(m1 == NULL && m2 == NULL);1671 // if not, change to a ring where exponents are at least1672 // large enough1673 kStratChangeTailRing(strat);1674 }1675 1676 #ifdef PDEBUG1677 Print("ksCreateSpoly!#?");1678 #endif1679 1680 // create the real one1681 ksCreateSpoly(&(strat->P), NULL, strat->use_buckets,1682 strat->tailRing, m1, m2, strat->R); //?????????1683 */1684 1660 }// else 1685 1661 1662 1663 if(strat->P.IsNull()) continue; 1664 1686 1665 if (strat->P.p1 == NULL) 1687 1666 { … … 1691 1670 1692 1671 // for input polys, prepare reduction 1693 strat->P.PrepareRed(strat->use_buckets);1672 strat->P.PrepareRed(strat->use_buckets); 1694 1673 } 1695 1674
Note: See TracChangeset
for help on using the changeset viewer.