Changeset e1b9e59 in git
- Timestamp:
- Jul 28, 2009, 11:56:59 AM (14 years ago)
- Branches:
- (u'spielwiese', '828514cf6e480e4bafc26df99217bf2a1ed1ef45')
- Children:
- 186673a0acbc5c03f2823324915e1b75a6601186
- Parents:
- 11b6490b056dd2fc128f1ca13075d8022d3631d5
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
kernel/ring.cc
r11b649 re1b9e59 2 2 * Computer Algebra System SINGULAR * 3 3 ****************************************/ 4 /* $Id: ring.cc,v 1.12 5 2009-07-28 08:49:15Singular Exp $ */4 /* $Id: ring.cc,v 1.126 2009-07-28 09:56:59 Singular Exp $ */ 5 5 6 6 /* … … 384 384 #endif 385 385 continue; 386 } else387 if (386 } 387 else if ( 388 388 ( (r->order[l] >= ringorder_lp) 389 389 ||(r->order[l] == ringorder_M) … … 411 411 if (r->order[l] == ringorder_a64) 412 412 { 413 414 413 int64 *w=(int64 *)r->wvhdl[l]; 414 #if SIZEOF_LONG == 4 415 415 Print("%*lld " ,nlen,w[i+j],i+j); 416 416 #else 417 417 Print(" %*ld" ,nlen,w[i+j],i+j); 418 418 #endif 419 419 } 420 420 else … … 469 469 } 470 470 else PrintS(" ..."); 471 } else 471 } 472 else 472 473 PrintS(" (NULL)"); 473 474 } … … 1645 1646 if (r->qideal!=NULL) 1646 1647 { 1647 if (copy_qideal) 1648 if (copy_qideal) 1648 1649 { 1649 1650 #ifndef NDEBUG 1650 1651 if (!copy_ordering) 1651 1652 WerrorS("internal error: rCopy0(Q,TRUE,FALSE)"); 1652 1653 else 1653 1654 #endif 1654 1655 { 1655 1656 #ifndef NDEBUG 1656 1657 WarnS("internal bad stuff: rCopy0(Q,TRUE,TRUE)"); 1657 1658 #endif 1658 1659 rComplete(res); 1659 1660 res->qideal= idrCopyR_NoSort(r->qideal, r, res); 1660 1661 rUnComplete(res); 1661 1662 } 1662 1663 } … … 2098 2099 continue; // To make for check OrdSize bound... 2099 2100 } 2100 } else2101 if (r->typ[j].ord_typ == ro_is)2101 } 2102 else if (r->typ[j].ord_typ == ro_is) 2102 2103 { 2103 2104 // Skip all intermediate blocks for undone variables: … … 2107 2108 } 2108 2109 2109 } else 2110 } 2111 else 2110 2112 { 2111 2113 if (r->typ[j].ord_typ==ro_cp) … … 2408 2410 2409 2411 // We will act as rO_Syz on our own!!! 2410 // Here we allocate an exponent as a level placeholder 2412 // Here we allocate an exponent as a level placeholder 2411 2413 o[place]= -1; 2412 2414 prev_ord=-1; … … 2480 2482 Print("v[%d]: %010x", i, pVarOffset[i]); 2481 2483 #endif 2482 } else 2484 } 2485 else 2483 2486 pVarOffset[i] = -1; // No change here... 2484 2487 } … … 2507 2510 // } 2508 2511 2509 2512 2510 2513 // Moreover: we need to allocate the module component (v[0]) here! 2511 2514 if( v[0] == -1) // It's possible that there was module component v0 at the begining (before prefix)! … … 3802 3805 r->typ[i].data.is.componentWeights = NULL; // ? 3803 3806 } 3804 3805 3807 3806 3808 if( r->typ[i].data.is.pVarOffset != NULL ) … … 3813 3815 { 3814 3816 if(r->typ[i].data.syz.limit > 0) 3815 omFreeSize(r->typ[i].data.syz.syz_index, ((r->typ[i].data.syz.limit) +1)*sizeof(int)); 3817 omFreeSize(r->typ[i].data.syz.syz_index, ((r->typ[i].data.syz.limit) +1)*sizeof(int)); 3816 3818 r->typ[i].data.syz.syz_index = NULL; 3817 } else if (r->typ[i].ord_typ == ro_syzcomp) 3819 } 3820 else if (r->typ[i].ord_typ == ro_syzcomp) 3818 3821 { 3819 3822 #ifndef NDEBUG … … 3834 3837 3835 3838 omFreeSize((ADDRESS)r->VarOffset, (r->N +1)*sizeof(int)); 3836 3839 3837 3840 if (r->ordsgn != NULL && r->CmpL_Size != 0) 3838 3841 omFreeSize((ADDRESS)r->ordsgn,r->ExpL_Size*sizeof(long)); … … 3982 3985 Print(" start (level) %d, suffixpos: %d, VO: ",r->typ[j].data.isTemp.start, r->typ[j].data.isTemp.suffixpos); 3983 3986 3984 #if MYTEST 3987 #if MYTEST 3985 3988 for( int k = 0; k <= r->N; k++) 3986 3989 if (r->typ[j].data.isTemp.pVarOffset[k] != -1) … … 3998 4001 3999 4002 PrintS("weights: "); 4000 4003 4001 4004 if( r->typ[j].data.is.componentWeights == NULL ) 4002 4005 PrintS("NULL == [0,...0]\n"); … … 4005 4008 (r->typ[j].data.is.componentWeights)->show(); PrintLn(); 4006 4009 } 4007 4008 }else4010 } 4011 else 4009 4012 { 4010 4013 Print(" place %d",r->typ[j].data.dp.place); … … 4128 4131 { 4129 4132 assume( p != NULL ); 4130 4133 4131 4134 p_Write(p, lmRing, tailRing); 4132 4135 … … 4146 4149 4147 4150 if (q != NULL) 4148 PrintS("...\n"); 4151 PrintS("...\n"); 4149 4152 } 4150 4153 } 4151 4154 else 4152 PrintS("0\n"); 4155 PrintS("0\n"); 4153 4156 } 4154 4157 … … 4479 4482 #ifndef NDEBUG 4480 4483 WarnS("error in nc_rComplete"); // cleanup?// rDelete(res);// return r; // just go on.. 4481 #endif 4484 #endif 4482 4485 } 4483 4486 } … … 4875 4878 assume(r->typ[pos].data.is.F == NULL); 4876 4879 4877 4878 4880 r->typ[pos].data.is.F = FF; // F is owened by ring now! TODO: delete at the end! 4879 4881 … … 4936 4938 currRing->typ[0].data.syz.limit = k; 4937 4939 currRing->typ[0].data.syz.curr_index++; 4938 4939 }else if(4940 (currRing->typ!=NULL) && 4940 } 4941 else if( 4942 (currRing->typ!=NULL) && 4941 4943 (currRing->typ[0].ord_typ==ro_isTemp) 4942 4944 ) … … 4946 4948 Warn("rSetSyzComp(%d) in an IS ring! Be careful!", k); 4947 4949 #endif 4948 } else 4950 } 4951 else 4949 4952 if ((currRing->order[0]!=ringorder_c) && (k!=0)) // ??? 4950 4953 {
Note: See TracChangeset
for help on using the changeset viewer.