161 assume(this_area>=last_area);
162 if(this_area>last_area)
165 for(j=last_area+1;j<=this_area;j++)
170 for(i=last_area+1;i<=max_area_index;i++)
186 assume(tai<=max_area_index);
187 if(tai==max_area_index)
190 max_in_area=area[tai+1]-1;
200 assume(pn<=mat->get_rows());
201 for(i=row+1;i<=max_in_area;i++)
223 for(i=found_in_row+1;i<=max_in_area;i++)
228 int first=row_cache[
i];
242 int h=row_cache[row];
243 row_cache[row]=row_cache[found_in_row];
244 row_cache[found_in_row]=
h;
257 for(i=max_in_area;i>row;i--)
260 assume(col_area_index<=max_area_index);
264 int first=row_cache[
i];
267 if(row_cache[i]==col)
270 number c1=mat->
get(i,col);
271 number c2=mat->
get(row,col);
285 if(row_cache[i]==matcol)
290 int this_cai=col_area_index;
291 while(this_cai<max_area_index)
293 last_in_area=area[this_cai+1]-1;
294 int h_c=row_cache[last_in_area];
295 row_cache[last_in_area]=row_cache[
index];
296 row_cache[
index]=h_c;
303 row_cache[
index]=row_cache[pn-1];
304 row_cache[pn-1]=matcol;
312 int this_cai=col_area_index;
314 assume(final_cai<=max_area_index);
315 while(this_cai<final_cai)
317 last_in_area=area[this_cai+1]-1;
318 int h_c=row_cache[last_in_area];
319 row_cache[last_in_area]=row_cache[
index];
320 row_cache[
index]=h_c;
void row_content(int row)
void row_normalize(int row)
BOOLEAN is_zero_entry(int i, int j)
int min_col_not_zero_in_row(int row)
int ksCheckCoeff(number *a, number *b)
void add_lambda_times_row(int add_to, int summand, number factor)
static int index(p_Length length, p_Ord ord)
void perm_rows(int i, int j)
void mult_row(int row, number factor)
BOOLEAN zero_row(int row)
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
int non_zero_entries(int row)
static const int bundle_size