 |
My Project
debian-1:4.1.1-p2+ds-4build3
|
#include <kutil.h>
|
KINLINE void | Init (ring tailRing=currRing) |
|
KINLINE | sLObject (ring tailRing=currRing) |
|
KINLINE | sLObject (poly p, ring tailRing=currRing) |
|
KINLINE | sLObject (poly p, ring c_r, ring tailRing) |
|
KINLINE void | Delete () |
|
KINLINE void | Clear () |
|
KINLINE void | LmDeleteAndIter () |
|
KINLINE poly | LmExtractAndIter () |
|
KINLINE void | PrepareRed (BOOLEAN use_bucket) |
|
KINLINE void | SetLmTail (poly lm, poly new_p, int length, int use_bucket, ring r) |
|
KINLINE void | Tail_Minus_mm_Mult_qq (poly m, poly qq, int lq, poly spNoether) |
|
KINLINE void | Tail_Mult_nn (number n) |
|
KINLINE poly | GetP (omBin lmBin=(omBin) NULL) |
|
KINLINE poly | GetTP () |
|
KINLINE poly | CanonicalizeP () |
|
KINLINE void | Copy () |
|
KINLINE int | GetpLength () |
|
KINLINE long | pLDeg (BOOLEAN use_last) |
|
KINLINE long | pLDeg () |
|
KINLINE int | SetLength (BOOLEAN lengt_pLength=FALSE) |
|
KINLINE long | SetDegStuffReturnLDeg () |
|
KINLINE long | SetDegStuffReturnLDeg (BOOLEAN use_last) |
|
KINLINE long | MinComp () |
|
KINLINE long | Comp () |
|
KINLINE void | ShallowCopyDelete (ring new_tailRing, pShallowCopyDeleteProc p_shallow_copy_delete) |
|
KINLINE void | SetShortExpVector () |
|
KINLINE sLObject & | operator= (const sTObject &) |
|
KINLINE TObject * | T_1 (const skStrategy *strat) |
|
KINLINE TObject * | T_2 (const skStrategy *strat) |
|
KINLINE void | T_1_2 (const skStrategy *strat, TObject *&T_1, TObject *&T_2) |
|
KINLINE void | Normalize () |
|
KINLINE void | HeadNormalize () |
|
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 173 of file kutil.h.
◆ sLObject() [1/3]
◆ sLObject() [2/3]
◆ sLObject() [3/3]
KINLINE sLObject::sLObject |
( |
poly |
p, |
|
|
ring |
c_r, |
|
|
ring |
tailRing |
|
) |
| |
◆ CanonicalizeP()
KINLINE poly sLObject::CanonicalizeP |
( |
| ) |
|
◆ Clear()
◆ Comp()
◆ Copy()
◆ Delete()
◆ GetP()
◆ GetpLength()
KINLINE int sLObject::GetpLength |
( |
| ) |
|
◆ GetTP()
◆ HeadNormalize()
KINLINE void sLObject::HeadNormalize |
( |
| ) |
|
◆ Init()
◆ LmDeleteAndIter()
KINLINE void sLObject::LmDeleteAndIter |
( |
| ) |
|
◆ LmExtractAndIter()
KINLINE poly sLObject::LmExtractAndIter |
( |
| ) |
|
◆ MinComp()
◆ Normalize()
KINLINE void sLObject::Normalize |
( |
| ) |
|
◆ operator=()
Definition at line 825 of file kInline.h.
827 memset(
this, 0,
sizeof(*
this));
◆ pLDeg() [1/2]
◆ pLDeg() [2/2]
◆ PrepareRed()
Definition at line 524 of file kInline.h.
529 if (use_bucket && (
l > 1))
◆ SetDegStuffReturnLDeg() [1/2]
KINLINE long sLObject::SetDegStuffReturnLDeg |
( |
| ) |
|
◆ SetDegStuffReturnLDeg() [2/2]
◆ SetLength()
◆ SetLmTail()
KINLINE void sLObject::SetLmTail |
( |
poly |
lm, |
|
|
poly |
new_p, |
|
|
int |
length, |
|
|
int |
use_bucket, |
|
|
ring |
r |
|
) |
| |
◆ SetShortExpVector()
KINLINE void sLObject::SetShortExpVector |
( |
| ) |
|
◆ ShallowCopyDelete()
Definition at line 700 of file kInline.h.
705 p_shallow_copy_delete);
707 new_tailRing->PolyBin,p_shallow_copy_delete,
◆ T_1()
◆ T_1_2()
◆ T_2()
◆ Tail_Minus_mm_Mult_qq()
KINLINE void sLObject::Tail_Minus_mm_Mult_qq |
( |
poly |
m, |
|
|
poly |
qq, |
|
|
int |
lq, |
|
|
poly |
spNoether |
|
) |
| |
◆ Tail_Mult_nn()
KINLINE void sLObject::Tail_Mult_nn |
( |
number |
n | ) |
|
◆ bucket
◆ checked
unsigned sLObject::checked |
◆ i_r1
◆ i_r2
◆ lcm
◆ p1
◆ p2
◆ prod_crit
◆ sev
unsigned long sLObject::sev |
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)
int kBucketCanonicalize(kBucket_pt bucket)
KINLINE long pFDeg() const
static poly p_Minus_mm_Mult_qq(poly p, const poly m, const poly q, int &lp, int lq, const poly spNoether, const ring r)
KINLINE void LmDeleteAndIter()
static poly p_LmShallowCopyDelete(poly p, const ring r)
#define __p_Mult_nn(p, n, r)
KINLINE void Set(ring r=currRing)
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 ...
static long p_MinComp(poly p, ring lmRing, ring tailRing)
poly kBucketExtractLm(kBucket_pt bucket)
KINLINE void ShallowCopyDelete(ring new_tailRing, omBin new_tailBin, pShallowCopyDeleteProc p_shallow_copy_delete, BOOLEAN set_max=TRUE)
KINLINE TObject * T_2(const skStrategy *strat)
void kBucketDestroy(kBucket_pt *bucket_pt)
void kBucketInit(kBucket_pt bucket, poly lm, int length)
void kBucket_Minus_m_Mult_p(kBucket_pt bucket, poly m, poly p, int *l, poly spNoether)
Bpoly == Bpoly - m*p; where m is a monom Does not destroy p and m assume (*l <= 0 || pLength(p) == *l...
void kBucket_Mult_n(kBucket_pt bucket, number n)
Multiply Bucket by number ,i.e. Bpoly == n*Bpoly.
void kBucketShallowCopyDelete(kBucket_pt bucket, ring new_tailRing, omBin new_tailBin, pShallowCopyDeleteProc p_shallow_copy_delete)
For changing the ring of the Bpoly to new_tailBin.
poly p_Last(const poly p, int &l, const ring r)
void kBucketClear(kBucket_pt bucket, poly *p, int *length)
int kFindInT(poly p, TSet T, int tlength)
returns index of p in TSet, or -1 if not found
static void p_LmFree(poly p, ring)
KINLINE TObject * T_1(const skStrategy *strat)
KINLINE poly GetLmTailRing()
void kBucketDeleteAndDestroy(kBucket_pt *bucket_pt)
kBucket_pt kBucketCreate(const ring bucket_ring)
Creation/Destruction of buckets.
const CanonicalForm int s
static BOOLEAN rIsSyzIndexRing(const ring r)
KINLINE void Init(ring tailRing=currRing)
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy
static number Copy(number a, const coeffs r)
KINLINE poly GetLm(ring r)
unsigned long p_GetShortExpVector(const poly p, const ring r)