Go to the source code of this file.
◆ mac_poly
◆ mac_destroy()
◆ mac_length()
◆ mac_mult_cons()
void mac_mult_cons |
( |
mac_poly |
p, |
|
|
number |
c |
|
) |
| |
◆ mac_p_add_ff_qq()
Definition at line 16 of file tgbgauss.cc.
28 set_this= &((*set_this)->next);
39 set_this= &((*set_this)->next);
62 set_this= &((*set_this)->next);
◆ simple_gauss()
Definition at line 125 of file tgbgauss.cc.
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;
◆ simple_gauss2()
Definition at line 365 of file tgbgauss.cc.
384 while((row<pn-1)&&(col<mat->get_columns())){
396 assume(pn<=mat->get_rows());
426 for(
i=row+1;
i<pn;
i++){
432 number c2=mat->
get(row,col);