163 assume(this_area>=last_area);
164 if(this_area>last_area)
167 for(
j=last_area+1;
j<=this_area;
j++)
172 for(
i=last_area+1;
i<=max_area_index;
i++)
188 assume(tai<=max_area_index);
189 if(tai==max_area_index)
192 max_in_area=area[tai+1]-1;
202 assume(pn<=mat->get_rows());
203 for(
i=row+1;
i<=max_in_area;
i++)
225 for(
i=found_in_row+1;
i<=max_in_area;
i++)
230 int first=row_cache[
i];
244 int h=row_cache[row];
245 row_cache[row]=row_cache[found_in_row];
246 row_cache[found_in_row]=
h;
259 for(
i=max_in_area;
i>row;
i--)
262 assume(col_area_index<=max_area_index);
266 int first=row_cache[
i];
269 if(row_cache[
i]==col)
272 number c1=mat->
get(
i,col);
273 number c2=mat->
get(row,col);
287 if(row_cache[
i]==matcol)
292 int this_cai=col_area_index;
293 while(this_cai<max_area_index)
295 last_in_area=area[this_cai+1]-1;
296 int h_c=row_cache[last_in_area];
297 row_cache[last_in_area]=row_cache[
index];
298 row_cache[
index]=h_c;
305 row_cache[
index]=row_cache[pn-1];
306 row_cache[pn-1]=matcol;
314 int this_cai=col_area_index;
316 assume(final_cai<=max_area_index);
317 while(this_cai<final_cai)
319 last_in_area=area[this_cai+1]-1;
320 int h_c=row_cache[last_in_area];
321 row_cache[last_in_area]=row_cache[
index];
322 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)
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
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)
int non_zero_entries(int row)
static const int bundle_size