Functions
singularWishlist.h File Reference
#include <polys/monomials/p_polys.h>

Go to the source code of this file.

Functions

static BOOLEAN _p_LeadmonomDivisibleByNoComp (poly a, poly b, const ring r)
 
static BOOLEAN p_LeadmonomDivisibleBy (poly a, poly b, const ring r)
 p_LmDivisibleBy checks also the divisibility of coefficients More...
 
void idShallowDelete (ideal *h)
 id_ShallowDelete deletes the monomials of the polynomials stored inside of it More...
 

Function Documentation

§ _p_LeadmonomDivisibleByNoComp()

static BOOLEAN _p_LeadmonomDivisibleByNoComp ( poly  a,
poly  b,
const ring  r 
)
inlinestatic

Definition at line 16 of file singularWishlist.h.

17 {
18  int i=r->VarL_Size - 1;
19  unsigned long divmask = r->divmask;
20  unsigned long la, lb;
21 
22  if (r->VarL_LowIndex >= 0)
23  {
24  i += r->VarL_LowIndex;
25  do
26  {
27  la = a->exp[i];
28  lb = b->exp[i];
29  if ((la > lb) ||
30  (((la & divmask) ^ (lb & divmask)) != ((lb - la) & divmask)))
31  {
33  return FALSE;
34  }
35  i--;
36  }
37  while (i>=r->VarL_LowIndex);
38  }
39  else
40  {
41  do
42  {
43  la = a->exp[r->VarL_Offset[i]];
44  lb = b->exp[r->VarL_Offset[i]];
45  if ((la > lb) ||
46  (((la & divmask) ^ (lb & divmask)) != ((lb - la) & divmask)))
47  {
49  return FALSE;
50  }
51  i--;
52  }
53  while (i>=0);
54  }
56  return TRUE;
57 }
const poly a
Definition: syzextra.cc:212
#define FALSE
Definition: auxiliary.h:97
BOOLEAN p_DebugLmDivisibleByNoComp(poly a, poly b, ring r)
Definition: pDebug.cc:140
#define TRUE
Definition: auxiliary.h:101
const ring r
Definition: syzextra.cc:208
int i
Definition: cfEzgcd.cc:123
#define pDivAssume(x)
Definition: p_polys.h:1205
const poly b
Definition: syzextra.cc:213

§ idShallowDelete()

void idShallowDelete ( ideal *  h)
inline

id_ShallowDelete deletes the monomials of the polynomials stored inside of it

Definition at line 75 of file singularWishlist.h.

76 {
77  if (*h != NULL)
78  {
79  int k;
80  k=(*h)->nrows*(*h)->ncols;
81  if (k>0)
82  omFreeSize((ADDRESS)((*h)->m),sizeof(poly)*k);
84  *h=NULL;
85  }
86  return;
87 }
omBin sip_sideal_bin
Definition: simpleideals.cc:30
#define omFreeSize(addr, size)
Definition: omAllocDecl.h:260
void * ADDRESS
Definition: auxiliary.h:118
int k
Definition: cfEzgcd.cc:93
#define NULL
Definition: omList.c:10
polyrec * poly
Definition: hilb.h:10
#define omFreeBin(addr, bin)
Definition: omAllocDecl.h:259
static Poly * h
Definition: janet.cc:978

§ p_LeadmonomDivisibleBy()

static BOOLEAN p_LeadmonomDivisibleBy ( poly  a,
poly  b,
const ring  r 
)
inlinestatic

p_LmDivisibleBy checks also the divisibility of coefficients

Definition at line 62 of file singularWishlist.h.

63 {
65 
67  if (p_GetComp(a, r) == 0 || p_GetComp(a,r) == p_GetComp(b,r))
69  return FALSE;
70 }
const poly a
Definition: syzextra.cc:212
#define FALSE
Definition: auxiliary.h:97
#define p_GetComp(p, r)
Definition: monomials.h:72
static BOOLEAN _p_LeadmonomDivisibleByNoComp(poly a, poly b, const ring r)
const ring r
Definition: syzextra.cc:208
#define p_LmCheckPolyRing1(p, r)
Definition: monomials.h:185
#define pIfThen1(cond, check)
Definition: monomials.h:187
#define NULL
Definition: omList.c:10
const poly b
Definition: syzextra.cc:213