83 assume( (0<n) && (n<=(
v->rows())) );
88 for (
int i=c-1;
i>=0;
i--)
173 for (
int i=0;
i<c;
i++)
175 (*res)[
i]=(*v)[
i+
cc ];
189 for (
int i=0;
i<c;
i++)
236 if( ( ((*
temp64)[
i]) > 0 ) && ( ((*add64)[
i]) > 0 ) )
241 if( ( ((*
temp64)[
i]) < 0 ) && ( ((*add64)[
i]) < 0 ) )
272 for(
i=n-1;
i>=0;
i--)
567 for(
int j=1;
j<=
s;
j++)
643 if( (((*a)[
i])>=0 && ((*
b)[
i])>=0) ||
644 (((*a)[
i])<0 && ((*
b)[
i])<0) )
660 for (
int i=1;
i<
s;
i++)
662 temp=(*nextweight)[
i];
688 if(0<n && n<=((
int)
I->ncols))
752 for(
int i=
N;
i>0;
i--) { (*iv)[
i-1]=e[
i];}
816 for(
i=n-1;
i>=0;
i--)
838 int r,
p0 = a, p1 =
b;
873 while(p1 != ((
int64)0) )
920 l->m[0].data=(
void *)
iv64;
921 l->m[1].data=(
void *)
i64;
1027 while(r->order[
i]!=0 &&
pos2<n)
1052 int* weights=r->wvhdl[
i];
1060 int* weights=r->wvhdl[
i];
1069 int* weights=r->wvhdl[0];
1109 length=r->block1[0] - r->block0[0];
1116 int* weights=r->wvhdl[0];
1117 length=r->block1[0] - r->block0[0];
1124 length=r->block1[0] - r->block0[0];
1126 (*
res)[
j]=weights[
j];
1151 for (
int i=0;
i<(
s-1);
i++)
1153 for (
int j=0;
j<((
s-1)-
i);
j++)
1186 for(
int i=0;
i<r;
i++){
1187 for(
int j=0;
j<c;
j++){
Rational abs(const Rational &a)
const CanonicalForm CFMap CFMap & N
const CanonicalForm int s
const Variable & v
< [in] a sqrfree bivariate poly
ideal idLift(ideal mod, ideal submod, ideal *rest, BOOLEAN goodShape, BOOLEAN isSB, BOOLEAN divide, matrix *unit, GbVariant alg)
represents the generators of submod in terms of the generators of mod (Matrix(SM)*U-Matrix(rest)) = M...
#define idDelete(H)
delete an ideal
int64vec * iv64Add(int64vec *a, int64vec *b)
int64vec * iv64Sub(int64vec *a, int64vec *b)
int64vec * iv64Copy(int64vec *o)
static BOOLEAN length(leftv result, leftv arg)
intvec * ivSub(intvec *a, intvec *b)
#define IMATELEM(M, I, J)
ideal kStd(ideal F, ideal Q, tHomog h, intvec **w, bigintmat *hilb, int syzComp, int newIdeal, intvec *vw, s_poly_proc_t sp)
ideal kInterRedOld(ideal F, const ideal Q)
static int pLength(poly a)
static void p_GetExpV(poly p, int *ev, const ring r)
void rChangeCurrRing(ring r)
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)
static long pTotaldegree(poly p)
#define pHead(p)
returns newly allocated copy of Lm(p), coef is copied, next=NULL, p might be NULL
#define pLmCmp(p, q)
returns 0|1|-1 if p=q|p>q|p<q w.r.t monomial ordering
void rSetWeightVec(ring r, int64 *wv)
BOOLEAN rComplete(ring r, int force)
this needs to be called whenever a new ring is created: new fields in ring are created (like VarOffse...
ring rCopy0(const ring r, BOOLEAN copy_qideal, BOOLEAN copy_ordering)
static BOOLEAN rHasLocalOrMixedOrdering(const ring r)
@ ringorder_a64
for int64 weights
static short rVar(const ring r)
#define rVar(r) (r->N)
ideal idInit(int idsize, int rank)
initialise an ideal / module
matrix id_Module2formatedMatrix(ideal mod, int rows, int cols, const ring R)
void idSkipZeroes(ideal ide)
gives an ideal/module the minimal possible size
int64vec * rGetGlobalOrderMatrix(ring r)
void nextt64(ideal G, int64vec *currw64, int64vec *targw64, int64 &tvec0, int64 &tvec1)
poly getNthPolyOfId(ideal I, int n)
matrix matIdLift(ideal Gomega, ideal M)
int invEpsOk64(ideal I, intvec *targm, int pertdeg, int64 inveps64)
void getTaun64(ideal G, intvec *targm, int pertdeg, int64vec **v64, int64 &i64)
int getMaxPosOfNthRow(intvec *v, int n)
intvec * getNthRow(intvec *v, int n)
EXTERN_VAR int overflow_error
BOOLEAN currwOnBorder64(ideal G, int64vec *currw64)
int64vec * nextw64(int64vec *currw, int64vec *targw, int64 nexttvec0, int64 nexttvec1)
static long scalarProduct(intvec *a, intvec *b)
BOOLEAN noPolysWithMoreThanTwoTerms(ideal Gw)
void rCopyAndChangeA(int64vec *w)
intvec * int64VecToIntVec(int64vec *source)
int64 gcd64(int64 a, int64 b)
ideal init64(ideal G, int64vec *currw64)
void gett64(intvec *listw, int64vec *currw64, int64vec *targw64, int64 &tvec0, int64 &tvec1)
int64vec * getNthRow64(intvec *v, int n)
int64vec * leadExp64(poly p)
ideal idInterRed(ideal G)
static int64 scalarProduct64(int64vec *a, int64vec *b)
int64 getInvEps64(ideal G, intvec *targm, int pertdeg)
int64vec * rGetGlobalOrderWeightVec(ring r)
int iv64Size(int64vec *v)