Changeset 18ff4c in git for kernel/gring.cc
- Timestamp:
- Jul 25, 2007, 12:53:15 PM (17 years ago)
- Branches:
- (u'spielwiese', '17f1d200f27c5bd38f5dfc6e8a0879242279d1d8')
- Children:
- 1da0b56138c1e89904888f80b4e46d2b5370e1e2
- Parents:
- 19408ce627be07e5f06ea3acb902cb1deccb10af
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
kernel/gring.cc
r19408c r18ff4c 7 7 * Author: levandov (Viktor Levandovsky) 8 8 * Created: 8/00 - 11/00 9 * Version: $Id: gring.cc,v 1.4 7 2007-07-24 16:22:36 motsakExp $9 * Version: $Id: gring.cc,v 1.48 2007-07-25 10:53:14 Singular Exp $ 10 10 *******************************************************************/ 11 11 #include "mod2.h" … … 1727 1727 poly pp=nc_mm_Mult_pp(m,p,currRing); 1728 1728 assume(pp!=NULL); 1729 1729 1730 1730 pDelete(&m); 1731 1731 number n=nCopy(pGetCoeff(pp)); … … 1762 1762 PrintS(", "); 1763 1763 pWrite0(p); 1764 PrintS(", *c): "); 1765 #endif 1766 1764 PrintS(", *c): "); 1765 #endif 1766 1767 1767 // b will not by multiplied by any constant in this impl. 1768 1768 // ==> *c=1 … … 1777 1777 1778 1778 // poly pLmB = pHead(b); 1779 poly m = pOne(); 1779 poly m = pOne(); 1780 1780 pExpVectorDiff(m, b, p); 1781 1781 // pDelete(&pLmB); 1782 1782 //pSetm(m); 1783 1783 1784 1784 #ifdef PDEBUG 1785 1785 pTest(m); … … 1787 1787 #endif 1788 1788 1789 pp = nc_mm_Mult_pp(m, p, currRing); 1789 pp = nc_mm_Mult_pp(m, p, currRing); 1790 1790 1791 1791 #if MYTEST 1792 PrintS("\n{b': "); 1792 PrintS("\n{b': "); 1793 1793 pWrite0(b); 1794 PrintS(", m: "); 1794 PrintS(", m: "); 1795 1795 pWrite0(m); 1796 PrintS(", pp: "); 1797 pWrite0(pp); 1796 PrintS(", pp: "); 1797 pWrite0(pp); 1798 1798 PrintS(" }\n"); 1799 #endif 1799 #endif 1800 1800 1801 1801 pDelete(&m); // one m for all tries! 1802 1802 1803 1803 // assume( pp != NULL ); 1804 1804 1805 1805 if( pp == NULL ) 1806 1806 { … … 1808 1808 1809 1809 if( !p_DivisibleBy(p, b, currRing) ) 1810 return; 1811 1810 return; 1811 1812 1812 } 1813 1813 } 1814 1814 1815 1815 #if MYTEST 1816 PrintS("{b': "); 1816 PrintS("{b': "); 1817 1817 pWrite0(b); 1818 PrintS(", pp: "); 1819 pWrite0(pp); 1818 PrintS(", pp: "); 1819 pWrite0(pp); 1820 1820 PrintS(" }\n"); 1821 #endif 1821 #endif 1822 1822 1823 1823 … … 2077 2077 #endif 2078 2078 2079 q = kNF(J,currQuotient,q,0, 4);2079 q = kNF(J,currQuotient,q,0,KSTD_NF_NONORM); 2080 2080 2081 2081 #ifdef PDEBUG … … 2467 2467 pTest(DDN); 2468 2468 #endif 2469 2469 2470 2470 matrix CC = NULL; 2471 2471 matrix DD = NULL; … … 2493 2493 ring save = currRing; 2494 2494 bool WeChangeRing = false; 2495 2495 2496 2496 if (currRing!=r) 2497 2497 { … … 2500 2500 WeChangeRing = true; 2501 2501 } 2502 2502 2503 2503 r->nc = (nc_struct *)omAlloc0(sizeof(nc_struct)); 2504 2504 r->nc->ref = 1; … … 2517 2517 assume( (CCC != NULL) != (CCN != NULL) ); // exactly one data about coeffs (C). 2518 2518 assume( !((DDD != NULL) && (DDN != NULL)) ); // at most one data about tails (D). 2519 2519 2520 2520 /* initialition of the matrix C */ 2521 2521 /* check the correctness of arguments */ … … 2610 2610 else 2611 2611 qN = p_GetCoeff(MATELEM(C,i,j),r); 2612 2612 2613 2613 if ( qN == NULL ) /* check the consistency: Cij!=0 */ 2614 2614 // find also illegal pN … … 2676 2676 return TRUE; 2677 2677 } 2678 r->nc->C = C; // if C and D were given by matrices at the beginning they are in r 2678 r->nc->C = C; // if C and D were given by matrices at the beginning they are in r 2679 2679 r->nc->D = D; // otherwise they should be in r->nc->basering(polynomial * Id_{N}) 2680 2680 2681 2681 if (WeChangeRing) 2682 2682 rChangeCurrRing(save); 2683 2683 2684 2684 return nc_InitMultiplication(r); 2685 2685 }
Note: See TracChangeset
for help on using the changeset viewer.