160 assume(this_area>=last_area);
161 if(this_area>last_area)
164 for(
j=last_area+1;
j<=this_area;
j++)
169 for(
i=last_area+1;
i<=max_area_index;
i++)
185 assume(tai<=max_area_index);
186 if(tai==max_area_index)
189 max_in_area=area[tai+1]-1;
199 assume(pn<=mat->get_rows());
200 for(
i=row+1;
i<=max_in_area;
i++)
222 for(
i=found_in_row+1;
i<=max_in_area;
i++)
227 int first=row_cache[
i];
241 int h=row_cache[row];
242 row_cache[row]=row_cache[found_in_row];
243 row_cache[found_in_row]=
h;
256 for(
i=max_in_area;
i>row;
i--)
259 assume(col_area_index<=max_area_index);
263 int first=row_cache[
i];
266 if(row_cache[
i]==col)
269 number c1=mat->
get(
i,col);
270 number c2=mat->
get(row,col);
284 if(row_cache[
i]==matcol)
289 int this_cai=col_area_index;
290 while(this_cai<max_area_index)
292 last_in_area=area[this_cai+1]-1;
293 int h_c=row_cache[last_in_area];
294 row_cache[last_in_area]=row_cache[
index];
295 row_cache[
index]=h_c;
302 row_cache[
index]=row_cache[pn-1];
303 row_cache[pn-1]=matcol;
311 int this_cai=col_area_index;
313 assume(final_cai<=max_area_index);
314 while(this_cai<final_cai)
316 last_in_area=area[this_cai+1]-1;
317 int h_c=row_cache[last_in_area];
318 row_cache[last_in_area]=row_cache[
index];
319 row_cache[
index]=h_c;
BOOLEAN is_zero_entry(int i, int j)
int min_col_not_zero_in_row(int row)
void add_lambda_times_row(int add_to, int summand, number factor)
BOOLEAN zero_row(int row)
void perm_rows(int i, int j)
int non_zero_entries(int row)
void mult_row(int row, number factor)
void row_content(int row)
int ksCheckCoeff(number *a, number *b)
static int index(p_Length length, p_Ord ord)
VAR ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
static const int bundle_size