132 int pn=
mat->get_rows();
252 mat->row_content(row);
278 mat->add_lambda_times_row(
i,row,
n1);
350 int act=
mat->min_col_not_zero_in_row(
i);
371 int pn=
mat->get_rows();
400 if(!(
mat->is_zero_entry(
i,col)))
414 if((!(
mat->is_zero_entry(
i,col)))
425 for(
i=row+1;
i<
pn;
i++){
427 if(!(
mat->is_zero_entry(
i,col)))
438 mat->add_lambda_times_row(
i,row,
n1);
688 if (bp==
NULL)
return -1;
689 if (
ap->exp<bp->
exp)
return -1;
737 (*set_this)->next=
old;
750 (*set_this)=
dt->next;
void mult_row(int row, number factor)
void add_lambda_times_row(int add_to, int summand, number factor)
void set(int i, int j, number n)
int min_col_not_zero_in_row(int row)
int non_zero_entries(int row)
int next_col_not_zero(int row, int pre)
BOOLEAN zero_row(int row)
BOOLEAN is_zero_entry(int i, int j)
void free_row(int row, BOOLEAN free_non_zeros=TRUE)
void perm_rows(int i, int j)
void set(int i, int j, number n)
BOOLEAN is_zero_entry(int i, int j)
int min_col_not_zero_in_row(int row)
tgb_sparse_matrix(int i, int j, ring rarg)
void add_lambda_times_row(int add_to, int summand, number factor)
BOOLEAN zero_row(int row)
void row_normalize(int row)
int next_col_not_zero(int row, int pre)
int non_zero_entries(int row)
void mult_row(int row, number factor)
void row_content(int row)
void free_row(int row, BOOLEAN free_non_zeros=TRUE)
static FORCE_INLINE number n_Gcd(number a, number b, const coeffs r)
in Z: return the gcd of 'a' and 'b' in Z/nZ, Z/2^kZ: computed as in the case Z in Z/pZ,...
static FORCE_INLINE void n_Write(number n, const coeffs r, const BOOLEAN bShortOut=TRUE)
static FORCE_INLINE void n_Normalize(number &n, const coeffs r)
inplace-normalization of n; produces some canonical representation of n;
const CanonicalForm int s
int ksCheckCoeff(number *a, number *b, const coeffs r)
number ndGcd(number, number, const coeffs r)
#define TEST_OPT_CONTENTSB
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 ...
Compatibility layer for legacy polynomial operations (over currRing)
void StringSetS(const char *st)
void PrintS(const char *s)
static BOOLEAN rField_has_simple_inverse(const ring r)
static const int bundle_size
mac_poly mac_p_add_ff_qq(mac_poly a, number f, mac_poly b)
static int row_cmp_gen(const void *a, const void *b)
void mac_destroy(mac_poly p)
void simple_gauss2(tgb_matrix *mat)
void mac_mult_cons(mac_poly p, number c)
void simple_gauss(tgb_sparse_matrix *mat, slimgb_alg *)
int mac_length(mac_poly p)
mac_poly mac_p_add_ff_qq(mac_poly a, number f, mac_poly b)
void mac_destroy(mac_poly p)
void mac_mult_cons(mac_poly p, number c)
int mac_length(mac_poly p)