Changeset 091b0e8 in git
- Timestamp:
- Jun 10, 2011, 9:38:12 AM (12 years ago)
- Branches:
- (u'spielwiese', '91fdef05f09f54b8d58d92a472e9c4a43aa4656f')
- Children:
- ae7cad0b174b23760efd41f0bf7c461c5e33e96a
- Parents:
- b9a4477dffa95152122f8354bb7633b5a708918e
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
Singular/ipshell.cc
rb9a447 r091b0e8 2147 2147 else 2148 2148 iv=ivCopy((intvec*)vv->m[1].Data()); //assume INTVEC 2149 R->block1[j]=si_max(R->block0[j],R->block0[j]+iv->length()-1); 2149 int iv_len=iv->length(); 2150 R->block1[j]=si_max(R->block0[j],R->block0[j]+iv_len-1); 2151 if (R->block1[j]>R->N) 2152 { 2153 R->block1[j]=R->N; 2154 iv_len=R->block1[j]-R->block0[j]+1; 2155 } 2150 2156 //Print("block %d from %d to %d\n",j,R->block0[j], R->block1[j]); 2151 2157 int i; … … 2159 2165 case ringorder_wp: 2160 2166 case ringorder_Wp: 2161 R->wvhdl[j] =( int *)omAlloc( (iv->length())*sizeof(int));2162 for (i=0; i<iv ->length();i++)2167 R->wvhdl[j] =( int *)omAlloc(iv_len*sizeof(int)); 2168 for (i=0; i<iv_len;i++) 2163 2169 { 2164 2170 R->wvhdl[j][i]=(*iv)[i]; … … 2169 2175 for (i=0; i<iv->length();i++) R->wvhdl[j][i]=(*iv)[i]; 2170 2176 R->block1[j]=si_max(R->block0[j],R->block0[j]+(int)sqrt((double)(iv->length()-1))); 2177 if (R->block1[j]>R->N) 2178 { 2179 WerrorS("ordering matrix too big"); 2180 goto rCompose_err; 2181 } 2171 2182 break; 2172 2183 case ringorder_ls: … … 2188 2199 2189 2200 case ringorder_s: 2190 {2191 2201 break; 2192 }2193 2202 2194 2203 case ringorder_IS:
Note: See TracChangeset
for help on using the changeset viewer.