Go to the source code of this file.
◆ jInitBasis()
Definition at line 13 of file wrapper.cc.
14{
16 {
17 WerrorS(
"janet only for well-orderings");
19 }
20
22
25
28
30 {
32 {
34
38
40 }
41 }
42
46 return r;
47}
const Variable & v
< [in] a sqrfree bivariate poly
void WerrorS(const char *s)
void InitHistory(Poly *p)
int ComputeBasis(jList *_lT, jList *_lQ)
void InsertInCount(jList *x, Poly *y)
void Initialization(char *Ord)
VAR ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
#define pCopy(p)
return a copy of the poly
static BOOLEAN rHasLocalOrMixedOrdering(const ring r)
◆ jjStdJanetBasis()
flag: 0: JB, 1: SB
Definition at line 50 of file wrapper.cc.
51{
53
59 {
61 {
62 goto zero;
63 }
64 else
66 }
67 if (is_zero)
68 goto zero;
70 {
73 if (flag==1)
75 else
77
79
81
83
85 {
88 {
89
91 {
96
98 }
99 }
100 else
101 {
106
108 }
110 }
111
112 if ((flag==1) && (
dpO==0))
113 {
114
117 }
123 }
124 else
126
127zero:
133}
void DestroyList(jList *x)
ideal kInterRedOld(ideal F, const ideal Q)
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy
long p_Deg(poly a, const ring r)
#define pIsConstant(p)
like above, except that Comp must be 0
ideal idInit(int idsize, int rank)
initialise an ideal / module
void idSkipZeroes(ideal ide)
gives an ideal/module the minimal possible size
static BOOLEAN jInitBasis(ideal v, jList **TT, jList **QQ)