 |
My Project
UNKNOWN_GIT_VERSION
|
#include <kutil.h>
|
KINLINE void | Init (ring r=currRing) |
|
KINLINE | sTObject (ring tailRing=currRing) |
|
KINLINE | sTObject (poly p, ring tailRing=currRing) |
|
KINLINE | sTObject (poly p, ring c_r, ring tailRing) |
|
KINLINE | sTObject (sTObject *T, int copy) |
|
KINLINE void | Set (ring r=currRing) |
|
KINLINE void | Set (poly p_in, ring r=currRing) |
|
KINLINE void | Set (poly p_in, ring c_r, ring t_r) |
|
KINLINE void | Delete () |
|
KINLINE void | Clear () |
|
KINLINE void | Copy () |
|
KINLINE poly | GetLmCurrRing () |
|
KINLINE poly | GetLmTailRing () |
|
KINLINE poly | GetLm (ring r) |
|
KINLINE void | GetLm (poly &p, ring &r) const |
|
KINLINE BOOLEAN | IsNull () const |
|
KINLINE int | GetpLength () |
|
KINLINE void | SetLmCurrRing () |
|
KINLINE poly | Next () |
|
KINLINE void | LmDeleteAndIter () |
|
KINLINE long | pTotalDeg () const |
|
KINLINE long | pFDeg () const |
|
KINLINE long | SetpFDeg () |
|
KINLINE long | GetpFDeg () const |
|
KINLINE long | pLDeg () |
|
KINLINE long | SetDegStuffReturnLDeg () |
|
KINLINE void | Mult_nn (number n) |
|
KINLINE void | ShallowCopyDelete (ring new_tailRing, omBin new_tailBin, pShallowCopyDeleteProc p_shallow_copy_delete, BOOLEAN set_max=TRUE) |
|
KINLINE void | pNorm () |
|
KINLINE void | pCleardenom () |
|
Definition at line 63 of file kutil.h.
◆ sTObject() [1/4]
◆ sTObject() [2/4]
◆ sTObject() [3/4]
KINLINE sTObject::sTObject |
( |
poly |
p, |
|
|
ring |
c_r, |
|
|
ring |
tailRing |
|
) |
| |
◆ sTObject() [4/4]
◆ Clear()
◆ Copy()
◆ Delete()
◆ GetLm() [1/2]
KINLINE void sTObject::GetLm |
( |
poly & |
p, |
|
|
ring & |
r |
|
) |
| const |
◆ GetLm() [2/2]
KINLINE poly sTObject::GetLm |
( |
ring |
r | ) |
|
◆ GetLmCurrRing()
KINLINE poly sTObject::GetLmCurrRing |
( |
| ) |
|
◆ GetLmTailRing()
KINLINE poly sTObject::GetLmTailRing |
( |
| ) |
|
◆ GetpFDeg()
KINLINE long sTObject::GetpFDeg |
( |
| ) |
const |
◆ GetpLength()
KINLINE int sTObject::GetpLength |
( |
| ) |
|
◆ Init()
◆ IsNull()
◆ LmDeleteAndIter()
KINLINE void sTObject::LmDeleteAndIter |
( |
| ) |
|
◆ Mult_nn()
KINLINE void sTObject::Mult_nn |
( |
number |
n | ) |
|
◆ Next()
◆ pCleardenom()
KINLINE void sTObject::pCleardenom |
( |
| ) |
|
◆ pFDeg()
KINLINE long sTObject::pFDeg |
( |
| ) |
const |
◆ pLDeg()
◆ pNorm()
◆ pTotalDeg()
KINLINE long sTObject::pTotalDeg |
( |
| ) |
const |
◆ Set() [1/3]
KINLINE void sTObject::Set |
( |
poly |
p_in, |
|
|
ring |
c_r, |
|
|
ring |
t_r |
|
) |
| |
◆ Set() [2/3]
◆ Set() [3/3]
◆ SetDegStuffReturnLDeg()
KINLINE long sTObject::SetDegStuffReturnLDeg |
( |
| ) |
|
◆ SetLmCurrRing()
KINLINE void sTObject::SetLmCurrRing |
( |
| ) |
|
◆ SetpFDeg()
KINLINE long sTObject::SetpFDeg |
( |
| ) |
|
◆ ShallowCopyDelete()
Definition at line 356 of file kInline.h.
363 if (new_tailBin ==
NULL) new_tailBin = new_tailRing->PolyBin;
366 t_p = p_shallow_copy_delete(
t_p,
tailRing, new_tailRing, new_tailBin);
381 tailRing, new_tailRing, new_tailBin);
◆ ecart
◆ FDeg
◆ i_r
◆ is_normalized
char sTObject::is_normalized |
◆ is_redundant
char sTObject::is_redundant |
◆ is_sigsafe
char sTObject::is_sigsafe |
◆ is_special
char sTObject::is_special |
◆ length
◆ max_exp
◆ pLength
◆ sevSig
unsigned long sTObject::sevSig |
◆ sig
◆ t_p
◆ tailRing
The documentation for this class was generated from the following files:
KINLINE poly k_LmInit_tailRing_2_currRing(poly t_p, ring tailRing, omBin lmBin)
static poly p_LmDeleteAndNext(poly p, const ring r)
KINLINE long pFDeg() const
static poly p_LmInit(poly p, const ring r)
#define TEST_OPT_CONTENTSB
KINLINE void Set(ring r=currRing)
KINLINE poly k_LmInit_currRing_2_tailRing(poly p, ring tailRing, omBin tailBin)
static poly p_Copy(poly p, const ring r)
returns a copy of p
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
denominator_list_s * denominator_list
void p_ProjectiveUnique(poly ph, const ring r)
KINLINE long SetDegStuffReturnLDeg()
poly p_GetMaxExpP(poly p, const ring r)
return monomial r such that GetExp(r,i) is maximum of all monomials in p; coeff == 0,...
KINLINE poly GetLmCurrRing()
denominator_list DENOMINATOR_LIST
static void p_LmFree(poly p, ring)
static void p_Delete(poly *p, const ring r)
KINLINE poly GetLmTailRing()
void p_Norm(poly p1, const ring r)
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy
CFArray copy(const CFList &list)
write elements of list into an array
static poly p_Mult_nn(poly p, number n, const ring r)
void p_Cleardenom_n(poly ph, const ring r, number &c)
KINLINE void Init(ring r=currRing)