Go to the source code of this file.
|
number | p_CoeffTerm (poly p, poly m, const ring r) |
| find coeff of (polynomial) m in polynomial p find coeff of (vector) m in vector p
|
|
poly | p_CoeffTermV (poly v, poly m, const ring r) |
| find vector of coeffs of (polynomial) m in vector v
|
|
ideal | id_CoeffTerm (ideal I, poly m, const ring r) |
| find coeffs of (polynomial) m in all polynomials from I find coeffs of (vector) m in all vectors from I
|
|
ideal | id_CoeffTermV (ideal M, poly m, const ring r) |
| find coeffs of (polynomial) m in all vectors from I
|
|
poly | p_CoeffTermId (poly v, ideal m, int n, const ring r) |
| find coeffs of a vector of a list of given monomials, n>=max_comp(v)
|
|
poly | p_CoeffTermMo (poly v, ideal m, int n, const ring r) |
| find coeffs of a vector of a matrix(as module) of given monomials, n>=max_comp(v)
|
|
◆ id_CoeffTerm()
find coeffs of (polynomial) m in all polynomials from I find coeffs of (vector) m in all vectors from I
Definition at line 63 of file pCoeff.cc.
64{
67 {
70 }
72}
number p_CoeffTerm(poly p, poly m, const ring r)
find coeff of (polynomial) m in polynomial p find coeff of (vector) m in vector p
poly p_NSet(number n, const ring r)
returns the poly representing the number n, destroys n
ideal idInit(int idsize, int rank)
initialise an ideal / module
◆ id_CoeffTermV()
find coeffs of (polynomial) m in all vectors from I
Definition at line 75 of file pCoeff.cc.
76{
79 {
81 }
83}
poly p_CoeffTermV(poly v, poly m, const ring r)
find vector of coeffs of (polynomial) m in vector v
◆ p_CoeffTerm()
find coeff of (polynomial) m in polynomial p find coeff of (vector) m in vector p
Definition at line 22 of file pCoeff.cc.
23{
25 {
27 {
29 {
31 }
33 }
34 }
36}
static FORCE_INLINE number n_Copy(number n, const coeffs r)
return a copy of 'n'
static FORCE_INLINE number n_Init(long i, const coeffs r)
a number representing i in the given coeff field/ring r
static int p_LmCmp(poly p, poly q, const ring r)
◆ p_CoeffTermId()
find coeffs of a vector of a list of given monomials, n>=max_comp(v)
Definition at line 86 of file pCoeff.cc.
87{
89 poly q;
95 {
98 {
102 {
105 }
106 }
108 }
109 return u;
110}
const Variable & v
< [in] a sqrfree bivariate poly
void p_TakeOutComp(poly *p, long comp, poly *q, int *lq, const ring r)
static poly p_Add_q(poly p, poly q, const ring r)
static unsigned long p_SetComp(poly p, unsigned long c, ring r)
static poly p_Copy(poly p, const ring r)
returns a copy of p
◆ p_CoeffTermMo()
find coeffs of a vector of a matrix(as module) of given monomials, n>=max_comp(v)
find coeffs of a vector of a matrix(as module) of given monomials, n>=max_comp(v)
Definition at line 113 of file pCoeff.cc.
114{
117 poly q;
121 {
128 {
132 }
133 else
135 }
137}
poly p_CoeffTermId(poly v, ideal m, int n, const ring r)
find coeffs of a vector of a list of given monomials, n>=max_comp(v)
void p_Shift(poly *p, int i, const ring r)
shifts components of the vector p by i
static void p_SetCompP(poly p, int i, ring r)
static long p_MaxComp(poly p, ring lmRing, ring tailRing)
ideal id_Vec2Ideal(poly vec, const ring R)
◆ p_CoeffTermV()
poly p_CoeffTermV |
( |
poly |
v, |
|
|
poly |
m, |
|
|
const ring |
r |
|
) |
| |
find vector of coeffs of (polynomial) m in vector v
Definition at line 39 of file pCoeff.cc.
40{
43 {
45 {
48 {
54 }
56 }
57 }
59}
#define p_SetCoeff0(p, n, r)
static poly p_Init(const ring r, omBin bin)